0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704355-1278553794.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.06/0.07 c (round 1) 0 del vars, 35 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 915 upgd conss, 704 impls, 0 clqs
0.09/0.10 c (round 2) 8 del vars, 35 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 915 upgd conss, 2384 impls, 0 clqs
0.09/0.10 c (round 3) 8 del vars, 122 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 915 upgd conss, 2384 impls, 0 clqs
0.09/0.11 c (round 4) 8 del vars, 124 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 915 upgd conss, 2384 impls, 0 clqs
0.09/0.12 c presolving (5 rounds):
0.09/0.12 c 8 deleted vars, 124 deleted constraints, 0 tightened bounds, 0 added holes, 35 changed sides, 0 changed coefficients
0.09/0.12 c 2384 implications, 0 cliques
0.09/0.12 c presolved problem has 192 variables (192 bin, 0 int, 0 impl, 0 cont) and 826 constraints
0.09/0.12 c 150 constraints of type <setppc>
0.09/0.12 c 676 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.08
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.3
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1789.98
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.12 c # [type: int, range: [1,2], default: 1]
0.09/0.12 c timing/clocktype = 2
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/indicator/addCouplingCons = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/rapidlearning/freq = 0
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.19/0.28 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.28 c 0.3s| 1 | 0 | 1133 | - |1795k| 0 | 174 | 192 | 826 | 192 | 826 | 0 | 0 | 0 | 7.024399e+01 | -- | Inf
1.29/1.35 o 92
1.29/1.35 c y 1.3s| 1 | 0 | 3098 | - |3777k| 0 | 174 | 192 | 826 | 192 | 826 | 0 | 0 | 0 | 7.024399e+01 | 9.200000e+01 | 30.97%
1.29/1.39 c 1.4s| 1 | 0 | 3227 | - |3666k| 0 | - | 192 | 826 | 192 | 826 | 0 | 0 | 0 | 9.200000e+01 | 9.200000e+01 | 0.00%
1.29/1.39 c 1.4s| 1 | 0 | 3227 | - |3666k| 0 | - | 192 | 826 | 192 | 826 | 0 | 0 | 0 | 9.200000e+01 | 9.200000e+01 | 0.00%
1.29/1.39 c
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time (sec) : 1.36
1.29/1.39 c Solving Nodes : 1
1.29/1.39 c Primal Bound : +9.20000000000000e+01 (1 solutions)
1.29/1.39 c Dual Bound : +9.20000000000000e+01
1.29/1.39 c Gap : 0.00 %
1.29/1.39 s OPTIMUM FOUND
1.29/1.39 v -x200 x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 x190 -x189 -x188 x187 x186 -x185 -x184 x183 -x182 x181 x180 -x179 x178 -x177
1.29/1.39 v -x176 x175 -x174 x173 -x172 x171 -x170 -x169 x168 -x167 x166 -x165 x164 -x163 x162 -x161 -x160 x159 -x158 x157 x156 -x155
1.29/1.39 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 x146 -x145 -x144 -x143 x142 -x141 -x140 x139 x138 -x137 x136 -x135 x134 -x133 x132
1.29/1.39 v -x131 x130 -x129 x128 -x127 x126 -x125 x124 -x123 x122 -x121 -x120 x119 -x118 x117 x116 -x115 -x114 x113 x112 -x111 x110
1.29/1.39 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
1.29/1.39 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
1.29/1.39 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
1.29/1.39 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
1.29/1.39 c SCIP Status : problem is solved [optimal solution found]
1.29/1.39 c Solving Time : 1.36
1.29/1.39 c Original Problem :
1.29/1.39 c Problem name : HOME/instance-2704355-1278553794.opb
1.29/1.39 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 950 initial, 950 maximal
1.29/1.39 c Presolved Problem :
1.29/1.39 c Problem name : t_HOME/instance-2704355-1278553794.opb
1.29/1.39 c Variables : 192 (192 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.39 c Constraints : 826 initial, 826 maximal
1.29/1.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.39 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.39 c probing : 0.02 8 0 0 0 0 0 0 0
1.29/1.39 c setppc : 0.00 0 0 0 0 0 13 0 0
1.29/1.39 c linear : 0.03 0 0 0 0 0 35 35 0
1.29/1.39 c logicor : 0.03 0 0 0 0 0 76 0 0
1.29/1.39 c root node : - 143 - - 143 - - - -
1.29/1.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.39 c integral : 0 0 0 0 0 0 0 0 0 0
1.29/1.39 c setppc : 150 1 583 0 0 2 0 0 0 0
1.29/1.39 c logicor : 676 1 486 0 0 0 0 0 0 0
1.29/1.39 c countsols : 0 0 0 0 0 0 0 0 0 0
1.29/1.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.39 c integral : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.39 c Propagators : Time Calls Cutoffs DomReds
1.29/1.39 c vbounds : 0.00 2 0 0
1.29/1.39 c rootredcost : 0.00 0 0 0
1.29/1.39 c pseudoobj : 0.00 3 1 0
1.29/1.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.39 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.39 c applied globally : - - - 0 0.0 - - -
1.29/1.39 c applied locally : - - - 0 0.0 - - -
1.29/1.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 564)
1.29/1.39 c redcost : 0.00 1 0 0 0 0
1.29/1.39 c impliedbounds : 0.00 1 0 0 119 0
1.29/1.39 c intobj : 0.00 0 0 0 0 0
1.29/1.39 c cgmip : 0.00 0 0 0 0 0
1.29/1.39 c gomory : 0.08 1 0 0 0 0
1.29/1.39 c strongcg : 0.07 1 0 0 500 0
1.29/1.39 c cmir : 0.01 1 0 0 0 0
1.29/1.39 c flowcover : 0.00 1 0 0 0 0
1.29/1.39 c clique : 0.00 1 0 0 6 0
1.29/1.39 c zerohalf : 0.00 0 0 0 0 0
1.29/1.39 c mcf : 0.00 1 0 0 0 0
1.29/1.39 c rapidlearning : 0.32 1 0 143 0 0
1.29/1.39 c Pricers : Time Calls Vars
1.29/1.39 c problem variables: 0.00 0 0
1.29/1.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.39 c pscost : 0.00 0 0 0 0 0 0
1.29/1.39 c inference : 0.00 0 0 0 0 0 0
1.29/1.39 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.39 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.39 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.39 c random : 0.00 0 0 0 0 0 0
1.29/1.39 c relpscost : 0.00 0 0 0 0 0 0
1.29/1.39 c Primal Heuristics : Time Calls Found
1.29/1.39 c LP solutions : 0.00 - 0
1.29/1.39 c pseudo solutions : 0.00 - 0
1.29/1.39 c oneopt : 0.00 0 0
1.29/1.39 c trivial : 0.00 2 0
1.29/1.39 c simplerounding : 0.00 0 0
1.29/1.39 c zirounding : 0.00 0 0
1.29/1.39 c rounding : 0.00 1 0
1.29/1.39 c shifting : 0.00 1 0
1.29/1.39 c intshifting : 0.00 0 0
1.29/1.39 c twoopt : 0.00 0 0
1.29/1.39 c fixandinfer : 0.00 0 0
1.29/1.39 c feaspump : 0.58 1 0
1.29/1.39 c coefdiving : 0.00 0 0
1.29/1.39 c pscostdiving : 0.00 0 0
1.29/1.39 c fracdiving : 0.00 0 0
1.29/1.39 c veclendiving : 0.00 0 0
1.29/1.39 c intdiving : 0.00 0 0
1.29/1.39 c actconsdiving : 0.00 0 0
1.29/1.39 c objpscostdiving : 0.00 0 0
1.29/1.39 c rootsoldiving : 0.00 0 0
1.29/1.39 c linesearchdiving : 0.00 0 0
1.29/1.39 c guideddiving : 0.00 0 0
1.29/1.39 c octane : 0.00 0 0
1.29/1.39 c rens : 0.00 0 0
1.29/1.39 c rins : 0.00 0 0
1.29/1.39 c localbranching : 0.00 0 0
1.29/1.39 c mutation : 0.00 0 0
1.29/1.39 c crossover : 0.00 0 0
1.29/1.39 c dins : 0.00 0 0
1.29/1.39 c undercover : 0.00 0 0
1.29/1.39 c nlp : 0.00 0 0
1.29/1.39 c trysol : 0.00 0 0
1.29/1.39 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.39 c primal LP : 0.00 0 0 0.00 -
1.29/1.39 c dual LP : 0.19 2 1262 631.00 6476.38
1.29/1.39 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.39 c barrier LP : 0.00 0 0 0.00 -
1.29/1.39 c diving/probing LP: 0.57 52 1965 37.79 3427.57
1.29/1.39 c strong branching : 0.00 0 0 0.00 -
1.29/1.39 c (at root node) : - 0 0 0.00 -
1.29/1.39 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.39 c B&B Tree :
1.29/1.39 c number of runs : 1
1.29/1.39 c nodes : 1
1.29/1.39 c nodes (total) : 1
1.29/1.39 c nodes left : 0
1.29/1.39 c max depth : 0
1.29/1.39 c max depth (total): 0
1.29/1.39 c backtracks : 0 (0.0%)
1.29/1.39 c delayed cutoffs : 0
1.29/1.39 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.39 c avg switch length: 2.00
1.29/1.39 c switching time : 0.00
1.29/1.39 c Solution :
1.29/1.39 c Solutions found : 1 (1 improvements)
1.29/1.39 c First Solution : +9.20000000000000e+01 (in run 1, after 1 nodes, 1.32 seconds, depth 0, found by <trysol>)
1.29/1.39 c Primal Bound : +9.20000000000000e+01 (in run 1, after 1 nodes, 1.32 seconds, depth 0, found by <trysol>)
1.29/1.39 c Dual Bound : +9.20000000000000e+01
1.29/1.39 c Gap : 0.00 %
1.29/1.39 c Root Dual Bound : +9.20000000000000e+01
1.29/1.39 c Root Iterations : 3227
1.39/1.40 c Time complete: 1.39.