| Name | /PARTIAL-SMALLINT-LIN/wcsp/pedigree/ normalized-connell_wcsp.wbo |
| MD5SUM | 20c28e16897beaca59805955de4cf286 |
| 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.003998 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 72 |
| Total number of constraints | 1151 |
| Number of soft constraints | 1139 |
| Number of constraints which are clauses | 1139 |
| Number of constraints which are cardinality constraints (but not clauses) | 12 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 6 |
| Top cost | 8 |
| Min constraint cost | 1 |
| Max constraint cost | 8 |
| Sum of constraints costs | 8867 |
| Biggest number in a constraint | 2 |
| Number of bits of the biggest number in a constraint | 2 |
| Biggest sum of numbers in a constraint | 7 |
| Number of bits of the biggest sum of numbers | 3 |
| 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-x1 -x2 -x3 x4 -x5 -x6 -x7 -x8 -x9 -x10 x11 -x12 -x13 -x14 -x15 x16 -x17 -x18 -x19 -x20 -x21 -x22 x23 -x24 -x25 -x26 -x27 -x28 x29 -x30 x31 -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 x40 -x41 -x42 -x43 x44 -x45 -x46 -x47 -x48 -x49 -x50 -x51 -x52 x53 -x54 -x55 -x56 -x57 x58 -x59 -x60 -x61 x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 x71 -x72