ClauseList* xorcl = cm->ReturnXorClauses();
#endif
- ClauseBuckets * cb = Sort_ClauseList_IntoBuckets(cl);
+ ClauseBuckets * cb = Sort_ClauseList_IntoBuckets(cl);
+ bool sat = CallSAT_On_ClauseBuckets(SatSolver, cb);
//bool sat = toSATandSolve(SatSolver, *cl);
- bool sat = CallSAT_On_ClauseBuckets(SatSolver, cb);
for (ClauseBuckets::iterator it = cb->begin(); it != cb->end(); it++)
- delete it->second;
+ delete it->second;
delete cb;
-
if(!sat)
{
return sat;
((*(info[*it]->clausespos))[0])->end());
}
doRenamingPosXor(varphi);
- //doRenamingPos(varphi, defs);
+ //ClauseList* psi = convertFormulaToCNFPosXORAux(varphi, 0, defs);
+ //info[varphi]->clausespos = psi;
ASTNode varXorNode = GetNodeFrom_SINGLETON(info[varphi]->clausespos);
ASTNode NotVarXorNode = bm->CreateNode(NOT, varXorNode);
xor_clause->push_back(ASTNodeToASTNodePtr(NotVarXorNode));
if (bm->UserFlags.stats_flag)
{
cerr << "Number of clauses:" << defs->size() << endl;
- //PrintClauseList(cout, *defs);
+ PrintClauseList(cout, *defs);
+ cerr << "Number of xor-clauses:" << clausesxor->size() << endl;
+ PrintClauseList(cout, *clausesxor);
}
return defs;
// }
#ifdef CRYPTOMINISAT
if(add_xor_clauses)
- {
+ {
+ //cout << "addXorClause:\n";
newS.addXorClause(satSolverClause, false, 0, "z");
}
else