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.3048
(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-17277549OPTIMUM 0.072988 0.0797889
Toolbar_BTD 2007-01-12277556OPTIMUM 1.3048 1.32559
Toulbar2 2007-01-12277554OPTIMUM 1.56576 1.58837
Toolbar_MaxSat 2007-01-19277555OPTIMUM 47.4438 47.9127
toolbar 2007-01-12277557OPTIMUM 61.5536 62.0277
aolibdvo 2007-01-17277550OPTIMUM 164.336 165.593
AbsconMax 109 PFC277553OPTIMUM 1088.53 1097.77
AbsconMax 109 EPFC277552OPTIMUM 1127.34 1132.63
CSP4J - MaxCSP 2006-12-19277551MSAT (TO) 2400.1 2415.75