Name | normalized-PB07/PURE-SAT/SAT07/industrial/ jarvisalo/eq.atree.braun.10.unsat.opb |
MD5SUM | 9966752c0ad702d51e91e911364f1cfa |
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 | 863.321 |
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 | 1111 |
Total number of constraints | 3756 |
Number of constraints which are clauses | 3756 |
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 | 19 |
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 | 17 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 36 |
Number of bits of the biggest sum of numbers | 6 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |