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 constraints2258
Best CPU time to get the best result obtained on this benchmark536.08
(Un)Satisfiability was proved
Number of variables40
Number of constraints2512
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2512
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_BTD 2007-01-12278312OPTIMUM 536.08 538.604
toolbar 2007-01-12278313OPTIMUM 541.932 544.408
Toolbar_MaxSat 2007-01-19278311OPTIMUM 599.539 601.99
Toulbar2 2007-01-12278310OPTIMUM 1780.4 1793.48
AbsconMax 109 EPFC278308MSAT (TO) 2400.09 2404.18
AbsconMax 109 PFC278309MSAT (TO) 2400.13 2415.58
CSP4J - MaxCSP 2006-12-19278307? (problem) 2.38464 2.53472
aolibdvo 2007-01-17278306? (TO) 2400.02 2402.71
aolibpvo 2007-01-17278305? (TO) 2400.09 2419.06