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 constraints894
Best CPU time to get the best result obtained on this benchmark8.30974
(Un)Satisfiability was proved
Number of variables100
Number of constraints898
Maximum constraint arity10
Maximum domain size2
Number of constraints which are defined in extension898
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-19278572OPTIMUM 8.30974 8.40578
toolbar 2007-01-12278574OPTIMUM 156.741 157.475
Toolbar_BTD 2007-01-12278573OPTIMUM 177.256 178.003
Toulbar2 2007-01-12278571OPTIMUM 2019.5 2020.27
AbsconMax 109 EPFC278569MSAT (TO) 2400.07 2411.7
AbsconMax 109 PFC278570MSAT (TO) 2400.14 2413.33
CSP4J - MaxCSP 2006-12-19278568? (problem) 1.23781 1.29432
aolibdvo 2007-01-17278567? (TO) 2400.05 2401.44
aolibpvo 2007-01-17278566? (TO) 2400.09 2401.39