Name | /OPT-BIGINT-LIN/zahidi/MH+IC/ normalized-minisat25_4_7_0_mh_ic.opb |
MD5SUM | d1abf7b4963ec923523ad7cbca6393af |
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 | 4905751 |
Best CPU time to get the best result obtained on this benchmark | 1800.04 |
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 | 45775 |
Total number of constraints | 102733 |
Number of constraints which are clauses | 71450 |
Number of constraints which are cardinality constraints (but not clauses) | 33 |
Number of constraints which are nor clauses,nor cardinality constraints | 31250 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 925 |
Number of terms in the objective function | 17425 |
Biggest coefficient in the objective function | 160103007 |
Number of bits for the biggest coefficient in the objective function | 28 |
Sum of the numbers in the objective function | 18442352201 |
Number of bits of the sum of numbers in the objective function | 35 |
Biggest number in a constraint | 160103007 |
Number of bits of the biggest number in a constraint | 28 |
Biggest sum of numbers in a constraint | 18442352201 |
Number of bits of the biggest sum of numbers | 35 |
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: 5910068--too large--