| Name | /PARTIAL-SMALLINT-LIN/wcsp/jnh/ normalized-jnh301_wcsp.wbo |
| MD5SUM | 43b9aaaba58886f82a61abd15f4e868b |
| 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 | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.199969 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 200 |
| Total number of constraints | 1000 |
| Number of soft constraints | 900 |
| Number of constraints which are clauses | 900 |
| Number of constraints which are cardinality constraints (but not clauses) | 100 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 14 |
| Top cost | 444855 |
| Min constraint cost | 1 |
| Max constraint cost | 1000 |
| Sum of constraints costs | 444854 |
| Biggest number in a constraint | 13 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 27 |
| Number of bits of the biggest sum of numbers | 5 |
| 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: 0x27 -x26 x25 x24 -x23 -x22 x21 -x20 x19 -x18 x17 -x16 x15 -x14 x13 -x12 x11 -x10 x9 -x8 x7 -x6 x5 x4 -x3 -x2 x1