CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-2_ext.xml
MD5SUMdaaccdaea9f79723e1ba03f679f57036
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.574
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-091084782SAT 6.574 6.64515
Mistral-option 1.3141084794SAT 7.8758 7.9648
MDG-probe 2008-06-271084784SAT 9.17261 9.27868
Mistral-prime 1.3131084795SAT 10.2614 10.3527
MDG-noprobe 2008-06-271084785SAT 10.3164 10.3822
cpHydra k_101084800SAT 20.7198 21.0066
spider 2008-06-141084783SAT 22.4666 22.5102
Abscon 112v4 ESAC1084799SAT 23.2395 23.4244
Abscon 112v4 AC1084798SAT 28.1407 28.4234
cpHydra k_401084801SAT 35.4946 35.9742
Concrete + CSP4J - Tabu Engine 2008-05-301084779SAT 41.2227 41.5135
Concrete + CPS4J 2008-05-301084781SAT 41.2967 41.6781
Minion/Tailor 2008-07-041106964SAT 96.4473 97.272
choco2_dwdeg 2008-06-261084791SAT 1502.07 1502.74
SAT4J CSP 2008-06-131084786? 100.393 98.7678
bpsolver 2008-06-271084789? (problem) 112.546 113.067
Sugar v1.13+minisat1084788? (MO) 12.75 13.0495
Sugar v1.13+picosat1084787? (MO) 13.76 14.0678
galac E1084793? (TO) 1800.01 1821.81
Concrete + CSP4J - WMC Engine 2008-05-301084780? (TO) 1800.03 1807.32
casper zito1084797? (TO) 1800.05 1800.83
galac M1084792? (TO) 1800.09 1803.21
casper zao1084796? (TO) 1800.1 1802.73
choco2_impwdeg 2008-06-261084790? (TO) 1800.2 1801.41

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