Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/plato.asu.edu/ pub/milp/normalized-mps-v2-20-10-dano3_3.opb |
MD5SUM | 1c7fb7925778882f8c8001dcd3838f28 |
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 | 404796 |
Total number of constraints | 3709 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 3 |
Number of constraints which are nor clauses,nor cardinality constraints | 3706 |
Minimum length of a constraint | 11 |
Maximum length of a constraint | 15900 |
Number of terms in the objective function | 30 |
Biggest coefficient in the objective function | 536870912 |
Number of bits for the biggest coefficient in the objective function | 30 |
Sum of the numbers in the objective function | 1073741823 |
Number of bits of the sum of numbers in the objective function | 30 |
Biggest number in a constraint | 134217728000 |
Number of bits of the biggest number in a constraint | 37 |
Biggest sum of numbers in a constraint | 569083166190 |
Number of bits of the biggest sum of numbers | 40 |
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) | 1856069 | ? (TO) | 1800.3 | 1793.92 | |
SAT4J Pseudo CP 2.1.1 (complete) | 1856068 | ? (TO) | 1800.34 | 1751.65 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: