Name | /OPT-BIGINT-LIN/zahidi/Large/ normalized-minisat100_16_6_5_ic.opb |
MD5SUM | 6addefc6c4fab0b060566769c28f9c6a |
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 | 15413119 |
Best CPU time to get the best result obtained on this benchmark | 1801.3 |
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 | 1000400 |
Total number of constraints | 2000307 |
Number of constraints which are clauses | 980300 |
Number of constraints which are cardinality constraints (but not clauses) | 7 |
Number of constraints which are nor clauses,nor cardinality constraints | 1020000 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 4950 |
Number of terms in the objective function | 29800 |
Biggest coefficient in the objective function | 170953875 |
Number of bits for the biggest coefficient in the objective function | 28 |
Sum of the numbers in the objective function | 187029967016 |
Number of bits of the sum of numbers in the objective function | 38 |
Biggest number in a constraint | 170953875 |
Number of bits of the biggest number in a constraint | 28 |
Biggest sum of numbers in a constraint | 187029967016 |
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: 17114153--too large--