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 constraints107
Best CPU time to get the best result obtained on this benchmark5.64714
(Un)Satisfiability was proved
Number of variables30
Number of constraints109
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension109
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-12280860OPTIMUM 5.64714 5.70625
Toolbar_BTD 2007-01-12280859OPTIMUM 5.82111 5.88156
aolibdvo 2007-01-17280853OPTIMUM 8.07777 8.14402
aolibpvo 2007-01-17280852OPTIMUM 8.47871 8.55101
Toulbar2 2007-01-12280857OPTIMUM 8.5417 8.62801
AbsconMax 109 EPFC280855OPTIMUM 60.9597 61.3719
AbsconMax 109 PFC280856OPTIMUM 68.9905 69.6479
CSP4J - MaxCSP 2006-12-19280854MSAT (TO) 2400.02 2400.87
Toolbar_MaxSat 2007-01-19280858? (TO) 2400.1 2403.51