| Name | /SOFT-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf6.ucl--soft-0-100-0.wbo |
| MD5SUM | 86c5d97f0ed50bca48960b88ee0ccb00 |
| Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.000999 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 67 |
| Total number of constraints | 132 |
| Number of soft constraints | 132 |
| Number of constraints which are clauses | 120 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 12 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 7 |
| Top cost | 6582 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 6581 |
| Biggest number in a constraint | 10 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 31 |
| 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: 2-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