Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=7-P0=5-P1=11-P2=79-P3=109-B.opb |
MD5SUM | 0a27d79e1432beae6ac37c69ce20353c |
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 | 3 |
Best CPU time to get the best result obtained on this benchmark | 0.035993 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 3 |
Optimality of the best value was proved | YES |
Number of variables | 63 |
Total number of constraints | 7 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 7 |
Minimum length of a constraint | 7 |
Maximum length of a constraint | 63 |
Number of terms in the objective function | 7 |
Biggest coefficient in the objective function | 64 |
Number of bits for the biggest coefficient in the objective function | 7 |
Sum of the numbers in the objective function | 127 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 8192 |
Number of bits of the biggest number in a constraint | 14 |
Biggest sum of numbers in a constraint | 32512 |
Number of bits of the biggest sum of numbers | 15 |
Number of products (including duplicates) | 147 |
Sum of products size (including duplicates) | 294 |
Number of different products | 147 |
Sum of products size | 294 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4113845 | OPT | 3 | 0.035993 | 0.0353949 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106312 | OPT | 3 | 3.2935 | 1.92929 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106311 | OPT | 3 | 10.6934 | 5.24242 |
toysat 2016-05-02 (complete) | 4106310 | OPT | 3 | 359.31 | 359.365 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3x1 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 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 x29 -x30 x31 x32 x33 -x34 -x35 -x43 x44 -x45 -x46 -x47 -x48 -x49 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 x36 x37 x38 x39 x40 x41 x42 -x50 -x51 -x52 -x53 x54 -x55 -x56 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 x203 x204 x205 x206 x207 x208 x209 x210 -x57 x58 -x59 x60 x61 x62 x63