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 constraints1424
Best CPU time to get the best result obtained on this benchmark103.976
(Un)Satisfiability was proved
Number of variables40
Number of constraints1552
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1552
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_MaxSat 2007-01-19278131OPTIMUM 103.976 104.446
toolbar 2007-01-12278133OPTIMUM 120.453 120.544
Toolbar_BTD 2007-01-12278132OPTIMUM 135 135.06
Toulbar2 2007-01-12278130OPTIMUM 619.211 622.376
aolibdvo 2007-01-17278126OPTIMUM 2000.31 2005.49
aolibpvo 2007-01-17278125OPTIMUM 2045.73 2047.68
CSP4J - MaxCSP 2006-12-19278127MSAT (TO) 2400.03 2422.32
AbsconMax 109 EPFC278128MSAT (TO) 2400.09 2400.89
AbsconMax 109 PFC278129MSAT (TO) 2400.09 2405.13