MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford4/
normalized-langford-4-3.xml
MD5SUMaa253ebcb4b244774c05961391955ab9
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.22381
Satisfiable
(Un)Satisfiability was proved
Number of variables12
Number of constraints75
Maximum constraint arity2
Maximum domain size12
Number of constraints which are defined in extension0
Number of constraints which are defined in intension75
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-inc1113825OPTIMUM2 1.22381 1.59253
Sugar v1.13+minisat1113826OPTIMUM2 1.41778 1.66612
AbsconMax 112 pc-w1113823OPTIMUM2 32.995 36.8473
AbsconMax 112 pc-d1113824OPTIMUM2 47.8677 74.4926
Concrete + CSP4J - MCRW Engine 2008-05-301113821MSAT (TO)2 3600 3617.62
Concrete + CSP4J - Tabu Engine 2008-05-301113822MSAT (TO)2 3600.02 3605.42

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 2 6 3 5 10 7 8 0 9 11 4