MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford2/
normalized-langford-2-10.xml
MD5SUMd438b1553ec5710c6f35b3a8e61b7288
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 benchmark17.7713
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints200
Maximum constraint arity2
Maximum domain size20
Number of constraints which are defined in extension0
Number of constraints which are defined in intension200
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+minisat1112692OPTIMUM1 17.7713 18.0756
Sugar++ v1.13+minisat-inc1112691OPTIMUM1 51.0212 52.0345
AbsconMax 112 pc-w1112689OPTIMUM1 856.616 2076.18
AbsconMax 112 pc-d1112690MSAT (TO)1 1619.66 4000.06
Concrete + CSP4J - MCRW Engine 2008-05-301112687MSAT (TO)1 3600.04 3615.12
Concrete + CSP4J - Tabu Engine 2008-05-301112688MSAT (TO)1 3600.07 3618.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:
16 11 13 0 1 3 4 6 9 8 18 14 17 5 7 10 12 15 19 19