CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20/
normalized-rand-3-20-20-60-632-7_ext.xml
MD5SUM07d3ae142484721fc64ab76ec299d0ab
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 benchmark1.82972
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints57
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension57
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-091080041SAT 1.82972 1.83535
MDG-noprobe 2008-06-271080044SAT 14.2408 14.3753
Mistral-prime 1.3131080054SAT 14.6038 14.7434
Mistral-option 1.3141080053SAT 14.6988 14.8234
cpHydra k_101080059SAT 22.0686 22.3738
cpHydra k_401080060SAT 22.0746 22.4216
MDG-probe 2008-06-271080043SAT 25.4821 25.5906
Concrete + CPS4J 2008-05-301080040SAT 30.0194 30.219
Sugar v1.13+minisat1080047SAT 47.3198 47.8773
spider 2008-06-141080042SAT 68.1296 68.7258
Concrete + CSP4J - Tabu Engine 2008-05-301080038SAT 105.573 106.63
Sugar v1.13+picosat1080046SAT 123.466 124.184
Minion/Tailor 2008-07-041106847SAT 131.388 131.592
choco2_dwdeg 2008-06-261080050SAT 249.967 251.847
choco2_impwdeg 2008-06-261080049SAT 276.603 276.763
Abscon 112v4 ESAC1080058SAT 495.171 497.434
Abscon 112v4 AC1080057SAT 497.083 501.84
SAT4J CSP 2008-06-131080045SAT 851.241 857.407
bpsolver 2008-06-271080048SAT 1240.29 1241.81
casper zito1080056SAT 1352.75 1365.01
galac M1080051SAT 1582.62 1595.28
casper zao1080055? (TO) 1800.01 1806.61
galac E1080052? (TO) 1800.07 1809.32
Concrete + CSP4J - WMC Engine 2008-05-301080039? (TO) 1800.1 1804.03

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:
19 12 4 19 15 18 14 5 0 12 15 4 19 6 8 0 18 3 4 4