Name | normalized-PB06/SATUNSAT-SMALLINT/web/ uclid_pb_benchmarks/normalized-37s.smv.opb |
MD5SUM | c32b20024d9dbe3bb08a79a9b8e2d75c |
Bench Category | DEC-SMALLINT (no optimisation, small integers) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.007997 |
Has Objective Function | NO |
Satisfiable | NO |
(Un)Satisfiability was proved | YES |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 1190 |
Total number of constraints | 3183 |
Number of constraints which are clauses | 3055 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 128 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Number of terms in the objective function | 0 |
Biggest coefficient in the objective function | 0 |
Number of bits for the biggest coefficient in the objective function | 0 |
Sum of the numbers in the objective function | 0 |
Number of bits of the sum of numbers in the objective function | 0 |
Biggest number in a constraint | 43 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 136 |
Number of bits of the biggest sum of numbers | 8 |
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: