MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-30/
normalized-kbtree-9-2-3-5-30-34_ext.xml
MD5SUMbc1916287cd47c80d934bd9c6d78d5af
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints6
Best CPU time to get the best result obtained on this benchmark0.821874
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-271128517OPTIMUM6 0.369943 0.38052
toulbar2 2008-06-271128518OPTIMUM6 0.821874 0.831521
Sugar++ v1.13+minisat-inc1128515OPTIMUM6 40.0879 40.7126
Sugar v1.13+minisat1128516OPTIMUM6 56.9933 56.6958
AbsconMax 112 pc-w1128513MSAT (TO)6 1583.04 4000.05
AbsconMax 112 pc-d1128514MSAT (TO)6 1592.98 4000.05
Concrete + CSP4J - MCRW Engine 2008-05-301128511MSAT (TO)6 3600.05 3601.12
Concrete + CSP4J - Tabu Engine 2008-05-301128512MSAT (TO)6 3600.07 3629.12

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