Name | /OPT-BIGINT-LIN/zahidi/IC/ normalized-minisat50_6_9_8_ic.opb |
MD5SUM | 579086081fadd70cb8f17f26654d7fe6 |
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 | 20224039 |
Best CPU time to get the best result obtained on this benchmark | 1800.23 |
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 | 125200 |
Total number of constraints | 250157 |
Number of constraints which are clauses | 120150 |
Number of constraints which are cardinality constraints (but not clauses) | 7 |
Number of constraints which are nor clauses,nor cardinality constraints | 130000 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 1225 |
Number of terms in the objective function | 7400 |
Biggest coefficient in the objective function | 157464000 |
Number of bits for the biggest coefficient in the objective function | 28 |
Sum of the numbers in the objective function | 48881177800 |
Number of bits of the sum of numbers in the objective function | 36 |
Biggest number in a constraint | 157464000 |
Number of bits of the biggest number in a constraint | 28 |
Biggest sum of numbers in a constraint | 48881177800 |
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: 32510607--too large--