| Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/ftp.netlib.org/ lp/data/normalized-mps-v2-20-10-pilot.we.opb |
| MD5SUM | 78c28cbc46584ca3f2053cae625d9faa |
| Bench Category | OPT-BIGINT (optimisation, big integers) |
| 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 | 24.4943 |
| Has Objective Function | YES |
| Satisfiable | NO |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 77678 |
| Total number of constraints | 1016 |
| 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 | 1016 |
| Minimum length of a constraint | 10 |
| Maximum length of a constraint | 2430 |
| Number of terms in the objective function | 2760 |
| Biggest coefficient in the objective function | 114621939712000000000 |
| Number of bits for the biggest coefficient in the objective function | 67 |
| Sum of the numbers in the objective function | 6133849937192095161813 |
| Number of bits of the sum of numbers in the objective function | 73 |
| Biggest number in a constraint | 114621939712000000000 |
| Number of bits of the biggest number in a constraint | 67 |
| Biggest sum of numbers in a constraint | 6133849937192095161813 |
| Number of bits of the biggest sum of numbers | 73 |
| 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) | 1856186 | UNSAT | 24.4943 | 21.6991 | |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1856187 | ? (TO) | 1800.86 | 1794.75 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: