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 constraints224
Best CPU time to get the best result obtained on this benchmark7.18991
(Un)Satisfiability was proved
Number of variables58
Number of constraints309
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension309
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-12279563OPTIMUM 7.18991 7.26337
aolibdvo 2007-01-17279557OPTIMUM 1342.52 1346.85
Toulbar2 2007-01-12279561MSAT (TO) 2400.05 2400.77
AbsconMax 109 EPFC279559MSAT (TO) 2400.08 2418.97
AbsconMax 109 PFC279560MSAT (TO) 2400.08 2420.28
toolbar 2007-01-12279564MSAT (TO) 2400.08 2405.33
CSP4J - MaxCSP 2006-12-19279558? (problem) 0.495923 0.576946
Toolbar_MaxSat 2007-01-19279562? (TO) 2400.02 2400.74
aolibpvo 2007-01-17279556? (TO) 2400.04 2416.49