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 constraints1510
Best CPU time to get the best result obtained on this benchmark111.899
(Un)Satisfiability was proved
Number of variables40
Number of constraints1646
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1646
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-19278068OPTIMUM 111.899 112.939
Toolbar_BTD 2007-01-12278069OPTIMUM 112.951 113.103
toolbar 2007-01-12278070OPTIMUM 113.531 114.419
Toulbar2 2007-01-12278067OPTIMUM 510.959 514.921
aolibpvo 2007-01-17278062OPTIMUM 1848.83 1849.46
aolibdvo 2007-01-17278063OPTIMUM 1900.26 1900.74
CSP4J - MaxCSP 2006-12-19278064MSAT (TO) 2400.1 2400.96
AbsconMax 109 EPFC278065MSAT (TO) 2400.12 2400.83
AbsconMax 109 PFC278066MSAT (TO) 2400.12 2401.01