}
// process the assertions, return true if no conflict is discovered
- return d_processor.apply(as);
-}
+ bool noConflict = d_processor.apply(as);
+
+ // now, post-process the assertions
-void Preprocessor::postprocess(Assertions& as)
-{
- preprocessing::AssertionPipeline& ap = as.getAssertionPipeline();
// if incremental, compute which variables are assigned
if (options::incrementalSolving())
{
// mark that we've processed assertions
d_assertionsProcessed = true;
+
+ return noConflict;
}
void Preprocessor::clearLearnedLiterals()
* true if no conflict was discovered while preprocessing them.
*/
bool process(Assertions& as);
- /**
- * Postprocess assertions, called after the SmtEngine has finished
- * giving the assertions to the SMT solver and before the assertions are
- * cleared.
- */
- void postprocess(Assertions& as);
/**
* Clear learned literals from the Boolean propagator.
*/
// end: INVARIANT to maintain: no reordering of assertions or
// introducing new ones
- d_pp.postprocess(as);
-
// Push the formula to SAT
{
Chat() << "converting to CNF..." << endl;