Name | /OPT-BIGINT-LIN/sroussel/BA/ normalized-BA_RDC4.dot_unif_0null50mast_rapportOE2.0_TMAX15_K67_cod1.opb |
MD5SUM | ec37fc0f57203c1e0a2a29b72d6435e0 |
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 | -4355 |
Best CPU time to get the best result obtained on this benchmark | 1477.86 |
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 | 40451 |
Total number of constraints | 40950 |
Number of constraints which are clauses | 40396 |
Number of constraints which are cardinality constraints (but not clauses) | 553 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 40128 |
Number of terms in the objective function | 32076 |
Biggest coefficient in the objective function | 1000 |
Number of bits for the biggest coefficient in the objective function | 10 |
Sum of the numbers in the objective function | 24278430 |
Number of bits of the sum of numbers in the objective function | 25 |
Biggest number in a constraint | 1000 |
Number of bits of the biggest number in a constraint | 10 |
Biggest sum of numbers in a constraint | 24278430 |
Number of bits of the biggest sum of numbers | 25 |
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: -4355--too large--