MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-7-3-5/kbtree-9-7-3-5-10/
normalized-kbtree-9-7-3-5-10-04_ext.xml
MD5SUMa8747d8a3675d0674df71d0f8d64c44c
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.016996
Satisfiable
(Un)Satisfiability was proved
Number of variables28
Number of constraints189
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension189
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-271128118OPTIMUM0 0.016996 0.0203461
toulbar2/BTD 2008-06-271128117OPTIMUM0 0.063989 0.0783549
Concrete + CSP4J - MCRW Engine 2008-05-301128111OPTIMUM0 0.411936 0.434625
Concrete + CSP4J - Tabu Engine 2008-05-301128112OPTIMUM0 0.428934 0.483941
Sugar++ v1.13+minisat-inc1128115OPTIMUM0 2.09568 2.32657
Sugar v1.13+minisat1128116OPTIMUM0 2.48862 2.7188
AbsconMax 112 pc-d1128114OPTIMUM0 2.6126 2.56114
AbsconMax 112 pc-w1128113OPTIMUM0 2.6266 2.66087

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