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 constraints168
Best CPU time to get the best result obtained on this benchmark1.48977
(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-17278719OPTIMUM 1.48977 1.49291
aolibdvo 2007-01-17278720OPTIMUM 1.58876 1.59087
toolbar 2007-01-12278727OPTIMUM 4.43633 4.5025
Toolbar_BTD 2007-01-12278726OPTIMUM 4.94525 4.95352
Toulbar2 2007-01-12278724OPTIMUM 5.15921 5.16983
AbsconMax 109 PFC278723OPTIMUM 71.5951 71.8114
AbsconMax 109 EPFC278722OPTIMUM 95.4405 95.585
CSP4J - MaxCSP 2006-12-19278721? (problem) 0.443932 0.515441
Toolbar_MaxSat 2007-01-19278725? (TO) 2400.08 2401.29