Correct a comment

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

diff --git a/src/to-sat/BitBlaster.cpp b/src/to-sat/BitBlaster.cpp
index e25825db48c10af7c235c418086f855559e7de9d..9da8706bce27c8746f31162c1a7eebe032854fd5 100644 (file)
--- a/src/to-sat/BitBlaster.cpp
+++ b/src/to-sat/BitBlaster.cpp
@@ -405,7 +405,6 @@ const BBNodeVec BitBlaster<BBNode,BBNodeManagerT>::BBTerm(const ASTNode& term, B
                const BBNodeVec& mpcd2 = BBTerm(t1, support);
                assert(mpcd1.size() == mpcd2.size());
                //Revereses the order of the nodes w/out the need for temporaries
-               //This is needed because t0 an t1 must be const
                if ((BVCONST != t0.GetKind()) && (BVCONST == t1.GetKind())) {
 
                        result = BBMult(mpcd2, mpcd1, support,t1,t0);