MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints56
Best CPU time to get the best result obtained on this benchmark36.6644
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints57
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension57
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
toolbar 2007-01-12276006OPTIMUM 36.6644 37.0122
Toolbar_BTD 2007-01-12276005OPTIMUM 41.0658 41.3911
aolibpvo 2007-01-17275998OPTIMUM 260.789 262.747
Toulbar2 2007-01-12276003OPTIMUM 330.067 330.175
AbsconMax 109 PFC276002OPTIMUM 426.199 430.142
AbsconMax 109 EPFC276001OPTIMUM 1202.95 1208.44
CSP4J - MaxCSP 2006-12-19276000MSAT (TO) 2400.01 2409.32
Toolbar_MaxSat 2007-01-19276004? (exit code) 29.5275 29.8062
aolibdvo 2007-01-17275999? (TO) 2400.04 2414.25