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 constraints184
Best CPU time to get the best result obtained on this benchmark8.64068
(Un)Satisfiability was proved
Number of variables16
Number of constraints188
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension188
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-17282589OPTIMUM 8.64068 8.71878
aolibdvo 2007-01-17282590OPTIMUM 18.2522 18.3789
Toulbar2 2007-01-12282594OPTIMUM 26.225 26.3503
toolbar 2007-01-12282597OPTIMUM 26.9689 27.1177
Toolbar_BTD 2007-01-12282596OPTIMUM 27.8048 27.8429
AbsconMax 109 EPFC282592OPTIMUM 32.4701 32.5511
AbsconMax 109 PFC282593OPTIMUM 32.5061 32.7788
CSP4J - MaxCSP 2006-12-19282591? (problem) 0.876865 0.937699
Toolbar_MaxSat 2007-01-19282595Wrong Opt. 28.2287 28.2397