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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
|
/********************* */
/*! \file theory_proof.cpp
** \verbatim
** Original author: Liana Hadarean
** Major contributors: Morgan Deters
** Minor contributors (to current version): none
** This file is part of the CVC4 project.
** Copyright (c) 2009-2014 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "proof/theory_proof.h"
#include "proof/proof_manager.h"
using namespace CVC4;
TheoryProof::TheoryProof()
: d_termDeclarations()
, d_sortDeclarations()
, d_declarationCache()
{}
void TheoryProof::addDeclaration(Expr term) {
if (d_declarationCache.count(term)) {
return;
}
Type type = term.getType();
if (type.isSort())
d_sortDeclarations.insert(type);
if (term.getKind() == kind::APPLY_UF) {
Expr function = term.getOperator();
d_termDeclarations.insert(function);
} else if (term.isVariable()) {
//Assert (type.isSort() || type.isBoolean());
d_termDeclarations.insert(term);
}
// recursively declare all other terms
for (unsigned i = 0; i < term.getNumChildren(); ++i) {
addDeclaration(term[i]);
}
d_declarationCache.insert(term);
}
std::string toLFSCKind(Kind kind) {
switch(kind) {
case kind::OR : return "or";
case kind::AND: return "and";
case kind::XOR: return "xor";
case kind::EQUAL: return "=";
case kind::IFF: return "iff";
case kind::IMPLIES: return "impl";
case kind::NOT: return "not";
default:
Unreachable();
}
}
void LFSCTheoryProof::printTerm(Expr term, std::ostream& os) {
if (term.isVariable()) {
if(term.getType().isBoolean()) {
os << "(p_app " << term << ")";
} else {
os << term;
}
return;
}
switch(Kind k = term.getKind()) {
case kind::APPLY_UF: {
if(term.getType().isBoolean()) {
os << "(p_app ";
}
Expr func = term.getOperator();
for (unsigned i = 0; i < term.getNumChildren(); ++i) {
os << "(apply _ _ ";
}
os << func << " ";
for (unsigned i = 0; i < term.getNumChildren(); ++i) {
printTerm(term[i], os);
os << ")";
}
if(term.getType().isBoolean()) {
os << ")";
}
return;
}
case kind::ITE:
os << (term.getType().isBoolean() ? "(ifte " : "(ite _ ");
printTerm(term[0], os);
os << " ";
printTerm(term[1], os);
os << " ";
printTerm(term[2], os);
os << ")";
return;
case kind::EQUAL:
os << "(";
os << "= ";
os << term[0].getType() << " ";
printTerm(term[0], os);
os << " ";
printTerm(term[1], os);
os << ")";
return;
case kind::DISTINCT:
os << "(not (= ";
os << term[0].getType() << " ";
printTerm(term[0], os);
os << " ";
printTerm(term[1], os);
os << "))";
return;
case kind::OR:
case kind::AND:
case kind::XOR:
case kind::IFF:
case kind::IMPLIES:
case kind::NOT:
// print the Boolean operators
os << "(" << toLFSCKind(k);
if(term.getNumChildren() > 2) {
// LFSC doesn't allow declarations with variable numbers of
// arguments, so we have to flatten these N-ary versions.
std::ostringstream paren;
os << " ";
for (unsigned i = 0; i < term.getNumChildren(); ++i) {
printTerm(term[i], os);
os << " ";
if(i < term.getNumChildren() - 2) {
os << "(" << toLFSCKind(k) << " ";
paren << ")";
}
}
os << paren.str() << ")";
} else {
// this is for binary and unary operators
for (unsigned i = 0; i < term.getNumChildren(); ++i) {
os << " ";
printTerm(term[i], os);
}
os << ")";
}
return;
case kind::CONST_BOOLEAN:
os << (term.getConst<bool>() ? "true" : "false");
return;
case kind::CHAIN: {
// LFSC doesn't allow declarations with variable numbers of
// arguments, so we have to flatten chained operators, like =.
Kind op = term.getOperator().getConst<Chain>().getOperator();
size_t n = term.getNumChildren();
std::ostringstream paren;
for(size_t i = 1; i < n; ++i) {
if(i + 1 < n) {
os << "(" << toLFSCKind(kind::AND) << " ";
paren << ")";
}
os << "(" << toLFSCKind(op) << " ";
printTerm(term[i - 1], os);
os << " ";
printTerm(term[i], os);
os << ")";
if(i + 1 < n) {
os << " ";
}
}
os << paren.str();
return;
}
default:
Unhandled(k);
}
Unreachable();
}
void LFSCTheoryProof::printAssertions(std::ostream& os, std::ostream& paren) {
ProofManager::assertions_iterator it = ProofManager::currentPM()->begin_assertions();
ProofManager::assertions_iterator end = ProofManager::currentPM()->end_assertions();
// collect declarations first
for(; it != end; ++it) {
addDeclaration(*it);
}
printDeclarations(os, paren);
it = ProofManager::currentPM()->begin_assertions();
for (; it != end; ++it) {
os << "(% A" << ProofManager::currentPM()->getAssertionCounter() << " (th_holds ";
printTerm(*it, os);
os << ")\n";
paren << ")";
//store map between assertion and counter
ProofManager::currentPM()->setAssertion( *it );
}
}
void LFSCTheoryProof::printDeclarations(std::ostream& os, std::ostream& paren) {
// declaring the sorts
for (SortSet::const_iterator it = d_sortDeclarations.begin(); it != d_sortDeclarations.end(); ++it) {
os << "(% " << *it << " sort\n";
paren << ")";
}
// declaring the terms
for (ExprSet::const_iterator it = d_termDeclarations.begin(); it != d_termDeclarations.end(); ++it) {
Expr term = *it;
os << "(% " << term << " ";
os << "(term ";
Type type = term.getType();
if (type.isFunction()) {
std::ostringstream fparen;
FunctionType ftype = (FunctionType)type;
std::vector<Type> args = ftype.getArgTypes();
args.push_back(ftype.getRangeType());
os << "(arrow";
for (unsigned i = 0; i < args.size(); i++) {
Type arg_type = args[i];
//Assert (arg_type.isSort() || arg_type.isBoolean());
os << " " << arg_type;
if (i < args.size() - 2) {
os << " (arrow";
fparen << ")";
}
}
os << fparen.str() << "))\n";
} else {
Assert (term.isVariable());
//Assert (type.isSort() || type.isBoolean());
os << type << ")\n";
}
paren << ")";
}
}
|
