MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford2/
normalized-langford-2-2.xml
MD5SUMdc6049fcc06a5563f81f5e357c779161
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 benchmark0.704892
Satisfiable
(Un)Satisfiability was proved
Number of variables4
Number of constraints8
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension8
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+minisat1112698OPTIMUM1 0.704892 0.772072
Sugar++ v1.13+minisat-inc1112697OPTIMUM1 0.712891 0.816677
AbsconMax 112 pc-d1112696OPTIMUM1 30.6743 30.8632
AbsconMax 112 pc-w1112695OPTIMUM1 30.7483 31.0869
Concrete + CSP4J - Tabu Engine 2008-05-301112694MSAT (TO)1 3600.02 3621.52
Concrete + CSP4J - MCRW Engine 2008-05-301112693MSAT (TO)1 3600.06 3617.22

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:
1 0 3 3