Name | /OPT-BIGINT-LIN/sroussel/BA/ normalized-BA_RDC4.dot_luby_50null20mast_rapportOE1.0_TMAX180_K67_cod3.opb |
MD5SUM | b8f34acad8e16997bb6a57bf03c5bda5 |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | -5138 |
Best CPU time to get the best result obtained on this benchmark | 1800.19 |
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 | 16038 |
Biggest coefficient in the objective function | 256 |
Number of bits for the biggest coefficient in the objective function | 9 |
Sum of the numbers in the objective function | 1664916 |
Number of bits of the sum of numbers in the objective function | 21 |
Biggest number in a constraint | 256 |
Number of bits of the biggest number in a constraint | 9 |
Biggest sum of numbers in a constraint | 1664916 |
Number of bits of the biggest sum of numbers | 21 |
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: -5138--too large--