0.00/0.00 c SCIP version 2.0.1.5 [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-3450484-1307100909.opb>
0.00/0.00 c original problem has 792 variables (792 bin, 0 int, 0 impl, 0 cont) and 604 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, 60 chg coeffs, 0 upgd conss, 3584 impls, 0 clqs
0.00/0.03 c (round 2) 25 del vars, 29 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 10 upgd conss, 5376 impls, 0 clqs
0.00/0.03 c (round 3) 41 del vars, 58 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 10 upgd conss, 6944 impls, 0 clqs
0.00/0.03 c (round 4) 57 del vars, 87 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 10 upgd conss, 8288 impls, 0 clqs
0.00/0.03 c (round 5) 73 del vars, 116 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 116 chg coeffs, 10 upgd conss, 9408 impls, 0 clqs
0.00/0.03 c (round 6) 89 del vars, 145 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 130 chg coeffs, 10 upgd conss, 10304 impls, 0 clqs
0.00/0.03 c (round 7) 105 del vars, 174 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 144 chg coeffs, 10 upgd conss, 10976 impls, 0 clqs
0.00/0.03 c (round 8) 121 del vars, 203 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 10 upgd conss, 11424 impls, 0 clqs
0.00/0.04 c (round 9) 137 del vars, 232 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 172 chg coeffs, 10 upgd conss, 11648 impls, 0 clqs
0.00/0.04 c (round 10) 153 del vars, 261 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 186 chg coeffs, 10 upgd conss, 11648 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 221/639 (34.6%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (11 rounds):
0.00/0.05 c 153 deleted vars, 261 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 186 changed coefficients
0.00/0.05 c 11684 implications, 0 cliques
0.00/0.05 c presolved problem has 639 variables (639 bin, 0 int, 0 impl, 0 cont) and 469 constraints
0.00/0.05 c 441 constraints of type <and>
0.00/0.05 c 9 constraints of type <linear>
0.00/0.05 c 10 constraints of type <logicor>
0.00/0.05 c 9 constraints of type <pseudoboolean>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.07 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.07 c 0.1s| 1 | 0 | 22 | - |3352k| 0 | 12 | 639 | 475 | 639 | 901 | 0 | 6 | 0 | 3.000000e+00 | -- | Inf
0.11/0.15 o 3
0.11/0.15 c U 0.1s| 1 | 0 | 332 | - |3400k| 0 | - | 639 | 475 | 639 | 901 | 0 | 6 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.11/0.15 c 0.2s| 1 | 0 | 332 | - |3391k| 0 | - | 639 | 476 | 639 | 901 | 0 | 6 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.11/0.15 c
0.11/0.15 c SCIP Status : problem is solved [optimal solution found]
0.11/0.15 c Solving Time (sec) : 0.15
0.11/0.15 c Solving Nodes : 1
0.11/0.15 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.11/0.15 c Dual Bound : +3.00000000000000e+00
0.11/0.15 c Gap : 0.00 %
0.11/0.15 s OPTIMUM FOUND
0.11/0.15 v -x216 x215 x214 x213 -x212 -x211 x210 x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 x144 x143 x142 -x141 -x140 -x139 -x138
0.11/0.15 v x137 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x136 x135 -x134 -x133 x132 -x131 x130 x129 -x192 -x191 -x190 -x189 -x188
0.11/0.15 v -x187 x186 -x185 -x128 -x127 -x126 x125 x124 -x123 -x122 x121 -x184 -x183 -x182 -x181 -x180 -x179 -x178 x177 x120 -x119
0.11/0.15 v x118 x117 -x116 -x115 x114 x113 -x176 -x175 -x174 -x173 -x172 -x171 x170 -x169 x112 -x111 -x110 x109 -x108 -x107 -x106 x105 -x168
0.11/0.15 v -x167 -x166 -x165 -x164 -x163 -x162 -x161 x104 x103 -x102 x101 x100 -x99 x98 x97 -x160 -x159 -x158 -x157 -x156 -x155 x154
0.11/0.15 v -x153 -x96 x95 -x94 -x93 x92 -x91 -x90 x89 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 x88 x87 -x86 -x85 -x84 -x83 x82
0.11/0.15 v x81 x80 -x79 -x78 -x77 -x76 -x75 x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 x66 x65 -x64 -x63 -x62 -x61 -x60 -x59 x58 x57 -x56 -x55
0.11/0.15 v -x54 -x53 -x52 -x51 x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 x33 -x32 -x31 -x30 -x29
0.11/0.15 v -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 x17 -x16 x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.11/0.15 c SCIP Status : problem is solved [optimal solution found]
0.11/0.15 c Total Time : 0.15
0.11/0.15 c solving : 0.15
0.11/0.15 c presolving : 0.04 (included in solving)
0.11/0.15 c reading : 0.00 (included in solving)
0.11/0.15 c Original Problem :
0.11/0.15 c Problem name : HOME/instance-3450484-1307100909.opb
0.11/0.15 c Variables : 792 (792 binary, 0 integer, 0 implicit integer, 0 continuous)
0.11/0.15 c Constraints : 604 initial, 604 maximal
0.11/0.15 c Presolved Problem :
0.11/0.15 c Problem name : t_HOME/instance-3450484-1307100909.opb
0.11/0.15 c Variables : 639 (639 binary, 0 integer, 0 implicit integer, 0 continuous)
0.11/0.15 c Constraints : 469 initial, 476 maximal
0.11/0.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.11/0.15 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.11/0.15 c and : 0.02 18 126 0 0 0 126 0 0 126
0.11/0.15 c linear : 0.00 1 8 0 0 0 0 0 0 60
0.11/0.15 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.11/0.15 c pseudoboolean : 0.00 0 0 0 0 0 135 0 0 0
0.11/0.15 c root node : - 0 - - 0 - - - - -
0.11/0.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.11/0.15 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.11/0.15 c and : 441 0 729 0 0 0 1977 0 0 0 0 0
0.11/0.15 c linear : 9 0 729 0 0 4 576 5 0 0 0 0
0.11/0.15 c logicor : 10+ 0 116 0 0 1 48 10 0 0 0 0
0.11/0.15 c pseudoboolean : 9 0 0 0 0 1 0 0 0 0 0 0
0.11/0.15 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.11/0.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.11/0.15 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.11/0.15 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.11/0.15 c linear : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
0.11/0.15 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.11/0.15 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.11/0.15 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.11/0.15 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.11/0.15 c vbounds : 0 0 0 0
0.11/0.15 c rootredcost : 0 0 0 0
0.11/0.15 c pseudoobj : 272 0 0 0
0.11/0.15 c Propagator Timings : TotalTime Propagate Resprop
0.11/0.15 c vbounds : 0.00 0.00 0.00
0.11/0.15 c rootredcost : 0.00 0.00 0.00
0.11/0.15 c pseudoobj : 0.00 0.00 0.00
0.11/0.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.11/0.15 c propagation : 0.01 15 6 253 246.0 0 0.0 -
0.11/0.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.11/0.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.11/0.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.11/0.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.11/0.15 c applied globally : - - - 6 59.8 - - -
0.11/0.15 c applied locally : - - - 0 0.0 - - -
0.11/0.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.11/0.15 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.11/0.15 c redcost : 0.00 0 0 0 0 0
0.11/0.15 c impliedbounds : 0.00 0 0 0 0 0
0.11/0.15 c intobj : 0.00 0 0 0 0 0
0.11/0.15 c gomory : 0.00 0 0 0 0 0
0.11/0.15 c cgmip : 0.00 0 0 0 0 0
0.11/0.15 c closecuts : 0.00 0 0 0 0 0
0.11/0.15 c strongcg : 0.00 0 0 0 0 0
0.11/0.15 c cmir : 0.00 0 0 0 0 0
0.11/0.15 c flowcover : 0.00 0 0 0 0 0
0.11/0.15 c clique : 0.00 0 0 0 0 0
0.11/0.15 c zerohalf : 0.00 0 0 0 0 0
0.11/0.15 c mcf : 0.00 0 0 0 0 0
0.11/0.15 c oddcycle : 0.00 0 0 0 0 0
0.11/0.15 c rapidlearning : 0.00 0 0 0 0 0
0.11/0.15 c Pricers : Time Calls Vars
0.11/0.15 c problem variables: 0.00 0 0
0.11/0.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.11/0.15 c pscost : 0.00 0 0 0 0 0 0
0.11/0.15 c inference : 0.00 0 0 0 0 0 0
0.11/0.15 c mostinf : 0.00 0 0 0 0 0 0
0.11/0.15 c leastinf : 0.00 0 0 0 0 0 0
0.11/0.15 c fullstrong : 0.00 0 0 0 0 0 0
0.11/0.15 c allfullstrong : 0.00 0 0 0 0 0 0
0.11/0.15 c random : 0.00 0 0 0 0 0 0
0.11/0.15 c relpscost : 0.00 0 0 0 0 0 0
0.11/0.15 c Primal Heuristics : Time Calls Found
0.11/0.15 c LP solutions : 0.00 - 0
0.11/0.15 c pseudo solutions : 0.00 - 0
0.11/0.15 c oneopt : 0.00 0 0
0.11/0.15 c trivial : 0.00 2 0
0.11/0.15 c shiftandpropagate: 0.02 1 0
0.11/0.15 c simplerounding : 0.00 0 0
0.11/0.15 c zirounding : 0.00 0 0
0.11/0.15 c rounding : 0.00 1 0
0.11/0.15 c shifting : 0.00 1 0
0.11/0.15 c intshifting : 0.00 0 0
0.11/0.15 c twoopt : 0.00 0 0
0.11/0.15 c fixandinfer : 0.00 0 0
0.11/0.15 c feaspump : 0.01 1 0
0.11/0.15 c clique : 0.00 0 0
0.11/0.15 c coefdiving : 0.00 0 0
0.11/0.15 c pscostdiving : 0.00 0 0
0.11/0.15 c fracdiving : 0.00 0 0
0.11/0.16 c veclendiving : 0.00 0 0
0.11/0.16 c intdiving : 0.00 0 0
0.11/0.16 c actconsdiving : 0.00 0 0
0.11/0.16 c objpscostdiving : 0.00 0 0
0.11/0.16 c rootsoldiving : 0.00 0 0
0.11/0.16 c linesearchdiving : 0.00 0 0
0.11/0.16 c guideddiving : 0.00 0 0
0.11/0.16 c octane : 0.00 0 0
0.11/0.16 c rens : 0.00 0 0
0.11/0.16 c rins : 0.00 0 0
0.11/0.16 c localbranching : 0.00 0 0
0.11/0.16 c mutation : 0.00 0 0
0.11/0.16 c crossover : 0.00 0 0
0.11/0.16 c dins : 0.00 0 0
0.11/0.16 c vbounds : 0.00 0 0
0.11/0.16 c undercover : 0.07 1 1
0.11/0.16 c subnlp : 0.00 0 0
0.11/0.16 c trysol : 0.00 0 0
0.11/0.16 c LP : Time Calls Iterations Iter/call Iter/sec
0.11/0.16 c primal LP : 0.00 0 0 0.00 -
0.11/0.16 c dual LP : 0.00 1 22 22.00 -
0.11/0.16 c lex dual LP : 0.00 0 0 0.00 -
0.11/0.16 c barrier LP : 0.00 0 0 0.00 -
0.11/0.16 c diving/probing LP: 0.00 10 310 31.00 -
0.11/0.16 c strong branching : 0.00 0 0 0.00 -
0.11/0.16 c (at root node) : - 0 0 0.00 -
0.11/0.16 c conflict analysis: 0.00 0 0 0.00 -
0.11/0.16 c B&B Tree :
0.11/0.16 c number of runs : 1
0.11/0.16 c nodes : 1
0.11/0.16 c nodes (total) : 1
0.11/0.16 c nodes left : 0
0.11/0.16 c max depth : 0
0.11/0.16 c max depth (total): 0
0.11/0.16 c backtracks : 0 (0.0%)
0.11/0.16 c delayed cutoffs : 0
0.11/0.16 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.11/0.16 c avg switch length: 2.00
0.11/0.16 c switching time : 0.00
0.11/0.16 c Solution :
0.11/0.16 c Solutions found : 1 (1 improvements)
0.11/0.16 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.15 seconds, depth 0, found by <undercover>)
0.11/0.16 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.15 seconds, depth 0, found by <undercover>)
0.11/0.16 c Dual Bound : +3.00000000000000e+00
0.11/0.16 c Gap : 0.00 %
0.11/0.16 c Root Dual Bound : +3.00000000000000e+00
0.11/0.16 c Root Iterations : 332
0.11/0.16 c Time complete: 0.16.