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 constraints488
Best CPU time to get the best result obtained on this benchmark288.987
(Un)Satisfiability was proved
Number of variables80
Number of constraints498
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension498
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 2007-01-12277890OPTIMUM 288.987 290.452
Toolbar_BTD 2007-01-12277889OPTIMUM 328.024 330.813
Toolbar_MaxSat 2007-01-19277888OPTIMUM 440.49 442.596
Toulbar2 2007-01-12277887OPTIMUM 1460.81 1473.38
CSP4J - MaxCSP 2006-12-19277884MSAT (TO) 2400.07 2422.42
AbsconMax 109 EPFC277885MSAT (TO) 2400.14 2416.73
AbsconMax 109 PFC277886MSAT (TO) 2400.14 2414.43
aolibpvo 2007-01-17277882? (TO) 2400.08 2409.37
aolibdvo 2007-01-17277883? (TO) 2400.09 2414.07