Name | submitted/manquinho/primes-dimacs-cnf/normalized-aim-100-1_6-yes1-2.opb |
MD5SUM | 3d058866acfc7bd1c3c31f94a11015a2 |
Bench Category | optimization, small integers (OPTSMALLINT) |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 100 |
Optimality of the best value was proved | YES |
Number of terms in the objective function | 200 |
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 | 200 |
Number of bits of the sum of numbers in the objective function | 8 |
Biggest number in a constraint | 2 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 200 |
Number of bits of the biggest sum of numbers | 8 |
Best result obtained on this benchmark | OPTIMUM FOUND |
Best CPU time to get the best result obtained on this benchmark | 0.024995 |
Number of variables | 200 |
Total number of constraints | 260 |
Number of constraints which are clauses | 259 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 3 |