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-2664631-1276415073.opb>
0.04/0.06 c original problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 963 constraints
0.04/0.06 c problem read
0.04/0.06 c presolving settings loaded
0.04/0.06 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.04/0.07 o 309
0.04/0.07 o 294
0.04/0.07 c feasible solution found by trivial heuristic, objective value 2.940000e+02
0.04/0.07 c presolving:
0.09/0.14 c (round 1) 0 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 959 upgd conss, 0 impls, 0 clqs
0.09/0.17 c (0.1s) probing: 101/309 (32.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.17 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.17 c presolving (2 rounds):
0.09/0.17 c 0 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
0.09/0.17 c 0 implications, 0 cliques
0.09/0.17 c presolved problem has 309 variables (309 bin, 0 int, 0 impl, 0 cont) and 959 constraints
0.09/0.17 c 959 constraints of type <logicor>
0.09/0.17 c transformed objective value is always integral (scale: 1)
0.09/0.17 c Presolving Time: 0.09
0.09/0.17 c - non default parameters ----------------------------------------------------------------------
0.09/0.17 c # SCIP version 1.2.1.2
0.09/0.17 c
0.09/0.17 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.17 c conflict/interconss = 0
0.09/0.17 c
0.09/0.17 c # should binary conflicts be preferred?
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c conflict/preferbinary = TRUE
0.09/0.17 c
0.09/0.17 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.17 c constraints/agelimit = 1
0.09/0.17 c
0.09/0.17 c # should enforcement of pseudo solution be disabled?
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/disableenfops = TRUE
0.09/0.17 c
0.09/0.17 c # frequency for displaying node information lines
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.17 c display/freq = 10000
0.09/0.17 c
0.09/0.17 c # maximal time in seconds to run
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/time = 1799.95
0.09/0.17 c
0.09/0.17 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.17 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.17 c limits/memory = 1620
0.09/0.17 c
0.09/0.17 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.17 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.17 c lp/solvefreq = -1
0.09/0.17 c
0.09/0.17 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.09/0.17 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.17 c lp/pricing = a
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify inequalities
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/linear/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # should presolving try to simplify knapsacks
0.09/0.17 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.17 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.17 c
0.09/0.17 c # priority of node selection rule <dfs> in standard mode
0.09/0.17 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.17 c nodeselection/dfs/stdpriority = 1000000
0.09/0.17 c
0.09/0.17 c -----------------------------------------------------------------------------------------------
0.09/0.17 c start solving
0.09/0.17 c
0.09/0.17 o 291
0.09/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c t 0.1s| 1 | 0 | 0 | - |2448k| 0 | - | 309 | 959 | 0 | 0 | 0 | 0 | 0 | -- | 2.910000e+02 | Inf
0.09/0.17 c 0.1s| 1 | 2 | 0 | - |2441k| 0 | - | 309 | 959 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 2.910000e+02 | Inf
0.09/0.19 o 7
0.09/0.19 c * 0.1s| 228 | 227 | 0 | 0.0 |2581k| 227 | - | 309 | 959 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 7.000000e+00 | 600.00%
0.19/0.29 o 6
0.19/0.29 c * 0.2s| 747 | 207 | 0 | 0.0 |2587k| 229 | - | 309 | 959 | 0 | 0 | 0 | 298 | 0 | 1.000000e+00 | 6.000000e+00 | 500.00%
0.70/0.79 o 5
0.70/0.79 c * 0.7s| 3291 | 172 | 0 | 0.0 |2592k| 229 | - | 309 | 961 | 0 | 0 | 0 |1422 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
2.49/2.58 c 2.3s| 10000 | 110 | 0 | 0.0 |2599k| 229 | - | 309 | 961 | 0 | 0 | 0 |4776 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
5.79/5.85 c 5.4s| 20000 | 66 | 0 | 0.0 |2596k| 229 | - | 309 | 961 | 0 | 0 | 0 |9504 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
9.79/9.83 c 9.2s| 30000 | 42 | 0 | 0.0 |2602k| 229 | - | 309 | 964 | 0 | 0 | 0 | 13k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
13.79/13.87 c 13.0s| 40000 | 28 | 0 | 0.0 |2607k| 229 | - | 309 | 962 | 0 | 0 | 0 | 17k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
17.99/18.03 c 17.0s| 50000 | 13 | 0 | 0.0 |2624k| 229 | - | 309 | 972 | 0 | 0 | 0 | 21k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
21.99/22.09 c 20.8s| 60000 | 17 | 0 | 0.0 |2613k| 229 | - | 309 | 959 | 0 | 0 | 0 | 25k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
26.58/26.62 c 25.2s| 70000 | 104 | 0 | 0.0 |2645k| 229 | - | 309 | 962 | 0 | 0 | 0 | 29k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
28.19/28.28 c
28.19/28.28 c SCIP Status : problem is solved [optimal solution found]
28.19/28.28 c Solving Time (sec) : 26.76
28.19/28.28 c Solving Nodes : 73518
28.19/28.28 c Primal Bound : +5.00000000000000e+00 (7 solutions)
28.19/28.28 c Dual Bound : +5.00000000000000e+00
28.19/28.28 c Gap : 0.00 %
28.19/28.28 s OPTIMUM FOUND
28.19/28.28 v -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288
28.19/28.28 v -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267
28.19/28.28 v -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247
28.19/28.28 v -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226
28.19/28.28 v -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205
28.19/28.28 v -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184
28.19/28.28 v -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163
28.19/28.28 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142
28.19/28.28 v -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121
28.19/28.28 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101
28.19/28.28 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76
28.19/28.28 v -x75 x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
28.19/28.28 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 x30 -x29 -x28 -x27 -x26 -x25
28.19/28.28 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
28.19/28.28 c SCIP Status : problem is solved [optimal solution found]
28.19/28.28 c Solving Time : 26.76
28.19/28.28 c Original Problem :
28.19/28.28 c Problem name : HOME/instance-2664631-1276415073.opb
28.19/28.28 c Variables : 309 (309 binary, 0 integer, 0 implicit integer, 0 continuous)
28.19/28.28 c Constraints : 963 initial, 963 maximal
28.19/28.28 c Presolved Problem :
28.19/28.28 c Problem name : t_HOME/instance-2664631-1276415073.opb
28.19/28.28 c Variables : 309 (309 binary, 0 integer, 0 implicit integer, 0 continuous)
28.19/28.28 c Constraints : 959 initial, 997 maximal
28.19/28.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
28.19/28.28 c trivial : 0.00 0 0 0 0 0 0 0 0
28.19/28.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
28.19/28.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
28.19/28.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
28.19/28.28 c implics : 0.00 0 0 0 0 0 0 0 0
28.19/28.28 c probing : 0.01 0 0 0 0 0 0 0 0
28.19/28.28 c linear : 0.04 0 0 0 0 0 4 3 0
28.19/28.28 c logicor : 0.03 0 0 0 0 0 0 0 0
28.19/28.28 c root node : - 205 - - 205 - - - -
28.19/28.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
28.19/28.28 c integral : 0 0 0 0 0 0 0 0 0 0
28.19/28.28 c logicor : 959+ 0 130520 0 2 33063 1196093 0 0 0
28.19/28.28 c countsols : 0 0 0 0 3 0 0 0 0 0
28.19/28.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
28.19/28.28 c integral : 0.00 0.00 0.00 0.00 0.00
28.19/28.28 c logicor : 8.79 0.00 8.79 0.00 0.00
28.19/28.28 c countsols : 0.00 0.00 0.00 0.00 0.00
28.19/28.28 c Propagators : Time Calls Cutoffs DomReds
28.19/28.28 c vbounds : 0.12 2 0 0
28.19/28.28 c rootredcost : 0.13 0 0 0
28.19/28.28 c pseudoobj : 6.97 216848 5398 3021230
28.19/28.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
28.19/28.28 c propagation : 2.75 30331 30330 30330 18.3 1273 22.1 -
28.19/28.28 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
28.19/28.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
28.19/28.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
28.19/28.28 c pseudo solution : 0.00 17 17 17 13.5 5 32.0 -
28.19/28.28 c applied globally : - - - 27395 13.7 - - -
28.19/28.28 c applied locally : - - - 4058 48.5 - - -
28.19/28.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
28.19/28.28 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
28.19/28.28 c redcost : 0.00 0 0 0 0 0
28.19/28.28 c impliedbounds : 0.00 0 0 0 0 0
28.19/28.28 c intobj : 0.00 0 0 0 0 0
28.19/28.28 c cgmip : 0.00 0 0 0 0 0
28.19/28.28 c gomory : 0.00 0 0 0 0 0
28.19/28.28 c strongcg : 0.00 0 0 0 0 0
28.19/28.28 c cmir : 0.00 0 0 0 0 0
28.19/28.28 c flowcover : 0.00 0 0 0 0 0
28.19/28.28 c clique : 0.00 0 0 0 0 0
28.19/28.28 c zerohalf : 0.00 0 0 0 0 0
28.19/28.28 c mcf : 0.00 0 0 0 0 0
28.19/28.28 c rapidlearning : 0.00 0 0 0 0 0
28.19/28.28 c Pricers : Time Calls Vars
28.19/28.28 c problem variables: 0.00 0 0
28.19/28.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
28.19/28.28 c relpscost : 0.00 0 0 0 0 0 0
28.19/28.28 c pscost : 0.00 0 0 0 0 0 0
28.19/28.28 c inference : 1.56 44823 0 0 0 0 89646
28.19/28.28 c mostinf : 0.00 0 0 0 0 0 0
28.19/28.28 c leastinf : 0.00 0 0 0 0 0 0
28.19/28.28 c fullstrong : 0.00 0 0 0 0 0 0
28.19/28.28 c allfullstrong : 0.00 0 0 0 0 0 0
28.19/28.28 c random : 0.00 0 0 0 0 0 0
28.19/28.28 c Primal Heuristics : Time Calls Found
28.19/28.28 c LP solutions : 0.00 - 0
28.19/28.28 c pseudo solutions : 0.00 - 3
28.19/28.28 c oneopt : 0.01 0 0
28.19/28.28 c trivial : 0.00 2 4
28.19/28.28 c simplerounding : 0.00 0 0
28.19/28.28 c zirounding : 0.00 0 0
28.19/28.28 c rounding : 0.00 0 0
28.19/28.28 c shifting : 0.00 0 0
28.19/28.28 c intshifting : 0.00 0 0
28.19/28.28 c twoopt : 0.00 0 0
28.19/28.28 c fixandinfer : 0.00 0 0
28.19/28.28 c feaspump : 0.00 0 0
28.19/28.28 c coefdiving : 0.00 0 0
28.19/28.28 c pscostdiving : 0.00 0 0
28.19/28.28 c fracdiving : 0.00 0 0
28.19/28.28 c veclendiving : 0.00 0 0
28.19/28.28 c intdiving : 0.00 0 0
28.19/28.28 c actconsdiving : 0.00 0 0
28.19/28.28 c objpscostdiving : 0.00 0 0
28.19/28.28 c rootsoldiving : 0.00 0 0
28.19/28.28 c linesearchdiving : 0.00 0 0
28.19/28.28 c guideddiving : 0.00 0 0
28.19/28.28 c octane : 0.00 0 0
28.19/28.28 c rens : 0.00 0 0
28.19/28.28 c rins : 0.00 0 0
28.19/28.28 c localbranching : 0.00 0 0
28.19/28.28 c mutation : 0.00 0 0
28.19/28.28 c crossover : 0.00 0 0
28.19/28.28 c dins : 0.00 0 0
28.19/28.28 c undercover : 0.00 0 0
28.19/28.28 c nlp : 0.00 0 0
28.19/28.28 c trysol : 0.02 0 0
28.19/28.28 c LP : Time Calls Iterations Iter/call Iter/sec
28.19/28.28 c primal LP : 0.00 0 0 0.00 -
28.19/28.28 c dual LP : 0.00 0 0 0.00 -
28.19/28.28 c lex dual LP : 0.00 0 0 0.00 -
28.19/28.28 c barrier LP : 0.00 0 0 0.00 -
28.19/28.28 c diving/probing LP: 0.00 0 0 0.00 -
28.19/28.28 c strong branching : 0.00 0 0 0.00 -
28.19/28.28 c (at root node) : - 0 0 0.00 -
28.19/28.28 c conflict analysis: 0.00 0 0 0.00 -
28.19/28.28 c B&B Tree :
28.19/28.28 c number of runs : 1
28.19/28.28 c nodes : 73518
28.19/28.28 c nodes (total) : 73518
28.19/28.28 c nodes left : 0
28.19/28.28 c max depth : 229
28.19/28.28 c max depth (total): 229
28.19/28.28 c backtracks : 31663 (43.1%)
28.19/28.28 c delayed cutoffs : 16122
28.19/28.28 c repropagations : 76625 (990305 domain reductions, 9786 cutoffs)
28.19/28.28 c avg switch length: 3.46
28.19/28.28 c switching time : 4.91
28.19/28.28 c Solution :
28.19/28.28 c Solutions found : 7 (6 improvements)
28.19/28.28 c First Solution : +3.09000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
28.19/28.28 c Primal Bound : +5.00000000000000e+00 (in run 1, after 3291 nodes, 0.66 seconds, depth 180, found by <relaxation>)
28.19/28.28 c Dual Bound : +5.00000000000000e+00
28.19/28.28 c Gap : 0.00 %
28.19/28.28 c Root Dual Bound : +0.00000000000000e+00
28.19/28.28 c Root Iterations : 0
28.19/28.29 c Time complete: 28.27.