MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-10/
normalized-kbtree-9-2-3-5-10-26_ext.xml
MD5SUMbe0a9facc56717bd692d63621a88cc3d
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints0
Best CPU time to get the best result obtained on this benchmark0.021996
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 2008-06-271128502OPTIMUM0 0.021996 0.0222271
toulbar2/BTD 2008-06-271128501OPTIMUM0 0.089985 0.09163
Concrete + CSP4J - Tabu Engine 2008-05-301128496OPTIMUM0 0.500923 0.533534
Concrete + CSP4J - MCRW Engine 2008-05-301128495OPTIMUM0 0.504922 0.532089
Sugar++ v1.13+minisat-inc1128499OPTIMUM0 2.80757 3.41451
Sugar v1.13+minisat1128500OPTIMUM0 3.59945 3.80972
AbsconMax 112 pc-w1128497OPTIMUM0 3.80942 3.8619
AbsconMax 112 pc-d1128498OPTIMUM0 3.81542 3.86556

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