MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-2-3-5/kbtree-9-2-3-5-20/
normalized-kbtree-9-2-3-5-20-01_ext.xml
MD5SUM8b1f1fbd794efbd471e9e376488ba93f
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.065989
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-271128470OPTIMUM0 0.065989 0.0650261
toulbar2/BTD 2008-06-271128469OPTIMUM0 0.101983 0.105045
Concrete + CSP4J - Tabu Engine 2008-05-301128464OPTIMUM0 0.562914 0.578716
Concrete + CSP4J - MCRW Engine 2008-05-301128463OPTIMUM0 0.565913 0.641566
Sugar++ v1.13+minisat-inc1128467OPTIMUM0 2.84157 3.37233
AbsconMax 112 pc-d1128466OPTIMUM0 3.15352 3.17743
AbsconMax 112 pc-w1128465OPTIMUM0 3.21651 3.3361
Sugar v1.13+minisat1128468OPTIMUM0 3.67844 3.91353

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