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 constraints39
Best CPU time to get the best result obtained on this benchmark1.2978
(Un)Satisfiability was proved
Number of variables60
Number of constraints40
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension40
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
aolibpvo 2007-01-17277540OPTIMUM 0.075988 0.081756
Toolbar_BTD 2007-01-12277547OPTIMUM 1.2978 1.33172
Toulbar2 2007-01-12277545OPTIMUM 1.52877 1.55035
Toolbar_MaxSat 2007-01-19277546OPTIMUM 47.1138 47.5565
toolbar 2007-01-12277548OPTIMUM 61.3207 61.8142
aolibdvo 2007-01-17277541OPTIMUM 166.62 167.926
AbsconMax 109 PFC277544OPTIMUM 1027.07 1028.24
AbsconMax 109 EPFC277543OPTIMUM 1100.44 1106.3
CSP4J - MaxCSP 2006-12-19277542MSAT (TO) 2400.03 2419.68