Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/plato.asu.edu/ pub/milp/normalized-mps-v2-20-10-qap10.opb |
MD5SUM | 92cff40bf32fe691e5181dcb856d7399 |
Bench Category | OPT-BIGINT (optimisation, big integers) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 170 |
Best CPU time to get the best result obtained on this benchmark | 1800.64 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 170 |
Optimality of the best value was proved | NO |
Number of variables | 83000 |
Total number of constraints | 1820 |
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 | 1820 |
Minimum length of a constraint | 200 |
Maximum length of a constraint | 200 |
Number of terms in the objective function | 52200 |
Biggest coefficient in the objective function | 26214400 |
Number of bits for the biggest coefficient in the objective function | 25 |
Sum of the numbers in the objective function | 24146585100 |
Number of bits of the sum of numbers in the objective function | 35 |
Biggest number in a constraint | 26214400 |
Number of bits of the biggest number in a constraint | 25 |
Biggest sum of numbers in a constraint | 24146585100 |
Number of bits of the biggest sum of numbers | 35 |
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 Resolution 2.1.1 (complete) | 1856033 | SAT (TO) | 170 | 1800.64 | 1796.47 |
SAT4J Pseudo CP 2.1.1 (complete) | 1856032 | SAT (TO) | 177 | 1800.58 | 1778.85 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 170--too large--