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 benchmark124.182
(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
toolbar 2007-01-12275961OPTIMUM 124.182 125.205
Toolbar_BTD 2007-01-12275960OPTIMUM 139.677 139.762
AbsconMax 109 PFC275957OPTIMUM 678.059 683.411
Toulbar2 2007-01-12275958OPTIMUM 1091.07 1096.05
AbsconMax 109 EPFC275956OPTIMUM 1099.01 1104.29
aolibpvo 2007-01-17275953OPTIMUM 1119.15 1124.05
aolibdvo 2007-01-17275954OPTIMUM 1138.05 1138.64
CSP4J - MaxCSP 2006-12-19275955MSAT (TO) 2400.05 2409.65
Toolbar_MaxSat 2007-01-19275959? (exit code) 29.6485 29.7846