| Name | /OPT-BIGINT-LIN/sroussel/NG/ normalized-NG.dot_unif_50null50mast_rapportOE1.0_TMAX15_K192_cod1.opb |
| MD5SUM | 12f5961a7e0e18d3559009517737c81e |
| Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | -50 |
| Best CPU time to get the best result obtained on this benchmark | 1800.37 |
| 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 | 399113 |
| Total number of constraints | 400980 |
| Number of constraints which are clauses | 399002 |
| Number of constraints which are cardinality constraints (but not clauses) | 1977 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 397089 |
| Number of terms in the objective function | 170372 |
| Biggest coefficient in the objective function | 50 |
| Number of bits for the biggest coefficient in the objective function | 6 |
| Sum of the numbers in the objective function | 8511533 |
| Number of bits of the sum of numbers in the objective function | 24 |
| Biggest number in a constraint | 50 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 8511533 |
| Number of bits of the biggest sum of numbers | 24 |
| 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: -50--too large--