MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-50/
normalized-kbtree-9-2-3-5-50-05_ext.xml
MD5SUMa3868b6ec1bb01fea4fa7d9cb9f3b3e3
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints48
Best CPU time to get the best result obtained on this benchmark815.95
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-271128365OPTIMUM48 1.25981 1.26322
toulbar2 2008-06-271128366OPTIMUM48 815.95 816.265
Concrete + CSP4J - MCRW Engine 2008-05-301128359MSAT (TO)48 3600.01 3623.22
Concrete + CSP4J - Tabu Engine 2008-05-301128360MSAT (TO)48 3600.04 3601.62
AbsconMax 112 pc-d1128362MSAT (TO)49 1599.18 4000.08
AbsconMax 112 pc-w1128361MSAT (TO)49 1601.74 4000.07
Sugar v1.13+minisat1128364MSAT (TO)98 3600.06 3603.62
Sugar++ v1.13+minisat-inc1128363MSAT (TO)106 3600.09 3629.43

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