System.out.println("There are " + cases.size() + " cases to solve");
// verify all the cases
// stop on the first case which has a solution (i.e counter-example)
int i = 0;
Solution result = new Solution();
while (i<cases.size() && result.empty()) {
result = new Solution();
Expression c = cases.get(i);
constSyst.addConstraint(c);
if (multi)
System.out.println("Case # " + (i+1));
System.out.println(constSyst);
if (timeout==-1)
constSyst.solve(result,true);
else
constSyst.solve(result,true,timeout);
constSyst.resetConstraintBlock();
i++;
}
System.out.println(constSyst.printStatus());
// if there is no solution, print the status
// to know the overall time for solving all cases
if (result.empty())
constSyst.printStatusToFile();
}