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 constraints56
Best CPU time to get the best result obtained on this benchmark66.5259
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints57
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension57
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-12275952OPTIMUM 66.5259 66.5588
Toolbar_BTD 2007-01-12275951OPTIMUM 72.9689 73.3355
aolibpvo 2007-01-17275944OPTIMUM 254.003 256.166
Toulbar2 2007-01-12275949OPTIMUM 545.449 548.099
AbsconMax 109 PFC275948OPTIMUM 642.466 648.913
AbsconMax 109 EPFC275947OPTIMUM 1524.62 1529.78
CSP4J - MaxCSP 2006-12-19275946MSAT (TO) 2400.06 2412.89
Toolbar_MaxSat 2007-01-19275950? (exit code) 1.07883 1.08872
aolibdvo 2007-01-17275945? (TO) 2400.08 2402.77