Name | /OPT-BIGINT-LIN/ heinz/normalized-zib01.opb |
MD5SUM | 8f491d5bc2eb927e9b611fe56423c3ea |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
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 | 12471400 |
Total number of constraints | 5887041 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 3671487 |
Number of constraints which are nor clauses,nor cardinality constraints | 2215554 |
Minimum length of a constraint | 3 |
Maximum length of a constraint | 162 |
Number of terms in the objective function | 12471400 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 12471400 |
Number of bits of the sum of numbers in the objective function | 24 |
Biggest number in a constraint | 56 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 12471400 |
Number of bits of the biggest sum of numbers | 24 |
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 | CPU time | Wall clock time |
---|---|---|---|---|
MinisatID 2.4.8-gmp [DEPRECATED] (complete) | 3479308 | ? (MO) | 231.23 | 231.284 |
MinisatID 2.5.2-gmp (fixed) (complete) | 3498212 | ? (MO) | 250.016 | 250.012 |
Sat4j Resolution 2.3.0 (complete) | 3479307 | ? (TO) | 1800.3 | 1519.39 |
Sat4j Res//CP 2.3.0 (complete) | 3479305 | ? (TO) | 1800.45 | 1451.96 |
Sat4j CuttingPlanes 2.3.0 (complete) | 3479306 | ? (TO) | 1800.57 | 1493.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: