CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford4/
normalized-langford-4-4.xml
MD5SUMb37d50180c85d43bb3d8c25e0f871b0d
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.009997
Satisfiable
(Un)Satisfiability was proved
Number of variables16
Number of constraints132
Maximum constraint arity2
Maximum domain size16
Number of constraints which are defined in extension0
Number of constraints which are defined in intension132
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
casper zito1092718UNSAT 0.009997 0.0182981
Mistral-option 1.3141092715UNSAT 0.009997 0.017304
MDG-noprobe 2008-06-271092706UNSAT 0.009998 0.016387
MDG-probe 2008-06-271092705UNSAT 0.010997 0.017029
Mistral-prime 1.3131092716UNSAT 0.011997 0.0166831
cpHydra k_401092722UNSAT 0.021995 0.028854
cpHydra k_101092721UNSAT 0.022995 0.028005
casper zao1092717UNSAT 0.026995 0.034915
bpsolver 2008-06-271092710UNSAT 0.039993 0.0469701
Minion/Tailor 2008-07-041105929UNSAT 0.437932 0.491342
Sugar v1.13+minisat1092709UNSAT 0.687895 0.7622
Sugar v1.13+picosat1092708UNSAT 0.693893 0.813532
Concrete + CSP4J - WMC Engine 2008-05-301092703UNSAT 0.705892 0.75483
choco2_impwdeg 2008-06-261092711UNSAT 0.730888 0.787898
Abscon 112v4 AC1092719UNSAT 0.752885 0.79372
Concrete + CPS4J 2008-05-301092704UNSAT 0.755884 0.806089
choco2_dwdeg 2008-06-261092712UNSAT 0.770882 0.795561
Abscon 112v4 ESAC1092720UNSAT 0.774881 0.838879
Concrete + CSP4J - Tabu Engine 2008-05-301092702UNSAT 0.832872 0.861022
galac M1092713UNSAT 1.00585 1.0687
galac E1092714UNSAT 1.56876 1.63864
SAT4J CSP 2008-06-131092707UNSAT 1.9677 2.01954

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: