| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9010_6-unsat--soft-66-100-0.wbo |
| MD5SUM | 5d7aea7a0e3c8d0b9f22ec2921124ff8 |
| 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 | 9 |
| Best CPU time to get the best result obtained on this benchmark | 0.167974 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 16744 |
| Total number of constraints | 52975 |
| Number of soft constraints | 17935 |
| Number of constraints which are clauses | 52611 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 364 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 72 |
| Top cost | 908194 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 908193 |
| Biggest number in a constraint | 41 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 413 |
| Number of bits of the biggest sum of numbers | 9 |
| 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: 9--too large--