CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-10-20-10/
normalized-rand-10-20-10-5-10000-9_ext.xml
MD5SUMfa3fd3e463227823f5510a53e7f059f4
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 benchmark1.06484
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-091048176UNSAT 1.06484 1.07909
Abscon 112v4 AC1048192UNSAT 1.43778 1.46648
Abscon 112v4 ESAC1048193UNSAT 1.45278 1.49936
Mistral-prime 1.3131048189UNSAT 2.43763 2.46085
Concrete + CPS4J 2008-05-301048175UNSAT 2.6156 2.6889
Mistral-option 1.3141048188UNSAT 2.89556 2.92604
MDG-noprobe 2008-06-271048179UNSAT 2.96255 2.97782
choco2_dwdeg 2008-06-261048185UNSAT 6.27604 6.36042
Minion/Tailor 2008-07-041104893UNSAT 7.39288 7.52544
cpHydra k_401048195UNSAT 9.27159 9.53319
cpHydra k_101048194UNSAT 9.97248 10.153
MDG-probe 2008-06-271048178UNSAT 11.1983 11.2915
choco2_impwdeg 2008-06-261048184UNSAT 26.456 26.5018
casper zito1048191UNSAT 91.802 92.5376
casper zao1048190UNSAT 101.754 102.738
galac E1048187UNSAT 194.989 196.854
bpsolver 2008-06-271048183UNSAT 258.533 259.853
galac M1048186UNSAT 305.505 307.05
Sugar v1.13+minisat1048182UNSAT 1688.06 1694.05
spider 2008-06-141048177UNSAT 1736.23 1747
SAT4J CSP 2008-06-131048180? 33.7389 32.5764
Concrete + CSP4J - WMC Engine 2008-05-301048174? (TO) 1800.01 1812.62
Concrete + CSP4J - Tabu Engine 2008-05-301048173? (TO) 1800.05 1814.72
Sugar v1.13+picosat1048181? (TO) 1800.09 1823.54

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: