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 constraints566
Best CPU time to get the best result obtained on this benchmark14.7937
(Un)Satisfiability was proved
Number of variables144
Number of constraints635
Maximum constraint arity3
Maximum domain size4
Number of constraints which are defined in extension635
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-12282794OPTIMUM 14.7937 14.8648
aolibpvo 2007-01-17282787OPTIMUM 137.079 138.112
Toulbar2 2007-01-12282792MSAT (TO) 2400.04 2409.45
AbsconMax 109 EPFC282790MSAT (TO) 2400.07 2401.22
toolbar 2007-01-12282795MSAT (TO) 2400.12 2402.51
AbsconMax 109 PFC282791MSAT (TO) 2400.14 2412.71
CSP4J - MaxCSP 2006-12-19282789? (problem) 0.569913 0.614035
Toolbar_MaxSat 2007-01-19282793? (TO) 2400.07 2409.23
aolibdvo 2007-01-17282788? (TO) 2400.1 2411.37