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 constraints264
Best CPU time to get the best result obtained on this benchmark6.596
(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-12279455OPTIMUM 6.596 6.6321
aolibdvo 2007-01-17279449OPTIMUM 25.5091 25.5163
toolbar 2007-01-12279456OPTIMUM 60.0079 60.0498
Toulbar2 2007-01-12279453OPTIMUM 385.3 386.79
aolibpvo 2007-01-17279448OPTIMUM 978.65 978.994
AbsconMax 109 EPFC279451MSAT (TO) 2400.06 2400.83
AbsconMax 109 PFC279452MSAT (TO) 2400.15 2400.88
CSP4J - MaxCSP 2006-12-19279450? (problem) 0.471927 0.49898
Toolbar_MaxSat 2007-01-19279454? (TO) 2400.05 2403.84