CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-3_ext.xml
MD5SUM8f0b2a49e1135ea84dc0e5c626ff8a69
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 benchmark12.97
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.3141084863SAT 12.97 13.0346
MDG-noprobe 2008-06-271084854SAT 15.3777 15.3837
Mistral-prime 1.3131084864SAT 16.5455 16.7155
MDG-probe 2008-06-271084853SAT 17.2154 17.363
mddc-solv 2008-06-091084851SAT 19.762 19.9533
spider 2008-06-141084852SAT 26.127 26.3637
cpHydra k_101084869SAT 27.7528 28.1182
Concrete + CPS4J 2008-05-301084850SAT 71.1492 71.266
Minion/Tailor 2008-07-041106965SAT 110.908 112.081
Abscon 112v4 AC1084867SAT 143.99 145.412
Concrete + CSP4J - Tabu Engine 2008-05-301084848SAT 147.262 148.23
Abscon 112v4 ESAC1084868SAT 148.571 150.037
cpHydra k_401084870SAT 153.346 153.795
SAT4J CSP 2008-06-131084855? 89.0945 87.5948
bpsolver 2008-06-271084858? (problem) 123.09 124.216
Sugar v1.13+minisat1084857? (MO) 12.787 13.6063
Sugar v1.13+picosat1084856? (MO) 13.8729 14.4143
Concrete + CSP4J - WMC Engine 2008-05-301084849? (TO) 1800.04 1808.43
galac M1084861? (TO) 1800.07 1804.21
casper zito1084866? (TO) 1800.1 1801.69
galac E1084862? (TO) 1800.1 1816.51
choco2_impwdeg 2008-06-261084859? (TO) 1800.13 1812.01
choco2_dwdeg 2008-06-261084860? (TO) 1800.14 1805.87
casper zao1084865? (TO) 1800.14 1801.68

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