MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford3/
normalized-langford-3-5.xml
MD5SUM43c8eda3f5b2d1223300980939f8a7f5
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 benchmark1.75673
Satisfiable
(Un)Satisfiability was proved
Number of variables15
Number of constraints115
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension0
Number of constraints which are defined in intension115
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+minisat1112388OPTIMUM2 1.75673 1.99077
Sugar++ v1.13+minisat-inc1112387OPTIMUM2 1.9367 2.20513
AbsconMax 112 pc-w1112385OPTIMUM2 108.021 223.439
AbsconMax 112 pc-d1112386OPTIMUM2 1177.92 3019.35
Concrete + CSP4J - MCRW Engine 2008-05-301112383MSAT (TO)2 3600 3602.82
Concrete + CSP4J - Tabu Engine 2008-05-301112384MSAT (TO)2 3600.1 3603.32

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:
1 8 10 2 0 3 11 9 7 6 5 14 13 12 12