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
|
/********************* */
/*! \file clausal_bitvector_proof.h
** \verbatim
** Top contributors (to current version):
** Alex Ozdemir, Mathias Preiner
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 for clausal (DRAT/LRAT) formats
**
** An internal string stream is hooked up to CryptoMiniSat, which spits out a
** binary DRAT proof. Depending on which kind of proof we're going to turn
** that into, we process it in different ways.
**/
#include "cvc4_private.h"
#ifndef CVC4__PROOF__CLAUSAL_BITVECTOR_PROOF_H
#define CVC4__PROOF__CLAUSAL_BITVECTOR_PROOF_H
#include <iostream>
#include <sstream>
#include <unordered_map>
#include "expr/expr.h"
#include "proof/bitvector_proof.h"
#include "proof/drat/drat_proof.h"
#include "proof/lrat/lrat_proof.h"
#include "proof/theory_proof.h"
#include "prop/cnf_stream.h"
#include "prop/sat_solver_types.h"
#include "theory/bv/theory_bv.h"
#include "util/statistics_registry.h"
namespace CVC4 {
namespace proof {
class ClausalBitVectorProof : public BitVectorProof
{
public:
ClausalBitVectorProof(theory::bv::TheoryBV* bv,
TheoryProofEngine* proofEngine);
~ClausalBitVectorProof() = default;
void attachToSatSolver(prop::SatSolver& sat_solver) override;
void initCnfProof(prop::CnfStream* cnfStream,
context::Context* cnf,
prop::SatVariable trueVar,
prop::SatVariable falseVar) override;
std::ostream& getDratOstream() { return d_binaryDratProof; }
void registerUsedClause(ClauseId id, prop::SatClause& clause);
void calculateAtomsInBitblastingProof() override;
protected:
// A list of all clauses and their ids which are passed into the SAT solver
std::unordered_map<ClauseId, prop::SatClause> d_clauses{};
std::vector<ClauseId> d_originalClauseIndices{};
// Stores the proof recieved from the SAT solver.
std::ostringstream d_binaryDratProof{};
std::vector<ClauseId> d_coreClauseIndices{};
struct DratTranslationStatistics
{
DratTranslationStatistics();
~DratTranslationStatistics();
// Total time spent doing translation (optimized binary DRAT -> in memory
// target format including IO, postprocessing, etc.)
TimerStat d_totalTime;
// Time that the external tool actually spent
TimerStat d_toolTime;
};
DratTranslationStatistics d_dratTranslationStatistics;
private:
// Optimizes the DRAT proof stored in `d_binaryDratProof` and returns a list
// of clause actually needed to check that proof (a smaller UNSAT core)
void optimizeDratProof();
// Given reference to a SAT clause encoded as a vector of literals, puts the
// literals into a canonical order
static void canonicalizeClause(prop::SatClause& clause);
struct DratOptimizationStatistics
{
DratOptimizationStatistics();
~DratOptimizationStatistics();
// Total time spent using drat-trim to optimize the DRAT proof/formula
// (including IO, etc.)
TimerStat d_totalTime;
// Time that drat-trim actually spent optimizing the DRAT proof/formula
TimerStat d_toolTime;
// Time that was spent matching clauses in drat-trim's output to clauses in
// its input
TimerStat d_clauseMatchingTime;
// Bytes in binary DRAT proof before optimization
IntStat d_initialDratSize;
// Bytes in binary DRAT proof after optimization
IntStat d_optimizedDratSize;
// Bytes in textual DIMACS bitblasted formula before optimization
IntStat d_initialFormulaSize;
// Bytes in textual DIMACS bitblasted formula after optimization
IntStat d_optimizedFormulaSize;
};
DratOptimizationStatistics d_dratOptimizationStatistics;
};
/**
* A representation of a clausal proof of a bitvector problem's UNSAT nature
*/
class LfscClausalBitVectorProof : public ClausalBitVectorProof
{
public:
LfscClausalBitVectorProof(theory::bv::TheoryBV* bv,
TheoryProofEngine* proofEngine)
: ClausalBitVectorProof(bv, proofEngine)
{
}
void printTheoryLemmaProof(std::vector<Expr>& lemma,
std::ostream& os,
std::ostream& paren,
const ProofLetMap& map) override;
void printBBDeclarationAndCnf(std::ostream& os,
std::ostream& paren,
ProofLetMap& letMap) override;
};
/**
* A DRAT proof for a bit-vector problem
*/
class LfscDratBitVectorProof : public LfscClausalBitVectorProof
{
public:
LfscDratBitVectorProof(theory::bv::TheoryBV* bv,
TheoryProofEngine* proofEngine)
: LfscClausalBitVectorProof(bv, proofEngine)
{
}
void printEmptyClauseProof(std::ostream& os, std::ostream& paren) override;
};
/**
* An LRAT proof for a bit-vector problem
*/
class LfscLratBitVectorProof : public LfscClausalBitVectorProof
{
public:
LfscLratBitVectorProof(theory::bv::TheoryBV* bv,
TheoryProofEngine* proofEngine)
: LfscClausalBitVectorProof(bv, proofEngine)
{
}
void printEmptyClauseProof(std::ostream& os, std::ostream& paren) override;
};
/**
* An Extended Resolution proof for a bit-vector problem
*/
class LfscErBitVectorProof : public LfscClausalBitVectorProof
{
public:
LfscErBitVectorProof(theory::bv::TheoryBV* bv, TheoryProofEngine* proofEngine)
: LfscClausalBitVectorProof(bv, proofEngine)
{
}
void printEmptyClauseProof(std::ostream& os, std::ostream& paren) override;
};
} // namespace proof
} // namespace CVC4
#endif /* CVC4__PROOF__CLAUSAL_BITVECTOR_PROOF_H */
|
