git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@1003
e59a4935-1847-0410-ae03-
e826735625c1
bool enable_AIG_rewrites_flag;
+ bool simplify_during_BB_flag;
+
// Available back-end SAT solvers.
enum SATSolvers
{
enable_AIG_rewrites_flag = false;
+ // If the bit-blaster discovers new constants, should the term simplifier be re-run.
+ simplify_during_BB_flag=false;
+
} //End of constructor for UserDefinedFlags
}; //End of struct UserDefinedFlags
// call SimplifyTerm on ite(true,y,z), which will do the expected simplification.
// Then the term that we bitblast will by "y".
- if (uf !=NULL && uf->optimize_flag)
+ if (uf !=NULL && uf->optimize_flag && uf->simplify_during_BB_flag)
{
const int numberOfChildren = term.Degree();
vector<BBNodeVec> ch;