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 constraints58
Best CPU time to get the best result obtained on this benchmark255.417
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints59
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension59
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
aolibpvo 2007-01-17276061OPTIMUM 234.158 236.006
toolbar 2007-01-12276069OPTIMUM 255.417 256.563
Toolbar_BTD 2007-01-12276068OPTIMUM 296.96 298.409
Toulbar2 2007-01-12276066OPTIMUM 667.865 672.627
aolibdvo 2007-01-17276062OPTIMUM 1534.2 1536.21
AbsconMax 109 PFC276065OPTIMUM 1959.25 1961.51
CSP4J - MaxCSP 2006-12-19276063MSAT (TO) 2400.06 2422.07
AbsconMax 109 EPFC276064MSAT (TO) 2400.12 2411.43
Toolbar_MaxSat 2007-01-19276067? (exit code) 1.10983 1.12265