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 constraints135
Best CPU time to get the best result obtained on this benchmark4.6193
(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-17278746OPTIMUM 4.6193 4.62317
aolibdvo 2007-01-17278747OPTIMUM 5.46217 5.51185
Toolbar_BTD 2007-01-12278753OPTIMUM 6.08807 6.13089
toolbar 2007-01-12278754OPTIMUM 6.35403 6.39377
Toulbar2 2007-01-12278751OPTIMUM 6.98394 6.99292
AbsconMax 109 EPFC278749OPTIMUM 153.016 153.189
AbsconMax 109 PFC278750OPTIMUM 203.38 205.173
CSP4J - MaxCSP 2006-12-19278748? (problem) 0.441931 0.493571
Toolbar_MaxSat 2007-01-19278752? (TO) 2400.09 2401.75