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
|
/********************* */
/*! \file inference_manager_buffered.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** 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"
using namespace CVC4::kind;
namespace CVC4 {
namespace theory {
InferenceManagerBuffered::InferenceManagerBuffered(Theory& t,
TheoryState& state,
ProofNodeManager* pnm)
: TheoryInferenceManager(t, state, pnm)
{
}
bool InferenceManagerBuffered::hasProcessed() const
{
return d_theoryState.isInConflict() || !d_pendingLem.empty()
|| !d_pendingFact.empty();
}
bool InferenceManagerBuffered::hasPendingFact() const
{
return !d_pendingFact.empty();
}
bool InferenceManagerBuffered::hasPendingLemma() const
{
return !d_pendingLem.empty();
}
void InferenceManagerBuffered::addPendingLemma(Node lem,
LemmaProperty p,
ProofGenerator* pg)
{
d_pendingLem.push_back(std::make_shared<Lemma>(lem, p, pg));
}
void InferenceManagerBuffered::addPendingLemma(std::shared_ptr<Lemma> lemma)
{
d_pendingLem.emplace_back(std::move(lemma));
}
void InferenceManagerBuffered::addPendingFact(Node fact, Node exp)
{
Assert(fact.getKind() != AND && fact.getKind() != OR);
d_pendingFact.push_back(std::pair<Node, Node>(fact, exp));
}
void InferenceManagerBuffered::addPendingPhaseRequirement(Node lit, bool pol)
{
// must ensure rewritten
lit = Rewriter::rewrite(lit);
d_pendingReqPhase[lit] = pol;
}
void InferenceManagerBuffered::doPendingFacts()
{
size_t i = 0;
while (!d_theoryState.isInConflict() && i < d_pendingFact.size())
{
std::pair<Node, Node>& pfact = d_pendingFact[i];
Node fact = pfact.first;
Node exp = pfact.second;
bool polarity = fact.getKind() != NOT;
TNode atom = polarity ? fact : fact[0];
// no double negation or conjunctive conclusions
Assert(atom.getKind() != NOT && atom.getKind() != AND);
assertInternalFact(atom, polarity, exp);
i++;
}
d_pendingFact.clear();
}
void InferenceManagerBuffered::doPendingLemmas()
{
// process all the pending lemmas
for (const std::shared_ptr<Lemma>& plem : d_pendingLem)
{
if (!plem->notifySend())
{
// the lemma indicated that it should not be sent after all
continue;
}
Node lem = plem->d_node;
LemmaProperty p = plem->d_property;
ProofGenerator* pg = plem->d_pg;
Assert(!lem.isNull());
// send (trusted) lemma on the output channel with property p
trustedLemma(TrustNode::mkTrustLemma(lem, pg), p);
}
d_pendingLem.clear();
}
void InferenceManagerBuffered::doPendingPhaseRequirements()
{
// process the pending require phase calls
for (const std::pair<const Node, bool>& prp : d_pendingReqPhase)
{
d_out.requirePhase(prp.first, prp.second);
}
d_pendingReqPhase.clear();
}
} // namespace theory
} // namespace CVC4
|
