MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/planning/
normalized-depot01cc_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/planning/
normalized-depot01cc_ext.xml
MD5SUM937a020913f3f006db8a04352d5b7781
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark0.024995
Satisfiable
(Un)Satisfiability was proved
Number of variables66
Number of constraints546
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension546
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-271125654OPTIMUM3 0.024995 0.0244979
toulbar2/BTD 2008-06-271125653OPTIMUM3 0.069988 0.075509
Sugar++ v1.13+minisat-inc1125651OPTIMUM3 3.73443 4.32162
Sugar v1.13+minisat1125652OPTIMUM3 7.27189 7.56703
AbsconMax 112 pc-d1125650OPTIMUM3 30.9293 31.4858
AbsconMax 112 pc-w1125649OPTIMUM3 30.9793 31.4856
Concrete + CSP4J - MCRW Engine 2008-05-301125647MSAT (TO)3 3600.03 3602.42
Concrete + CSP4J - Tabu Engine 2008-05-301125648MSAT (TO)3 3600.08 3603.42

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