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 constraints212
Best CPU time to get the best result obtained on this benchmark5.55015
(Un)Satisfiability was proved
Number of variables40
Number of constraints255
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension255
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 2007-01-12279168OPTIMUM 5.55015 5.55595
Toolbar_BTD 2007-01-12279167OPTIMUM 6.10707 6.14922
Toulbar2 2007-01-12279165OPTIMUM 10.6674 10.7672
aolibpvo 2007-01-17279160OPTIMUM 11.5572 11.6483
aolibdvo 2007-01-17279161OPTIMUM 12.1212 12.1735
AbsconMax 109 EPFC279163MSAT (TO) 2400.07 2400.84
AbsconMax 109 PFC279164MSAT (TO) 2400.11 2411.16
CSP4J - MaxCSP 2006-12-19279162? (problem) 0.486925 0.504855
Toolbar_MaxSat 2007-01-19279166? (TO) 2400.14 2402.27