Name | /OPT-BIGINT-LIN/zahidi/MH+IC/ normalized-minisat35_4_11_9_mh_ic.opb |
MD5SUM | 35d83572ac6ace98816feaf09e0a147d |
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 | 5734377 |
Best CPU time to get the best result obtained on this benchmark | 1800.07 |
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 | 126385 |
Total number of constraints | 286973 |
Number of constraints which are clauses | 201180 |
Number of constraints which are cardinality constraints (but not clauses) | 43 |
Number of constraints which are nor clauses,nor cardinality constraints | 85750 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 1820 |
Number of terms in the objective function | 46445 |
Biggest coefficient in the objective function | 132651000 |
Number of bits for the biggest coefficient in the objective function | 27 |
Sum of the numbers in the objective function | 41743355515 |
Number of bits of the sum of numbers in the objective function | 36 |
Biggest number in a constraint | 132651000 |
Number of bits of the biggest number in a constraint | 27 |
Biggest sum of numbers in a constraint | 41743355515 |
Number of bits of the biggest sum of numbers | 36 |
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: 5734377--too large--