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 constraints1575
Best CPU time to get the best result obtained on this benchmark212.457
(Un)Satisfiability was proved
Number of variables40
Number of constraints1727
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1727
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 2007-01-12278151OPTIMUM 212.457 212.956
Toolbar_MaxSat 2007-01-19278149OPTIMUM 233.752 235.621
Toolbar_BTD 2007-01-12278150OPTIMUM 234.211 234.481
Toulbar2 2007-01-12278148OPTIMUM 854.997 862.962
AbsconMax 109 EPFC278146MSAT (TO) 2400.04 2418.71
CSP4J - MaxCSP 2006-12-19278145MSAT (TO) 2400.07 2415.84
AbsconMax 109 PFC278147MSAT (TO) 2400.11 2410.42
aolibpvo 2007-01-17278143? (TO) 2400.05 2411.38
aolibdvo 2007-01-17278144? (TO) 2400.06 2409.87