Name | /OPT-BIGINT-LIN/leberre/opb-paranoid/misc2010/random/ rand.smallist/normalized-randea4da3.cudf.paranoid.opb |
MD5SUM | 0edd398b01ee94c58887c0bed557a63b |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.041992 |
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 | 6316 |
Total number of constraints | 19500 |
Number of constraints which are clauses | 19499 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 1147 |
Number of terms in the objective function | 2993 |
Biggest coefficient in the objective function | 1850 |
Number of bits for the biggest coefficient in the objective function | 11 |
Sum of the numbers in the objective function | 2120098 |
Number of bits of the sum of numbers in the objective function | 22 |
Biggest number in a constraint | 1850 |
Number of bits of the biggest number in a constraint | 11 |
Biggest sum of numbers in a constraint | 2120098 |
Number of bits of the biggest sum of numbers | 22 |
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: