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 constraints194
Best CPU time to get the best result obtained on this benchmark8.04078
(Un)Satisfiability was proved
Number of variables30
Number of constraints330
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension330
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-19279931OPTIMUM 3.15852 3.19317
toolbar 2007-01-12279933OPTIMUM 8.04078 8.11534
Toolbar_BTD 2007-01-12279932OPTIMUM 8.65068 8.73439
aolibpvo 2007-01-17279925OPTIMUM 21.8137 21.9099
aolibdvo 2007-01-17279926OPTIMUM 23.4874 23.5406
Toulbar2 2007-01-12279930OPTIMUM 42.2016 42.5758
AbsconMax 109 PFC279929OPTIMUM 413.827 414.363
AbsconMax 109 EPFC279928OPTIMUM 468.308 468.85
CSP4J - MaxCSP 2006-12-19279927MSAT (TO) 2400.09 2402.67