Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/plato.asu.edu/ pub/unibo/normalized-mps-v2-20-10-B2C1S1.opb |
MD5SUM | a5c62cef1e86c64304fd5ef232ab5991 |
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 | 107808 |
Total number of constraints | 3904 |
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 | 3904 |
Minimum length of a constraint | 31 |
Maximum length of a constraint | 1440 |
Number of terms in the objective function | 38688 |
Biggest coefficient in the objective function | 348966092800 |
Number of bits for the biggest coefficient in the objective function | 39 |
Sum of the numbers in the objective function | 299074813804544 |
Number of bits of the sum of numbers in the objective function | 49 |
Biggest number in a constraint | 348966092800 |
Number of bits of the biggest number in a constraint | 39 |
Biggest sum of numbers in a constraint | 299074813804544 |
Number of bits of the biggest sum of numbers | 49 |
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) | 1856152 | ? (TO) | 1800.28 | 1778.07 | |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1856153 | ? (TO) | 1801.01 | 1792.44 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: