Name | /OPT-BIGINT-LIN/zahidi/Multihop/ normalized-minisat25_6_4_6_mh.opb |
MD5SUM | 94b1451a4cda8c04cd1bd81816dea3d0 |
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 | 5637187 |
Best CPU time to get the best result obtained on this benchmark | 1800.02 |
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 | 31350 |
Total number of constraints | 73332 |
Number of constraints which are clauses | 57050 |
Number of constraints which are cardinality constraints (but not clauses) | 32 |
Number of constraints which are nor clauses,nor cardinality constraints | 16250 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 925 |
Number of terms in the objective function | 16825 |
Biggest coefficient in the objective function | 155720872 |
Number of bits for the biggest coefficient in the objective function | 28 |
Sum of the numbers in the objective function | 17732231209 |
Number of bits of the sum of numbers in the objective function | 35 |
Biggest number in a constraint | 155720872 |
Number of bits of the biggest number in a constraint | 28 |
Biggest sum of numbers in a constraint | 17732231209 |
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: 5687138--too large--