MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/kbtree/kbtree-9-5-3-5/kbtree-9-5-3-5-30/
normalized-kbtree-9-5-3-5-30-37_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-5-3-5/kbtree-9-5-3-5-30/
normalized-kbtree-9-5-3-5-30-37_ext.xml
MD5SUM8f8b0a7c5493e73941d99d8d9614db70
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints9
Best CPU time to get the best result obtained on this benchmark1.26781
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints255
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension255
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
toulbar2 2008-06-271128662OPTIMUM9 1.26781 1.28297
toulbar2/BTD 2008-06-271128661OPTIMUM9 1.37079 1.40301
Sugar++ v1.13+minisat-inc1128659OPTIMUM9 276.303 278.866
Sugar v1.13+minisat1128660OPTIMUM9 1071.96 1076.53
AbsconMax 112 pc-w1128657MSAT (TO)9 1573.88 4000.05
AbsconMax 112 pc-d1128658MSAT (TO)9 1622.25 4000.04
Concrete + CSP4J - MCRW Engine 2008-05-301128655MSAT (TO)9 3600.05 3621.32
Concrete + CSP4J - Tabu Engine 2008-05-301128656MSAT (TO)9 3600.09 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: 9
Solution found:
2 3 2 0 0 0 0 2 1 1 4 4 4 2 3 0 3 0 2 3 1 0 3 4 3 3 0 1 2 0 2 1 3 3 0 2 2 1 3 3