| Name | /PARTIAL-BIGINT-LIN/wcsp/driver/ normalized-driverlog01cc_wcsp.wbo |
| MD5SUM | ae3da1373d27eef810c7a9893a753cd2 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 1045 |
| Best CPU time to get the best result obtained on this benchmark | 0.042992 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 195 |
| Total number of constraints | 808 |
| Number of soft constraints | 737 |
| Number of constraints which are clauses | 737 |
| Number of constraints which are cardinality constraints (but not clauses) | 71 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 4 |
| Top cost | 11728 |
| Min constraint cost | 1 |
| Max constraint cost | 11728 |
| Sum of constraints costs | 7810208 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 5 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| PB/CT 0.1 fixed (complete) | 2700753 | OPTIMUM | 0.042992 | 0.043148 |
| SAT4J PB Resolution 2.2.1 (complete) | 2700752 | OPTIMUM | 0.467928 | 0.308584 |
| PB/CT 0.1 (complete) | 2700751 | Wrong UNSAT | 0.017996 | 0.0180771 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2700748 | Wrong UNSAT | 0.285956 | 0.256391 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2700749 | Wrong UNSAT | 0.291955 | 0.253036 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2700750 | Wrong UNSAT | 0.359944 | 1.2434 |
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: 1045x1 -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 x73 -x74 -x75 x76 -x77 -x78 -x79 x80 -x81 -x82 -x83 x84 -x85 -x86 -x87 x88 -x89 x90 -x91 x92 x93 -x94 -x95 x96 -x97 -x98 x99 x100 -x101 -x102 -x103 x104 -x105 -x106 x107 -x108 -x109 x110 -x111 -x112 x113 -x114 -x115 x116 -x117 -x118 -x119 x120 -x121 -x122 -x123 x124 -x125 -x126 -x127 x128 -x129 x130 -x131 x132 x133 -x134 -x135 -x136 x137 x138 -x139 -x140 x141 -x142 x143 -x144 -x145 x146 -x147 -x148 x149 -x150 -x151 x152 -x153 -x154 -x155 x156 -x157 -x158 -x159 x160 -x161 -x162 -x163 x164 -x165 x166 -x167 x168 x169 -x170 -x171 -x172 x173 -x174 x175 x176 -x177 x178 -x179 x180 -x181 x182 -x183 -x184 x185 -x186 x187 -x188 x189 -x190 x191 -x192 x193 x194 -x195