0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2664773-1276592975.opb>
0.00/0.03 c original problem has 363 variables (363 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.03 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.02/0.04 o 363
0.02/0.04 c feasible solution found by trivial heuristic, objective value 3.630000e+02
0.02/0.04 c presolving:
0.02/0.05 c (round 1) 1 del vars, 12 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.02/0.05 c (round 2) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.02/0.06 c (round 3) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 46 upgd conss, 0 impls, 0 clqs
0.02/0.06 c (0.0s) probing: 101/362 (27.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.02/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.06 c presolving (4 rounds):
0.02/0.06 c 1 deleted vars, 32 deleted constraints, 1 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.02/0.06 c 0 implications, 0 cliques
0.02/0.06 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 46 constraints
0.02/0.06 c 46 constraints of type <logicor>
0.02/0.06 c transformed objective value is always integral (scale: 1)
0.02/0.06 c Presolving Time: 0.02
0.02/0.06 c - non default parameters ----------------------------------------------------------------------
0.02/0.06 c # SCIP version 1.2.1.2
0.02/0.06 c
0.02/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c conflict/interconss = 0
0.02/0.06 c
0.02/0.06 c # should binary conflicts be preferred?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c conflict/preferbinary = TRUE
0.02/0.06 c
0.02/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c constraints/agelimit = 1
0.02/0.06 c
0.02/0.06 c # should enforcement of pseudo solution be disabled?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/disableenfops = TRUE
0.02/0.06 c
0.02/0.06 c # frequency for displaying node information lines
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.06 c display/freq = 10000
0.02/0.06 c
0.02/0.06 c # maximal time in seconds to run
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/time = 1799.98
0.02/0.06 c
0.02/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/memory = 1620
0.02/0.06 c
0.02/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c lp/solvefreq = -1
0.02/0.06 c
0.02/0.06 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.02/0.06 c # [type: char, range: {lafpsqd}, default: l]
0.02/0.06 c lp/pricing = a
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify inequalities
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/linear/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify knapsacks
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # priority of node selection rule <dfs> in standard mode
0.02/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.02/0.06 c nodeselection/dfs/stdpriority = 1000000
0.02/0.06 c
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c start solving
0.02/0.06 c
0.02/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.06 c t 0.0s| 1 | 2 | 0 | - |1372k| 0 | - | 362 | 46 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 3.630000e+02 | Large
0.10/0.10 o 6
0.10/0.10 c * 0.1s| 358 | 355 | 0 | 0.0 |1534k| 357 | - | 362 | 46 | 0 | 0 | 0 | 0 | 0 | 2.000000e+00 | 6.000000e+00 | 200.00%
0.59/0.63 o 5
0.59/0.63 c * 0.5s| 3386 | 314 | 0 | 0.0 |1603k| 358 | - | 362 | 46 | 0 | 0 | 0 | 754 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
2.49/2.57 c 2.3s| 10000 | 292 | 0 | 0.0 |1664k| 358 | - | 362 | 48 | 0 | 0 | 0 |2856 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
5.69/5.76 c 5.2s| 20000 | 148 | 0 | 0.0 |1732k| 358 | - | 362 | 46 | 0 | 0 | 0 |5692 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
8.99/9.09 c 8.3s| 30000 | 108 | 0 | 0.0 |1755k| 358 | - | 362 | 46 | 0 | 0 | 0 |8027 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
12.69/12.70 c 11.7s| 40000 | 73 | 0 | 0.0 |1809k| 358 | - | 362 | 65 | 0 | 0 | 0 | 10k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
16.49/16.55 c 15.3s| 50000 | 83 | 0 | 0.0 |1826k| 358 | - | 362 | 46 | 0 | 0 | 0 | 12k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
20.28/20.39 c 19.0s| 60000 | 145 | 0 | 0.0 |1866k| 358 | - | 362 | 46 | 0 | 0 | 0 | 14k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
23.98/24.08 c 22.5s| 70000 | 46 | 0 | 0.0 |1858k| 358 | - | 362 | 48 | 0 | 0 | 0 | 16k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
27.59/27.67 c 25.9s| 80000 | 82 | 0 | 0.0 |1871k| 358 | - | 362 | 51 | 0 | 0 | 0 | 18k| 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
30.49/30.56 c
30.49/30.56 c SCIP Status : problem is solved [optimal solution found]
30.49/30.56 c Solving Time (sec) : 28.59
30.49/30.56 c Solving Nodes : 86843
30.49/30.56 c Primal Bound : +5.00000000000000e+00 (5 solutions)
30.49/30.56 c Dual Bound : +5.00000000000000e+00
30.49/30.56 c Gap : 0.00 %
30.49/30.56 s OPTIMUM FOUND
30.49/30.56 v -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342
30.49/30.56 v -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322
30.49/30.56 v -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301
30.49/30.56 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280
30.49/30.56 v x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259
30.49/30.56 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238
30.49/30.56 v -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217
30.49/30.56 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196
30.49/30.56 v -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176
30.49/30.56 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155
30.49/30.56 v -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134
30.49/30.56 v -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113
30.49/30.56 v -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91
30.49/30.56 v -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65
30.49/30.56 v -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40
30.49/30.56 v -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15
30.49/30.56 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
30.49/30.56 c SCIP Status : problem is solved [optimal solution found]
30.49/30.56 c Solving Time : 28.59
30.49/30.56 c Original Problem :
30.49/30.56 c Problem name : HOME/instance-2664773-1276592975.opb
30.49/30.56 c Variables : 363 (363 binary, 0 integer, 0 implicit integer, 0 continuous)
30.49/30.56 c Constraints : 78 initial, 78 maximal
30.49/30.56 c Presolved Problem :
30.49/30.56 c Problem name : t_HOME/instance-2664773-1276592975.opb
30.49/30.56 c Variables : 362 (362 binary, 0 integer, 0 implicit integer, 0 continuous)
30.49/30.56 c Constraints : 46 initial, 121 maximal
30.49/30.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
30.49/30.56 c trivial : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c dualfix : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c implics : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c probing : 0.01 0 0 0 0 0 0 0 0
30.49/30.56 c linear : 0.00 1 0 0 1 0 32 20 0
30.49/30.56 c logicor : 0.00 0 0 0 0 0 0 0 0
30.49/30.56 c root node : - 306 - - 306 - - - -
30.49/30.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
30.49/30.56 c integral : 0 0 0 0 0 0 0 0 0 0
30.49/30.56 c logicor : 46+ 0 170152 0 0 39658 24695 0 0 0
30.49/30.56 c countsols : 0 0 0 0 2 0 0 0 0 0
30.49/30.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
30.49/30.56 c integral : 0.00 0.00 0.00 0.00 0.00
30.49/30.56 c logicor : 6.89 0.00 6.89 0.00 0.00
30.49/30.56 c countsols : 0.00 0.00 0.00 0.00 0.00
30.49/30.56 c Propagators : Time Calls Cutoffs DomReds
30.49/30.56 c vbounds : 0.20 2 0 0
30.49/30.56 c rootredcost : 0.11 0 0 0
30.49/30.56 c pseudoobj : 12.69 323528 3850 8668382
30.49/30.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
30.49/30.56 c propagation : 4.83 19877 19876 19876 34.8 4 80.8 -
30.49/30.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
30.49/30.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
30.49/30.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
30.49/30.56 c pseudo solution : 0.01 158 158 158 5.7 1 212.0 -
30.49/30.56 c applied globally : - - - 14902 18.9 - - -
30.49/30.56 c applied locally : - - - 5132 79.8 - - -
30.49/30.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
30.49/30.56 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
30.49/30.56 c redcost : 0.00 0 0 0 0 0
30.49/30.56 c impliedbounds : 0.00 0 0 0 0 0
30.49/30.56 c intobj : 0.00 0 0 0 0 0
30.49/30.56 c cgmip : 0.00 0 0 0 0 0
30.49/30.56 c gomory : 0.00 0 0 0 0 0
30.49/30.56 c strongcg : 0.00 0 0 0 0 0
30.49/30.56 c cmir : 0.00 0 0 0 0 0
30.49/30.56 c flowcover : 0.00 0 0 0 0 0
30.49/30.56 c clique : 0.00 0 0 0 0 0
30.49/30.56 c zerohalf : 0.00 0 0 0 0 0
30.49/30.56 c mcf : 0.00 0 0 0 0 0
30.49/30.56 c rapidlearning : 0.00 0 0 0 0 0
30.49/30.57 c Pricers : Time Calls Vars
30.49/30.57 c problem variables: 0.00 0 0
30.49/30.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
30.49/30.57 c relpscost : 0.00 0 0 0 0 0 0
30.49/30.57 c pscost : 0.00 0 0 0 0 0 0
30.49/30.57 c inference : 1.83 44029 0 0 0 0 88058
30.49/30.57 c mostinf : 0.00 0 0 0 0 0 0
30.49/30.57 c leastinf : 0.00 0 0 0 0 0 0
30.49/30.57 c fullstrong : 0.00 0 0 0 0 0 0
30.49/30.57 c allfullstrong : 0.00 0 0 0 0 0 0
30.49/30.57 c random : 0.00 0 0 0 0 0 0
30.49/30.57 c Primal Heuristics : Time Calls Found
30.49/30.57 c LP solutions : 0.00 - 0
30.49/30.57 c pseudo solutions : 0.00 - 2
30.49/30.57 c oneopt : 0.03 0 0
30.49/30.57 c trivial : 0.00 2 3
30.49/30.57 c simplerounding : 0.00 0 0
30.49/30.57 c zirounding : 0.00 0 0
30.49/30.57 c rounding : 0.00 0 0
30.49/30.57 c shifting : 0.00 0 0
30.49/30.57 c intshifting : 0.00 0 0
30.49/30.57 c twoopt : 0.00 0 0
30.49/30.57 c fixandinfer : 0.00 0 0
30.49/30.57 c feaspump : 0.00 0 0
30.49/30.57 c coefdiving : 0.00 0 0
30.49/30.57 c pscostdiving : 0.00 0 0
30.49/30.57 c fracdiving : 0.00 0 0
30.49/30.57 c veclendiving : 0.00 0 0
30.49/30.57 c intdiving : 0.00 0 0
30.49/30.57 c actconsdiving : 0.00 0 0
30.49/30.57 c objpscostdiving : 0.00 0 0
30.49/30.57 c rootsoldiving : 0.00 0 0
30.49/30.57 c linesearchdiving : 0.00 0 0
30.49/30.57 c guideddiving : 0.00 0 0
30.49/30.57 c octane : 0.00 0 0
30.49/30.57 c rens : 0.00 0 0
30.49/30.57 c rins : 0.00 0 0
30.49/30.57 c localbranching : 0.00 0 0
30.49/30.57 c mutation : 0.00 0 0
30.49/30.57 c crossover : 0.00 0 0
30.49/30.57 c dins : 0.00 0 0
30.49/30.57 c undercover : 0.00 0 0
30.49/30.57 c nlp : 0.03 0 0
30.49/30.57 c trysol : 0.06 0 0
30.49/30.57 c LP : Time Calls Iterations Iter/call Iter/sec
30.49/30.57 c primal LP : 0.00 0 0 0.00 -
30.49/30.57 c dual LP : 0.00 0 0 0.00 -
30.49/30.57 c lex dual LP : 0.00 0 0 0.00 -
30.49/30.57 c barrier LP : 0.00 0 0 0.00 -
30.49/30.57 c diving/probing LP: 0.00 0 0 0.00 -
30.49/30.57 c strong branching : 0.00 0 0 0.00 -
30.49/30.57 c (at root node) : - 0 0 0.00 -
30.49/30.57 c conflict analysis: 0.00 0 0 0.00 -
30.49/30.57 c B&B Tree :
30.49/30.57 c number of runs : 1
30.49/30.57 c nodes : 86843
30.49/30.57 c nodes (total) : 86843
30.49/30.57 c nodes left : 0
30.49/30.57 c max depth : 358
30.49/30.57 c max depth (total): 358
30.49/30.57 c backtracks : 42387 (48.8%)
30.49/30.57 c delayed cutoffs : 1142
30.49/30.57 c repropagations : 112880 (133397 domain reductions, 854 cutoffs)
30.49/30.57 c avg switch length: 4.27
30.49/30.57 c switching time : 3.77
30.49/30.57 c Solution :
30.49/30.57 c Solutions found : 5 (3 improvements)
30.49/30.57 c First Solution : +3.63000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
30.49/30.57 c Primal Bound : +5.00000000000000e+00 (in run 1, after 3386 nodes, 0.54 seconds, depth 353, found by <relaxation>)
30.49/30.57 c Dual Bound : +5.00000000000000e+00
30.49/30.57 c Gap : 0.00 %
30.49/30.57 c Root Dual Bound : +1.00000000000000e+00
30.49/30.57 c Root Iterations : 0
30.49/30.57 c Time complete: 30.56.