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 constraints152
Best CPU time to get the best result obtained on this benchmark65.838
(Un)Satisfiability was provedNO
Number of variables36
Number of constraints153
Maximum constraint arity4
Maximum domain size9
Number of constraints which are defined in extension153
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
AbsconMax 109 PFC275099OPTIMUM 65.838 66.4461
AbsconMax 109 EPFC275098OPTIMUM 144.738 146.095
toolbar 2007-01-12275103OPTIMUM 763.991 767.679
Toolbar_BTD 2007-01-12275102OPTIMUM 1059.8 1061.62
Toulbar2 2007-01-12275100MSAT (TO) 2400.05 2411.22
CSP4J - MaxCSP 2006-12-19275097MSAT (TO) 2400.08 2411.51
aolibpvo 2007-01-17275095? (TO) 2400.03 2420.67
aolibdvo 2007-01-17275096? (TO) 2400.03 2420.52
Toolbar_MaxSat 2007-01-19275101? (TO) 2400.1 2422.01