| Name | normalized-PB06/SATUNSAT-SMALLINT/ submitted-PB06/roussel/normalized-pigeon-cardinality-51-50.opb |
| MD5SUM | 285c24e978af8153c6a378b9af59f522 |
| Bench Category | DEC-SMALLINT-LIN (no optimisation, small integers, linear constraints) |
| 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 | 0.047992 |
| 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 | 2550 |
| Total number of constraints | 101 |
| Number of constraints which are clauses | 51 |
| Number of constraints which are cardinality constraints (but not clauses) | 50 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 50 |
| Maximum length of a constraint | 51 |
| 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 | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 52 |
| 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 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: