| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-25s.smv--soft-33-100-0.wbo |
| MD5SUM | 24165b373ac62bb316922f56a500ddfe |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.154976 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 5072 |
| Total number of constraints | 12829 |
| Number of soft constraints | 8490 |
| Number of constraints which are clauses | 11721 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1108 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 429589 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 429588 |
| Biggest number in a constraint | 165 |
| Number of bits of the biggest number in a constraint | 8 |
| Biggest sum of numbers in a constraint | 546 |
| Number of bits of the biggest sum of numbers | 10 |
| 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).
cost of falsified constraints: 2x5062 x5063 x5064 x5065 -x5066 -x5067 x5068 x5069 x5070 x5071 x5072