From 8175223cddb40637258171d64ffc89d059bce5a8 Mon Sep 17 00:00:00 2001 From: trevor_hansen Date: Sat, 30 Apr 2011 05:09:02 +0000 Subject: [PATCH] Bugfix. The last checkin caused an infinite loop (often). git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@1293 e59a4935-1847-0410-ae03-e826735625c1 --- src/AST/NodeFactory/SimplifyingNodeFactory.cpp | 2 ++ 1 file changed, 2 insertions(+) diff --git a/src/AST/NodeFactory/SimplifyingNodeFactory.cpp b/src/AST/NodeFactory/SimplifyingNodeFactory.cpp index b8ab590..df3e578 100644 --- a/src/AST/NodeFactory/SimplifyingNodeFactory.cpp +++ b/src/AST/NodeFactory/SimplifyingNodeFactory.cpp @@ -786,10 +786,12 @@ ASTNode SimplifyingNodeFactory::CreateTerm(Kind kind, unsigned int width, result = NodeFactory::CreateTerm(BEEV::ITE, width, children[0], children[1][1], children[2]); else if (children[0].GetKind() == BEEV::NOT) result = NodeFactory::CreateTerm(BEEV::ITE, width, children[0][0], children[2], children[1]); +/* else if (children[0].GetKind() ==BEEV::EQ && children[0][1] == children[1]) result = NodeFactory::CreateTerm(BEEV::ITE, width, children[0], children[0][0], children[2]); else if (children[0].GetKind() == BEEV::EQ && children[0][0] == children[1]) result = NodeFactory::CreateTerm(BEEV::ITE, width, children[0], children[0][1], children[2]); +*/ break; } -- 2.47.3