MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/planning/
logistics01ac_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/planning/
logistics01ac_ext.xml
MD5SUM2e7db55e56022e76df4f25c857bbb01f
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints2610
Best CPU time to get the best result obtained on this benchmark5.62514
Satisfiable
(Un)Satisfiability was proved
Number of variables165
Number of constraints2615
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension2615
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
aolibdvo 2007-01-17280682OPTIMUM 5.62514 5.65244
aolibpvo 2007-01-17280681OPTIMUM 10.5384 10.586
Toulbar2 2007-01-12280686OPTIMUM 24.5583 24.5805
Toolbar_BTD 2007-01-12280688OPTIMUM 24.6073 24.7022
toolbar 2007-01-12280689OPTIMUM 26.101 26.1164
Toolbar_MaxSat 2007-01-19280687OPTIMUM 115.334 115.367
AbsconMax 109 EPFC280684OPTIMUM 236.475 236.775
AbsconMax 109 PFC280685OPTIMUM 300.628 303.459
CSP4J - MaxCSP 2006-12-19280683? 0.51992 0.56354