Name | /OPT-BIGINT-LIN/zahidi/Base/ normalized-minisat100_4_32_6.opb |
MD5SUM | f19aad2da4bea8b48e35d4e26f93e3de |
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 | 5657601 |
Best CPU time to get the best result obtained on this benchmark | 1800.41 |
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 | 20200 |
Total number of constraints | 30206 |
Number of constraints which are clauses | 200 |
Number of constraints which are cardinality constraints (but not clauses) | 6 |
Number of constraints which are nor clauses,nor cardinality constraints | 30000 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 4950 |
Number of terms in the objective function | 19900 |
Biggest coefficient in the objective function | 150568768 |
Number of bits for the biggest coefficient in the objective function | 28 |
Sum of the numbers in the objective function | 176505017008 |
Number of bits of the sum of numbers in the objective function | 38 |
Biggest number in a constraint | 150568768 |
Number of bits of the biggest number in a constraint | 28 |
Biggest sum of numbers in a constraint | 176505017008 |
Number of bits of the biggest sum of numbers | 38 |
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: 6163473--too large--