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
|
/******************************************************************************
* Top contributors (to current version):
* Gereon Kremer, Makai Mann, 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.
* ****************************************************************************
*
* Implementation of the inference manager for the theory of strings.
*/
#include "theory/arith/inference_manager.h"
#include "options/arith_options.h"
#include "theory/arith/arith_state.h"
#include "theory/arith/theory_arith.h"
#include "theory/rewriter.h"
namespace cvc5 {
namespace theory {
namespace arith {
InferenceManager::InferenceManager(Env& env,
TheoryArith& ta,
ArithState& astate,
ProofNodeManager* pnm)
: InferenceManagerBuffered(env, ta, astate, pnm, "theory::arith::"),
// currently must track propagated literals if using the equality solver
d_trackPropLits(astate.options().arith.arithEqSolver),
d_propLits(context())
{
}
void InferenceManager::addPendingLemma(std::unique_ptr<SimpleTheoryLemma> lemma,
bool isWaiting)
{
Trace("arith::infman") << "Add " << lemma->getId() << " " << lemma->d_node
<< (isWaiting ? " as waiting" : "") << std::endl;
if (hasCachedLemma(lemma->d_node, lemma->d_property))
{
return;
}
if (isEntailedFalse(*lemma))
{
if (isWaiting)
{
d_waitingLem.clear();
}
else
{
d_pendingLem.clear();
d_theoryState.notifyInConflict();
}
}
if (isWaiting)
{
d_waitingLem.emplace_back(std::move(lemma));
}
else
{
d_pendingLem.emplace_back(std::move(lemma));
}
}
void InferenceManager::addPendingLemma(const SimpleTheoryLemma& lemma,
bool isWaiting)
{
addPendingLemma(
std::unique_ptr<SimpleTheoryLemma>(new SimpleTheoryLemma(lemma)),
isWaiting);
}
void InferenceManager::addPendingLemma(const Node& lemma,
InferenceId inftype,
ProofGenerator* pg,
bool isWaiting,
LemmaProperty p)
{
addPendingLemma(std::unique_ptr<SimpleTheoryLemma>(
new SimpleTheoryLemma(inftype, lemma, p, pg)),
isWaiting);
}
void InferenceManager::flushWaitingLemmas()
{
for (auto& lem : d_waitingLem)
{
Trace("arith::infman") << "Flush waiting lemma to pending: "
<< lem->getId() << " " << lem->d_node
<< std::endl;
d_pendingLem.emplace_back(std::move(lem));
}
d_waitingLem.clear();
}
void InferenceManager::clearWaitingLemmas()
{
d_waitingLem.clear();
}
bool InferenceManager::hasUsed() const
{
return hasSent() || hasPending();
}
bool InferenceManager::hasWaitingLemma() const
{
return !d_waitingLem.empty();
}
std::size_t InferenceManager::numWaitingLemmas() const
{
return d_waitingLem.size();
}
bool InferenceManager::hasCachedLemma(TNode lem, LemmaProperty p)
{
Node rewritten = Rewriter::rewrite(lem);
return TheoryInferenceManager::hasCachedLemma(rewritten, p);
}
bool InferenceManager::cacheLemma(TNode lem, LemmaProperty p)
{
Node rewritten = Rewriter::rewrite(lem);
return TheoryInferenceManager::cacheLemma(rewritten, p);
}
bool InferenceManager::isEntailedFalse(const SimpleTheoryLemma& lem)
{
if (d_theoryState.options().arith.nlExtEntailConflicts)
{
Node ch_lemma = lem.d_node.negate();
ch_lemma = Rewriter::rewrite(ch_lemma);
Trace("arith-inf-manager") << "InferenceManager::Check entailment of "
<< ch_lemma << "..." << std::endl;
std::pair<bool, Node> et = d_theory.getValuation().entailmentCheck(
options::TheoryOfMode::THEORY_OF_TYPE_BASED, ch_lemma);
Trace("arith-inf-manager") << "entailment test result : " << et.first << " "
<< et.second << std::endl;
if (et.first)
{
Trace("arith-inf-manager")
<< "*** Lemma entailed to be in conflict : " << lem.d_node
<< std::endl;
return true;
}
}
return false;
}
bool InferenceManager::propagateLit(TNode lit)
{
if (d_trackPropLits)
{
d_propLits.insert(lit);
}
return TheoryInferenceManager::propagateLit(lit);
}
bool InferenceManager::hasPropagated(TNode lit) const
{
Assert(d_trackPropLits);
return d_propLits.find(lit) != d_propLits.end();
}
} // namespace arith
} // namespace theory
} // namespace cvc5
|
