MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-70/
normalized-kbtree-9-2-3-5-70-50_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-70/
normalized-kbtree-9-2-3-5-70-50_ext.xml
MD5SUMf8a45b0a3a3f7375b1f3eb86d6d666a8
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints112
Best CPU time to get the best result obtained on this benchmark3600
Satisfiable
(Un)Satisfiability was proved
Number of variables58
Number of constraints309
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension309
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/BTD 2008-06-271128325OPTIMUM112 3.62445 3.66395
Concrete + CSP4J - Tabu Engine 2008-05-301128320MSAT (TO)112 3600 3601.43
Concrete + CSP4J - MCRW Engine 2008-05-301128319MSAT (TO)112 3600.09 3615.92
AbsconMax 112 pc-w1128321MSAT (TO)113 1589.18 4000.05
AbsconMax 112 pc-d1128322MSAT (TO)113 1597.33 4000.07
Sugar++ v1.13+minisat-inc1128323MSAT (TO)137 3600.14 3625.92
Sugar v1.13+minisat1128324MSAT (TO)148 3600.03 3632.82
toulbar2 2008-06-271128326? (TO) 3600.11 3625.11

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: 112
Solution found:
1 4 4 2 0 4 3 0 1 4 2 0 4 4 0 1 3 3 3 3 0 2 1 1 4 3 4 1 4 4 1 4 2 2 1 0 0 3 2 1 3 0 1 3 1 4 4 3 2 3 2 2 2 3 1 0 1 1