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
|
/********************* */
/*! \file proof_checker.cpp
** \verbatim
** Top contributors (to current version):
** Haniel Barbosa, Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 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 Implementation of equality proof checker
**/
#include "theory/uf/proof_checker.h"
#include "theory/uf/theory_uf_rewriter.h"
using namespace CVC5::kind;
namespace CVC5 {
namespace theory {
namespace uf {
void UfProofRuleChecker::registerTo(ProofChecker* pc)
{
// add checkers
pc->registerChecker(PfRule::REFL, this);
pc->registerChecker(PfRule::SYMM, this);
pc->registerChecker(PfRule::TRANS, this);
pc->registerChecker(PfRule::CONG, this);
pc->registerChecker(PfRule::TRUE_INTRO, this);
pc->registerChecker(PfRule::TRUE_ELIM, this);
pc->registerChecker(PfRule::FALSE_INTRO, this);
pc->registerChecker(PfRule::FALSE_ELIM, this);
pc->registerChecker(PfRule::HO_CONG, this);
pc->registerChecker(PfRule::HO_APP_ENCODE, this);
}
Node UfProofRuleChecker::checkInternal(PfRule id,
const std::vector<Node>& children,
const std::vector<Node>& args)
{
// compute what was proven
if (id == PfRule::REFL)
{
Assert(children.empty());
Assert(args.size() == 1);
return args[0].eqNode(args[0]);
}
else if (id == PfRule::SYMM)
{
Assert(children.size() == 1);
Assert(args.empty());
bool polarity = children[0].getKind() != NOT;
Node eqp = polarity ? children[0] : children[0][0];
if (eqp.getKind() != EQUAL)
{
// not a (dis)equality
return Node::null();
}
Node conc = eqp[1].eqNode(eqp[0]);
return polarity ? conc : conc.notNode();
}
else if (id == PfRule::TRANS)
{
Assert(children.size() > 0);
Assert(args.empty());
Node first;
Node curr;
for (size_t i = 0, nchild = children.size(); i < nchild; i++)
{
Node eqp = children[i];
if (eqp.getKind() != EQUAL)
{
return Node::null();
}
if (first.isNull())
{
first = eqp[0];
}
else if (eqp[0] != curr)
{
return Node::null();
}
curr = eqp[1];
}
return first.eqNode(curr);
}
else if (id == PfRule::CONG)
{
Assert(children.size() > 0);
Assert(args.size() >= 1 && args.size() <= 2);
// We do congruence over builtin kinds using operatorToKind
std::vector<Node> lchildren;
std::vector<Node> rchildren;
// get the kind encoded as args[0]
Kind k;
if (!getKind(args[0], k))
{
return Node::null();
}
if (k == kind::UNDEFINED_KIND)
{
return Node::null();
}
Trace("uf-pfcheck") << "congruence for " << args[0] << " uses kind " << k
<< ", metakind=" << kind::metaKindOf(k) << std::endl;
if (kind::metaKindOf(k) == kind::metakind::PARAMETERIZED)
{
if (args.size() <= 1)
{
return Node::null();
}
// parameterized kinds require the operator
lchildren.push_back(args[1]);
rchildren.push_back(args[1]);
}
else if (args.size() > 1)
{
return Node::null();
}
for (size_t i = 0, nchild = children.size(); i < nchild; i++)
{
Node eqp = children[i];
if (eqp.getKind() != EQUAL)
{
return Node::null();
}
lchildren.push_back(eqp[0]);
rchildren.push_back(eqp[1]);
}
NodeManager* nm = NodeManager::currentNM();
Node l = nm->mkNode(k, lchildren);
Node r = nm->mkNode(k, rchildren);
return l.eqNode(r);
}
else if (id == PfRule::TRUE_INTRO)
{
Assert(children.size() == 1);
Assert(args.empty());
Node trueNode = NodeManager::currentNM()->mkConst(true);
return children[0].eqNode(trueNode);
}
else if (id == PfRule::TRUE_ELIM)
{
Assert(children.size() == 1);
Assert(args.empty());
if (children[0].getKind() != EQUAL || !children[0][1].isConst()
|| !children[0][1].getConst<bool>())
{
return Node::null();
}
return children[0][0];
}
else if (id == PfRule::FALSE_INTRO)
{
Assert(children.size() == 1);
Assert(args.empty());
if (children[0].getKind() != kind::NOT)
{
return Node::null();
}
Node falseNode = NodeManager::currentNM()->mkConst(false);
return children[0][0].eqNode(falseNode);
}
else if (id == PfRule::FALSE_ELIM)
{
Assert(children.size() == 1);
Assert(args.empty());
if (children[0].getKind() != EQUAL || !children[0][1].isConst()
|| children[0][1].getConst<bool>())
{
return Node::null();
}
return children[0][0].notNode();
}
if (id == PfRule::HO_CONG)
{
Assert(children.size() > 0);
std::vector<Node> lchildren;
std::vector<Node> rchildren;
for (size_t i = 0, nchild = children.size(); i < nchild; ++i)
{
Node eqp = children[i];
if (eqp.getKind() != EQUAL)
{
return Node::null();
}
lchildren.push_back(eqp[0]);
rchildren.push_back(eqp[1]);
}
NodeManager* nm = NodeManager::currentNM();
Node l = nm->mkNode(kind::APPLY_UF, lchildren);
Node r = nm->mkNode(kind::APPLY_UF, rchildren);
return l.eqNode(r);
}
else if (id == PfRule::HO_APP_ENCODE)
{
Assert(args.size() == 1);
Node ret = TheoryUfRewriter::getHoApplyForApplyUf(args[0]);
return args[0].eqNode(ret);
}
// no rule
return Node::null();
}
} // namespace uf
} // namespace theory
} // namespace CVC5
|
