MAX-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 benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark26.6979
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 NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar v1.13+minisat1113862OPTIMUM2 26.6979 27.4957
Sugar++ v1.13+minisat-inc1113861OPTIMUM2 44.6482 48.9686
Concrete + CSP4J - Tabu Engine 2008-05-301113858MSAT (TO)2 3600.01 3611.62
Concrete + CSP4J - MCRW Engine 2008-05-301113857MSAT (TO)2 3600.06 3614.22
AbsconMax 112 pc-d1113860MSAT (TO)3 1611.48 4000.05
AbsconMax 112 pc-w1113859MSAT (TO)3 1632.85 4000.07

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: 2
Solution found:
0 26 7 8 10 6 1 3 4 2 29 11 13 16 13 9 12 14 31 32 15 18 22 20 17 21 24 33 35 19 23 28 27 25 30 34