| Name | PB24/normalized-PB06/OPT-LIN/submitted-PB06/roussel/factor/ normalized-factor-sizeN=200-sizeP=101-sizeQ=200-410184650-max.opb |
| MD5SUM | 7019383684b6a8bf7ad7b84e6b4410bb |
| Bench Category | OPT-LIN (optimization problem, linear constraints, no OPT/UNSAT certificate) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | -193 |
| Best CPU time to get the best result obtained on this benchmark | 2687.89 |
| Has Objective Function | YES |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 20501 |
| Total number of constraints | 60601 |
| Number of constraints which are clauses | 60600 |
| 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 | 20200 |
| Number of terms in the objective function | 101 |
| Biggest coefficient in the objective function | 1267650600228229401496703205376 |
| Number of bits for the biggest coefficient in the objective function | 101 |
| Sum of the numbers in the objective function | 2535301200456458802993406410751 |
| Number of bits of the sum of numbers in the objective function | 101 |
| Biggest number in a constraint | 1018517988167243043134222844204689080525734196832968125318070224677190649881668353091698688 |
| Number of bits of the biggest number in a constraint | 300 |
| Biggest sum of numbers in a constraint | 4074071952668972172536891376818271167362115627974489459407595858486846194981300150535267275 |
| Number of bits of the biggest sum of numbers | 301 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |