Name | normalized-PB06/OPT-SMALLINT/submitted-PB05/ sorensson/garden/normalized-g9x9.opb |
MD5SUM | 4b56e6775cc4a081c8696ef0fa81b784 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 20 |
Best CPU time to get the best result obtained on this benchmark | 0.109982 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 20 |
Optimality of the best value was proved | YES |
Number of variables | 81 |
Total number of constraints | 81 |
Number of constraints which are clauses | 81 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 3 |
Maximum length of a constraint | 5 |
Number of terms in the objective function | 81 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 81 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 81 |
Number of bits of the biggest sum of numbers | 7 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |