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 constraints737
Best CPU time to get the best result obtained on this benchmark4.91725
(Un)Satisfiability was proved
Number of variables435
Number of constraints738
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension738
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-12277581OPTIMUM 4.91725 4.95083
Toolbar_MaxSat 2007-01-19277582OPTIMUM 17.9983 18.1046
aolibpvo 2007-01-17277576OPTIMUM 184.884 184.95
AbsconMax 109 EPFC277579OPTIMUM 246.064 246.508
AbsconMax 109 PFC277580OPTIMUM 298.884 300.359
CSP4J - MaxCSP 2006-12-19277578MSAT (TO) 2400.03 2413.93
toolbar 2007-01-12277584MSAT (TO) 2400.11 2404.3
Toolbar_BTD 2007-01-12277583? (TO) 2400.01 2419.54
aolibdvo 2007-01-17277577? (TO) 2400.1 2411.97