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.2918
(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-17277513OPTIMUM 0.098984 0.105169
Toolbar_BTD 2007-01-12277520OPTIMUM 1.2918 1.32233
Toulbar2 2007-01-12277518OPTIMUM 1.54077 1.57481
Toolbar_MaxSat 2007-01-19277519OPTIMUM 44.3403 44.7587
toolbar 2007-01-12277521OPTIMUM 58.0432 58.3284
aolibdvo 2007-01-17277514OPTIMUM 166.502 167.939
AbsconMax 109 EPFC277516OPTIMUM 1055.55 1060.77
AbsconMax 109 PFC277517OPTIMUM 1080.66 1085.98
CSP4J - MaxCSP 2006-12-19277515MSAT (TO) 2400.05 2401.74