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 constraints408
Best CPU time to get the best result obtained on this benchmark4.03039
(Un)Satisfiability was proved
Number of variables80
Number of constraints458
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension458
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_MaxSat 2007-01-19277780OPTIMUM 0.903862 1.01768
toolbar 2007-01-12277782OPTIMUM 4.03039 4.08182
Toolbar_BTD 2007-01-12277781OPTIMUM 4.32134 4.36753
Toulbar2 2007-01-12277779OPTIMUM 9.94549 9.97369
aolibpvo 2007-01-17277774OPTIMUM 13.7799 13.8982
aolibdvo 2007-01-17277775OPTIMUM 14.8307 14.9397
AbsconMax 109 EPFC277777MSAT (TO) 2400.12 2403.92
AbsconMax 109 PFC277778MSAT (TO) 2400.13 2405.91
CSP4J - MaxCSP 2006-12-19277776? (problem) 0.486925 0.526588