MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-5-3-5/kbtree-9-5-3-5-10/
normalized-kbtree-9-5-3-5-10-36_ext.xml
MD5SUM3e74c5bf8aa2b02fe5042afa45b6c851
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.019996
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints255
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension255
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-271128614OPTIMUM0 0.019996 0.026946
toulbar2/BTD 2008-06-271128613OPTIMUM0 0.080986 0.0889689
Concrete + CSP4J - Tabu Engine 2008-05-301128608OPTIMUM0 0.476926 0.916774
Concrete + CSP4J - MCRW Engine 2008-05-301128607OPTIMUM0 0.501923 0.578229
Sugar++ v1.13+minisat-inc1128611OPTIMUM0 1.62975 1.70946
Sugar v1.13+minisat1128612OPTIMUM0 1.64875 2.13826
AbsconMax 112 pc-d1128610OPTIMUM0 3.12652 3.24846
AbsconMax 112 pc-w1128609OPTIMUM0 3.16152 3.24235

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