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 constraints202
Best CPU time to get the best result obtained on this benchmark5.78412
(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-12279536OPTIMUM 5.78412 5.84607
aolibdvo 2007-01-17279530OPTIMUM 14.1408 14.2589
toolbar 2007-01-12279537OPTIMUM 124.414 125.524
Toulbar2 2007-01-12279534OPTIMUM 820.184 826.835
AbsconMax 109 EPFC279532MSAT (TO) 2400.06 2401.17
AbsconMax 109 PFC279533MSAT (TO) 2400.14 2403.02
CSP4J - MaxCSP 2006-12-19279531? (problem) 0.488925 0.561065
Toolbar_MaxSat 2007-01-19279535? (TO) 2400.04 2419.93
aolibpvo 2007-01-17279529? (TO) 2400.04 2410.74