From: trevor_hansen <trevor_hansen@e59a4935-1847-0410-ae03-e826735625c1>
Date: Thu, 1 Sep 2011 12:29:37 +0000 (+0000)
Subject: Bugfix. Thanks for Jianjun Huang for the report. If the simplifying node factory... 
X-Git-Url: https://git.unchartedbackwaters.co.uk/w/?a=commitdiff_plain;h=0c9d5ed8db8a85ae78388d975dc7d5626b049fd4;p=francis%2Fstp.git

Bugfix. Thanks for Jianjun Huang for the report. If the simplifying node factory wasn't enabled, the types were sometimes wrong.

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

diff --git a/src/simplifier/bvsolver.cpp b/src/simplifier/bvsolver.cpp
index c67f466..681ae84 100644
--- a/src/simplifier/bvsolver.cpp
+++ b/src/simplifier/bvsolver.cpp
@@ -660,10 +660,11 @@ namespace BEEV
     {
         ASTVec c = FlattenKind(AND,input.GetChildren());
         input = _bm->CreateNode(AND,c);
+        k = input.GetKind();
 
         // When flattening simplifications will be applied to the node, potentially changing it's type:
         // (AND x (ANY (not x) y)) gives us FALSE.
-       if (!(EQ == input.GetKind() || AND == input.GetKind()))
+       if (!(EQ == k || AND == k ))
            return input;
 
           if (CheckAlreadySolvedMap(input, output))