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 constraints196
Best CPU time to get the best result obtained on this benchmark0.444931
(Un)Satisfiability was proved
Number of variables40
Number of constraints197
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension197
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
aolibpvo 2007-01-17277972OPTIMUM 0.422935 0.429768
aolibdvo 2007-01-17277973OPTIMUM 0.444931 0.451645
Toolbar_MaxSat 2007-01-19277978OPTIMUM 0.495924 0.515971
AbsconMax 109 PFC277976OPTIMUM 0.864868 0.926725
AbsconMax 109 EPFC277975OPTIMUM 0.883864 0.921378
Toolbar_BTD 2007-01-12277979OPTIMUM 3.15552 3.1665
toolbar 2007-01-12277980OPTIMUM 3.19151 3.20063
Toulbar2 2007-01-12277977OPTIMUM 3.21551 3.22265
CSP4J - MaxCSP 2006-12-19277974MSAT (TO) 2400.1 2415.51