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 constraints2191
Best CPU time to get the best result obtained on this benchmark471.169
(Un)Satisfiability was proved
Number of variables40
Number of constraints2435
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2435
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-12278250OPTIMUM 471.169 471.92
Toolbar_BTD 2007-01-12278249OPTIMUM 531.774 536.153
Toolbar_MaxSat 2007-01-19278248OPTIMUM 580.589 583.57
Toulbar2 2007-01-12278247OPTIMUM 1858.93 1876.37
AbsconMax 109 EPFC278245MSAT (TO) 2400.06 2400.76
AbsconMax 109 PFC278246MSAT (TO) 2400.08 2402.92
CSP4J - MaxCSP 2006-12-19278244? (problem) 2.17267 2.30424
aolibdvo 2007-01-17278243? (TO) 2400.03 2417.9
aolibpvo 2007-01-17278242? (TO) 2400.06 2407.01