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
|
/********************* */
/*! \file theory_preprocessor.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Morgan Deters, Dejan Jovanovic
** 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 The theory preprocessor.
**/
#include "cvc4_private.h"
#ifndef CVC4__THEORY__THEORY_PREPROCESSOR_H
#define CVC4__THEORY__THEORY_PREPROCESSOR_H
#include <unordered_map>
#include "expr/lazy_proof.h"
#include "expr/node.h"
#include "expr/term_conversion_proof_generator.h"
#include "theory/trust_node.h"
namespace CVC4 {
class LogicInfo;
class TheoryEngine;
class RemoveTermFormulas;
namespace theory {
/**
* The preprocessor used in TheoryEngine.
*/
class TheoryPreprocessor
{
typedef std::unordered_map<Node, Node, NodeHashFunction> NodeMap;
public:
/** Constructs a theory preprocessor */
TheoryPreprocessor(TheoryEngine& engine,
RemoveTermFormulas& tfr,
ProofNodeManager* pnm = nullptr);
/** Destroys a theory preprocessor */
~TheoryPreprocessor();
/** Clear the cache of this class */
void clearCache();
/**
* Preprocesses the given assertion node. It returns a TrustNode of kind
* TrustNodeKind::REWRITE indicating the preprocessed form of node. It stores
* additional lemmas in newLemmas, which are trust nodes of kind
* TrustNodeKind::LEMMA. These correspond to e.g. lemmas corresponding to ITE
* removal. For each lemma in newLemmas, we add the corresponding skolem that
* the lemma defines. The flag doTheoryPreprocess is whether we should run
* theory-specific preprocessing.
*
* @param node The assertion to preprocess,
* @param newLemmas The lemmas to add to the set of assertions,
* @param newSkolems The skolems that newLemmas correspond to,
* @param doTheoryPreprocess whether to run theory-specific preprocessing.
* @return The trust node corresponding to rewriting node via preprocessing.
*/
TrustNode preprocess(TNode node,
std::vector<TrustNode>& newLemmas,
std::vector<Node>& newSkolems,
bool doTheoryPreprocess);
/**
* Runs theory specific preprocessing on the non-Boolean parts of
* the formula. This is only called on input assertions, after ITEs
* have been removed.
*/
TrustNode theoryPreprocess(TNode node);
private:
/** Reference to owning theory engine */
TheoryEngine& d_engine;
/** Logic info of theory engine */
const LogicInfo& d_logicInfo;
/** Cache for theory-preprocessing of assertions */
NodeMap d_ppCache;
/** The term formula remover */
RemoveTermFormulas& d_tfr;
/** The context for the proof generator below */
context::Context d_pfContext;
/** A term conversion proof generator */
std::unique_ptr<TConvProofGenerator> d_tpg;
/** A lazy proof, for additional lemmas. */
std::unique_ptr<LazyCDProof> d_lp;
/** Helper for theoryPreprocess */
Node ppTheoryRewrite(TNode term);
/**
* Rewrite with proof, which stores a REWRITE step in d_tpg if necessary
* and returns the rewritten form of term.
*/
Node rewriteWithProof(Node term);
/**
* Preprocess with proof, which calls the appropriate ppRewrite method,
* stores the corresponding rewrite step in d_tpg if necessary and returns
* the preprocessed and rewritten form of term. It should be the case that
* term is already in rewritten form.
*/
Node preprocessWithProof(Node term);
/** Proofs enabled */
bool isProofEnabled() const;
};
} // namespace theory
} // namespace CVC4
#endif /* CVC4__THEORY__THEORY_PREPROCESSOR_H */
|
