MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford3/
normalized-langford-3-3.xml
MD5SUM299fb69885835c5763c3aa3db583ccc7
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.00785
Satisfiable
(Un)Satisfiability was proved
Number of variables9
Number of constraints42
Maximum constraint arity2
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension42
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+minisat1112370OPTIMUM2 1.00785 1.17565
Sugar++ v1.13+minisat-inc1112369OPTIMUM2 1.03084 1.53116
AbsconMax 112 pc-w1112367OPTIMUM2 31.5752 33.467
AbsconMax 112 pc-d1112368OPTIMUM2 32.0551 34.4408
Concrete + CSP4J - Tabu Engine 2008-05-301112366MSAT (TO)2 3600.03 3623.42
Concrete + CSP4J - MCRW Engine 2008-05-301112365MSAT (TO)2 3600.05 3622.62

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:
7 2 0 1 5 4 3 8 8