CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-11_ext.xml
MD5SUM9a1e5061af5a11aec5f3135ecda7e6f0
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 benchmark11.8762
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
MDG-probe 2008-06-271084945SAT 4.5903 4.62718
MDG-noprobe 2008-06-271084946SAT 11.8762 12.1134
Mistral-prime 1.3131084956SAT 11.9582 12.0636
cpHydra k_101084961SAT 22.1096 22.4334
Concrete + CPS4J 2008-05-301084942SAT 23.4264 23.5749
mddc-solv 2008-06-091084943SAT 24.8772 24.909
Mistral-option 1.3141084955SAT 38.3762 38.3906
Minion/Tailor 2008-07-041106958SAT 56.7624 57.1425
Concrete + CSP4J - Tabu Engine 2008-05-301084940SAT 214.91 215.057
cpHydra k_401084962SAT 313.453 314.147
spider 2008-06-141084944SAT 411.363 413.676
Abscon 112v4 ESAC1084960SAT 423.776 427.665
Abscon 112v4 AC1084959SAT 548.54 550.526
SAT4J CSP 2008-06-131084947? 111.585 109.423
bpsolver 2008-06-271084950? (problem) 122.757 123.799
Sugar v1.13+picosat1084948? (MO) 12.71 12.8515
Sugar v1.13+minisat1084949? (MO) 13.9029 14.5883
galac E1084954? (TO) 1800.03 1807.41
Concrete + CSP4J - WMC Engine 2008-05-301084941? (TO) 1800.04 1806.32
casper zao1084957? (TO) 1800.05 1816.62
galac M1084953? (TO) 1800.06 1800.91
casper zito1084958? (TO) 1800.11 1810.63
choco2_dwdeg 2008-06-261084952? (TO) 1800.12 1802.21
choco2_impwdeg 2008-06-261084951? (TO) 1800.14 1818.57

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