MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/planning/
normalized-rovers02ac_ext.xml
MD5SUM1f4877141c50196b97bdc56681b5c4db
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.502922
Satisfiable
(Un)Satisfiability was proved
Number of variables153
Number of constraints5183
Maximum constraint arity2
Maximum domain size24
Number of constraints which are defined in extension5183
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-271125486OPTIMUM3 0.502922 0.508454
toulbar2/BTD 2008-06-271125485OPTIMUM3 0.989849 1.00233
AbsconMax 112 pc-d1125482OPTIMUM3 540.454 1279.86
AbsconMax 112 pc-w1125481MSAT (TO)3 1584.17 4000.05
Concrete + CSP4J - Tabu Engine 2008-05-301125480MSAT (TO)3 3600.01 3617.42
Concrete + CSP4J - MCRW Engine 2008-05-301125479MSAT (TO)3 3600.03 3604.02
Sugar v1.13+minisat1125484? (MO) 79.31 84.351
Sugar++ v1.13+minisat-inc1125483? (MO) 81.2136 83.8212

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