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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* This file is part of the cvc5 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.
* ****************************************************************************
*
* The module for managing witness form conversion in proofs.
*/
#include "smt/witness_form.h"
#include "expr/skolem_manager.h"
#include "theory/rewriter.h"
namespace cvc5 {
namespace smt {
WitnessFormGenerator::WitnessFormGenerator(ProofNodeManager* pnm)
: d_tcpg(pnm,
nullptr,
TConvPolicy::FIXPOINT,
TConvCachePolicy::NEVER,
"WfGenerator::TConvProofGenerator",
nullptr,
true),
d_wintroPf(pnm, nullptr, nullptr, "WfGenerator::LazyCDProof"),
d_pskPf(pnm, nullptr, "WfGenerator::PurifySkolemProof")
{
}
std::shared_ptr<ProofNode> WitnessFormGenerator::getProofFor(Node eq)
{
if (eq.getKind() != kind::EQUAL)
{
// expecting an equality
return nullptr;
}
Node lhs = eq[0];
Node rhs = convertToWitnessForm(eq[0]);
if (rhs != eq[1])
{
// expecting witness form
return nullptr;
}
std::shared_ptr<ProofNode> pn = d_tcpg.getProofFor(eq);
Assert(pn != nullptr);
return pn;
}
std::string WitnessFormGenerator::identify() const
{
return "WitnessFormGenerator";
}
Node WitnessFormGenerator::convertToWitnessForm(Node t)
{
Node tw = SkolemManager::getOriginalForm(t);
if (t == tw)
{
// trivial case
return tw;
}
std::unordered_set<TNode, TNodeHashFunction>::iterator it;
std::vector<TNode> visit;
TNode cur;
TNode curw;
visit.push_back(t);
do
{
cur = visit.back();
visit.pop_back();
it = d_visited.find(cur);
if (it == d_visited.end())
{
d_visited.insert(cur);
curw = SkolemManager::getOriginalForm(cur);
// if its witness form is different
if (cur != curw)
{
if (cur.isVar())
{
Node eq = cur.eqNode(curw);
// equality between a variable and its original form
d_eqs.insert(eq);
// ------- SKOLEM_INTRO
// k = t
d_wintroPf.addStep(eq, PfRule::SKOLEM_INTRO, {}, {cur});
d_tcpg.addRewriteStep(
cur, curw, &d_wintroPf, true, PfRule::ASSUME, true);
}
else
{
// A term whose witness form is different from itself, recurse.
// It should be the case that cur has children, since the witness
// form of constants are themselves.
Assert(cur.getNumChildren() > 0);
if (cur.hasOperator())
{
visit.push_back(cur.getOperator());
}
visit.insert(visit.end(), cur.begin(), cur.end());
}
}
}
} while (!visit.empty());
return tw;
}
bool WitnessFormGenerator::requiresWitnessFormTransform(Node t, Node s) const
{
return theory::Rewriter::rewrite(t) != theory::Rewriter::rewrite(s);
}
bool WitnessFormGenerator::requiresWitnessFormIntro(Node t) const
{
Node tr = theory::Rewriter::rewrite(t);
return !tr.isConst() || !tr.getConst<bool>();
}
const std::unordered_set<Node, NodeHashFunction>&
WitnessFormGenerator::getWitnessFormEqs() const
{
return d_eqs;
}
ProofGenerator* WitnessFormGenerator::convertExistsInternal(Node exists)
{
Assert(exists.getKind() == kind::EXISTS);
if (exists[0].getNumChildren() == 1 && exists[1].getKind() == kind::EQUAL
&& exists[1][0] == exists[0][0])
{
Node tpurified = exists[1][1];
Trace("witness-form") << "convertExistsInternal: infer purification "
<< exists << " for " << tpurified << std::endl;
// ------ REFL
// t = t
// ---------------- EXISTS_INTRO
// exists x. x = t
// The concluded existential is then used to construct the witness term
// via witness intro.
Node teq = tpurified.eqNode(tpurified);
d_pskPf.addStep(teq, PfRule::REFL, {}, {tpurified});
d_pskPf.addStep(exists, PfRule::EXISTS_INTRO, {teq}, {exists});
return &d_pskPf;
}
return nullptr;
}
} // namespace smt
} // namespace cvc5
|
