MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/planning/
rovers02ac_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/planning/
rovers02ac_ext.xml
MD5SUMb5f2943b448e76146b4533d5d650253e
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints5298
Best CPU time to get the best result obtained on this benchmark23.3734
Satisfiable
(Un)Satisfiability was proved
Number of variables153
Number of constraints5301
Maximum constraint arity2
Maximum domain size24
Number of constraints which are defined in extension5301
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Toulbar2 2007-01-12280722OPTIMUM 23.3734 23.5963
toolbar 2007-01-12280725OPTIMUM 25.7241 25.8405
Toolbar_BTD 2007-01-12280724OPTIMUM 26.142 26.156
AbsconMax 109 EPFC280720OPTIMUM 319.919 320.116
aolibpvo 2007-01-17280717OPTIMUM 353.421 356.497
AbsconMax 109 PFC280721OPTIMUM 372.296 372.735
aolibdvo 2007-01-17280718OPTIMUM 896.85 900.283
Toolbar_MaxSat 2007-01-19280723OPTIMUM 2226.2 2240.05
CSP4J - MaxCSP 2006-12-19280719? 0.401938 0.4619