MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/planning/
normalized-mprime03cc_ext.xml
MD5SUM174d085fa072f4f8473b8b5725c5eae8
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 variables50
Number of constraints526
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension526
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-271125974OPTIMUM3 0.024995 0.031593
toulbar2/BTD 2008-06-271125973OPTIMUM3 0.06499 0.072012
Sugar++ v1.13+minisat-inc1125971OPTIMUM3 3.66144 3.73764
Sugar v1.13+minisat1125972OPTIMUM3 6.52501 7.65902
AbsconMax 112 pc-d1125970OPTIMUM3 31.0933 31.2314
AbsconMax 112 pc-w1125969OPTIMUM3 422.856 1011.77
Concrete + CSP4J - Tabu Engine 2008-05-301125968MSAT (TO)3 3600 3616.72
Concrete + CSP4J - MCRW Engine 2008-05-301125967MSAT (TO)3 3600.11 3601.92

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