0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2667563-1276466316.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 748 impls, 0 clqs
0.00/0.04 c (round 2) 6 del vars, 56 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 772 impls, 0 clqs
0.00/0.05 c (round 3) 10 del vars, 69 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.05 c (round 4) 15 del vars, 113 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.05 c (round 5) 20 del vars, 164 del conss, 17 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 846 impls, 0 clqs
0.00/0.05 c (round 6) 22 del vars, 201 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.00/0.06 c (round 7) 26 del vars, 218 del conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 878 impls, 0 clqs
0.00/0.06 c (round 8) 27 del vars, 227 del conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 908 impls, 0 clqs
0.00/0.08 c (round 9) 27 del vars, 245 del conss, 24 chg bounds, 18 chg sides, 0 chg coeffs, 0 upgd conss, 908 impls, 0 clqs
0.09/0.10 c (round 10) 27 del vars, 247 del conss, 24 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 908 impls, 0 clqs
0.09/0.12 c (round 11) 109 del vars, 247 del conss, 26 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3256 impls, 0 clqs
0.09/0.12 c (round 12) 112 del vars, 756 del conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3771 impls, 0 clqs
0.09/0.13 c (round 13) 119 del vars, 772 del conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3829 impls, 0 clqs
0.09/0.13 c (round 14) 121 del vars, 780 del conss, 31 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3876 impls, 0 clqs
0.09/0.13 c (round 15) 126 del vars, 805 del conss, 31 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3900 impls, 0 clqs
0.09/0.13 c (round 16) 126 del vars, 813 del conss, 31 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3942 impls, 0 clqs
0.09/0.13 c (round 17) 127 del vars, 814 del conss, 31 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3942 impls, 0 clqs
0.09/0.14 c (round 18) 132 del vars, 814 del conss, 31 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4910 impls, 0 clqs
0.09/0.14 c presolving (19 rounds):
0.09/0.14 c 132 deleted vars, 814 deleted constraints, 31 tightened bounds, 0 added holes, 18 changed sides, 0 changed coefficients
0.09/0.14 c 4910 implications, 0 cliques
0.09/0.14 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.09/0.14 c 136 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.09
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.14 c # SCIP version 1.2.1.2
0.09/0.14 c
0.09/0.14 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c conflict/interconss = 0
0.09/0.14 c
0.09/0.14 c # should binary conflicts be preferred?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c conflict/preferbinary = TRUE
0.09/0.14 c
0.09/0.14 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c constraints/agelimit = 1
0.09/0.14 c
0.09/0.14 c # should enforcement of pseudo solution be disabled?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/disableenfops = TRUE
0.09/0.14 c
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = 10000
0.09/0.14 c
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = 1799.98
0.09/0.14 c
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = 1620
0.09/0.14 c
0.09/0.14 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c lp/solvefreq = 0
0.09/0.14 c
0.09/0.14 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.14 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.14 c lp/pricing = a
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # priority of node selection rule <dfs> in standard mode
0.09/0.14 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.14 c nodeselection/dfs/stdpriority = 1000000
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 0 | 71 | - |1259k| 0 | 46 | 68 | 136 | 68 | 126 | 0 | 0 | 0 | 8.778571e+01 | -- | Inf
0.09/0.15 o 99
0.09/0.15 c R 0.1s| 1 | 0 | 71 | - |1264k| 0 | 46 | 68 | 136 | 68 | 126 | 0 | 0 | 0 | 8.778571e+01 | 9.900000e+01 | 12.77%
0.09/0.15 o 98
0.09/0.15 c s 0.1s| 1 | 0 | 71 | - |1269k| 0 | 46 | 68 | 136 | 68 | 126 | 0 | 0 | 0 | 8.778571e+01 | 9.800000e+01 | 11.64%
0.09/0.16 c 0.1s| 1 | 0 | 92 | - |1295k| 0 | 46 | 68 | 136 | 68 | 149 | 23 | 0 | 0 | 8.900000e+01 | 9.800000e+01 | 10.11%
0.09/0.16 o 89
0.09/0.16 c b 0.1s| 1 | 0 | 92 | - |1300k| 0 | - | 68 | 136 | 68 | 149 | 23 | 0 | 0 | 8.900000e+01 | 8.900000e+01 | 0.00%
0.09/0.16 c 0.1s| 1 | 0 | 92 | - |1297k| 0 | - | 68 | 136 | 68 | 149 | 23 | 0 | 0 | 8.900000e+01 | 8.900000e+01 | 0.00%
0.09/0.16 c
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time (sec) : 0.10
0.09/0.16 c Solving Nodes : 1
0.09/0.16 c Primal Bound : +8.90000000000000e+01 (3 solutions)
0.09/0.16 c Dual Bound : +8.90000000000000e+01
0.09/0.16 c Gap : 0.00 %
0.09/0.16 s OPTIMUM FOUND
0.09/0.16 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.09/0.16 v -x177 -x176 x175 -x174 x173 x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 -x158 x157 -x156 -x155
0.09/0.16 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 -x146 x145 x144 -x143 -x142 x141 -x140 x139 x138 -x137 x136 -x135 x134 -x133
0.09/0.16 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.09/0.16 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.09/0.16 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.09/0.16 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
0.09/0.16 v -x29 -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.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time : 0.10
0.09/0.16 c Original Problem :
0.09/0.16 c Problem name : HOME/instance-2667563-1276466316.opb
0.09/0.16 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 950 initial, 950 maximal
0.09/0.16 c Presolved Problem :
0.09/0.16 c Problem name : t_HOME/instance-2667563-1276466316.opb
0.09/0.16 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 136 initial, 136 maximal
0.09/0.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.16 c trivial : 0.00 9 0 0 0 0 0 0 0
0.09/0.16 c dualfix : 0.00 4 0 0 0 0 0 0 0
0.09/0.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c implics : 0.00 0 6 0 0 0 0 0 0
0.09/0.16 c probing : 0.03 82 5 0 2 0 0 0 0
0.09/0.16 c linear : 0.02 20 0 0 24 0 245 18 0
0.09/0.16 c logicor : 0.01 6 0 0 5 0 569 0 0
0.09/0.16 c root node : - 0 - - 0 - - - -
0.09/0.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.16 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.16 c logicor : 136 1 714 0 0 17 0 0 0 0
0.09/0.16 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.16 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c logicor : 0.01 0.00 0.01 0.00 0.00
0.09/0.16 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c Propagators : Time Calls Cutoffs DomReds
0.09/0.16 c vbounds : 0.00 2 0 0
0.09/0.16 c rootredcost : 0.00 0 0 0
0.09/0.16 c pseudoobj : 0.00 3 0 0
0.09/0.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.16 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c applied globally : - - - 0 0.0 - - -
0.09/0.16 c applied locally : - - - 0 0.0 - - -
0.09/0.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.16 c cut pool : 0.00 0 - - 0 - (maximal pool size: 38)
0.09/0.16 c redcost : 0.00 1 0 0 0 0
0.09/0.16 c impliedbounds : 0.00 1 0 0 31 0
0.09/0.16 c intobj : 0.00 0 0 0 0 0
0.09/0.16 c cgmip : 0.00 0 0 0 0 0
0.09/0.16 c gomory : 0.00 1 0 0 116 0
0.09/0.16 c strongcg : 0.01 1 0 0 116 0
0.09/0.16 c cmir : 0.00 1 0 0 0 0
0.09/0.16 c flowcover : 0.00 1 0 0 0 0
0.09/0.16 c clique : 0.00 1 0 0 6 0
0.09/0.16 c zerohalf : 0.00 0 0 0 0 0
0.09/0.16 c mcf : 0.00 1 0 0 0 0
0.09/0.16 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.16 c Pricers : Time Calls Vars
0.09/0.16 c problem variables: 0.00 0 0
0.09/0.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.16 c pscost : 0.00 0 0 0 0 0 0
0.09/0.16 c inference : 0.00 0 0 0 0 0 0
0.09/0.16 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.16 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.16 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c random : 0.00 0 0 0 0 0 0
0.09/0.16 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.16 c Primal Heuristics : Time Calls Found
0.09/0.17 c LP solutions : 0.00 - 0
0.09/0.17 c pseudo solutions : 0.00 - 0
0.09/0.17 c trivial : 0.00 2 0
0.09/0.17 c simplerounding : 0.00 0 0
0.09/0.17 c zirounding : 0.00 0 0
0.09/0.17 c rounding : 0.00 1 1
0.09/0.17 c shifting : 0.00 1 1
0.09/0.17 c intshifting : 0.00 0 0
0.09/0.17 c oneopt : 0.00 1 1
0.09/0.17 c twoopt : 0.00 0 0
0.09/0.17 c fixandinfer : 0.00 0 0
0.09/0.17 c feaspump : 0.00 0 0
0.09/0.17 c coefdiving : 0.00 0 0
0.09/0.17 c pscostdiving : 0.00 0 0
0.09/0.17 c fracdiving : 0.00 0 0
0.09/0.17 c veclendiving : 0.00 0 0
0.09/0.17 c intdiving : 0.00 0 0
0.09/0.17 c actconsdiving : 0.00 0 0
0.09/0.17 c objpscostdiving : 0.00 0 0
0.09/0.17 c rootsoldiving : 0.00 0 0
0.09/0.17 c linesearchdiving : 0.00 0 0
0.09/0.17 c guideddiving : 0.00 0 0
0.09/0.17 c octane : 0.00 0 0
0.09/0.17 c rens : 0.00 0 0
0.09/0.17 c rins : 0.00 0 0
0.09/0.17 c localbranching : 0.00 0 0
0.09/0.17 c mutation : 0.00 0 0
0.09/0.17 c crossover : 0.00 0 0
0.09/0.17 c dins : 0.00 0 0
0.09/0.17 c undercover : 0.00 0 0
0.09/0.17 c nlp : 0.00 0 0
0.09/0.17 c trysol : 0.00 0 0
0.09/0.17 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.17 c primal LP : 0.00 0 0 0.00 -
0.09/0.17 c dual LP : 0.00 2 92 46.00 -
0.09/0.17 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.17 c barrier LP : 0.00 0 0 0.00 -
0.09/0.17 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.17 c strong branching : 0.00 0 0 0.00 -
0.09/0.17 c (at root node) : - 0 0 0.00 -
0.09/0.17 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.17 c B&B Tree :
0.09/0.17 c number of runs : 1
0.09/0.17 c nodes : 1
0.09/0.17 c nodes (total) : 1
0.09/0.17 c nodes left : 0
0.09/0.17 c max depth : 0
0.09/0.17 c max depth (total): 0
0.09/0.17 c backtracks : 0 (0.0%)
0.09/0.17 c delayed cutoffs : 0
0.09/0.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.17 c avg switch length: 2.00
0.09/0.17 c switching time : 0.00
0.09/0.17 c Solution :
0.09/0.17 c Solutions found : 3 (3 improvements)
0.09/0.17 c First Solution : +9.90000000000000e+01 (in run 1, after 1 nodes, 0.09 seconds, depth 0, found by <rounding>)
0.09/0.17 c Primal Bound : +8.90000000000000e+01 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <oneopt>)
0.09/0.17 c Dual Bound : +8.90000000000000e+01
0.09/0.17 c Gap : 0.00 %
0.09/0.17 c Root Dual Bound : +8.90000000000000e+01
0.09/0.17 c Root Iterations : 92
0.09/0.17 c Time complete: 0.17.