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
|
/********************* */
/*! \file proof_post_processor.cpp
** \verbatim
** Top contributors (to current version):
** Haniel Barbosa
** 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 module for processing proof nodes in the prop
** engine
**/
#include "prop/proof_post_processor.h"
#include "theory/builtin/proof_checker.h"
namespace CVC4 {
namespace prop {
ProofPostprocessCallback::ProofPostprocessCallback(
ProofNodeManager* pnm, ProofCnfStream* proofCnfStream)
: d_pnm(pnm), d_proofCnfStream(proofCnfStream)
{
}
void ProofPostprocessCallback::initializeUpdate() { d_assumpToProof.clear(); }
bool ProofPostprocessCallback::shouldUpdate(std::shared_ptr<ProofNode> pn,
bool& continueUpdate)
{
bool result = pn->getRule() == PfRule::ASSUME
&& d_proofCnfStream->hasProofFor(pn->getResult());
// check if should continue traversing
if (d_proofCnfStream->isBlocked(pn))
{
continueUpdate = false;
result = false;
}
return result;
}
bool ProofPostprocessCallback::update(Node res,
PfRule id,
const std::vector<Node>& children,
const std::vector<Node>& args,
CDProof* cdp,
bool& continueUpdate)
{
Trace("prop-proof-pp-debug")
<< "- Post process " << id << " " << children << " / " << args << "\n";
Assert(id == PfRule::ASSUME);
// we cache based on the assumption node, not the proof node, since there
// may be multiple occurrences of the same node.
Node f = args[0];
std::shared_ptr<ProofNode> pfn;
std::map<Node, std::shared_ptr<ProofNode>>::iterator it =
d_assumpToProof.find(f);
if (it != d_assumpToProof.end())
{
Trace("prop-proof-pp-debug") << "...already computed" << std::endl;
pfn = it->second;
}
else
{
Assert(d_proofCnfStream != nullptr);
// get proof from proof cnf stream
pfn = d_proofCnfStream->getProofFor(f);
Assert(pfn != nullptr && pfn->getResult() == f);
if (Trace.isOn("prop-proof-pp"))
{
Trace("prop-proof-pp") << "=== Connect CNF proof for: " << f << "\n";
Trace("prop-proof-pp") << *pfn.get() << "\n";
}
d_assumpToProof[f] = pfn;
}
// connect the proof
cdp->addProof(pfn);
// do not recursively process the result
continueUpdate = false;
// moreover block the fact f so that its proof node is not traversed if we run
// this post processor again (which can happen in incremental benchmarks)
d_proofCnfStream->addBlocked(pfn);
return true;
}
ProofPostproccess::ProofPostproccess(ProofNodeManager* pnm,
ProofCnfStream* proofCnfStream)
: d_cb(pnm, proofCnfStream), d_pnm(pnm)
{
}
ProofPostproccess::~ProofPostproccess() {}
void ProofPostproccess::process(std::shared_ptr<ProofNode> pf)
{
// Initialize the callback, which computes necessary static information about
// how to process, including how to process assumptions in pf.
d_cb.initializeUpdate();
// now, process
ProofNodeUpdater updater(d_pnm, d_cb);
updater.process(pf);
}
} // namespace prop
} // namespace CVC4
|
