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 constraints59
Best CPU time to get the best result obtained on this benchmark237.937
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints60
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension60
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-12276024OPTIMUM 237.937 238.96
Toolbar_BTD 2007-01-12276023OPTIMUM 251.245 251.591
aolibdvo 2007-01-17276017OPTIMUM 681.298 687.137
aolibpvo 2007-01-17276016OPTIMUM 890.604 894.027
AbsconMax 109 PFC276020OPTIMUM 1775.96 1792.35
Toulbar2 2007-01-12276021OPTIMUM 1895.53 1904.5
CSP4J - MaxCSP 2006-12-19276018MSAT (TO) 2400.05 2402.42
AbsconMax 109 EPFC276019MSAT (TO) 2400.13 2400.98
Toolbar_MaxSat 2007-01-19276022? (exit code) 6.95194 6.96422