MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford3/
normalized-langford-3-2.xml
MD5SUM600c60a30e90c9d9a9bdf8a5d50ba77d
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 benchmark0.731888
Satisfiable
(Un)Satisfiability was proved
Number of variables6
Number of constraints19
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension0
Number of constraints which are defined in intension19
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+minisat1112382OPTIMUM2 0.731888 0.844836
Sugar++ v1.13+minisat-inc1112381OPTIMUM2 0.755884 0.909676
AbsconMax 112 pc-w1112379OPTIMUM2 30.7653 31.2752
AbsconMax 112 pc-d1112380OPTIMUM2 30.8863 31.2834
Concrete + CSP4J - Tabu Engine 2008-05-301112378MSAT (TO)2 3600.02 3611.82
Concrete + CSP4J - MCRW Engine 2008-05-301112377MSAT (TO)2 3600.06 3617.52

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