MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/kbtree/kbtree-9-7-3-5/kbtree-9-7-3-5-30/
normalized-kbtree-9-7-3-5-30-27_ext.xml
MD5SUM4e2d231d0a48f3bec709a946cdfceb21
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints5
Best CPU time to get the best result obtained on this benchmark0.105983
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-271128318OPTIMUM5 0.105983 0.114341
toulbar2/BTD 2008-06-271128317OPTIMUM5 0.142977 0.153085
Sugar v1.13+minisat1128316OPTIMUM5 17.9803 18.2275
Sugar++ v1.13+minisat-inc1128315OPTIMUM5 26.8979 27.6497
AbsconMax 112 pc-d1128314OPTIMUM5 87.2167 172.966
AbsconMax 112 pc-w1128313OPTIMUM5 319.098 760.965
Concrete + CSP4J - MCRW Engine 2008-05-301128311MSAT (TO)5 3600.03 3628.12
Concrete + CSP4J - Tabu Engine 2008-05-301128312MSAT (TO)5 3600.04 3605.83

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