CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-10-20-10/
normalized-rand-10-20-10-5-10000-13_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-10-20-10/
normalized-rand-10-20-10-5-10000-13_ext.xml
MD5SUM0a43ed623093b7647c443dc16926075e
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.741886
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints5
Maximum constraint arity10
Maximum domain size10
Number of constraints which are defined in extension5
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-091048521UNSAT 0.741886 0.749538
Abscon 112v4 ESAC1048538UNSAT 2.09668 2.18916
Abscon 112v4 AC1048537UNSAT 2.33964 2.42783
Concrete + CPS4J 2008-05-301048520UNSAT 2.40463 2.42343
MDG-noprobe 2008-06-271048524UNSAT 2.70759 2.72502
Mistral-prime 1.3131048534UNSAT 2.80457 2.83746
Mistral-option 1.3141048533UNSAT 2.89156 2.92189
Minion/Tailor 2008-07-041104908UNSAT 4.24935 4.35409
choco2_dwdeg 2008-06-261048530UNSAT 6.24105 6.30865
cpHydra k_401048540UNSAT 9.14261 9.4324
cpHydra k_101048539UNSAT 10.4774 10.7021
MDG-probe 2008-06-271048523UNSAT 11.4493 11.5599
choco2_impwdeg 2008-06-261048529UNSAT 19.0291 19.2301
casper zito1048536UNSAT 79.7259 79.7626
casper zao1048535UNSAT 96.8243 97.7358
bpsolver 2008-06-271048528UNSAT 98.91 99.6875
spider 2008-06-141048522UNSAT 148.915 148.944
galac E1048532UNSAT 330.711 336.283
galac M1048531UNSAT 532.987 535.231
Sugar v1.13+minisat1048527UNSAT 1062.68 1066.88
Sugar v1.13+picosat1048526UNSAT 1653.33 1663.38
SAT4J CSP 2008-06-131048525? 31.8362 31.1391
Concrete + CSP4J - WMC Engine 2008-05-301048519? (TO) 1800.09 1812.52
Concrete + CSP4J - Tabu Engine 2008-05-301048518? (TO) 1800.1 1801.52

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: