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 constraints373
Best CPU time to get the best result obtained on this benchmark5.36218
(Un)Satisfiability was proved
Number of variables40
Number of constraints670
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension670
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-19278428OPTIMUM 1.53677 1.56117
toolbar 2007-01-12278430OPTIMUM 5.36218 5.43281
Toolbar_BTD 2007-01-12278429OPTIMUM 5.9271 5.98882
aolibpvo 2007-01-17278422OPTIMUM 5.9271 5.95612
aolibdvo 2007-01-17278423OPTIMUM 6.10207 6.13701
Toulbar2 2007-01-12278427OPTIMUM 10.8174 10.9227
AbsconMax 109 EPFC278425OPTIMUM 540.113 540.442
AbsconMax 109 PFC278426OPTIMUM 626.227 627.234
CSP4J - MaxCSP 2006-12-19278424? (problem) 0.550916 0.61379