| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf8.ucl--soft-33-100-0.wbo |
| MD5SUM | 0213af97bcb368564904cb77675881c0 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 0.302953 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 6059 |
| Total number of constraints | 16684 |
| Number of soft constraints | 11088 |
| Number of constraints which are clauses | 15940 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 744 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 559152 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 559151 |
| Biggest number in a constraint | 34 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 127 |
| Number of bits of the biggest sum of numbers | 7 |
| 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: 1-x6051 -x6052 x6053 -x6054 x6055 -x6056 -x6057 -x6058 x6059