CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-3-20-20/
normalized-rand-3-20-20-60-632-20_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20/
normalized-rand-3-20-20-60-632-20_ext.xml
MD5SUMf08f8e3d2ee23ffe705a406a6e4398a4
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 benchmark0.478926
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints56
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension56
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-091080271SAT 0.478926 0.482388
Mistral-prime 1.3131080284SAT 2.06069 2.0821
spider 2008-06-141080272SAT 4.20236 4.24486
MDG-noprobe 2008-06-271080274SAT 5.20121 5.25245
Mistral-option 1.3141080283SAT 5.2782 5.32859
MDG-probe 2008-06-271080273SAT 5.34319 5.34689
Sugar v1.13+picosat1080276SAT 5.9061 6.06951
cpHydra k_401080290SAT 9.68153 9.90044
cpHydra k_101080289SAT 9.75052 9.91458
Concrete + CPS4J 2008-05-301080270SAT 11.3113 11.4282
casper zito1080286SAT 18.5592 18.7413
Minion/Tailor 2008-07-041106829SAT 38.4662 38.8618
Concrete + CSP4J - Tabu Engine 2008-05-301080268SAT 49.2015 49.664
choco2_dwdeg 2008-06-261080280SAT 82.8214 83.2642
Sugar v1.13+minisat1080277SAT 105.547 106.128
choco2_impwdeg 2008-06-261080279SAT 123.019 124.115
SAT4J CSP 2008-06-131080275SAT 124.163 124.433
bpsolver 2008-06-271080278SAT 259.939 262.187
Abscon 112v4 ESAC1080288SAT 324.064 327.177
Abscon 112v4 AC1080287SAT 363.31 366.822
casper zao1080285SAT 660.01 666.293
Concrete + CSP4J - WMC Engine 2008-05-301080269? (TO) 1800 1808.92
galac E1080282? (TO) 1800.01 1809.52
galac M1080281? (TO) 1800.02 1810.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 11 1 17 4 19 14 17 10 15 8 10 8 10 0 0 18 4 10 1