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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Alex Ozdemir
*
* 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.
* ****************************************************************************
*
* Implementation of the abstract proof generator class.
*/
#include "proof/eager_proof_generator.h"
#include "proof/proof.h"
#include "proof/proof_node.h"
#include "proof/proof_node_manager.h"
namespace cvc5 {
EagerProofGenerator::EagerProofGenerator(ProofNodeManager* pnm,
context::Context* c,
std::string name)
: d_pnm(pnm), d_name(name), d_proofs(c == nullptr ? &d_context : c)
{
}
void EagerProofGenerator::setProofFor(Node f, std::shared_ptr<ProofNode> pf)
{
// pf should prove f
Assert(pf->getResult() == f)
<< "EagerProofGenerator::setProofFor: unexpected result" << std::endl
<< "Expected: " << f << std::endl
<< "Actual: " << pf->getResult() << std::endl;
d_proofs[f] = pf;
}
void EagerProofGenerator::setProofForConflict(Node conf,
std::shared_ptr<ProofNode> pf)
{
// Normalize based on key
Node ckey = TrustNode::getConflictProven(conf);
setProofFor(ckey, pf);
}
void EagerProofGenerator::setProofForLemma(Node lem,
std::shared_ptr<ProofNode> pf)
{
// Normalize based on key
Node lkey = TrustNode::getLemmaProven(lem);
setProofFor(lkey, pf);
}
void EagerProofGenerator::setProofForPropExp(TNode lit,
Node exp,
std::shared_ptr<ProofNode> pf)
{
// Normalize based on key
Node pekey = TrustNode::getPropExpProven(lit, exp);
setProofFor(pekey, pf);
}
std::shared_ptr<ProofNode> EagerProofGenerator::getProofFor(Node f)
{
NodeProofNodeMap::iterator it = d_proofs.find(f);
if (it == d_proofs.end())
{
return nullptr;
}
return (*it).second;
}
bool EagerProofGenerator::hasProofFor(Node f)
{
return d_proofs.find(f) != d_proofs.end();
}
TrustNode EagerProofGenerator::mkTrustNode(Node n,
std::shared_ptr<ProofNode> pf,
bool isConflict)
{
if (pf == nullptr)
{
return TrustNode::null();
}
if (isConflict)
{
// this shouldnt modify the key
setProofForConflict(n, pf);
// we can now return the trust node
return TrustNode::mkTrustConflict(n, this);
}
// this shouldnt modify the key
setProofForLemma(n, pf);
// we can now return the trust node
return TrustNode::mkTrustLemma(n, this);
}
TrustNode EagerProofGenerator::mkTrustNode(Node conc,
PfRule id,
const std::vector<Node>& exp,
const std::vector<Node>& args,
bool isConflict)
{
// if no children, its easy
if (exp.empty())
{
std::shared_ptr<ProofNode> pf = d_pnm->mkNode(id, {}, args, conc);
return mkTrustNode(conc, pf, isConflict);
}
// otherwise, we use CDProof + SCOPE
CDProof cdp(d_pnm);
cdp.addStep(conc, id, exp, args);
std::shared_ptr<ProofNode> pf = cdp.getProofFor(conc);
// We use mkNode instead of mkScope, since there is no reason to check
// whether the free assumptions of pf are in exp, since they are by the
// construction above.
std::shared_ptr<ProofNode> pfs = d_pnm->mkNode(PfRule::SCOPE, {pf}, exp);
return mkTrustNode(pfs->getResult(), pfs, isConflict);
}
TrustNode EagerProofGenerator::mkTrustedRewrite(Node a,
Node b,
std::shared_ptr<ProofNode> pf)
{
if (pf == nullptr)
{
return TrustNode::null();
}
Node eq = a.eqNode(b);
setProofFor(eq, pf);
return TrustNode::mkTrustRewrite(a, b, this);
}
TrustNode EagerProofGenerator::mkTrustedRewrite(Node a,
Node b,
PfRule id,
const std::vector<Node>& args)
{
Node eq = a.eqNode(b);
CDProof cdp(d_pnm);
cdp.addStep(eq, id, {}, args);
std::shared_ptr<ProofNode> pf = cdp.getProofFor(eq);
return mkTrustedRewrite(a, b, pf);
}
TrustNode EagerProofGenerator::mkTrustedPropagation(
Node n, Node exp, std::shared_ptr<ProofNode> pf)
{
if (pf == nullptr)
{
return TrustNode::null();
}
setProofForPropExp(n, exp, pf);
return TrustNode::mkTrustPropExp(n, exp, this);
}
TrustNode EagerProofGenerator::mkTrustNodeSplit(Node f)
{
// make the lemma
Node lem = f.orNode(f.notNode());
return mkTrustNode(lem, PfRule::SPLIT, {}, {f}, false);
}
std::string EagerProofGenerator::identify() const { return d_name; }
} // namespace cvc5
|
