Name | normalized-PB06/OPT-MEDINT/mps-v2-20-10/plato.asu.edu/ pub/milp/normalized-mps-v2-20-10-neos9.opb |
MD5SUM | 9b565ffd2f62b11d1859d685ea38235b |
Bench Category | OPT-MEDINT (optimisation, medium 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 | 874498 |
Total number of constraints | 110909 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 87 |
Number of constraints which are nor clauses,nor cardinality constraints | 110822 |
Minimum length of a constraint | 11 |
Maximum length of a constraint | 14080 |
Number of terms in the objective function | 198658 |
Biggest coefficient in the objective function | 1024 |
Number of bits for the biggest coefficient in the objective function | 11 |
Sum of the numbers in the objective function | 38727219 |
Number of bits of the sum of numbers in the objective function | 26 |
Biggest number in a constraint | 30720 |
Number of bits of the biggest number in a constraint | 15 |
Biggest sum of numbers in a constraint | 38727219 |
Number of bits of the biggest sum of numbers | 26 |
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) | 1855303 | ? (TO) | 1800.44 | 1790.02 | |
SAT4J Pseudo CP 2.1.1 (complete) | 1855302 | ? (TO) | 1800.54 | 1675.34 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: