MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/latinSquare/
normalized-latinSquare-dg-12_all.xml

Jump to solvers results

General information on the benchmark

Namecsp/latinSquare/
normalized-latinSquare-dg-12_all.xml
MD5SUM535246887d226e6be0539abc12ce8eb5
Bench CategoryGLOBAL (global constraints)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints24
Best CPU time to get the best result obtained on this benchmark3600.06
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints48
Maximum constraint arity12
Maximum domain size12
Number of constraints which are defined in extension0
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)alldifferent(48)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1108975MSAT (TO)24 3600.06 3601.23
Sugar v1.13+minisat1108976MSAT (TO)24 3600.08 3623.43

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: 24
Solution found:
10 3 1 9 0 6 5 2 8 11 4 7 0 6 5 8 11 2 10 4 9 7 1 3 2 1 11 5 4 7 1 11 6 5 2 7 5 5 8 3 11 10 11 10 3 8 6 5 4 0 9 6 2 11 3 8 5 1 10 7 0 1 6 11
11 8 11 6 11 3 11 2 7 8 3 10 1 5 9 2 0 4 6 11 11 0 11 0 9 0 10 4 7 9 11 8 9 11 9 4 11 4 8 3 1 10 11 11 10 11 6 1 3 9 8 7 4 0 2 5 2 11 4 2 11
1 10 3 10 2 7 11 11 7 11 7 11 3 10 6 2 6 9 5