long = "quant-epr"
type = "bool"
default = "false"
- help = "infer whether in effectively propositional fragment, use for cbqi"
+ help = "infer whether in effectively propositional fragment, use for cegqi"
[[option]]
name = "quantEprMatching"
name = "cegqiBvIneqMode"
category = "regular"
long = "cegqi-bv-ineq=MODE"
- type = "CbqiBvIneqMode"
+ type = "CegqiBvIneqMode"
default = "EQ_BOUNDARY"
help = "choose mode for handling bit-vector inequalities with counterexample-guided instantiation"
help_mode = "Modes for handling bit-vector inequalities in counterexample-guided instantiation."
{
return Node::null();
}
- else if (options::cegqiBvIneqMode() == options::CbqiBvIneqMode::KEEP
+ else if (options::cegqiBvIneqMode() == options::CegqiBvIneqMode::KEEP
|| (pol && k == EQUAL))
{
return lit;
Trace("cegqi-bv") << " " << sm << " <> " << tm << std::endl;
Node ret;
- if (options::cegqiBvIneqMode() == options::CbqiBvIneqMode::EQ_SLACK)
+ if (options::cegqiBvIneqMode() == options::CegqiBvIneqMode::EQ_SLACK)
{
// if using slack, we convert constraints to a positive equality based on
// the current model M, e.g.: