MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/allsquaresUnsat/
normalized-squaresUnsat-12-12.xml
MD5SUMf2b3b466b33c17a430e70cd4470c6662
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 benchmark3.73043
Satisfiable
(Un)Satisfiability was proved
Number of variables288
Number of constraints333
Maximum constraint arity12
Maximum domain size26
Number of constraints which are defined in extension0
Number of constraints which are defined in intension265
Global constraints used (with number of constraints)cumulative(2),weightedsum(66)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1108941OPTIMUM3 3.73043 3.83573
Sugar v1.13+minisat1108942OPTIMUM3 5.50116 5.25824

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:
25 0 10 22 14 2 19 0 13 12 8 0 8 20 12 22 9 20 9 12 0 16 15 0 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 0 0 0 1 1 0 0 1 1
0 0 1 0 0 1 0 0 1 1 0 1 0 1 0 0 1 1 0 0 0 1 0 0 1 0 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 1 0 0 0 0 1 1 0 1 0 0 0 0 1 0 0 1 0 0 1 0
0 1 0 0 0 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 1 1 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0
0 1 0 0 1 0 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0
1 0 0 0 0 0 1 0 1 0 1 0 0 0 1