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 constraints1726
Best CPU time to get the best result obtained on this benchmark127.78
(Un)Satisfiability was proved
Number of variables40
Number of constraints1889
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1889
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-19278257OPTIMUM 127.78 127.994
Toolbar_BTD 2007-01-12278258OPTIMUM 150.174 151.406
toolbar 2007-01-12278259OPTIMUM 152.505 152.584
Toulbar2 2007-01-12278256OPTIMUM 581.852 583.264
CSP4J - MaxCSP 2006-12-19278253MSAT (TO) 2400 2401.92
AbsconMax 109 EPFC278254MSAT (TO) 2400.14 2409.11
AbsconMax 109 PFC278255MSAT (TO) 2400.16 2417.64
aolibdvo 2007-01-17278252? (TO) 2400.1 2421.45
aolibpvo 2007-01-17278251? (TO) 2400.12 2409.2