0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3732613-1338704871.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 0 clqs
0.00/0.02 c (round 2) 8 del vars, 75 del conss, 0 add conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 820 impls, 0 clqs
0.00/0.02 c (round 3) 13 del vars, 99 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 846 impls, 0 clqs
0.00/0.02 c (round 4) 22 del vars, 176 del conss, 0 add conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 856 impls, 0 clqs
0.00/0.02 c (round 5) 25 del vars, 212 del conss, 0 add conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.00/0.02 c (round 6) 27 del vars, 230 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 994 impls, 0 clqs
0.00/0.03 c (round 7) 27 del vars, 247 del conss, 0 add conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 1014 impls, 0 clqs
0.00/0.03 c (round 8) 27 del vars, 247 del conss, 0 add conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 1014 impls, 0 clqs
0.00/0.04 c (round 9) 83 del vars, 247 del conss, 0 add conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2704 impls, 0 clqs
0.00/0.04 c (round 10) 83 del vars, 617 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3098 impls, 0 clqs
0.00/0.04 c (round 11) 87 del vars, 632 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3098 impls, 0 clqs
0.00/0.04 c (round 12) 90 del vars, 645 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3098 impls, 0 clqs
0.00/0.04 c (round 13) 92 del vars, 655 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3150 impls, 0 clqs
0.00/0.04 c (round 14) 92 del vars, 666 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3150 impls, 0 clqs
0.00/0.04 c (round 15) 184 del vars, 666 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3150 impls, 0 clqs
0.00/0.04 c (round 16) 184 del vars, 937 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3172 impls, 0 clqs
0.00/0.04 c (round 17) 193 del vars, 943 del conss, 0 add conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 3172 impls, 0 clqs
0.00/0.04 c presolving (18 rounds):
0.00/0.04 c 193 deleted vars, 943 deleted constraints, 0 added constraints, 25 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.00/0.04 c 3180 implications, 0 cliques
0.00/0.04 c presolved problem has 7 variables (7 bin, 0 int, 0 impl, 0 cont) and 7 constraints
0.00/0.04 c 2 constraints of type <setppc>
0.00/0.04 c 5 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.5
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1797
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 o 97
0.00/0.04 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.04 c t 0.0s| 1 | 0 | 0 | - |1084k| 0 | - | 7 | 7 | 0 | 0 | 0 | 0 | 0 | -- | 9.700000e+01 | Inf
0.00/0.04 o 94
0.00/0.04 c b 0.0s| 1 | 0 | 0 | - |1089k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | -- | 9.400000e+01 | Inf
0.00/0.04 c 0.0s| 1 | 0 | 2 | - |1087k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.00/0.04 c 0.0s| 1 | 0 | 2 | - |1087k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +9.40000000000000e+01 (2 solutions)
0.00/0.04 c Dual Bound : +9.40000000000000e+01
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v -x200 -x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 x190 -x189 x188 -x187 -x186 x185 -x184 -x183 -x182 x181 -x180 x179 -x178
0.00/0.04 v -x177 x176 -x175 -x174 x173 x172 -x171 -x170 x169 -x168 x167 x166 -x165 -x164 x163 -x162 x161 -x160 -x159 x158 -x157 -x156
0.00/0.04 v x155 -x154 x153 -x152 x151 -x150 x149 x148 -x147 x146 -x145 -x144 x143 x142 -x141 x140 -x139 x138 -x137 -x136 x135 x134 -x133
0.00/0.04 v -x132 x131 x130 -x129 -x128 x127 x126 -x125 -x124 x123 x122 -x121 x120 -x119 -x118 x117 x116 -x115 -x114 x113 -x112 x111 -x110
0.00/0.04 v x109 -x108 x107 -x106 x105 x104 -x103 -x102 -x101 x100 -x99 -x98 x97 x96 -x95 x94 -x93 -x92 x91 x90 -x89 -x88 x87 -x86 x85
0.00/0.04 v -x84 x83 x82 -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
0.00/0.04 v -x56 x55 -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.00/0.04 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.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.03 (included in solving)
0.00/0.04 c reading : 0.01 (included in solving)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3732613-1338704871.opb
0.00/0.04 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 950 initial, 950 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3732613-1338704871.opb
0.00/0.04 c Variables : 7 (7 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 7 initial, 7 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 5 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 10 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0 3 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 142 6 0 0 0 0 0 0 0
0.00/0.04 c setppc : 0.00 5 0 0 0 0 155 0 0 0
0.00/0.04 c linear : 0.01 20 0 0 24 0 247 0 17 0
0.00/0.04 c logicor : 0.01 2 0 0 1 0 541 0 0 0
0.00/0.04 c root node : - 0 - - 0 - - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 6 0 0 0 0 0 0
0.00/0.04 c setppc : 2 0 204 0 0 4 0 10 0 0 0 0
0.00/0.04 c logicor : 5 0 176 0 0 3 0 8 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 4 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c pseudoobj : 1 0 0 0
0.00/0.04 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.04 c vbounds : 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c redcost : 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0 0 0 0 0
0.00/0.04 c clique : 0.00 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.04 c Pricers : Time Calls Vars
0.00/0.04 c problem variables: 0.00 0 0
0.00/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : Time Calls Found
0.00/0.04 c LP solutions : 0.00 - 0
0.00/0.04 c pseudo solutions : 0.00 - 0
0.00/0.04 c trivial : 0.00 2 1
0.00/0.04 c shiftandpropagate: 0.00 0 0
0.00/0.04 c simplerounding : 0.00 0 0
0.00/0.04 c zirounding : 0.00 0 0
0.00/0.04 c rounding : 0.00 0 0
0.00/0.04 c shifting : 0.00 0 0
0.00/0.04 c intshifting : 0.00 0 0
0.00/0.04 c oneopt : 0.00 1 1
0.00/0.04 c twoopt : 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0 0
0.00/0.04 c feaspump : 0.00 0 0
0.00/0.04 c clique : 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0 0
0.00/0.04 c intdiving : 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0 0
0.00/0.04 c octane : 0.00 0 0
0.00/0.04 c rens : 0.00 0 0
0.00/0.04 c rins : 0.00 0 0
0.00/0.04 c localbranching : 0.00 0 0
0.00/0.04 c mutation : 0.00 0 0
0.00/0.04 c crossover : 0.00 0 0
0.00/0.04 c dins : 0.00 0 0
0.00/0.04 c vbounds : 0.00 0 0
0.00/0.04 c undercover : 0.00 0 0
0.00/0.04 c subnlp : 0.00 0 0
0.00/0.04 c trysol : 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.04 c primal LP : 0.00 0 0 0.00 -
0.00/0.04 c dual LP : 0.00 1 2 2.00 -
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 -
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 1
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 2 (2 improvements)
0.00/0.04 c First Solution : +9.70000000000000e+01 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trivial>)
0.00/0.04 c Primal Bound : +9.40000000000000e+01 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <oneopt>)
0.00/0.04 c Dual Bound : +9.40000000000000e+01
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +9.40000000000000e+01
0.00/0.04 c Root Iterations : 2
0.00/0.05 c Time complete: 0.03.