1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/********************* */
/*! \file clausal_bitvector_proof.cpp
** \verbatim
** Top contributors (to current version):
** Alex Ozdemir
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Bitvector proof using the DRAT proof format
**
** Contains DRAT-specific printing logic.
**/
#include "cvc4_private.h"
#include <algorithm>
#include <iterator>
#include <set>
#include "options/bv_options.h"
#include "proof/clausal_bitvector_proof.h"
#include "proof/drat/drat_proof.h"
#include "proof/er/er_proof.h"
#include "proof/lfsc_proof_printer.h"
#include "proof/lrat/lrat_proof.h"
#include "theory/bv/theory_bv.h"
namespace CVC4 {
namespace proof {
ClausalBitVectorProof::ClausalBitVectorProof(theory::bv::TheoryBV* bv,
TheoryProofEngine* proofEngine)
: BitVectorProof(bv, proofEngine), d_usedClauses(), d_binaryDratProof()
{
}
void ClausalBitVectorProof::attachToSatSolver(prop::SatSolver& sat_solver)
{
sat_solver.setClausalProofLog(this);
}
void ClausalBitVectorProof::initCnfProof(prop::CnfStream* cnfStream,
context::Context* cnf,
prop::SatVariable trueVar,
prop::SatVariable falseVar)
{
Assert(d_cnfProof == nullptr);
d_cnfProof.reset(new LFSCCnfProof(cnfStream, cnf, "bb"));
// Create a clause which forces the true variable to be true, and register it
int trueClauseId = ClauseId(ProofManager::currentPM()->nextId());
// with the CNF proof
d_cnfProof->registerTrueUnitClause(trueClauseId);
// and with (this) bit-vector proof
prop::SatClause c{prop::SatLiteral(trueVar, false)};
registerUsedClause(trueClauseId, c);
// The same for false.
int falseClauseId = ClauseId(ProofManager::currentPM()->nextId());
d_cnfProof->registerFalseUnitClause(falseClauseId);
c[0] = prop::SatLiteral(falseVar, true);
registerUsedClause(falseClauseId, c);
}
void ClausalBitVectorProof::registerUsedClause(ClauseId id,
prop::SatClause& clause)
{
d_usedClauses.emplace_back(id, clause);
};
void ClausalBitVectorProof::calculateAtomsInBitblastingProof()
{
// Debug dump of DRAT Proof
if (Debug.isOn("bv::clausal"))
{
std::string serializedDratProof = d_binaryDratProof.str();
Debug("bv::clausal") << "binary DRAT proof byte count: "
<< serializedDratProof.size() << std::endl;
Debug("bv::clausal") << "Parsing DRAT proof ... " << std::endl;
drat::DratProof dratProof =
drat::DratProof::fromBinary(serializedDratProof);
Debug("bv::clausal") << "Printing DRAT proof ... " << std::endl;
dratProof.outputAsText(Debug("bv::clausal"));
}
// Empty any old record of which atoms were used
d_atomsInBitblastingProof.clear();
// For each used clause, ask the CNF proof which atoms are used in it
for (const auto& usedIndexAndClause : d_usedClauses)
{
d_cnfProof->collectAtoms(&usedIndexAndClause.second,
d_atomsInBitblastingProof);
}
}
void LfscClausalBitVectorProof::printTheoryLemmaProof(std::vector<Expr>& lemma,
std::ostream& os,
std::ostream& paren,
const ProofLetMap& map)
{
Unreachable(
"Clausal bit-vector proofs should only be used in combination with eager "
"bitblasting, which **does not use theory lemmas**");
}
void LfscClausalBitVectorProof::printBBDeclarationAndCnf(std::ostream& os,
std::ostream& paren,
ProofLetMap& letMap)
{
os << "\n;; Bitblasting mappings\n";
printBitblasting(os, paren);
os << "\n;; BB-CNF mappings\n";
d_cnfProof->printAtomMapping(d_atomsInBitblastingProof, os, paren, letMap);
os << "\n;; BB-CNF proofs\n";
for (const auto& idAndClause : d_usedClauses)
{
d_cnfProof->printCnfProofForClause(
idAndClause.first, &idAndClause.second, os, paren);
}
}
void LfscDratBitVectorProof::printEmptyClauseProof(std::ostream& os,
std::ostream& paren)
{
Assert(options::bitblastMode() == theory::bv::BITBLAST_MODE_EAGER,
"the BV theory should only be proving bottom directly in the eager "
"bitblasting mode");
os << "\n;; Proof of input to SAT solver\n";
os << "(@ proofOfSatInput ";
paren << ")";
std::vector<ClauseId> usedIds;
usedIds.reserve(d_usedClauses.size());
for (const auto& idAnd : d_usedClauses)
{
usedIds.push_back(idAnd.first);
};
LFSCProofPrinter::printSatInputProof(usedIds, os, "bb");
os << "\n;; DRAT Proof Value\n";
os << "(@ dratProof ";
paren << ")";
drat::DratProof::fromBinary(d_binaryDratProof.str()).outputAsLfsc(os, 2);
os << "\n";
os << "\n;; Verification of DRAT Proof\n";
os << "(drat_proof_of_bottom _ proofOfSatInput dratProof "
<< "\n)";
}
void LfscLratBitVectorProof::printEmptyClauseProof(std::ostream& os,
std::ostream& paren)
{
Assert(options::bitblastMode() == theory::bv::BITBLAST_MODE_EAGER,
"the BV theory should only be proving bottom directly in the eager "
"bitblasting mode");
os << "\n;; Proof of input to SAT solver\n";
os << "(@ proofOfCMap ";
paren << ")";
std::vector<ClauseId> usedIds;
usedIds.reserve(d_usedClauses.size());
for (const auto& idAnd : d_usedClauses)
{
usedIds.push_back(idAnd.first);
};
LFSCProofPrinter::printCMapProof(usedIds, os, "bb");
os << "\n;; DRAT Proof Value\n";
os << "(@ lratProof ";
paren << ")";
lrat::LratProof pf =
lrat::LratProof::fromDratProof(d_usedClauses, d_binaryDratProof.str());
pf.outputAsLfsc(os);
os << "\n";
os << "\n;; Verification of DRAT Proof\n";
os << "(lrat_proof_of_bottom _ proofOfCMap lratProof "
<< "\n)";
}
void LfscErBitVectorProof::printEmptyClauseProof(std::ostream& os,
std::ostream& paren)
{
Assert(options::bitblastMode() == theory::bv::BITBLAST_MODE_EAGER,
"the BV theory should only be proving bottom directly in the eager "
"bitblasting mode");
er::ErProof pf =
er::ErProof::fromBinaryDratProof(d_usedClauses, d_binaryDratProof.str());
pf.outputAsLfsc(os);
}
} // namespace proof
}; // namespace CVC4
|
