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 constraints186
Best CPU time to get the best result obtained on this benchmark0.140977
(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
aolibpvo 2007-01-17278692OPTIMUM 0.140977 0.143095
aolibdvo 2007-01-17278693OPTIMUM 0.147976 0.149783
Toolbar_BTD 2007-01-12278699OPTIMUM 2.93255 2.99677
toolbar 2007-01-12278700OPTIMUM 2.95855 2.9664
Toulbar2 2007-01-12278697OPTIMUM 3.10553 3.11204
AbsconMax 109 EPFC278695OPTIMUM 41.9296 42.0147
AbsconMax 109 PFC278696OPTIMUM 43.9823 44.0515
Toolbar_MaxSat 2007-01-19278698OPTIMUM 1758.13 1772.76
CSP4J - MaxCSP 2006-12-19278694MSAT (TO) 2400.01 2405.09