MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/allsquaresUnsat/
normalized-squaresUnsat-2-2.xml

Jump to solvers results

General information on the benchmark

Namecsp/allsquaresUnsat/
normalized-squaresUnsat-2-2.xml
MD5SUMf89ebe09a8b37b69c6dd533be7c4852e
Bench CategoryGLOBAL (global constraints)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark0.631903
Satisfiable
(Un)Satisfiability was proved
Number of variables8
Number of constraints8
Maximum constraint arity4
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension5
Global constraints used (with number of constraints)cumulative(2),weightedsum(1)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar v1.13+minisat1108934OPTIMUM3 0.631903 0.806375
Sugar++ v1.13+minisat-inc1108933OPTIMUM3 0.648901 2.55447

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 3
Solution found:
1 0 1 0 0 0 0 0