0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452087-1307102263.opb>
0.00/0.00 c original problem has 243 variables (243 bin, 0 int, 0 impl, 0 cont) and 19 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 9 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 0 upgd conss, 4356 impls, 0 clqs
0.00/0.03 c (round 2) 27 del vars, 16 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 10 upgd conss, 6660 impls, 0 clqs
0.00/0.03 c (round 3) 45 del vars, 32 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 10 upgd conss, 8676 impls, 0 clqs
0.00/0.03 c (round 4) 63 del vars, 48 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 118 chg coeffs, 10 upgd conss, 10404 impls, 0 clqs
0.00/0.03 c (round 5) 81 del vars, 64 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 134 chg coeffs, 10 upgd conss, 11844 impls, 0 clqs
0.00/0.04 c (round 6) 99 del vars, 80 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 150 chg coeffs, 10 upgd conss, 12996 impls, 0 clqs
0.00/0.04 c (round 7) 117 del vars, 96 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 166 chg coeffs, 10 upgd conss, 13860 impls, 0 clqs
0.00/0.04 c (round 8) 135 del vars, 112 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 182 chg coeffs, 10 upgd conss, 14436 impls, 0 clqs
0.00/0.04 c (round 9) 153 del vars, 128 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 198 chg coeffs, 10 upgd conss, 14724 impls, 0 clqs
0.00/0.04 c (round 10) 171 del vars, 144 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 214 chg coeffs, 10 upgd conss, 14724 impls, 0 clqs
0.00/0.07 c (0.1s) probing: 238/801 (29.7%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.07 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (11 rounds):
0.00/0.07 c 171 deleted vars, 144 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 214 changed coefficients
0.00/0.07 c 14760 implications, 0 cliques
0.00/0.07 c presolved problem has 801 variables (801 bin, 0 int, 0 impl, 0 cont) and 595 constraints
0.00/0.07 c 576 constraints of type <and>
0.00/0.07 c 9 constraints of type <linear>
0.00/0.07 c 10 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 2)
0.00/0.07 c Presolving Time: 0.07
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 2.0.1.4
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 13950
0.00/0.07 c
0.00/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
0.00/0.07 c
0.00/0.07 c # belongs reading time to solving time?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c timing/reading = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/indicator/addCouplingCons = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.10 c 0.1s| 1 | 0 | 22 | - |3453k| 0 | 12 | 801 | 600 | 801 |1171 | 0 | 5 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 o 3
0.19/0.22 c U 0.2s| 1 | 0 | 450 | - |3513k| 0 | - | 801 | 600 | 801 |1171 | 0 | 5 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.19/0.22 c 0.2s| 1 | 0 | 450 | - |3500k| 0 | - | 801 | 601 | 801 |1171 | 0 | 5 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.19/0.22 c
0.19/0.22 c SCIP Status : problem is solved [optimal solution found]
0.19/0.22 c Solving Time (sec) : 0.22
0.19/0.22 c Solving Nodes : 1
0.19/0.22 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.19/0.22 c Dual Bound : +3.00000000000000e+00
0.19/0.22 c Gap : 0.00 %
0.19/0.22 s OPTIMUM FOUND
0.19/0.22 v -x243 -x242 -x241 x240 -x239 -x238 -x237 x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x162 -x161 x160 -x159
0.19/0.22 v -x158 -x157 x156 -x155 x154 -x225 -x224 -x223 -x222 -x221 -x220 -x219 x218 -x217 -x153 -x152 -x151 -x150 x149 -x148 x147 x146
0.19/0.22 v x145 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 x208 x144 -x143 x142 -x141 x140 x139 x138 -x137 x136 -x207 -x206 -x205
0.19/0.22 v -x204 -x203 -x202 -x201 x200 -x199 x135 -x134 -x133 -x132 x131 x130 x129 x128 x127 -x198 -x197 -x196 -x195 -x194 -x193 -x192
0.19/0.22 v x191 -x190 x126 x125 -x124 x123 x122 -x121 x120 -x119 x118 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 x181 x117 x116 x115
0.19/0.22 v x114 -x113 -x112 x111 x110 x109 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 x108 -x107 x106 -x105 -x104 x103 x102
0.19/0.22 v -x101 x100 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x99 -x98 x97 x96 -x95 x94 x93 x92 x91 x90 -x89 -x88 -x87
0.19/0.22 v -x86 -x85 -x84 x83 x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 x64 -x63 -x62 -x61
0.19/0.22 v -x60 -x59 -x58 -x57 x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 x37 -x36 -x35 -x34
0.19/0.22 v -x33 -x32 -x31 -x30 x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 x19 -x18 -x17 -x16 x15 -x14 -x13 x12 -x11 x10 -x9 -x8
0.19/0.22 v -x7 -x6 -x5 -x4 -x3 x2 x1
0.19/0.22 c SCIP Status : problem is solved [optimal solution found]
0.19/0.22 c Total Time : 0.22
0.19/0.22 c solving : 0.22
0.19/0.22 c presolving : 0.07 (included in solving)
0.19/0.22 c reading : 0.00 (included in solving)
0.19/0.22 c Original Problem :
0.19/0.22 c Problem name : HOME/instance-3452087-1307102263.opb
0.19/0.22 c Variables : 243 (243 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.22 c Constraints : 19 initial, 19 maximal
0.19/0.22 c Presolved Problem :
0.19/0.22 c Problem name : t_HOME/instance-3452087-1307102263.opb
0.19/0.22 c Variables : 801 (801 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.22 c Constraints : 595 initial, 601 maximal
0.19/0.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.22 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c probing : 0.02 0 0 0 0 0 0 0 0 0
0.19/0.22 c and : 0.04 18 144 0 0 0 144 0 0 144
0.19/0.22 c linear : 0.00 1 8 0 0 0 0 0 0 70
0.19/0.22 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c root node : - 0 - - 0 - - - - -
0.19/0.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.22 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.19/0.22 c and : 576 0 795 0 0 4 2013 0 0 0 0 0
0.19/0.22 c linear : 9 0 795 0 0 3 510 4 0 0 0 0
0.19/0.22 c logicor : 10+ 0 107 0 0 1 37 11 0 0 0 0
0.19/0.22 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.19/0.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.22 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c and : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.19/0.22 c linear : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
0.19/0.22 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.22 c vbounds : 0 0 0 0
0.19/0.22 c rootredcost : 0 0 0 0
0.19/0.22 c pseudoobj : 304 0 0 0
0.19/0.22 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.22 c vbounds : 0.00 0.00 0.00
0.19/0.22 c rootredcost : 0.00 0.00 0.00
0.19/0.22 c pseudoobj : 0.00 0.00 0.00
0.19/0.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.22 c propagation : 0.02 15 5 235 309.7 0 0.0 -
0.19/0.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.22 c applied globally : - - - 5 70.6 - - -
0.19/0.22 c applied locally : - - - 0 0.0 - - -
0.19/0.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.22 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.22 c redcost : 0.00 0 0 0 0 0
0.19/0.22 c impliedbounds : 0.00 0 0 0 0 0
0.19/0.22 c intobj : 0.00 0 0 0 0 0
0.19/0.22 c gomory : 0.00 0 0 0 0 0
0.19/0.22 c cgmip : 0.00 0 0 0 0 0
0.19/0.22 c closecuts : 0.00 0 0 0 0 0
0.19/0.22 c strongcg : 0.00 0 0 0 0 0
0.19/0.22 c cmir : 0.00 0 0 0 0 0
0.19/0.22 c flowcover : 0.00 0 0 0 0 0
0.19/0.22 c clique : 0.00 0 0 0 0 0
0.19/0.22 c zerohalf : 0.00 0 0 0 0 0
0.19/0.22 c mcf : 0.00 0 0 0 0 0
0.19/0.22 c oddcycle : 0.00 0 0 0 0 0
0.19/0.22 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.22 c Pricers : Time Calls Vars
0.19/0.22 c problem variables: 0.00 0 0
0.19/0.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.22 c pscost : 0.00 0 0 0 0 0 0
0.19/0.22 c inference : 0.00 0 0 0 0 0 0
0.19/0.22 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.22 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.22 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.22 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.22 c random : 0.00 0 0 0 0 0 0
0.19/0.22 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.22 c Primal Heuristics : Time Calls Found
0.19/0.22 c LP solutions : 0.00 - 0
0.19/0.22 c pseudo solutions : 0.00 - 0
0.19/0.22 c oneopt : 0.00 0 0
0.19/0.22 c trivial : 0.00 2 0
0.19/0.22 c shiftandpropagate: 0.02 1 0
0.19/0.22 c simplerounding : 0.00 0 0
0.19/0.22 c zirounding : 0.00 0 0
0.19/0.22 c rounding : 0.00 1 0
0.19/0.22 c shifting : 0.00 1 0
0.19/0.22 c intshifting : 0.00 0 0
0.19/0.22 c twoopt : 0.00 0 0
0.19/0.22 c fixandinfer : 0.00 0 0
0.19/0.22 c feaspump : 0.01 1 0
0.19/0.22 c clique : 0.00 0 0
0.19/0.22 c coefdiving : 0.00 0 0
0.19/0.22 c pscostdiving : 0.00 0 0
0.19/0.22 c fracdiving : 0.00 0 0
0.19/0.22 c veclendiving : 0.00 0 0
0.19/0.22 c intdiving : 0.00 0 0
0.19/0.22 c actconsdiving : 0.00 0 0
0.19/0.22 c objpscostdiving : 0.00 0 0
0.19/0.22 c rootsoldiving : 0.00 0 0
0.19/0.22 c linesearchdiving : 0.00 0 0
0.19/0.22 c guideddiving : 0.00 0 0
0.19/0.22 c octane : 0.00 0 0
0.19/0.22 c rens : 0.00 0 0
0.19/0.22 c rins : 0.00 0 0
0.19/0.22 c localbranching : 0.00 0 0
0.19/0.22 c mutation : 0.00 0 0
0.19/0.22 c crossover : 0.00 0 0
0.19/0.22 c dins : 0.00 0 0
0.19/0.22 c vbounds : 0.00 0 0
0.19/0.22 c undercover : 0.11 1 1
0.19/0.22 c subnlp : 0.00 0 0
0.19/0.22 c trysol : 0.00 0 0
0.19/0.22 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.22 c primal LP : 0.00 0 0 0.00 -
0.19/0.22 c dual LP : 0.00 1 22 22.00 -
0.19/0.22 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.22 c barrier LP : 0.00 0 0 0.00 -
0.19/0.22 c diving/probing LP: 0.01 9 428 47.56 -
0.19/0.22 c strong branching : 0.00 0 0 0.00 -
0.19/0.22 c (at root node) : - 0 0 0.00 -
0.19/0.22 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.22 c B&B Tree :
0.19/0.22 c number of runs : 1
0.19/0.22 c nodes : 1
0.19/0.22 c nodes (total) : 1
0.19/0.22 c nodes left : 0
0.19/0.22 c max depth : 0
0.19/0.22 c max depth (total): 0
0.19/0.22 c backtracks : 0 (0.0%)
0.19/0.22 c delayed cutoffs : 0
0.19/0.22 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.22 c avg switch length: 2.00
0.19/0.22 c switching time : 0.00
0.19/0.22 c Solution :
0.19/0.22 c Solutions found : 1 (1 improvements)
0.19/0.22 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.22 seconds, depth 0, found by <undercover>)
0.19/0.22 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.22 seconds, depth 0, found by <undercover>)
0.19/0.22 c Dual Bound : +3.00000000000000e+00
0.19/0.22 c Gap : 0.00 %
0.19/0.22 c Root Dual Bound : +3.00000000000000e+00
0.19/0.22 c Root Iterations : 450
0.19/0.23 c Time complete: 0.23.