MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/langford2/
normalized-langford-2-5.xml

Jump to solvers results

General information on the benchmark

Namecsp/langford2/
normalized-langford-2-5.xml
MD5SUM42a251b4e5e78e8baab98daca83f50dd
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark1.12183
Satisfiable
(Un)Satisfiability was proved
Number of variables10
Number of constraints50
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension0
Number of constraints which are defined in intension50
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1112703OPTIMUM1 1.12183 1.29995
Sugar v1.13+minisat1112704OPTIMUM1 1.24081 1.4568
AbsconMax 112 pc-d1112702OPTIMUM1 31.0393 31.7285
AbsconMax 112 pc-w1112701OPTIMUM1 31.2113 32.3712
Concrete + CSP4J - MCRW Engine 2008-05-301112699MSAT (TO)1 3600.02 3617.02
Concrete + CSP4J - Tabu Engine 2008-05-301112700MSAT (TO)1 3600.08 3634.42

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 1
Solution found:
7 3 1 4 2 9 6 5 9 8