CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-17_ext.xml
MD5SUM20f6936a9f409b14eec766fe1691fa7b
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.73467
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
mddc-solv 2008-06-091084897SAT 8.73467 8.75634
MDG-noprobe 2008-06-271084900SAT 9.8935 9.90144
Mistral-prime 1.3131084910SAT 10.6484 10.6693
MDG-probe 2008-06-271084899SAT 11.1433 11.236
Mistral-option 1.3141084909SAT 18.0583 18.131
cpHydra k_101084915SAT 21.2208 21.4434
Concrete + CPS4J 2008-05-301084896SAT 52.39 52.4781
Abscon 112v4 ESAC1084914SAT 104.925 105.437
Abscon 112v4 AC1084913SAT 105.104 105.651
spider 2008-06-141084898SAT 108.204 109.273
Minion/Tailor 2008-07-041106961SAT 110.108 111.182
cpHydra k_401084916SAT 112.771 114.242
Concrete + CSP4J - Tabu Engine 2008-05-301084894SAT 311.564 313.14
Concrete + CSP4J - WMC Engine 2008-05-301084895SAT 1151.77 1162.84
SAT4J CSP 2008-06-131084901? 108.509 106.923
bpsolver 2008-06-271084904? (problem) 119.944 121.377
Sugar v1.13+picosat1084902? (MO) 12.776 13.2062
Sugar v1.13+minisat1084903? (MO) 12.84 13.016
casper zao1084911? (TO) 1800.03 1812.03
casper zito1084912? (TO) 1800.05 1806.63
galac M1084907? (TO) 1800.08 1816.62
galac E1084908? (TO) 1800.1 1814.11
choco2_impwdeg 2008-06-261084905? (TO) 1800.11 1800.88
choco2_dwdeg 2008-06-261084906? (TO) 1800.19 1801

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