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 constraints288
Best CPU time to get the best result obtained on this benchmark1.37479
(Un)Satisfiability was proved
Number of variables40
Number of constraints297
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension297
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_MaxSat 2007-01-19278059OPTIMUM 1.37479 1.3983
toolbar 2007-01-12278061OPTIMUM 5.14622 5.15144
Toolbar_BTD 2007-01-12278060OPTIMUM 5.59115 5.59436
aolibpvo 2007-01-17278053OPTIMUM 6.46002 6.46368
Toulbar2 2007-01-12278058OPTIMUM 10.8963 10.9534
aolibdvo 2007-01-17278054OPTIMUM 11.3363 11.3414
AbsconMax 109 PFC278057OPTIMUM 190.894 192.62
AbsconMax 109 EPFC278056OPTIMUM 192.124 193.863
CSP4J - MaxCSP 2006-12-19278055MSAT (TO) 2400.08 2402.79