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 constraints846
Best CPU time to get the best result obtained on this benchmark0.986849
(Un)Satisfiability was proved
Number of variables100
Number of constraints847
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension847
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-19278563OPTIMUM 0.986849 0.997287
AbsconMax 109 PFC278561OPTIMUM 1.40279 1.45566
AbsconMax 109 EPFC278560OPTIMUM 1.64475 1.71917
toolbar 2007-01-12278565OPTIMUM 21.2068 21.3109
Toolbar_BTD 2007-01-12278564OPTIMUM 21.3787 21.4074
Toulbar2 2007-01-12278562OPTIMUM 22.4686 22.5498
aolibpvo 2007-01-17278557OPTIMUM 116.889 117.912
aolibdvo 2007-01-17278558OPTIMUM 1618.98 1622.18
CSP4J - MaxCSP 2006-12-19278559MSAT (TO) 2400.08 2402.48