MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/allsquaresUnsat/
normalized-squaresUnsat-11-11.xml
MD5SUM3caa6473dd6fba5681589b5a1a9ee0d5
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 benchmark2.73858
Satisfiable
(Un)Satisfiability was proved
Number of variables242
Number of constraints278
Maximum constraint arity11
Maximum domain size23
Number of constraints which are defined in extension0
Number of constraints which are defined in intension221
Global constraints used (with number of constraints)cumulative(2),weightedsum(55)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1108949OPTIMUM3 2.73858 2.43258
Sugar v1.13+minisat1108950OPTIMUM3 4.31034 4.69837

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:
7 11 11 18 8 7 0 0 14 13 0 15 2 9 0 12 17 15 7 4 13 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 0 0 1
0 1 0 0 0 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 0
1 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 0 0 0
1 1 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 1