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 constraints1853
Best CPU time to get the best result obtained on this benchmark427.224
(Un)Satisfiability was proved
Number of variables40
Number of constraints2052
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2052
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-12278277OPTIMUM 427.224 427.865
Toolbar_BTD 2007-01-12278276OPTIMUM 480.75 484.133
Toolbar_MaxSat 2007-01-19278275OPTIMUM 609.276 610.885
Toulbar2 2007-01-12278274OPTIMUM 1460.31 1465.81
CSP4J - MaxCSP 2006-12-19278271MSAT (TO) 2400.01 2402.43
AbsconMax 109 PFC278273MSAT (TO) 2400.09 2421.92
AbsconMax 109 EPFC278272MSAT (TO) 2400.14 2402.82
aolibpvo 2007-01-17278269? (TO) 2400.06 2419.65
aolibdvo 2007-01-17278270? (TO) 2400.07 2400.78