-/********************* */
/*! \file congruence_manager.cpp
** \verbatim
** Original author: Tim King
d_constraintDatabase(cd),
d_setupLiteral(setup),
d_avariables(avars),
- d_ee(d_notify, c, "theory::arith::ArithCongruenceManager", false)
+ d_ee(d_notify, c, "theory::arith::ArithCongruenceManager", true)
{}
ArithCongruenceManager::Statistics::Statistics():
d_numGetModelValConflicts("theory::arrays::number of getModelVal conflicts", 0),
d_numSetModelValSplits("theory::arrays::number of setModelVal splits", 0),
d_numSetModelValConflicts("theory::arrays::number of setModelVal conflicts", 0),
- d_ppEqualityEngine(u, "theory::arrays::TheoryArraysPP" , false),
+ d_ppEqualityEngine(u, "theory::arrays::TheoryArraysPP" , true),
d_ppFacts(u),
// d_ppCache(u),
d_literalsToPropagate(c),
d_literalsToPropagateIndex(c, 0),
d_isPreRegistered(c),
- d_mayEqualEqualityEngine(c, "theory::arrays::TheoryArraysMayEqual", false),
+ d_mayEqualEqualityEngine(c, "theory::arrays::TheoryArraysMayEqual", true),
d_notify(*this),
- d_equalityEngine(d_notify, c, "theory::arrays::TheoryArrays", false),
+ d_equalityEngine(d_notify, c, "theory::arrays::TheoryArrays", true),
d_conflict(c, false),
d_backtracker(c),
d_infoMap(c, &d_backtracker),
CoreSolver::CoreSolver(context::Context* c, TheoryBV* bv)
: SubtheorySolver(c, bv),
d_notify(*this),
- d_equalityEngine(d_notify, c, "theory::bv::TheoryBV", false),
+ d_equalityEngine(d_notify, c, "theory::bv::TheoryBV", true),
d_slicer(new Slicer()),
d_isComplete(c, true),
d_useSlicer(false),
d_infer(c),
d_infer_exp(c),
d_notify( *this ),
- d_equalityEngine(d_notify, c, "theory::datatypes::TheoryDatatypes", false),
+ d_equalityEngine(d_notify, c, "theory::datatypes::TheoryDatatypes", true),
d_labels( c ),
d_selector_apps( c ),
//d_consEqc( c ),
context::UserContext* u):
d_external(external),
d_notify(*this),
- d_equalityEngine(d_notify, c, "theory::sets::TheorySetsPrivate", false),
+ d_equalityEngine(d_notify, c, "theory::sets::TheorySetsPrivate", true),
d_trueNode(NodeManager::currentNM()->mkConst<bool>(true)),
d_falseNode(NodeManager::currentNM()->mkConst<bool>(false)),
d_conflict(c),
: Theory(THEORY_STRINGS, c, u, out, valuation, logicInfo),
RMAXINT(LONG_MAX),
d_notify( *this ),
- d_equalityEngine(d_notify, c, "theory::strings::TheoryStrings", false),
+ d_equalityEngine(d_notify, c, "theory::strings::TheoryStrings", true),
d_conflict(c, false),
d_infer(c),
d_infer_exp(c),
/* The strong theory solver can be notified by EqualityEngine::init(),
* so make sure it's initialized first. */
d_thss(NULL),
- d_equalityEngine(d_notify, c, "theory::uf::TheoryUF", false),
+ d_equalityEngine(d_notify, c, "theory::uf::TheoryUF", true),
d_conflict(c, false),
d_literalsToPropagate(c),
d_literalsToPropagateIndex(c, 0),