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 constraints799
Best CPU time to get the best result obtained on this benchmark0.844871
(Un)Satisfiability was proved
Number of variables100
Number of constraints800
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension800
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-19278545OPTIMUM 0.844871 0.852107
AbsconMax 109 EPFC278542OPTIMUM 2.18967 2.33036
AbsconMax 109 PFC278543OPTIMUM 2.27665 2.34785
toolbar 2007-01-12278547OPTIMUM 18.7312 18.9075
Toulbar2 2007-01-12278544OPTIMUM 20.2499 20.2687
Toolbar_BTD 2007-01-12278546OPTIMUM 20.2799 20.4701
aolibpvo 2007-01-17278539OPTIMUM 280.211 281.088
aolibdvo 2007-01-17278540OPTIMUM 338.038 339.862
CSP4J - MaxCSP 2006-12-19278541MSAT (TO) 2400.01 2403.87