MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints282
Best CPU time to get the best result obtained on this benchmark5.40218
(Un)Satisfiability was proved
Number of variables58
Number of constraints309
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension309
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_BTD 2007-01-12279356OPTIMUM 5.40218 5.45707
aolibdvo 2007-01-17279350OPTIMUM 40.0649 40.0771
toolbar 2007-01-12279357OPTIMUM 49.6624 49.8908
Toulbar2 2007-01-12279354OPTIMUM 177.276 177.411
aolibpvo 2007-01-17279349OPTIMUM 1242.32 1253.39
AbsconMax 109 EPFC279352MSAT (TO) 2400.1 2413.2
AbsconMax 109 PFC279353MSAT (TO) 2400.14 2402.58
CSP4J - MaxCSP 2006-12-19279351? (problem) 0.512921 0.749708
Toolbar_MaxSat 2007-01-19279355? (TO) 2400.08 2410.06