MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/langford3/
normalized-langford-3-6.xml

Jump to solvers results

General information on the benchmark

Namecsp/langford3/
normalized-langford-3-6.xml
MD5SUMf380abbe6eb872dcedead7538a516eac
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 benchmark2.17367
Satisfiable
(Un)Satisfiability was proved
Number of variables18
Number of constraints165
Maximum constraint arity2
Maximum domain size18
Number of constraints which are defined in extension0
Number of constraints which are defined in intension165
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+minisat1112406OPTIMUM2 2.17367 2.43282
Sugar++ v1.13+minisat-inc1112405OPTIMUM2 2.18467 2.44055
AbsconMax 112 pc-w1112403OPTIMUM2 1018.56 2528.48
AbsconMax 112 pc-d1112404MSAT (TO)2 1586.43 4000.05
Concrete + CSP4J - MCRW Engine 2008-05-301112401MSAT (TO)2 3600.06 3601.32
Concrete + CSP4J - Tabu Engine 2008-05-301112402MSAT (TO)2 3600.07 3633.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: 2
Solution found:
10 1 6 3 5 2 12 4 15 8 11 9 14 7 0 13 17 16