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 constraints345
Best CPU time to get the best result obtained on this benchmark0.353945
(Un)Satisfiability was proved
Number of variables40
Number of constraints426
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension426
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-17278377OPTIMUM 0.353945 0.355834
aolibdvo 2007-01-17278378OPTIMUM 0.38794 0.388416
Toolbar_MaxSat 2007-01-19278383OPTIMUM 0.712891 0.724311
toolbar 2007-01-12278385OPTIMUM 3.45048 3.47127
Toolbar_BTD 2007-01-12278384OPTIMUM 3.57346 3.58366
Toulbar2 2007-01-12278382OPTIMUM 3.88141 3.93034
AbsconMax 109 EPFC278380OPTIMUM 82.4275 82.5229
AbsconMax 109 PFC278381OPTIMUM 168.574 168.825
CSP4J - MaxCSP 2006-12-19278379? (problem) 0.45593 0.498471