CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-1_ext.xml
MD5SUM777fc5a1408e3970fe4cdc5b66e8ea16
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 benchmark3.3155
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.3141084771SAT 3.3155 3.757
MDG-probe 2008-06-271084761SAT 11.1793 11.2909
Mistral-prime 1.3131084772SAT 18.6902 18.8669
MDG-noprobe 2008-06-271084762SAT 19.0481 19.2075
cpHydra k_101084777SAT 29.3025 29.7003
mddc-solv 2008-06-091084759SAT 37.6573 37.9913
Concrete + CSP4J - Tabu Engine 2008-05-301084756SAT 92.9009 92.9897
spider 2008-06-141084760SAT 110.977 111.841
Concrete + CPS4J 2008-05-301084758SAT 146.131 147.456
Minion/Tailor 2008-07-041106963SAT 154.409 154.502
Abscon 112v4 AC1084775SAT 230.553 231.747
cpHydra k_401084778SAT 246.826 247.113
Abscon 112v4 ESAC1084776SAT 247.921 250.287
Concrete + CSP4J - WMC Engine 2008-05-301084757SAT 1138.02 1142.85
SAT4J CSP 2008-06-131084763? 79.186 77.3872
bpsolver 2008-06-271084766? (problem) 115.042 115.307
Sugar v1.13+minisat1084765? (MO) 12.71 13.7136
Sugar v1.13+picosat1084764? (MO) 12.777 13.3405
galac E1084770? (TO) 1800 1806.01
galac M1084769? (TO) 1800.04 1814.01
choco2_dwdeg 2008-06-261084768? (TO) 1800.08 1802.18
casper zito1084774? (TO) 1800.09 1810.28
casper zao1084773? (TO) 1800.12 1803.68
choco2_impwdeg 2008-06-261084767? (TO) 1800.12 1801.28

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