Tiny improvement. Create slightly fewer nodes.

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

diff --git a/src/simplifier/simplifier.cpp b/src/simplifier/simplifier.cpp
index a2d18991435fe4ce462cb97b2c47cc099c0565e2..7bd69487761d543619e5bdc0db8a81832bdc53d3 100644 (file)
--- a/src/simplifier/simplifier.cpp
+++ b/src/simplifier/simplifier.cpp
@@ -10,6 +10,7 @@
 #include <cassert>
 #include <cmath>
 #include "simplifier.h"
+#include "AIGSimplifyPropositionalCore.h"
 
 namespace BEEV
 {
@@ -3090,10 +3091,7 @@ namespace BEEV
 
     if (constkids.size() > 1)
       {
-        ASTNode output = 
-          nf->CreateTerm(BVPLUS,
-                          constkids[0].GetValueWidth(), constkids);
-        output = BVConstEvaluator(output);
+       ASTNode output = NonMemberBVConstEvaluator(_bm , BVPLUS, constkids, constkids[0].GetValueWidth());
         if (output != zero)
           outputvec.push_back(output);
       }
@@ -3105,7 +3103,7 @@ namespace BEEV
 
     if (outputvec.size() > 1)
       {
-        output = nf->CreateTerm(BVPLUS, len, outputvec);
+       output = nf->CreateTerm(BVPLUS, len, outputvec);
       }
     else if (outputvec.size() == 1)
       {