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 constraints117
Best CPU time to get the best result obtained on this benchmark4.07038
(Un)Satisfiability was proved
Number of variables62
Number of constraints211
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension211
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
Toolbar_BTD 2007-01-12278969OPTIMUM 4.07038 4.10146
aolibpvo 2007-01-17278962OPTIMUM 4.69429 4.7355
toolbar 2007-01-12278970OPTIMUM 31.7792 31.9489
aolibdvo 2007-01-17278963OPTIMUM 81.7656 82.3835
Toulbar2 2007-01-12278967OPTIMUM 103.212 104.153
AbsconMax 109 PFC278966MSAT (TO) 2400.05 2420.32
AbsconMax 109 EPFC278965MSAT (TO) 2400.16 2419.4
CSP4J - MaxCSP 2006-12-19278964? (problem) 0.472927 0.516098
Toolbar_MaxSat 2007-01-19278968? (TO) 2400.04 2408.38