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
|
/******************************************************************************
* 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.
* ****************************************************************************
*
* Implementation of the trust node utility.
*/
#include "proof/trust_node.h"
#include "proof/proof_ensure_closed.h"
#include "proof/proof_generator.h"
namespace cvc5 {
const char* toString(TrustNodeKind tnk)
{
switch (tnk)
{
case TrustNodeKind::CONFLICT: return "CONFLICT";
case TrustNodeKind::LEMMA: return "LEMMA";
case TrustNodeKind::PROP_EXP: return "PROP_EXP";
case TrustNodeKind::REWRITE: return "REWRITE";
default: return "?";
}
}
std::ostream& operator<<(std::ostream& out, TrustNodeKind tnk)
{
out << toString(tnk);
return out;
}
TrustNode TrustNode::mkTrustConflict(Node conf, ProofGenerator* g)
{
Node ckey = getConflictProven(conf);
// if a generator is provided, should confirm that it can prove it
Assert(g == nullptr || g->hasProofFor(ckey));
return TrustNode(TrustNodeKind::CONFLICT, ckey, g);
}
TrustNode TrustNode::mkTrustLemma(Node lem, ProofGenerator* g)
{
Node lkey = getLemmaProven(lem);
// if a generator is provided, should confirm that it can prove it
Assert(g == nullptr || g->hasProofFor(lkey));
return TrustNode(TrustNodeKind::LEMMA, lkey, g);
}
TrustNode TrustNode::mkTrustPropExp(TNode lit, Node exp, ProofGenerator* g)
{
Node pekey = getPropExpProven(lit, exp);
Assert(g == nullptr || g->hasProofFor(pekey));
return TrustNode(TrustNodeKind::PROP_EXP, pekey, g);
}
TrustNode TrustNode::mkTrustRewrite(TNode n, Node nr, ProofGenerator* g)
{
Node rkey = getRewriteProven(n, nr);
Assert(g == nullptr || g->hasProofFor(rkey));
return TrustNode(TrustNodeKind::REWRITE, rkey, g);
}
TrustNode TrustNode::null()
{
return TrustNode(TrustNodeKind::INVALID, Node::null());
}
TrustNode::TrustNode(TrustNodeKind tnk, Node p, ProofGenerator* g)
: d_tnk(tnk), d_proven(p), d_gen(g)
{
// does not make sense to provide null node with generator
Assert(!d_proven.isNull() || d_gen == nullptr);
}
TrustNodeKind TrustNode::getKind() const { return d_tnk; }
Node TrustNode::getNode() const
{
switch (d_tnk)
{
// the node of lemma is the node itself
case TrustNodeKind::LEMMA: return d_proven;
// the node of the rewrite is the right hand side of EQUAL
case TrustNodeKind::REWRITE: return d_proven[1];
// the node of an explained propagation is the antecendant of an IMPLIES
// the node of a conflict is underneath a NOT
default: return d_proven[0];
}
}
Node TrustNode::getProven() const { return d_proven; }
ProofGenerator* TrustNode::getGenerator() const { return d_gen; }
bool TrustNode::isNull() const { return d_proven.isNull(); }
std::shared_ptr<ProofNode> TrustNode::toProofNode() const
{
if (d_gen == nullptr)
{
return nullptr;
}
return d_gen->getProofFor(d_proven);
}
Node TrustNode::getConflictProven(Node conf) { return conf.notNode(); }
Node TrustNode::getLemmaProven(Node lem) { return lem; }
Node TrustNode::getPropExpProven(TNode lit, Node exp)
{
return NodeManager::currentNM()->mkNode(kind::IMPLIES, exp, lit);
}
Node TrustNode::getRewriteProven(TNode n, Node nr) { return n.eqNode(nr); }
void TrustNode::debugCheckClosed(const char* c,
const char* ctx,
bool reqNullGen)
{
pfgEnsureClosed(d_proven, d_gen, c, ctx, reqNullGen);
}
std::string TrustNode::identifyGenerator() const
{
if (d_gen == nullptr)
{
return "null";
}
return d_gen->identify();
}
std::ostream& operator<<(std::ostream& out, TrustNode n)
{
out << "(" << n.getKind() << " " << n.getProven() << " "
<< n.identifyGenerator() << ")";
return out;
}
} // namespace cvc5
|
