MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints844
Best CPU time to get the best result obtained on this benchmark1.83272
(Un)Satisfiability was proved
Number of variables100
Number of constraints846
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension846
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-19278536OPTIMUM 1.83272 1.84979
toolbar 2007-01-12278538OPTIMUM 26.6759 26.7196
Toolbar_BTD 2007-01-12278537OPTIMUM 29.2965 29.5719
Toulbar2 2007-01-12278535OPTIMUM 240.378 241.399
AbsconMax 109 PFC278534OPTIMUM 422.991 425.38
AbsconMax 109 EPFC278533OPTIMUM 718.805 721.285
CSP4J - MaxCSP 2006-12-19278532MSAT (TO) 2400.06 2410.96
aolibdvo 2007-01-17278531? (TO) 2400.01 2410.68
aolibpvo 2007-01-17278530? (TO) 2400.04 2402.01