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-2704414-1278554990.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.07/0.07 c (round 1) 0 del vars, 16 del conss, 0 chg bounds, 16 chg sides, 0 chg coeffs, 884 upgd conss, 632 impls, 0 clqs
0.09/0.10 c (round 2) 11 del vars, 16 del conss, 1 chg bounds, 16 chg sides, 0 chg coeffs, 884 upgd conss, 1417 impls, 0 clqs
0.09/0.10 c (round 3) 11 del vars, 58 del conss, 1 chg bounds, 16 chg sides, 0 chg coeffs, 884 upgd conss, 1417 impls, 0 clqs
0.09/0.11 c (round 4) 11 del vars, 59 del conss, 1 chg bounds, 16 chg sides, 0 chg coeffs, 884 upgd conss, 1417 impls, 0 clqs
0.09/0.11 c presolving (5 rounds):
0.09/0.11 c 11 deleted vars, 59 deleted constraints, 1 tightened bounds, 0 added holes, 16 changed sides, 0 changed coefficients
0.09/0.11 c 1417 implications, 0 cliques
0.09/0.11 c presolved problem has 189 variables (189 bin, 0 int, 0 impl, 0 cont) and 841 constraints
0.09/0.11 c 141 constraints of type <setppc>
0.09/0.11 c 700 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.08
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.98
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/rapidlearning/freq = 0
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.29/0.36 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.3s| 1 | 0 | 1304 | - |1725k| 0 | 172 | 189 | 841 | 189 | 839 | 0 | 0 | 0 | 6.900374e+01 | -- | Inf
1.29/1.30 o 97
1.29/1.30 c y 1.3s| 1 | 0 | 3164 | - |3642k| 0 | 172 | 189 | 841 | 189 | 839 | 0 | 0 | 0 | 6.900374e+01 | 9.700000e+01 | 40.57%
1.29/1.34 c 1.3s| 1 | 0 | 3272 | - |3582k| 0 | - | 189 | 841 | 189 | 839 | 0 | 0 | 0 | 9.700000e+01 | 9.700000e+01 | 0.00%
1.29/1.34 c 1.3s| 1 | 0 | 3272 | - |3582k| 0 | - | 189 | 841 | 189 | 839 | 0 | 0 | 0 | 9.700000e+01 | 9.700000e+01 | 0.00%
1.29/1.34 c
1.29/1.34 c SCIP Status : problem is solved [optimal solution found]
1.29/1.34 c Solving Time (sec) : 1.31
1.29/1.34 c Solving Nodes : 1
1.29/1.34 c Primal Bound : +9.70000000000000e+01 (1 solutions)
1.29/1.34 c Dual Bound : +9.70000000000000e+01
1.29/1.34 c Gap : 0.00 %
1.29/1.34 s OPTIMUM FOUND
1.29/1.34 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.34 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.34 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.34 v -x131 x130 -x129 -x128 x127 x126 -x125 -x124 x123 -x122 x121 -x120 x119 x118 -x117 -x116 x115 x114 -x113 x112 -x111 x110 -x109
1.29/1.34 v -x108 x107 -x106 x105 -x104 x103 -x102 x101 -x100 x99 x98 -x97 -x96 x95 -x94 -x93 -x92 x91 -x90 x89 -x88 x87 -x86 x85 x84
1.29/1.34 v -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 -x56
1.29/1.34 v 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 x28
1.29/1.34 v -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.34 c SCIP Status : problem is solved [optimal solution found]
1.29/1.34 c Solving Time : 1.31
1.29/1.34 c Original Problem :
1.29/1.34 c Problem name : HOME/instance-2704414-1278554990.opb
1.29/1.34 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.34 c Constraints : 900 initial, 900 maximal
1.29/1.34 c Presolved Problem :
1.29/1.34 c Problem name : t_HOME/instance-2704414-1278554990.opb
1.29/1.34 c Variables : 189 (189 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.34 c Constraints : 841 initial, 841 maximal
1.29/1.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.34 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c probing : 0.02 4 7 0 1 0 0 0 0
1.29/1.34 c setppc : 0.00 0 0 0 0 0 13 0 0
1.29/1.34 c linear : 0.03 0 0 0 0 0 16 16 0
1.29/1.34 c logicor : 0.03 0 0 0 0 0 30 0 0
1.29/1.34 c root node : - 76 - - 76 - - - -
1.29/1.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.34 c integral : 0 0 0 0 0 0 0 0 0 0
1.29/1.34 c setppc : 141 1 469 0 0 0 0 0 0 0
1.29/1.34 c logicor : 700 1 424 0 0 0 0 0 0 0
1.29/1.34 c countsols : 0 0 0 0 0 0 0 0 0 0
1.29/1.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.34 c integral : 0.00 0.00 0.00 0.00 0.00
1.29/1.34 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.34 c logicor : 0.01 0.00 0.01 0.00 0.00
1.29/1.34 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.34 c Propagators : Time Calls Cutoffs DomReds
1.29/1.34 c vbounds : 0.00 2 0 0
1.29/1.34 c rootredcost : 0.00 0 0 0
1.29/1.34 c pseudoobj : 0.00 3 1 0
1.29/1.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.34 c applied globally : - - - 0 0.0 - - -
1.29/1.34 c applied locally : - - - 0 0.0 - - -
1.29/1.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 573)
1.29/1.34 c redcost : 0.00 1 0 0 0 0
1.29/1.34 c impliedbounds : 0.00 1 0 0 126 0
1.29/1.34 c intobj : 0.00 0 0 0 0 0
1.29/1.34 c cgmip : 0.00 0 0 0 0 0
1.29/1.34 c gomory : 0.09 1 0 0 4 0
1.29/1.34 c strongcg : 0.07 1 0 0 500 0
1.29/1.34 c cmir : 0.01 1 0 0 0 0
1.29/1.34 c flowcover : 0.00 1 0 0 0 0
1.29/1.34 c clique : 0.00 1 0 0 7 0
1.29/1.34 c zerohalf : 0.00 0 0 0 0 0
1.29/1.34 c mcf : 0.00 1 0 0 0 0
1.29/1.34 c rapidlearning : 0.16 1 0 76 0 0
1.29/1.34 c Pricers : Time Calls Vars
1.29/1.34 c problem variables: 0.00 0 0
1.29/1.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.34 c pscost : 0.00 0 0 0 0 0 0
1.29/1.34 c inference : 0.00 0 0 0 0 0 0
1.29/1.34 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.34 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.34 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.34 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.34 c random : 0.00 0 0 0 0 0 0
1.29/1.34 c relpscost : 0.00 0 0 0 0 0 0
1.29/1.34 c Primal Heuristics : Time Calls Found
1.29/1.34 c LP solutions : 0.00 - 0
1.29/1.34 c pseudo solutions : 0.00 - 0
1.29/1.34 c oneopt : 0.00 0 0
1.29/1.34 c trivial : 0.00 2 0
1.29/1.34 c simplerounding : 0.00 0 0
1.29/1.34 c zirounding : 0.00 0 0
1.29/1.34 c rounding : 0.00 1 0
1.29/1.34 c shifting : 0.00 1 0
1.29/1.34 c intshifting : 0.00 0 0
1.29/1.34 c twoopt : 0.00 0 0
1.29/1.34 c fixandinfer : 0.00 0 0
1.29/1.34 c feaspump : 0.61 1 0
1.29/1.34 c coefdiving : 0.00 0 0
1.29/1.34 c pscostdiving : 0.00 0 0
1.29/1.34 c fracdiving : 0.00 0 0
1.29/1.34 c veclendiving : 0.00 0 0
1.29/1.34 c intdiving : 0.00 0 0
1.29/1.34 c actconsdiving : 0.00 0 0
1.29/1.34 c objpscostdiving : 0.00 0 0
1.29/1.34 c rootsoldiving : 0.00 0 0
1.29/1.34 c linesearchdiving : 0.00 0 0
1.29/1.34 c guideddiving : 0.00 0 0
1.29/1.34 c octane : 0.00 0 0
1.29/1.34 c rens : 0.00 0 0
1.29/1.34 c rins : 0.00 0 0
1.29/1.34 c localbranching : 0.00 0 0
1.29/1.34 c mutation : 0.00 0 0
1.29/1.34 c crossover : 0.00 0 0
1.29/1.34 c dins : 0.00 0 0
1.29/1.34 c undercover : 0.00 0 0
1.29/1.34 c nlp : 0.00 0 0
1.29/1.34 c trysol : 0.00 0 0
1.29/1.34 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.34 c primal LP : 0.00 0 0 0.00 -
1.29/1.34 c dual LP : 0.26 2 1412 706.00 5328.60
1.29/1.34 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.34 c barrier LP : 0.00 0 0 0.00 -
1.29/1.34 c diving/probing LP: 0.60 31 1860 60.00 3105.35
1.29/1.34 c strong branching : 0.00 0 0 0.00 -
1.29/1.34 c (at root node) : - 0 0 0.00 -
1.29/1.34 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.34 c B&B Tree :
1.29/1.34 c number of runs : 1
1.29/1.34 c nodes : 1
1.29/1.34 c nodes (total) : 1
1.29/1.34 c nodes left : 0
1.29/1.34 c max depth : 0
1.29/1.34 c max depth (total): 0
1.29/1.34 c backtracks : 0 (0.0%)
1.29/1.34 c delayed cutoffs : 0
1.29/1.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.34 c avg switch length: 2.00
1.29/1.34 c switching time : 0.00
1.29/1.34 c Solution :
1.29/1.34 c Solutions found : 1 (1 improvements)
1.29/1.34 c First Solution : +9.70000000000000e+01 (in run 1, after 1 nodes, 1.28 seconds, depth 0, found by <trysol>)
1.29/1.34 c Primal Bound : +9.70000000000000e+01 (in run 1, after 1 nodes, 1.28 seconds, depth 0, found by <trysol>)
1.29/1.34 c Dual Bound : +9.70000000000000e+01
1.29/1.34 c Gap : 0.00 %
1.29/1.34 c Root Dual Bound : +9.70000000000000e+01
1.29/1.34 c Root Iterations : 3272
1.29/1.35 c Time complete: 1.34.