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
|
/******************************************************************************
* Top contributors (to current version):
* Yoni Zohar, Andrew Reynolds, Mathias Preiner
*
* 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.
* ****************************************************************************
*
* Pre-process step for detecting quantifier macro definitions.
*/
#include "cvc5_private.h"
#ifndef CVC5__PREPROCESSING__PASSES__QUANTIFIER_MACROS_H
#define CVC5__PREPROCESSING__PASSES__QUANTIFIER_MACROS_H
#include <map>
#include <vector>
#include "expr/node.h"
#include "preprocessing/preprocessing_pass.h"
namespace cvc5 {
namespace preprocessing {
namespace passes {
class QuantifierMacros : public PreprocessingPass
{
public:
QuantifierMacros(PreprocessingPassContext* preprocContext);
~QuantifierMacros() {}
protected:
PreprocessingPassResult applyInternal(
AssertionPipeline* assertionsToPreprocess) override;
private:
bool processAssertion(Node n);
bool isBoundVarApplyUf(Node n);
bool process(Node n, bool pol, std::vector<Node>& args, Node f);
bool containsBadOp(Node n,
Node op,
std::vector<Node>& opc,
std::map<Node, bool>& visited);
bool isGroundUfTerm(Node f, Node n);
void getMacroCandidates(Node n,
std::vector<Node>& candidates,
std::map<Node, bool>& visited);
Node solveInEquality(Node n, Node lit);
/**
* Called when we have inferred a quantified formula is of the form
* forall x1 ... xn. n = ndef
* where n is of the form U(x1...xn). Returns true if this is a legal
* macro definition for U.
*/
bool addMacroEq(Node n, Node ndef);
/**
* This applies macro elimination to the given pipeline, which discovers
* whether there are any quantified formulas corresponding to macros,
* and rewrites the given assertions pipeline.
*
* @param ap The pipeline to apply macros to.
* @return Whether new definitions were inferred and we rewrote the assertions
* based on them.
*/
bool simplify(AssertionPipeline* ap);
void finalizeDefinitions();
void clearMaps();
/** All macros inferred by this class */
std::map<Node, Node> d_macroDefs;
/** The current list of macros inferring during a call to simplify */
std::map<Node, Node> d_macroDefsNew;
/** Map from quantified formulas to whether they are macro definitions */
std::map<Node, bool> d_quant_macros;
/** Whether we are currently limited to inferring ground macros */
bool d_ground_macros;
};
} // passes
} // preprocessing
} // namespace cvc5
#endif /*CVC5__PREPROCESSING__PASSES__QUANTIFIER_MACROS_H */
|
