| Name | /PARTIAL-BIGINT-LIN/wcsp/spot5/ normalized-spot5-29_wcsp.wbo |
| MD5SUM | 429cc4a9012eaf2031e2cb9a0fbbc756 |
| 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 | 8059 |
| Best CPU time to get the best result obtained on this benchmark | 75.6 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 202 |
| Total number of constraints | 774 |
| Number of soft constraints | 692 |
| Number of constraints which are clauses | 692 |
| Number of constraints which are cardinality constraints (but not clauses) | 82 |
| 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 | 20092 |
| Min constraint cost | 1 |
| Max constraint cost | 20092 |
| Sum of constraints costs | 12276211 |
| 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 |
|---|---|---|---|---|
| Sat4j PB 2012-05-28 (complete) | 3718004 | OPTIMUM | 75.6 | 73.7699 |
| npSolver 1.0 (complete) | 3713437 | OPTIMUM | 242.959 | 243.131 |
| npSolver inc (complete) | 3714130 | OPTIMUM | 248.685 | 248.75 |
| toysat 2012-05-17 (complete) | 3711926 | OPTIMUM | 260.44 | 260.606 |
| wbo2satCp2 2012-05-19 (complete) | 3716902 | OPTIMUM | 287.55 | 287.683 |
| wbo2sat 2012-05-19 (complete) | 3716209 | OPTIMUM | 294.183 | 294.25 |
| npSolver inc (fixed) (complete) | 3754204 | OPTIMUM | 765.129 | 765.253 |
| npSolver 1.0 (fixed) (complete) | 3754897 | OPTIMUM | 771.773 | 771.908 |
| npSolver inc-topdown-quickBound (fixed) (complete) | 3752818 | ? (TO) | 1800.09 | 1795.11 |
| npSolver inc-topDown (complete) | 3714823 | ? (TO) | 1800.11 | 1800.41 |
| npSolver inc-topdown-quickBound (complete) | 3715516 | ? (TO) | 1800.12 | 1804.11 |
| npSolver inc-topDown (fixed) (complete) | 3753511 | ? (TO) | 1800.13 | 1805.12 |
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: 8059x1 -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 -x196 -x197 -x198 -x199 -x200 x201 -x202