Francois Bobot <francois@bobot.eu> <francois@bobot.eu>
Liana Hadarean <lianah@cs.nyu.edu> <lianahady@gmail.com>
Andrew Reynolds <andrew.j.reynolds@gmail.com> <andrew.j.reynolds@gmail.com>
+Andrew Reynolds <andrew.j.reynolds@gmail.com> <reynolds@laraserver2.epfl.ch>
+Andrew Reynolds <andrew.j.reynolds@gmail.com> <reynolds@larapc05.epfl.ch>
Cesare Tinelli <cesare-tinelli@uiowa.edu> <cesare-tinelli@uiowa.edu>
Christopher L. Conway <christopherleeconway@gmail.com> <christopherleeconway@gmail.com>
Clark Barrett <barrett@cs.nyu.edu> <barrett@cs.nyu.edu>
/**
- * Return the uinterpreted function symbol corresponding to division-by-zero
+ * Return the uninterpreted function symbol corresponding to division-by-zero
* for this particular bit-width
* @param k should be UREM or UDIV
* @param width
NodeSet d_staticLearnCache;
/**
- * Maps from bit-vector width to divison-by-zero uninterpreted
+ * Maps from bit-vector width to division-by-zero uninterpreted
* function symbols.
*/
__gnu_cxx::hash_map<unsigned, Node> d_BVDivByZero;
when to apply instantiation
option instMaxLevel --inst-max-level=N int :default -1
maximum inst level of terms used to instantiate quantified formulas with (-1 == no limit, default)
-
+
option eagerInstQuant --eager-inst-quant bool :default false
apply quantifier instantiation eagerly
-
+
option fullSaturateQuant --full-saturate-quant bool :default false
when all other quantifier instantiation strategies fail, instantiate with ground terms from relevant domain, then arbitrary ground terms before answering unknown
option fmfOneInstPerRound --mbqi-one-inst-per-round bool :default false
only add one instantiation per quantifier per round for mbqi
option fmfOneQuantPerRound --mbqi-one-quant-per-round bool :default false
- only add instantiations for one quantifier per round for mbqi
+ only add instantiations for one quantifier per round for mbqi
option fmfInstEngine --fmf-inst-engine bool :default false
use instantiation engine in conjunction with finite model finding
d_engine(engine) {
}
- /*
+ /**
* Return true if n has an associated SAT literal
*/
bool isSatLiteral(TNode n) const;