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 constraints2344
Best CPU time to get the best result obtained on this benchmark342.48
(Un)Satisfiability was proved
Number of variables40
Number of constraints2600
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2600
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-12278304OPTIMUM 342.48 342.867
Toolbar_BTD 2007-01-12278303OPTIMUM 385.124 388.159
Toolbar_MaxSat 2007-01-19278302OPTIMUM 485.749 487.984
Toulbar2 2007-01-12278301OPTIMUM 1079.79 1082.6
CSP4J - MaxCSP 2006-12-19278298MSAT (TO) 2400 2414.9
AbsconMax 109 EPFC278299MSAT (TO) 2400.12 2402.68
AbsconMax 109 PFC278300MSAT (TO) 2400.12 2422.38
aolibdvo 2007-01-17278297? (TO) 2400.06 2405
aolibpvo 2007-01-17278296? (TO) 2400.11 2416.68