CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.2/
normalized-rand-2-40-11-414-200-10_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-10_ext.xml
MD5SUMae56f402f5edeca9927c8f50a3c6b65b
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark1.3348
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints414
Maximum constraint arity2
Maximum domain size11
Number of constraints which are defined in extension414
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Concrete + CSP4J - Tabu Engine 2008-05-301096812SAT 1.3348 1.36306
Mistral-prime 1.3131096827SAT 3.2885 3.32709
bpsolver 2008-06-271096821SAT 5.08023 5.13185
choco2_dwdeg 2008-06-261096823SAT 7.2039 7.23388
choco2_impwdeg 2008-06-261096822SAT 7.96879 8.08409
MDG-probe 2008-06-271096816SAT 8.09877 8.1763
galac E1096825SAT 8.78566 8.97936
cpHydra k_101096832SAT 9.8825 10.0115
Mistral-option 1.3141096826SAT 9.97048 10.0643
cpHydra k_401096833SAT 10.1395 10.3198
MDG-noprobe 2008-06-271096817SAT 11.2043 11.3222
Abscon 112v4 AC1096830SAT 12.6731 12.8075
Abscon 112v4 ESAC1096831SAT 12.941 13.0889
galac M1096824SAT 33.5439 33.9529
Concrete + CPS4J 2008-05-301096814SAT 38.1182 38.5376
Sugar v1.13+minisat1096820SAT 47.1998 47.7561
spider 2008-06-141096815SAT 79.024 79.6004
casper zito1096829SAT 85.589 86.0192
Sugar v1.13+picosat1096819SAT 87.5877 88.433
Minion/Tailor 2008-07-041107166SAT 128.786 130.074
casper zao1096828SAT 199.117 199.686
SAT4J CSP 2008-06-131096818SAT 366.018 367.847
Concrete + CSP4J - WMC Engine 2008-05-301096813? (TO) 1800.08 1808.72

Additionnal information

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

Solution found:
2 3 2 4 8 6 2 2 1 2 6 2 8 0 8 10 2 5 7 1 7 3 4 10 6 3 10 6 1 9 3 2 8 8 6 6 5 0 3 6