0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666039-1276403959.opb>
0.00/0.02 c original problem has 304 variables (304 bin, 0 int, 0 impl, 0 cont) and 671 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 1 del vars, 4 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 460 impls, 0 clqs
0.00/0.06 c (round 2) 1 del vars, 4 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 664 upgd conss, 460 impls, 0 clqs
0.00/0.07 c (round 3) 1 del vars, 5 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 667 upgd conss, 460 impls, 0 clqs
0.06/0.08 c (0.0s) probing: 122/303 (40.3%) - 5 fixings, 0 aggregations, 3 implications, 0 bound changes
0.06/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.06/0.08 c (round 4) 6 del vars, 5 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 667 upgd conss, 466 impls, 0 clqs
0.06/0.08 c (round 5) 6 del vars, 68 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 667 upgd conss, 466 impls, 0 clqs
0.06/0.08 c (0.0s) probing: 132/303 (43.6%) - 5 fixings, 0 aggregations, 3 implications, 0 bound changes
0.06/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.06/0.08 c presolving (6 rounds):
0.06/0.08 c 6 deleted vars, 68 deleted constraints, 1 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.06/0.08 c 466 implications, 0 cliques
0.06/0.08 c presolved problem has 298 variables (298 bin, 0 int, 0 impl, 0 cont) and 603 constraints
0.06/0.08 c 603 constraints of type <logicor>
0.06/0.08 c transformed objective value is always integral (scale: 1)
0.06/0.08 c Presolving Time: 0.04
0.06/0.08 c - non default parameters ----------------------------------------------------------------------
0.06/0.08 c # SCIP version 1.2.1.2
0.06/0.08 c
0.06/0.08 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.06/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.08 c conflict/interconss = 0
0.06/0.08 c
0.06/0.08 c # should binary conflicts be preferred?
0.06/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.08 c conflict/preferbinary = TRUE
0.06/0.08 c
0.06/0.08 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.06/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.08 c constraints/agelimit = 1
0.06/0.08 c
0.06/0.08 c # should enforcement of pseudo solution be disabled?
0.06/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.08 c constraints/disableenfops = TRUE
0.06/0.08 c
0.06/0.08 c # frequency for displaying node information lines
0.06/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.08 c display/freq = 10000
0.06/0.08 c
0.06/0.08 c # maximal time in seconds to run
0.06/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.08 c limits/time = 1799.98
0.06/0.08 c
0.06/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.08 c limits/memory = 1620
0.06/0.08 c
0.06/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.06/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.08 c lp/solvefreq = 0
0.06/0.08 c
0.06/0.08 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.06/0.08 c # [type: char, range: {lafpsqd}, default: l]
0.06/0.08 c lp/pricing = a
0.06/0.08 c
0.06/0.08 c # should presolving try to simplify inequalities
0.06/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.08 c constraints/linear/simplifyinequalities = TRUE
0.06/0.08 c
0.06/0.08 c # should presolving try to simplify knapsacks
0.06/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.08 c
0.06/0.08 c # priority of node selection rule <dfs> in standard mode
0.06/0.08 c # [type: int, range: [-536870912,536870911], default: 0]
0.06/0.08 c nodeselection/dfs/stdpriority = 1000000
0.06/0.08 c
0.06/0.08 c -----------------------------------------------------------------------------------------------
0.06/0.08 c start solving
0.06/0.08 c
0.06/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.09 c 0.1s| 1 | 0 | 105 | - |1750k| 0 | 27 | 298 | 603 | 298 | 603 | 0 | 0 | 0 | 1.049667e+03 | -- | Inf
0.06/0.09 o 1843
0.06/0.09 c R 0.1s| 1 | 0 | 105 | - |1755k| 0 | 27 | 298 | 603 | 298 | 603 | 0 | 0 | 0 | 1.049667e+03 | 1.843000e+03 | 75.58%
0.06/0.09 o 1800
0.06/0.09 c s 0.1s| 1 | 0 | 105 | - |1760k| 0 | 27 | 298 | 603 | 298 | 603 | 0 | 0 | 0 | 1.049667e+03 | 1.800000e+03 | 71.48%
0.09/0.12 c 0.1s| 1 | 0 | 115 | - |1766k| 0 | 8 | 298 | 603 | 298 | 605 | 2 | 0 | 0 | 1.053000e+03 | 1.800000e+03 | 70.94%
0.09/0.12 o 1218
0.09/0.12 c b 0.1s| 1 | 0 | 115 | - |1772k| 0 | 8 | 298 | 603 | 298 | 605 | 2 | 0 | 0 | 1.053000e+03 | 1.218000e+03 | 15.67%
0.09/0.12 o 1213
0.09/0.12 c R 0.1s| 1 | 0 | 115 | - |1772k| 0 | 8 | 298 | 603 | 298 | 605 | 2 | 0 | 0 | 1.053000e+03 | 1.213000e+03 | 15.19%
0.09/0.14 c 0.1s| 1 | 0 | 118 | - |1777k| 0 | 8 | 298 | 603 | 298 | 606 | 3 | 0 | 0 | 1.053000e+03 | 1.213000e+03 | 15.19%
0.09/0.14 o 1103
0.09/0.14 c b 0.1s| 1 | 0 | 118 | - |1786k| 0 | 8 | 298 | 603 | 298 | 606 | 3 | 0 | 0 | 1.053000e+03 | 1.103000e+03 | 4.75%
0.09/0.15 c 0.1s| 1 | 0 | 120 | - |1786k| 0 | 0 | 298 | 603 | 298 | 607 | 4 | 0 | 0 | 1.053000e+03 | 1.103000e+03 | 4.75%
0.09/0.15 o 1053
0.09/0.15 c b 0.1s| 1 | 0 | 120 | - |1792k| 0 | - | 298 | 603 | 298 | 607 | 4 | 0 | 0 | 1.053000e+03 | 1.053000e+03 | 0.00%
0.09/0.15 c 0.1s| 1 | 0 | 120 | - |1789k| 0 | - | 298 | 603 | 298 | 607 | 4 | 0 | 0 | 1.053000e+03 | 1.053000e+03 | 0.00%
0.09/0.15 c
0.09/0.15 c SCIP Status : problem is solved [optimal solution found]
0.09/0.15 c Solving Time (sec) : 0.11
0.09/0.15 c Solving Nodes : 1
0.09/0.15 c Primal Bound : +1.05300000000000e+03 (8 solutions)
0.09/0.15 c Dual Bound : +1.05300000000000e+03
0.09/0.15 c Gap : 0.00 %
0.09/0.16 s OPTIMUM FOUND
0.09/0.16 v -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283
0.09/0.16 v -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 x263 x262
0.09/0.16 v x261 x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241
0.09/0.16 v -x240 -x239 -x238 -x237 -x236 -x235 -x234 x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 x225 x224 -x223 -x222 x221 x220 x219
0.09/0.16 v -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198
0.09/0.16 v -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 x189 -x188 -x187 x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177
0.09/0.16 v -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156
0.09/0.16 v -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136
0.09/0.16 v -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 x118 -x117 -x116 -x115 x114
0.09/0.16 v x113 x112 x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91
0.09/0.16 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
0.09/0.16 v -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41
0.09/0.16 v -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 x16
0.09/0.16 v x15 -x14 x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 x4 -x3 -x2 -x1
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time : 0.11
0.09/0.16 c Original Problem :
0.09/0.16 c Problem name : HOME/instance-2666039-1276403959.opb
0.09/0.16 c Variables : 304 (304 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 671 initial, 671 maximal
0.09/0.16 c Presolved Problem :
0.09/0.16 c Problem name : t_HOME/instance-2666039-1276403959.opb
0.09/0.16 c Variables : 298 (298 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 603 initial, 603 maximal
0.09/0.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.16 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c probing : 0.01 5 0 0 0 0 0 0 0
0.09/0.16 c linear : 0.01 1 0 0 1 0 4 0 0
0.09/0.16 c logicor : 0.01 0 0 0 0 0 64 0 0
0.09/0.16 c root node : - 0 - - 0 - - - -
0.09/0.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.16 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.16 c logicor : 603 3 200 0 0 5 0 0 0 0
0.09/0.16 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.16 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c Propagators : Time Calls Cutoffs DomReds
0.09/0.16 c vbounds : 0.00 2 0 0
0.09/0.16 c rootredcost : 0.00 0 0 0
0.09/0.16 c pseudoobj : 0.00 3 0 0
0.09/0.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.16 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c applied globally : - - - 0 0.0 - - -
0.09/0.16 c applied locally : - - - 0 0.0 - - -
0.09/0.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.16 c cut pool : 0.00 2 - - 0 - (maximal pool size: 6)
0.09/0.16 c redcost : 0.00 3 0 0 0 0
0.09/0.16 c impliedbounds : 0.00 3 0 0 0 0
0.09/0.16 c intobj : 0.00 0 0 0 0 0
0.09/0.16 c cgmip : 0.00 0 0 0 0 0
0.09/0.16 c gomory : 0.00 3 0 0 276 0
0.09/0.16 c strongcg : 0.02 3 0 0 276 0
0.09/0.16 c cmir : 0.02 3 0 0 0 0
0.09/0.16 c flowcover : 0.00 3 0 0 0 0
0.09/0.16 c clique : 0.00 1 0 0 0 0
0.09/0.16 c zerohalf : 0.00 0 0 0 0 0
0.09/0.16 c mcf : 0.00 1 0 0 0 0
0.09/0.16 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.16 c Pricers : Time Calls Vars
0.09/0.16 c problem variables: 0.00 0 0
0.09/0.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.16 c pscost : 0.00 0 0 0 0 0 0
0.09/0.16 c inference : 0.00 0 0 0 0 0 0
0.09/0.16 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.16 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.16 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c random : 0.00 0 0 0 0 0 0
0.09/0.16 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.16 c Primal Heuristics : Time Calls Found
0.09/0.16 c LP solutions : 0.00 - 0
0.09/0.16 c pseudo solutions : 0.00 - 0
0.09/0.16 c trivial : 0.00 2 0
0.09/0.16 c simplerounding : 0.00 3 0
0.09/0.16 c zirounding : 0.00 0 0
0.09/0.16 c rounding : 0.00 3 2
0.09/0.16 c shifting : 0.00 3 3
0.09/0.16 c intshifting : 0.00 0 0
0.09/0.16 c oneopt : 0.00 3 3
0.09/0.16 c twoopt : 0.00 0 0
0.09/0.16 c fixandinfer : 0.00 0 0
0.09/0.16 c feaspump : 0.00 0 0
0.09/0.16 c coefdiving : 0.00 0 0
0.09/0.16 c pscostdiving : 0.00 0 0
0.09/0.16 c fracdiving : 0.00 0 0
0.09/0.16 c veclendiving : 0.00 0 0
0.09/0.16 c intdiving : 0.00 0 0
0.09/0.16 c actconsdiving : 0.00 0 0
0.09/0.16 c objpscostdiving : 0.00 0 0
0.09/0.16 c rootsoldiving : 0.00 0 0
0.09/0.16 c linesearchdiving : 0.00 0 0
0.09/0.16 c guideddiving : 0.00 0 0
0.09/0.16 c octane : 0.00 0 0
0.09/0.16 c rens : 0.00 0 0
0.09/0.16 c rins : 0.00 0 0
0.09/0.16 c localbranching : 0.00 0 0
0.09/0.16 c mutation : 0.00 0 0
0.09/0.16 c crossover : 0.00 0 0
0.09/0.16 c dins : 0.00 0 0
0.09/0.16 c undercover : 0.00 0 0
0.09/0.16 c nlp : 0.00 0 0
0.09/0.16 c trysol : 0.00 0 0
0.09/0.16 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.16 c primal LP : 0.00 0 0 0.00 -
0.09/0.16 c dual LP : 0.03 4 120 30.00 4000.00
0.09/0.16 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.16 c barrier LP : 0.00 0 0 0.00 -
0.09/0.16 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.16 c strong branching : 0.00 0 0 0.00 -
0.09/0.16 c (at root node) : - 0 0 0.00 -
0.09/0.16 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.16 c B&B Tree :
0.09/0.16 c number of runs : 1
0.09/0.16 c nodes : 1
0.09/0.16 c nodes (total) : 1
0.09/0.16 c nodes left : 0
0.09/0.16 c max depth : 0
0.09/0.16 c max depth (total): 0
0.09/0.16 c backtracks : 0 (0.0%)
0.09/0.16 c delayed cutoffs : 0
0.09/0.16 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.16 c avg switch length: 2.00
0.09/0.16 c switching time : 0.00
0.09/0.16 c Solution :
0.09/0.16 c Solutions found : 8 (6 improvements)
0.09/0.16 c First Solution : +1.84300000000000e+03 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <rounding>)
0.09/0.16 c Primal Bound : +1.05300000000000e+03 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <oneopt>)
0.09/0.16 c Dual Bound : +1.05300000000000e+03
0.09/0.16 c Gap : 0.00 %
0.09/0.16 c Root Dual Bound : +1.05300000000000e+03
0.09/0.16 c Root Iterations : 120
0.09/0.16 c Time complete: 0.16.