CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-7_ext.xml
MD5SUM34879420b3bf5ffa2588efa919042c15
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.51047
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.3141054375SAT 3.51047 3.51744
MDG-noprobe 2008-06-271054366SAT 3.9664 4.0527
cpHydra k_401054382SAT 4.05638 4.09989
MDG-probe 2008-06-271054365SAT 4.06138 4.10428
Mistral-prime 1.3131054376SAT 4.42833 4.48003
cpHydra k_101054381SAT 4.44332 4.49382
mddc-solv 2008-06-091054363SAT 5.84211 5.88048
Concrete + CPS4J 2008-05-301054362SAT 16.9184 17.0652
Concrete + CSP4J - Tabu Engine 2008-05-301054360SAT 22.0956 22.3843
spider 2008-06-141054364SAT 28.3417 28.6263
Minion/Tailor 2008-07-041104917SAT 50.9283 51.4954
Abscon 112v4 AC1054379SAT 56.0415 56.5693
Abscon 112v4 ESAC1054380SAT 120.582 124.894
choco2_dwdeg 2008-06-261054372SAT 679.513 683.156
casper zito1054378SAT 1025.76 1030.4
galac M1054373SAT 1039.06 1043.61
casper zao1054377SAT 1218.38 1219.94
SAT4J CSP 2008-06-131054367? 110.985 109.78
bpsolver 2008-06-271054370? (problem) 121.934 123.047
Sugar v1.13+picosat1054368? (MO) 12.67 12.9528
Sugar v1.13+minisat1054369? (MO) 13.8738 14.7592
galac E1054374? (TO) 1800.06 1810.62
Concrete + CSP4J - WMC Engine 2008-05-301054361? (TO) 1800.08 1803.42
choco2_impwdeg 2008-06-261054371? (TO) 1800.14 1807.79

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