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
|
/********************* */
/*! \file quantifier_macros.h
** \verbatim
** Top contributors (to current version):
** Yoni Zohar, Andrew Reynolds, Mathias Preiner
** This file is part of the CVC4 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.\endverbatim
**
** \brief Pre-process step for detecting quantifier macro definitions
**/
#include "cvc4_private.h"
#ifndef CVC4__PREPROCESSING__PASSES__QUANTIFIER_MACROS_H
#define CVC4__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 isMacroLiteral(Node n, bool pol);
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);
bool getFreeVariables(Node n,
std::vector<Node>& v_quant,
std::vector<Node>& vars,
bool retOnly,
std::map<Node, bool>& visited);
bool getSubstitution(std::vector<Node>& v_quant,
std::map<Node, Node>& solved,
std::vector<Node>& vars,
std::vector<Node>& subs,
bool reqComplete);
void addMacro(Node op, Node n, std::vector<Node>& opc);
void debugMacroDefinition(Node oo, Node n);
/**
* This applies macro elimination to the given pipeline, which discovers
* whether there are any quantified formulas corresponding to macros.
*
* @param ap The pipeline to apply macros to.
* @param doRewrite Whether we also wish to rewrite the assertions based on
* the discovered macro definitions.
* @return Whether new definitions were inferred and we rewrote the assertions
* based on them.
*/
bool simplify(AssertionPipeline* ap, bool doRewrite = false);
Node simplify(Node n);
void finalizeDefinitions();
void clearMaps();
// map from operators to macro basis terms
std::map<Node, std::vector<Node> > d_macro_basis;
// map from operators to macro definition
std::map<Node, Node> d_macro_defs;
std::map<Node, Node> d_macro_defs_new;
// operators to macro ops that contain them
std::map<Node, std::vector<Node> > d_macro_def_contains;
// simplify caches
std::map<Node, Node> d_simplify_cache;
std::map<Node, bool> d_quant_macros;
bool d_ground_macros;
};
} // passes
} // preprocessing
} // namespace CVC5
#endif /*CVC4__PREPROCESSING__PASSES__QUANTIFIER_MACROS_H */
|
