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
|
/********************* */
/*! \file inference_manager_buffered.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Gereon Kremer
** 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 A buffered inference manager
**/
#include "theory/inference_manager_buffered.h"
#include "theory/rewriter.h"
#include "theory/theory.h"
#include "theory/theory_state.h"
using namespace CVC4::kind;
namespace CVC4 {
namespace theory {
InferenceManagerBuffered::InferenceManagerBuffered(Theory& t,
TheoryState& state,
ProofNodeManager* pnm,
const std::string& name,
bool cacheLemmas)
: TheoryInferenceManager(t, state, pnm, name, cacheLemmas),
d_processingPendingLemmas(false)
{
}
bool InferenceManagerBuffered::hasPending() const
{
return hasPendingFact() || hasPendingLemma();
}
bool InferenceManagerBuffered::hasPendingFact() const
{
return !d_pendingFact.empty();
}
bool InferenceManagerBuffered::hasPendingLemma() const
{
return !d_pendingLem.empty();
}
bool InferenceManagerBuffered::addPendingLemma(Node lem,
InferenceId id,
LemmaProperty p,
ProofGenerator* pg,
bool checkCache)
{
if (checkCache)
{
// check if it is unique up to rewriting
Node lemr = Rewriter::rewrite(lem);
if (hasCachedLemma(lemr, p))
{
return false;
}
}
// make the simple theory lemma
d_pendingLem.emplace_back(new SimpleTheoryLemma(id, lem, p, pg));
return true;
}
void InferenceManagerBuffered::addPendingLemma(
std::unique_ptr<TheoryInference> lemma)
{
d_pendingLem.emplace_back(std::move(lemma));
}
void InferenceManagerBuffered::addPendingFact(Node conc,
InferenceId id,
Node exp,
ProofGenerator* pg)
{
// make a simple theory internal fact
Assert(conc.getKind() != AND && conc.getKind() != OR);
d_pendingFact.emplace_back(new SimpleTheoryInternalFact(id, conc, exp, pg));
}
void InferenceManagerBuffered::addPendingFact(
std::unique_ptr<TheoryInference> fact)
{
d_pendingFact.emplace_back(std::move(fact));
}
void InferenceManagerBuffered::addPendingPhaseRequirement(Node lit, bool pol)
{
// it is the responsibility of the caller to ensure lit is rewritten
d_pendingReqPhase[lit] = pol;
}
void InferenceManagerBuffered::doPendingFacts()
{
size_t i = 0;
while (!d_theoryState.isInConflict() && i < d_pendingFact.size())
{
// assert the internal fact, which notice may enqueue more pending facts in
// this loop, or result in a conflict.
assertInternalFactTheoryInference(d_pendingFact[i].get());
i++;
}
d_pendingFact.clear();
}
void InferenceManagerBuffered::doPendingLemmas()
{
if (d_processingPendingLemmas)
{
// already processing
return;
}
d_processingPendingLemmas = true;
size_t i = 0;
while (i < d_pendingLem.size())
{
// process this lemma, which notice may enqueue more pending lemmas in this
// loop, or clear the lemmas.
lemmaTheoryInference(d_pendingLem[i].get());
i++;
}
d_pendingLem.clear();
d_processingPendingLemmas = false;
}
void InferenceManagerBuffered::doPendingPhaseRequirements()
{
// process the pending require phase calls
for (const std::pair<const Node, bool>& prp : d_pendingReqPhase)
{
requirePhase(prp.first, prp.second);
}
d_pendingReqPhase.clear();
}
void InferenceManagerBuffered::clearPending()
{
d_pendingFact.clear();
d_pendingLem.clear();
d_pendingReqPhase.clear();
}
void InferenceManagerBuffered::clearPendingFacts() { d_pendingFact.clear(); }
void InferenceManagerBuffered::clearPendingLemmas() { d_pendingLem.clear(); }
void InferenceManagerBuffered::clearPendingPhaseRequirements()
{
d_pendingReqPhase.clear();
}
std::size_t InferenceManagerBuffered::numPendingLemmas() const
{
return d_pendingLem.size();
}
std::size_t InferenceManagerBuffered::numPendingFacts() const
{
return d_pendingFact.size();
}
void InferenceManagerBuffered::lemmaTheoryInference(TheoryInference* lem)
{
// process this lemma
LemmaProperty p = LemmaProperty::NONE;
TrustNode tlem = lem->processLemma(p);
Assert(!tlem.isNull());
// send the lemma
trustedLemma(tlem, lem->getId(), p);
}
void InferenceManagerBuffered::assertInternalFactTheoryInference(
TheoryInference* fact)
{
// process this fact
std::vector<Node> exp;
ProofGenerator* pg = nullptr;
Node lit = fact->processFact(exp, pg);
Assert(!lit.isNull());
bool pol = lit.getKind() != NOT;
TNode atom = pol ? lit : lit[0];
// no double negation or conjunctive conclusions
Assert(atom.getKind() != NOT && atom.getKind() != AND);
// assert the internal fact
assertInternalFact(atom, pol, fact->getId(), exp, pg);
}
} // namespace theory
} // namespace CVC4
|
