CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/langford4/
normalized-langford-4-9.xml

Jump to solvers results

General information on the benchmark

Namecsp/langford4/
normalized-langford-4-9.xml
MD5SUM86dddb0f65e85dccb4a223f08a17bdb9
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.047992
Satisfiable
(Un)Satisfiability was proved
Number of variables36
Number of constraints657
Maximum constraint arity2
Maximum domain size36
Number of constraints which are defined in extension0
Number of constraints which are defined in intension657
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271092895UNSAT 0.047992 0.051329
Mistral-prime 1.3131092905UNSAT 0.051991 0.054489
cpHydra k_401092911UNSAT 0.06099 0.0627929
cpHydra k_101092910UNSAT 0.06299 0.06985
MDG-probe 2008-06-271092894UNSAT 0.076987 0.0792641
Mistral-option 1.3141092904UNSAT 0.102983 0.102935
bpsolver 2008-06-271092899UNSAT 0.118981 0.125986
Minion/Tailor 2008-07-041105932UNSAT 0.727888 0.795659
casper zao1092906UNSAT 0.740886 0.742921
casper zito1092907UNSAT 0.801877 0.802759
Sugar v1.13+minisat1092898UNSAT 1.17282 1.22419
Sugar v1.13+picosat1092897UNSAT 1.27681 1.33038
Abscon 112v4 ESAC1092909UNSAT 1.2918 1.3593
Abscon 112v4 AC1092908UNSAT 1.35979 1.41824
choco2_dwdeg 2008-06-261092901UNSAT 1.38279 1.41868
Concrete + CPS4J 2008-05-301092893UNSAT 1.50977 1.56557
choco2_impwdeg 2008-06-261092900UNSAT 1.59476 1.62578
galac M1092902UNSAT 2.28065 2.34024
galac E1092903UNSAT 2.49962 2.6009
SAT4J CSP 2008-06-131092896UNSAT 6.96894 7.0453
Concrete + CSP4J - WMC Engine 2008-05-301092892? (TO) 1800.07 1812.82
Concrete + CSP4J - Tabu Engine 2008-05-301092891? (TO) 1800.09 1817.22

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: