Name | /OPT-BIGINT-LIN/leberre/opb-paranoid/misc2010/datasets/ 10orplus/normalized-codebreaker.cudf.paranoid.opb |
MD5SUM | b0b0977e9ec037181e9f3d33c57febaf |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 193395 |
Best CPU time to get the best result obtained on this benchmark | 710.886 |
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 | 19770 |
Total number of constraints | 96411 |
Number of constraints which are clauses | 94846 |
Number of constraints which are cardinality constraints (but not clauses) | 1565 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 2962 |
Number of terms in the objective function | 7254 |
Biggest coefficient in the objective function | 4296 |
Number of bits for the biggest coefficient in the objective function | 13 |
Sum of the numbers in the objective function | 12720454 |
Number of bits of the sum of numbers in the objective function | 24 |
Biggest number in a constraint | 4296 |
Number of bits of the biggest number in a constraint | 13 |
Biggest sum of numbers in a constraint | 12720454 |
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 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 193395--too large--