Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/plato.asu.edu/ pub/unibo/normalized-mps-v2-20-10-dc1c.opb |
MD5SUM | aae7296985adde1f17776b4f5ad45572 |
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 | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 17863355069035520 |
Optimality of the best value was proved | NO |
Number of variables | 58150 |
Total number of constraints | 1648 |
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 | 1648 |
Minimum length of a constraint | 31 |
Maximum length of a constraint | 58150 |
Number of terms in the objective function | 58150 |
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 | 6807821537690881562733 |
Number of bits of the sum of numbers in the objective function | 73 |
Biggest number in a constraint | 536870912000000000000 |
Number of bits of the biggest number in a constraint | 69 |
Biggest sum of numbers in a constraint | 6808845537690881562733 |
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) | 1856134 | ? (TO) | 1800.24 | 1766.14 | |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1856135 | ? (TO) | 1800.51 | 1791.62 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: