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.2908
(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-17277531OPTIMUM 0.065989 0.072611
Toolbar_BTD 2007-01-12277538OPTIMUM 1.2908 1.31632
Toulbar2 2007-01-12277536OPTIMUM 1.53377 1.56073
Toolbar_MaxSat 2007-01-19277537OPTIMUM 47.0588 47.5176
toolbar 2007-01-12277539OPTIMUM 61.4187 61.8884
aolibdvo 2007-01-17277532OPTIMUM 166.804 168.156
AbsconMax 109 PFC277535OPTIMUM 1020.12 1024.6
AbsconMax 109 EPFC277534OPTIMUM 1056.57 1057.88
CSP4J - MaxCSP 2006-12-19277533MSAT (TO) 2400 2422.31