| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-41-40--soft-66-100-0.wbo |
| MD5SUM | b19b36a9eeef0aa91319f6277ed84276 |
| 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.334948 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1640 |
| Total number of constraints | 81 |
| Number of soft constraints | 21 |
| Number of constraints which are clauses | 41 |
| Number of constraints which are cardinality constraints (but not clauses) | 40 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 40 |
| Maximum length of a constraint | 41 |
| Top cost | 1107 |
| Min constraint cost | 1 |
| Max constraint cost | 96 |
| Sum of constraints costs | 1106 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 42 |
| Number of bits of the biggest sum of numbers | 6 |
| 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-x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1