CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-9_ext.xml
MD5SUM9c8ddf9c3eba4ea604759caf2f2ef92e
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 benchmark13.206
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
Mistral-option 1.3141084748SAT 13.206 13.2778
MDG-probe 2008-06-271084738SAT 13.314 13.4414
Mistral-prime 1.3131084749SAT 15.0577 15.1938
MDG-noprobe 2008-06-271084739SAT 15.7906 15.9476
mddc-solv 2008-06-091084736SAT 25.2512 25.4777
cpHydra k_101084754SAT 25.7831 26.1101
spider 2008-06-141084737SAT 33.5039 33.8281
Concrete + CSP4J - Tabu Engine 2008-05-301084733SAT 45.2151 45.712
Concrete + CPS4J 2008-05-301084735SAT 53.4739 53.5539
Abscon 112v4 ESAC1084753SAT 77.0303 77.8222
Abscon 112v4 AC1084752SAT 79.3589 79.8243
cpHydra k_401084755SAT 87.43 87.9064
Minion/Tailor 2008-07-041106969SAT 158.508 160.095
Concrete + CSP4J - WMC Engine 2008-05-301084734SAT 1614.83 1625.2
SAT4J CSP 2008-06-131084740? 101.009 99.33
bpsolver 2008-06-271084743? (problem) 121.737 122.753
Sugar v1.13+picosat1084741? (MO) 11.883 12.4746
Sugar v1.13+minisat1084742? (MO) 12.77 13.1546
galac E1084747? (TO) 1800.01 1806.61
galac M1084746? (TO) 1800.03 1808.52
casper zao1084750? (TO) 1800.04 1803.23
casper zito1084751? (TO) 1800.05 1806.13
choco2_dwdeg 2008-06-261084745? (TO) 1800.15 1815.61
choco2_impwdeg 2008-06-261084744? (TO) 1800.16 1810.09

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