CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-80/
normalized-composed-25-1-80-9_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-80/
normalized-composed-25-1-80-9_ext.xml
MD5SUMd449d6d8de81070e764342e14165e89c
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.023995
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints302
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension302
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
Mistral-option 1.3141097904UNSAT 0.023995 0.030591
Mistral-prime 1.3131097905UNSAT 0.025995 0.0311399
MDG-noprobe 2008-06-271097895UNSAT 0.028995 0.02912
cpHydra k_401097911UNSAT 0.036994 0.04311
cpHydra k_101097910UNSAT 0.037993 0.042493
casper zito1097907UNSAT 0.039992 0.0466381
spider 2008-06-141097893UNSAT 0.045992 0.052148
casper zao1097906UNSAT 0.061989 0.0687769
MDG-probe 2008-06-271097894UNSAT 0.06399 0.0699469
bpsolver 2008-06-271097899UNSAT 0.18897 0.199272
Minion/Tailor 2008-07-041105419UNSAT 0.499923 0.512954
Concrete + CPS4J 2008-05-301097892UNSAT 0.570912 0.605694
choco2_dwdeg 2008-06-261097901UNSAT 0.631903 0.679696
choco2_impwdeg 2008-06-261097900UNSAT 0.700893 0.737626
Abscon 112v4 AC1097908UNSAT 0.809876 0.841191
Abscon 112v4 ESAC1097909UNSAT 0.851869 0.896674
Sugar v1.13+minisat1097898UNSAT 0.950854 1.04891
galac M1097902UNSAT 1.01584 1.05054
Sugar v1.13+picosat1097897UNSAT 1.05984 1.20495
galac E1097903UNSAT 1.17082 1.21923
SAT4J CSP 2008-06-131097896UNSAT 1.73773 1.7527
Concrete + CSP4J - WMC Engine 2008-05-301097891? (TO) 1800.01 1803.82
Concrete + CSP4J - Tabu Engine 2008-05-301097890? (TO) 1800.04 1808.92

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: