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 constraints87
Best CPU time to get the best result obtained on this benchmark3.00954
(Un)Satisfiability was proved
Number of variables28
Number of constraints189
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension189
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
aolibdvo 2007-01-17278675OPTIMUM 3.00954 3.03546
aolibpvo 2007-01-17278674OPTIMUM 3.04354 3.05366
Toolbar_BTD 2007-01-12278681OPTIMUM 4.70228 4.75794
toolbar 2007-01-12278682OPTIMUM 4.81227 4.85016
Toulbar2 2007-01-12278679OPTIMUM 6.44402 6.46215
AbsconMax 109 EPFC278677OPTIMUM 533.103 533.682
AbsconMax 109 PFC278678OPTIMUM 533.859 538.475
CSP4J - MaxCSP 2006-12-19278676? (problem) 0.416936 0.457218
Toolbar_MaxSat 2007-01-19278680? (TO) 2400.15 2401.28