| Name | normalized-PB07/PURE-SAT/SAT07/industrial/
jarvisalo/eq.atree.braun.8.unsat.opb |
| MD5SUM | 2bc18543f4d9526a52c391340f96369c |
| Bench Category | PURE-SAT (instances containing only clauses) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 32.1891 |
| Has Objective Function | NO |
| Satisfiable | NO |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 684 |
| Total number of constraints | 2300 |
| Number of constraints which are clauses | 2300 |
| 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 | 15 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 13 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 28 |
| Number of bits of the biggest sum of numbers | 5 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |