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 constraints99
Best CPU time to get the best result obtained on this benchmark2.44563
(Un)Satisfiability was proved
Number of variables150
Number of constraints100
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension100
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-17277504OPTIMUM 0.52092 0.522593
Toolbar_BTD 2007-01-12277511OPTIMUM 2.44563 2.5005
CSP4J - MaxCSP 2006-12-19277506MSAT (TO) 2400 2411.73
Toulbar2 2007-01-12277509MSAT (TO) 2400.05 2409.4
toolbar 2007-01-12277512MSAT (TO) 2400.05 2410.94
AbsconMax 109 EPFC277507MSAT (TO) 2400.13 2411.14
AbsconMax 109 PFC277508MSAT (TO) 2400.14 2411.42
aolibdvo 2007-01-17277505? (TO) 2400.1 2400.9
Toolbar_MaxSat 2007-01-19277510? (TO) 2400.15 2421.46