Speedup. Problems with lots of pluses sometimes ran slowly. For the same reason that...

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

diff --git a/src/simplifier/simplifier.cpp b/src/simplifier/simplifier.cpp
index f678ffe36a773dc3ada01bbca9e0ad3b08ec079b..e97b3de9c5745521d033188da061639c5882a223 100644 (file)
--- a/src/simplifier/simplifier.cpp
+++ b/src/simplifier/simplifier.cpp
@@ -1642,7 +1642,7 @@ namespace BEEV
                {
                        ASTVec v;
                        ASTVec toProcess = actualInputterm.GetChildren();
-                       if (actualInputterm.GetKind() == BVAND || actualInputterm.GetKind() == BVOR)
+                       if (actualInputterm.GetKind() == BVAND || actualInputterm.GetKind() == BVOR || actualInputterm.GetKind() == BVPLUS)
                        {
                                // If we didn't flatten these, then we'd start flattening each of these
                                // from the bottom up. Potentially creating tons of the nodes along the way.