MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford4/
normalized-langford-4-2.xml
MD5SUMde5bb072e217b209b719935f87b51d28
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.969852
Satisfiable
(Un)Satisfiability was proved
Number of variables8
Number of constraints34
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension0
Number of constraints which are defined in intension34
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+minisat-inc1113867OPTIMUM2 0.969852 1.17791
Sugar v1.13+minisat1113868OPTIMUM2 0.972851 1.21118
AbsconMax 112 pc-d1113866OPTIMUM2 31.1013 31.8996
AbsconMax 112 pc-w1113865OPTIMUM2 31.2053 32.2698
Concrete + CSP4J - MCRW Engine 2008-05-301113863MSAT (TO)2 3600.04 3603.92
Concrete + CSP4J - Tabu Engine 2008-05-301113864MSAT (TO)2 3600.06 3629.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:
2 0 4 3 5 6 7 1