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 constraints796
Best CPU time to get the best result obtained on this benchmark1.17682
(Un)Satisfiability was proved
Number of variables100
Number of constraints797
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension797
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-19278527OPTIMUM 1.17682 1.18645
AbsconMax 109 PFC278525OPTIMUM 2.70259 2.73279
AbsconMax 109 EPFC278524OPTIMUM 3.08053 3.14239
toolbar 2007-01-12278529OPTIMUM 19.596 19.7508
Toulbar2 2007-01-12278526OPTIMUM 19.764 19.816
Toolbar_BTD 2007-01-12278528OPTIMUM 20.7558 20.9264
aolibpvo 2007-01-17278521OPTIMUM 921.983 927.181
aolibdvo 2007-01-17278522OPTIMUM 1132.81 1134.1
CSP4J - MaxCSP 2006-12-19278523MSAT (TO) 2400.09 2411.85