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
|
/********************* */
/*! \file eager_proof_generator.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 the abstract proof generator class
**/
#include "theory/eager_proof_generator.h"
#include "expr/proof_node_manager.h"
namespace CVC4 {
namespace theory {
EagerProofGenerator::EagerProofGenerator(ProofNodeManager* pnm,
context::Context* c)
: d_pnm(pnm), 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);
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 n,
PfRule id,
const std::vector<Node>& args,
bool isConflict)
{
std::vector<std::shared_ptr<ProofNode>> children;
std::shared_ptr<ProofNode> pf = d_pnm->mkNode(id, children, args, n);
return mkTrustNode(n, pf, isConflict);
}
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());
std::vector<Node> args;
return mkTrustNode(lem, PfRule::SPLIT, args, false);
}
} // namespace theory
} // namespace CVC4
|
