| Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/plato.asu.edu/ pub/unibo/normalized-mps-v2-20-10-NSR8K.opb |
| MD5SUM | cc5d7ea426a09a5b1cb030d82bbe1743 |
| Bench Category | OPT-BIGINT (optimisation, big integers) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| 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 | 221520 |
| Total number of constraints | 6283 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 6283 |
| Minimum length of a constraint | 45 |
| Maximum length of a constraint | 221520 |
| Number of terms in the objective function | 221520 |
| Biggest coefficient in the objective function | 536870912000000000000 |
| Number of bits for the biggest coefficient in the objective function | 69 |
| Sum of the numbers in the objective function | 34400198927214221876937 |
| Number of bits of the sum of numbers in the objective function | 75 |
| Biggest number in a constraint | 536870912000000000000 |
| Number of bits of the biggest number in a constraint | 69 |
| Biggest sum of numbers in a constraint | 34400301327214221876937 |
| Number of bits of the biggest sum of numbers | 75 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SAT4J Pseudo CP 2.1.1 (complete) | 1856146 | ? (TO) | 1800.31 | 1782.78 | |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1856147 | ? (TO) | 1800.33 | 1782.77 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: