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 constraints132
Best CPU time to get the best result obtained on this benchmark0.333949
(Un)Satisfiability was proved
Number of variables42
Number of constraints133
Maximum constraint arity6
Maximum domain size2
Number of constraints which are defined in extension133
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-19277609OPTIMUM 0.333949 0.351726
toolbar 2007-01-12277611OPTIMUM 1.62275 1.6498
Toolbar_BTD 2007-01-12277610OPTIMUM 1.80172 1.82383
Toulbar2 2007-01-12277608OPTIMUM 1.87971 1.90035
AbsconMax 109 PFC277607OPTIMUM 1.9457 2.01466
AbsconMax 109 EPFC277606OPTIMUM 2.00569 2.07118
aolibpvo 2007-01-17277603OPTIMUM 8.41872 8.49336
aolibdvo 2007-01-17277604OPTIMUM 35.2286 35.5292
CSP4J - MaxCSP 2006-12-19277605MSAT (TO) 2400.02 2417.13