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 constraints1928
Best CPU time to get the best result obtained on this benchmark246.827
(Un)Satisfiability was proved
Number of variables40
Number of constraints2125
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2125
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-12278268OPTIMUM 246.827 248
Toolbar_MaxSat 2007-01-19278266OPTIMUM 251.82 253.126
Toolbar_BTD 2007-01-12278267OPTIMUM 267.644 268.85
Toulbar2 2007-01-12278265OPTIMUM 896.237 900.545
CSP4J - MaxCSP 2006-12-19278262MSAT (TO) 2400.01 2400.72
AbsconMax 109 EPFC278263MSAT (TO) 2400.07 2424.04
AbsconMax 109 PFC278264MSAT (TO) 2400.09 2405.8
aolibpvo 2007-01-17278260? (TO) 2400.11 2400.86
aolibdvo 2007-01-17278261? (TO) 2400.11 2419.7