| Name | submitted/manquinho/primes-dimacs-cnf/normalized-ssa2670-141.opb |
| MD5SUM | 423b72910a463b7aa4b9bdae86b878a8 |
| Bench Category | optimization, small integers (OPTSMALLINT) |
| Has Objective Function | YES |
| Satisfiable | NO |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of terms in the objective function | 1972 |
| 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 | 1972 |
| Number of bits of the sum of numbers in the objective function | 11 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 1972 |
| Number of bits of the biggest sum of numbers | 11 |
| Best result obtained on this benchmark | UNSAT |
| Best CPU time to get the best result obtained on this benchmark | 0.19497 |
| Number of variables | 1972 |
| Total number of constraints | 3301 |
| Number of constraints which are clauses | 3301 |
| 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 | 1 |
| Maximum length of a constraint | 5 |