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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/********************* */
/*! \file trigger.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Morgan Deters, Tim King
** 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 Implementation of trigger class
**/
#include "theory/quantifiers/ematching/trigger.h"
#include "expr/skolem_manager.h"
#include "options/quantifiers_options.h"
#include "theory/quantifiers/ematching/candidate_generator.h"
#include "theory/quantifiers/ematching/inst_match_generator.h"
#include "theory/quantifiers/ematching/inst_match_generator_multi.h"
#include "theory/quantifiers/ematching/inst_match_generator_multi_linear.h"
#include "theory/quantifiers/ematching/inst_match_generator_simple.h"
#include "theory/quantifiers/ematching/pattern_term_selector.h"
#include "theory/quantifiers/ematching/trigger_trie.h"
#include "theory/quantifiers/inst_match.h"
#include "theory/quantifiers/instantiate.h"
#include "theory/quantifiers/quantifiers_attributes.h"
#include "theory/quantifiers/quantifiers_inference_manager.h"
#include "theory/quantifiers/quantifiers_registry.h"
#include "theory/quantifiers/quantifiers_state.h"
#include "theory/quantifiers/term_util.h"
#include "theory/valuation.h"
using namespace CVC5::kind;
namespace CVC5 {
namespace theory {
namespace quantifiers {
namespace inst {
/** trigger class constructor */
Trigger::Trigger(QuantifiersState& qs,
QuantifiersInferenceManager& qim,
QuantifiersRegistry& qr,
TermRegistry& tr,
Node q,
std::vector<Node>& nodes)
: d_qstate(qs), d_qim(qim), d_qreg(qr), d_treg(tr), d_quant(q)
{
// We must ensure that the ground subterms of the trigger have been
// preprocessed.
Valuation& val = d_qstate.getValuation();
for (const Node& n : nodes)
{
Node np = ensureGroundTermPreprocessed(val, n, d_groundTerms);
d_nodes.push_back(np);
}
if (Trace.isOn("trigger"))
{
QuantAttributes& qa = d_qreg.getQuantAttributes();
Trace("trigger") << "Trigger for " << qa.quantToString(q) << ": "
<< std::endl;
for (const Node& n : d_nodes)
{
Trace("trigger") << " " << n << std::endl;
}
}
QuantifiersStatistics& stats = qs.getStats();
if( d_nodes.size()==1 ){
if (TriggerTermInfo::isSimpleTrigger(d_nodes[0]))
{
d_mg = new InstMatchGeneratorSimple(this, q, d_nodes[0]);
++(stats.d_triggers);
}else{
d_mg = InstMatchGenerator::mkInstMatchGenerator(this, q, d_nodes[0]);
++(stats.d_simple_triggers);
}
}else{
if( options::multiTriggerCache() ){
d_mg = new InstMatchGeneratorMulti(this, q, d_nodes);
}else{
d_mg = InstMatchGenerator::mkInstMatchGeneratorMulti(this, q, d_nodes);
}
if (Trace.isOn("multi-trigger"))
{
Trace("multi-trigger") << "Trigger for " << q << ": " << std::endl;
for (const Node& nc : d_nodes)
{
Trace("multi-trigger") << " " << nc << std::endl;
}
}
++(stats.d_multi_triggers);
}
Trace("trigger-debug") << "Finished making trigger." << std::endl;
}
Trigger::~Trigger() {
delete d_mg;
}
void Trigger::resetInstantiationRound() { d_mg->resetInstantiationRound(); }
void Trigger::reset(Node eqc) { d_mg->reset(eqc); }
bool Trigger::isMultiTrigger() const { return d_nodes.size() > 1; }
Node Trigger::getInstPattern() const
{
return NodeManager::currentNM()->mkNode( INST_PATTERN, d_nodes );
}
uint64_t Trigger::addInstantiations()
{
uint64_t gtAddedLemmas = 0;
if (!d_groundTerms.empty())
{
// for each ground term t that does not exist in the equality engine, we
// add a purification lemma of the form (k = t).
eq::EqualityEngine* ee = d_qstate.getEqualityEngine();
for (const Node& gt : d_groundTerms)
{
if (!ee->hasTerm(gt))
{
SkolemManager* sm = NodeManager::currentNM()->getSkolemManager();
Node k = sm->mkPurifySkolem(gt, "gt");
Node eq = k.eqNode(gt);
Trace("trigger-gt-lemma")
<< "Trigger: ground term purify lemma: " << eq << std::endl;
d_qim.addPendingLemma(eq, InferenceId::UNKNOWN);
gtAddedLemmas++;
}
}
}
uint64_t addedLemmas = d_mg->addInstantiations(d_quant);
if (Debug.isOn("inst-trigger"))
{
if (addedLemmas > 0)
{
Debug("inst-trigger") << "Added " << addedLemmas
<< " lemmas, trigger was " << d_nodes << std::endl;
}
}
return gtAddedLemmas + addedLemmas;
}
bool Trigger::sendInstantiation(std::vector<Node>& m, InferenceId id)
{
return d_qim.getInstantiate()->addInstantiation(d_quant, m, id);
}
bool Trigger::sendInstantiation(InstMatch& m, InferenceId id)
{
return sendInstantiation(m.d_vals, id);
}
int Trigger::getActiveScore() { return d_mg->getActiveScore(); }
Node Trigger::ensureGroundTermPreprocessed(Valuation& val,
Node n,
std::vector<Node>& gts)
{
NodeManager* nm = NodeManager::currentNM();
std::unordered_map<TNode, Node, TNodeHashFunction> visited;
std::unordered_map<TNode, Node, TNodeHashFunction>::iterator it;
std::vector<TNode> visit;
TNode cur;
visit.push_back(n);
do
{
cur = visit.back();
visit.pop_back();
it = visited.find(cur);
if (it == visited.end())
{
if (cur.getNumChildren() == 0)
{
visited[cur] = cur;
}
else if (!TermUtil::hasInstConstAttr(cur))
{
// cur has no INST_CONSTANT, thus is ground.
Node vcur = val.getPreprocessedTerm(cur);
gts.push_back(vcur);
visited[cur] = vcur;
}
else
{
visited[cur] = Node::null();
visit.push_back(cur);
visit.insert(visit.end(), cur.begin(), cur.end());
}
}
else if (it->second.isNull())
{
Node ret = cur;
bool childChanged = false;
std::vector<Node> children;
if (cur.getMetaKind() == metakind::PARAMETERIZED)
{
children.push_back(cur.getOperator());
}
for (const Node& cn : cur)
{
it = visited.find(cn);
Assert(it != visited.end());
Assert(!it->second.isNull());
childChanged = childChanged || cn != it->second;
children.push_back(it->second);
}
if (childChanged)
{
ret = nm->mkNode(cur.getKind(), children);
}
visited[cur] = ret;
}
} while (!visit.empty());
Assert(visited.find(n) != visited.end());
Assert(!visited.find(n)->second.isNull());
return visited[n];
}
void Trigger::debugPrint(const char* c) const
{
Trace(c) << "TRIGGER( " << d_nodes << " )" << std::endl;
}
} // namespace inst
} // namespace quantifiers
} // namespace theory
} // namespace CVC5
|
