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 constraints11105
Best CPU time to get the best result obtained on this benchmark679.678
(Un)Satisfiability was proved
Number of variables8921
Number of constraints11107
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension11107
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
Toulbar2 2007-01-12280569OPTIMUM 679.678 685.991
AbsconMax 109 EPFC280567MSAT (TO) 2400.1 2408.05
AbsconMax 109 PFC280568MSAT (TO) 2400.14 2416.93
CSP4J - MaxCSP 2006-12-19280566? (problem) 40.1849 40.6259
Toolbar_MaxSat 2007-01-19280570? (MO) 0.032994 5.66125
Toolbar_BTD 2007-01-12280571? (MO) 27 27.2139
aolibdvo 2007-01-17280565? (MO) 74.9786 75.6237
aolibpvo 2007-01-17280564? (MO) 75.2056 75.6656
toolbar 2007-01-12280572? (MO) 121.05 122.239