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 constraints152
Best CPU time to get the best result obtained on this benchmark376.425
(Un)Satisfiability was provedNO
Number of variables36
Number of constraints153
Maximum constraint arity4
Maximum domain size9
Number of constraints which are defined in extension153
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
AbsconMax 109 PFC275090OPTIMUM 376.425 376.841
AbsconMax 109 EPFC275089OPTIMUM 393.926 394.118
CSP4J - MaxCSP 2006-12-19275088MSAT (TO) 2400.03 2402.64
toolbar 2007-01-12275094MSAT (TO) 2400.05 2416.7
Toulbar2 2007-01-12275091MSAT (TO) 2400.13 2401.12
aolibdvo 2007-01-17275087? (TO) 2400.02 2400.09
aolibpvo 2007-01-17275086? (TO) 2400.07 2411.36
Toolbar_MaxSat 2007-01-19275092? (TO) 2400.09 2421.95
Toolbar_BTD 2007-01-12275093? (TO) 2400.09 2416.12