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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Haniel Barbosa, Gereon Kremer
*
* 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.
* ****************************************************************************
*
* Proof node algorithm utilities.
*/
#include "cvc5_private.h"
#ifndef CVC5__PROOF__PROOF_NODE_ALGORITHM_H
#define CVC5__PROOF__PROOF_NODE_ALGORITHM_H
#include <vector>
#include "expr/node.h"
namespace cvc5 {
class ProofNode;
namespace expr {
/**
* This adds to the vector assump all formulas that are "free assumptions" of
* the proof whose root is ProofNode pn. A free assumption is a formula F
* that is an argument (in d_args) of a ProofNode whose kind is ASSUME, and
* that proof node is not beneath an application of SCOPE containing F as an
* argument.
*
* This traverses the structure of the dag represented by this ProofNode.
* Its implementation is analogous to expr::getFreeVariables.
*
* @param pn The proof node.
* @param assump The vector to add the free asumptions of pn to.
*/
void getFreeAssumptions(ProofNode* pn, std::vector<Node>& assump);
/**
* Same as above, but maps assumptions to the proof pointer(s) for that
* assumption. Notice that depending on how pn is constructed, there may be
* multiple ProofNode that are ASSUME proofs of the same assumption, which
* are each added to the range of the assumption.
*
* @param pn The proof node.
* @param amap The mapping to add the free asumptions of pn and their
* corresponding proof nodes to.
*/
void getFreeAssumptionsMap(
std::shared_ptr<ProofNode> pn,
std::map<Node, std::vector<std::shared_ptr<ProofNode>>>& amap);
/**
* Return true if pn contains a subproof whose rule is ASSUME. Notice that we
* do *not* distinguish between free vs. non-free assumptions in this call.
* This call involves at most a single dag traversal over the proof node.
*
* This call will partially populate caMap. In particular, it will only fill
* caMap for the proof nodes that were traversed up to where the first
* assumption in pn was found.
*
* @param pn The proof node.
* @param caMap Cache of results, mapping proof nodes to whether they contain
* assumptions.
* @return true if pn contains assumptions
*/
bool containsAssumption(const ProofNode* pn,
std::unordered_map<const ProofNode*, bool>& caMap);
/**
* Same as above, with an empty cache as the initial value of caMap.
*/
bool containsAssumption(const ProofNode* pn);
/**
* @return true if pn contains pnc.
*/
bool containsSubproof(ProofNode* pn, ProofNode* pnc);
/**
* Same as above, with a visited cache.
*
* @return true if pn contains pnc.
*/
bool containsSubproof(ProofNode* pn,
ProofNode* pnc,
std::unordered_set<const ProofNode*>& visited);
} // namespace expr
} // namespace cvc5
#endif /* CVC5__PROOF__PROOF_NODE_ALGORITHM_H */
|
