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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* 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.
* ****************************************************************************
*
* Arithmetic equality solver
*/
#include "theory/arith/equality_solver.h"
#include "theory/arith/inference_manager.h"
using namespace cvc5::kind;
namespace cvc5 {
namespace theory {
namespace arith {
EqualitySolver::EqualitySolver(ArithState& astate, InferenceManager& aim)
: d_astate(astate),
d_aim(aim),
d_notify(*this),
d_ee(nullptr),
d_propLits(astate.getSatContext())
{
}
bool EqualitySolver::needsEqualityEngine(EeSetupInfo& esi)
{
esi.d_notify = &d_notify;
esi.d_name = "arith::ee";
return true;
}
void EqualitySolver::finishInit()
{
d_ee = d_astate.getEqualityEngine();
// add the function kinds
d_ee->addFunctionKind(kind::NONLINEAR_MULT);
d_ee->addFunctionKind(kind::EXPONENTIAL);
d_ee->addFunctionKind(kind::SINE);
d_ee->addFunctionKind(kind::IAND);
d_ee->addFunctionKind(kind::POW2);
}
bool EqualitySolver::preNotifyFact(
TNode atom, bool pol, TNode fact, bool isPrereg, bool isInternal)
{
if (atom.getKind() != EQUAL)
{
// finished processing, since not beneficial to add non-equality facts
return true;
}
Trace("arith-eq-solver") << "EqualitySolver::preNotifyFact: " << fact
<< std::endl;
// we will process
return false;
}
TrustNode EqualitySolver::explain(TNode lit)
{
Trace("arith-eq-solver-debug") << "explain " << lit << "?" << std::endl;
// check if we propagated it?
if (d_propLits.find(lit) == d_propLits.end())
{
Trace("arith-eq-solver-debug") << "...did not propagate" << std::endl;
return TrustNode::null();
}
Trace("arith-eq-solver-debug")
<< "...explain via inference manager" << std::endl;
// if we did, explain with the arithmetic inference manager
return d_aim.explainLit(lit);
}
bool EqualitySolver::propagateLit(Node lit)
{
// if we've already propagated, ignore
if (d_aim.hasPropagated(lit))
{
return true;
}
// notice this is only used when ee-mode=distributed
// remember that this was a literal we propagated
Trace("arith-eq-solver-debug") << "propagate lit " << lit << std::endl;
d_propLits.insert(lit);
return d_aim.propagateLit(lit);
}
void EqualitySolver::conflictEqConstantMerge(TNode a, TNode b)
{
d_aim.conflictEqConstantMerge(a, b);
}
bool EqualitySolver::EqualitySolverNotify::eqNotifyTriggerPredicate(
TNode predicate, bool value)
{
Trace("arith-eq-solver") << "...propagate (predicate) " << predicate << " -> "
<< value << std::endl;
if (value)
{
return d_es.propagateLit(predicate);
}
return d_es.propagateLit(predicate.notNode());
}
bool EqualitySolver::EqualitySolverNotify::eqNotifyTriggerTermEquality(
TheoryId tag, TNode t1, TNode t2, bool value)
{
Trace("arith-eq-solver") << "...propagate (term eq) " << t1.eqNode(t2)
<< " -> " << value << std::endl;
if (value)
{
return d_es.propagateLit(t1.eqNode(t2));
}
return d_es.propagateLit(t1.eqNode(t2).notNode());
}
void EqualitySolver::EqualitySolverNotify::eqNotifyConstantTermMerge(TNode t1,
TNode t2)
{
Trace("arith-eq-solver") << "...conflict merge " << t1 << " " << t2
<< std::endl;
d_es.conflictEqConstantMerge(t1, t2);
}
} // namespace arith
} // namespace theory
} // namespace cvc5
|
