If there are unapplied substitutions before starting unconstrained variable eliminati...

git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@1228 e59a4935-1847-0410-ae03-e826735625c1

diff --git a/src/simplifier/RemoveUnconstrained.cpp b/src/simplifier/RemoveUnconstrained.cpp
index f15a1e8cf293aad71e2cf2c0e22df5bc20ae829a..78798ea75002b65f8483a31bfc2e875406ce7a57 100644 (file)
--- a/src/simplifier/RemoveUnconstrained.cpp
+++ b/src/simplifier/RemoveUnconstrained.cpp
@@ -26,7 +26,6 @@ namespace BEEV
 
   const bool debug_unconstrained = false;
 
-  // There should be no unapplied simplifications.
   ASTNode
   RemoveUnconstrained::topLevel(const ASTNode &n, Simplifier *simplifier)
   {
@@ -35,7 +34,9 @@ namespace BEEV
     bm.GetRunTimes()->start(RunTimes::RemoveUnconstrained);
 
     //All the simplifications should be written through before we get here.
-    assert(result == simplifier->applySubstitutionMap(result));
+
+    if(simplifier->hasUnappliedSubstitutions())
+      result = simplifier->applySubstitutionMap(result);
 
     result = topLevel_other(result, simplifier);