CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/leighton/leighton-15/
normalized-lei450-15d-05.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/leighton/leighton-15/
normalized-lei450-15d-05.xml
MD5SUMd261f13932fb290bcd2c3a49b12d7e9e
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.671897
Satisfiable
(Un)Satisfiability was proved
Number of variables450
Number of constraints16750
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension16750
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271089654UNSAT 0.671897 0.681671
MDG-probe 2008-06-271089653UNSAT 0.685894 0.697263
Mistral-prime 1.3131089664UNSAT 0.685895 0.693178
cpHydra k_101089669UNSAT 0.687894 0.701055
Mistral-option 1.3141089663UNSAT 0.688894 0.696121
cpHydra k_401089670UNSAT 0.705891 0.717704
bpsolver 2008-06-271089658UNSAT 2.10768 2.11644
Minion/Tailor 2008-07-041105689UNSAT 3.19551 3.26932
Abscon 112v4 AC1089667UNSAT 3.99039 4.07712
Abscon 112v4 ESAC1089668UNSAT 4.23535 4.20679
Sugar v1.13+minisat1089657UNSAT 4.46432 4.60733
Sugar v1.13+picosat1089656UNSAT 5.9461 6.10804
choco2_impwdeg 2008-06-261089659UNSAT 6.54 6.62622
choco2_dwdeg 2008-06-261089660UNSAT 6.55 6.56989
galac M1089661UNSAT 6.77997 6.88155
galac E1089662UNSAT 7.66383 7.80069
SAT4J CSP 2008-06-131089655UNSAT 7.9088 8.04414
casper zao1089665UNSAT 39.8079 39.9963
casper zito1089666UNSAT 57.5193 57.8937
Concrete + CPS4J 2008-05-301089652UNSAT 105.925 106.982
Concrete + CSP4J - Tabu Engine 2008-05-301089650? (TO) 1800.01 1803.93
Concrete + CSP4J - WMC Engine 2008-05-301089651? (TO) 1800.05 1804.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: