Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-edgecross10-020.opb |
MD5SUM | 1759a7eaa781538581429c8c946afc38 |
Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 11 |
Best CPU time to get the best result obtained on this benchmark | 1.27781 |
Has Objective Function | YES |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 91 |
Total number of constraints | 481 |
Number of constraints which are clauses | 480 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 3 |
Number of terms in the objective function | 206 |
Biggest coefficient in the objective function | 85 |
Number of bits for the biggest coefficient in the objective function | 7 |
Sum of the numbers in the objective function | 529 |
Number of bits of the sum of numbers in the objective function | 10 |
Biggest number in a constraint | 85 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 529 |
Number of bits of the biggest sum of numbers | 10 |
Number of products (including duplicates) | 147 |
Sum of products size (including duplicates) | 294 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4119267 | OPT | 11 | 1.27781 | 1.27926 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119266 | OPT | 11 | 178.15 | 176.742 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119265 | OPT | 11 | 357.68 | 190.042 |
toysat 2016-05-02 (complete) | 4119264 | ? (TO) | 1800.01 | 1800.51 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 11-x1 -x92 x81 -x93 x94 x86 -x95 -x54 -x96 -x97 x83 -x98 -x99 -x4 -x100 -x101 -x71 -x102 -x72 -x103 x84 -x104 x87 -x105 -x5 x50 -x106 -x60 -x107 x62 -x108 -x74 -x109 x90 -x110 -x6 -x111 -x112 -x113 x7 -x114 x115 -x116 -x117 -x118 -x119 -x120 -x9 -x121 -x122 -x123 -x10 -x124 -x125 -x11 -x126 -x12 -x127 -x128 -x129 -x130 x131 x13 -x132 -x133 -x134 x135 -x136 -x14 -x65 -x137 -x66 -x138 -x139 -x140 -x141 -x142 -x15 x47 -x143 -x144 -x145 -x68 -x146 -x147 -x148 -x16 -x149 -x150 -x17 -x151 -x152 -x18 -x153 -x154 -x155 -x19 -x156 -x157 -x158 -x21 -x159 -x160 -x161 -x23 -x162 -x163 -x164 -x24 -x165 x25 -x166 -x167 -x168 x169 x170 x171 x26 -x172 -x173 x174 x75 x175 x176 x27 x177 x178 x28 -x179 -x180 -x181 -x182 x183 x184 x185 -x186 -x29 -x187 -x188 -x189 -x63 -x190 -x191 -x30 -x192 -x193 -x31 -x194 -x195 -x196 -x32 -x197 -x198 -x33 -x199 -x200 -x34 -x201 -x202 -x203 -x204 -x205 -x206 -x35 -x207 -x208 -x36 -x209 -x210 x211 -x212 -x38 -x213 -x214 -x215 -x216 -x217 -x39 -x218 x219 x40 -x220 -x221 -x222 -x41 -x223 -x224 -x225 -x42 -x226 -x43 -x227 -x228 -x229 -x230 -x231 -x232 -x233 -x234 -x44 -x235 -x236 -x237 -x45 -x238 x91 x2 -x3 -x8 -x20 -x22 x37 -x46 -x48 -x49 -x51 x52 -x53 -x55 -x56 -x57 x58 -x59 -x61 x64 x67 x69 x70 x73 -x76 -x77 -x78 -x79 -x80 x82 x85 -x88 -x89