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 constraints59
Best CPU time to get the best result obtained on this benchmark179.693
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints60
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension60
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-12275943OPTIMUM 179.693 179.991
Toulbar2 2007-01-12275940OPTIMUM 207.483 208.642
Toolbar_BTD 2007-01-12275942OPTIMUM 223.518 225.455
aolibpvo 2007-01-17275935OPTIMUM 689.13 689.541
AbsconMax 109 PFC275939OPTIMUM 1459.22 1462.2
AbsconMax 109 EPFC275938OPTIMUM 1916.42 1918.22
CSP4J - MaxCSP 2006-12-19275937MSAT (TO) 2400.1 2418.79
Toolbar_MaxSat 2007-01-19275941? (exit code) 32.0931 32.4515
aolibdvo 2007-01-17275936? (TO) 2400.05 2411.52