CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-8-20-5/
normalized-rand-8-20-5-18-800-19_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-19_ext.xml
MD5SUM0d3371b4f098cfc1ba29218d9b5a7fe9
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark8.5777
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints18
Maximum constraint arity8
Maximum domain size5
Number of constraints which are defined in extension18
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
MDG-probe 2008-06-271054342SAT 6.28504 6.35624
Mistral-option 1.3141054352SAT 8.5777 8.6577
Mistral-prime 1.3131054353SAT 9.25759 9.26929
MDG-noprobe 2008-06-271054343SAT 10.0325 10.1332
mddc-solv 2008-06-091054340SAT 18.6672 18.7551
cpHydra k_101054358SAT 20.4689 20.7902
Concrete + CPS4J 2008-05-301054339SAT 24.2503 24.3012
Concrete + CSP4J - Tabu Engine 2008-05-301054337SAT 68.8225 69.4506
Minion/Tailor 2008-07-041104916SAT 110.319 111.468
spider 2008-06-141054341SAT 201.213 202.781
cpHydra k_401054359SAT 310.095 314.797
Abscon 112v4 AC1054356SAT 1041.03 1046.65
Abscon 112v4 ESAC1054357SAT 1058.93 1061.92
casper zao1054354SAT 1181.78 1198.85
Concrete + CSP4J - WMC Engine 2008-05-301054338SAT 1186.78 1187.45
choco2_dwdeg 2008-06-261054349SAT 1519.1 1521.3
casper zito1054355SAT 1543.81 1554.81
SAT4J CSP 2008-06-131054344? 79.9029 78.3579
bpsolver 2008-06-271054347? (problem) 121.506 122.631
Sugar v1.13+minisat1054346? (MO) 11.794 12.2943
Sugar v1.13+picosat1054345? (MO) 12.81 13.0146
galac E1054351? (TO) 1800.09 1803.21
galac M1054350? (TO) 1800.09 1808.11
choco2_impwdeg 2008-06-261054348? (TO) 1800.18 1814.96

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:
1 1 1 1 0 3 3 4 1 1 2 2 0 0 0 0 4 2 0 0