CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-18_ext.xml
MD5SUM1200f5c145087e54f9d054527a898e22
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 benchmark6.29304
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.3141084932SAT 6.29304 6.3564
Mistral-prime 1.3131084933SAT 9.8655 9.87423
MDG-noprobe 2008-06-271084923SAT 10.9603 11.064
MDG-probe 2008-06-271084922SAT 11.5582 11.6894
cpHydra k_101084938SAT 21.2928 21.5618
mddc-solv 2008-06-091084920SAT 25.4201 25.6518
spider 2008-06-141084921SAT 43.5074 43.5696
Concrete + CSP4J - Tabu Engine 2008-05-301084917SAT 54.4077 54.9618
Concrete + CPS4J 2008-05-301084919SAT 65.4171 65.4899
Abscon 112v4 AC1084936SAT 82.4925 82.9679
Abscon 112v4 ESAC1084937SAT 92.281 93.2114
cpHydra k_401084939SAT 93.5048 93.8303
Minion/Tailor 2008-07-041106962SAT 101.07 101.622
Concrete + CSP4J - WMC Engine 2008-05-301084918SAT 1404.77 1409.9
SAT4J CSP 2008-06-131084924? 71.7641 70.599
bpsolver 2008-06-271084927? (problem) 121.941 123.04
Sugar v1.13+picosat1084925? (MO) 12.72 12.9935
Sugar v1.13+minisat1084926? (MO) 12.72 12.9752
galac M1084930? (TO) 1800.02 1802.42
galac E1084931? (TO) 1800.05 1816.61
casper zito1084935? (TO) 1800.06 1808.13
casper zao1084934? (TO) 1800.11 1807.73
choco2_impwdeg 2008-06-261084928? (TO) 1800.16 1801.01
choco2_dwdeg 2008-06-261084929? (TO) 1800.17 1817.2

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