Node input = proofVariableToReason(v);
Assert(acceptableOriginalNodes(input));
if(input.getKind() == kind::AND){
- if(input.getNumChildren() != 2){
- Warning() << "Fix this bug!" << std::endl;
+ for(Node::iterator input_iter = input.begin(), input_end = input.end(); input_iter != input_end; ++input_iter){
+ Node inputChild = *input_iter;
+ nb << inputChild;
}
- nb << input[0] << input[1];
}else{
nb << input;
}
d_partialModel.commitAssignmentChanges();
revertOutOfConflict();
- if(Debug.isOn("arith::consistency")){
+ if(Debug.isOn("arith::consistency::comitonconflict")){
entireStateIsConsistent("commit on conflict");
}
}
}
Warning() << endl;
result = false;
- } else {
+ } else if(Debug.isOn("arith::consistency::initial")){
d_partialModel.printModel(var);
Warning() << "Initial var is not consistent for " << var << *i;
if(d_tableau.isBasic(var)){