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 constraints848
Best CPU time to get the best result obtained on this benchmark0.916859
(Un)Satisfiability was proved
Number of variables100
Number of constraints849
Maximum constraint arity10
Maximum domain size2
Number of constraints which are defined in extension849
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-19278581OPTIMUM 0.916859 0.938013
AbsconMax 109 PFC278579OPTIMUM 1.69174 1.76046
AbsconMax 109 EPFC278578OPTIMUM 2.02669 2.07551
toolbar 2007-01-12278583OPTIMUM 21.2628 21.391
Toulbar2 2007-01-12278580OPTIMUM 21.4367 21.485
Toolbar_BTD 2007-01-12278582OPTIMUM 22.7775 22.8099
aolibpvo 2007-01-17278575OPTIMUM 770.814 774.366
aolibdvo 2007-01-17278576OPTIMUM 948.502 951.696
CSP4J - MaxCSP 2006-12-19278577MSAT (TO) 2400.03 2411.51