MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/kbtree/kbtree-5-2-4-5/kbtree-5-2-4-5-20/
normalized-kbtree-5-2-4-5-20-50_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-5-2-4-5/kbtree-5-2-4-5-20/
normalized-kbtree-5-2-4-5-20-50_ext.xml
MD5SUM17f1f1de9277659d55300d862b5a7d8e
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.023995
Satisfiable
(Un)Satisfiability was proved
Number of variables62
Number of constraints211
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension211
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-271128070OPTIMUM0 0.023995 0.0292461
toulbar2/BTD 2008-06-271128069OPTIMUM0 0.075988 0.082017
Concrete + CSP4J - Tabu Engine 2008-05-301128064OPTIMUM0 0.532918 0.524456
Concrete + CSP4J - MCRW Engine 2008-05-301128063OPTIMUM0 0.536918 0.475762
Sugar++ v1.13+minisat-inc1128067OPTIMUM0 2.27065 2.46465
Sugar v1.13+minisat1128068OPTIMUM0 2.6446 2.69925
AbsconMax 112 pc-w1128065OPTIMUM0 2.91256 2.91364
AbsconMax 112 pc-d1128066OPTIMUM0 3.18451 3.23426

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