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 constraints898
Best CPU time to get the best result obtained on this benchmark1.84972
(Un)Satisfiability was proved
Number of variables100
Number of constraints900
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension900
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-19278554OPTIMUM 1.84972 1.86402
Toolbar_BTD 2007-01-12278555OPTIMUM 33.9318 34.2423
toolbar 2007-01-12278556OPTIMUM 34.9467 34.9753
Toulbar2 2007-01-12278553OPTIMUM 184.915 185.153
AbsconMax 109 EPFC278551OPTIMUM 970.755 975.189
AbsconMax 109 PFC278552OPTIMUM 1149.71 1154.41
CSP4J - MaxCSP 2006-12-19278550MSAT (TO) 2400.1 2411.65
aolibdvo 2007-01-17278549? (TO) 2400.09 2411.03
aolibpvo 2007-01-17278548? (TO) 2400.11 2401.68