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-2667558-1276464733.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 786 impls, 0 clqs
0.00/0.04 c (round 2) 12 del vars, 79 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 0 clqs
0.00/0.04 c (round 3) 19 del vars, 142 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 884 impls, 0 clqs
0.00/0.05 c (round 4) 23 del vars, 184 del conss, 20 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 946 impls, 0 clqs
0.00/0.05 c (round 5) 26 del vars, 225 del conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 956 impls, 0 clqs
0.04/0.05 c (round 6) 30 del vars, 253 del conss, 27 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1014 impls, 0 clqs
0.04/0.06 c (round 7) 31 del vars, 263 del conss, 28 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1080 impls, 0 clqs
0.04/0.09 c (round 8) 31 del vars, 283 del conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 1096 impls, 0 clqs
0.09/0.13 c (round 9) 83 del vars, 283 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6444 impls, 0 clqs
0.09/0.13 c (round 10) 83 del vars, 555 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6598 impls, 0 clqs
0.09/0.13 c (round 11) 83 del vars, 563 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6598 impls, 0 clqs
0.09/0.14 c (round 12) 85 del vars, 563 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6700 impls, 0 clqs
0.09/0.14 c (round 13) 85 del vars, 623 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6806 impls, 0 clqs
0.09/0.14 c (round 14) 85 del vars, 627 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6806 impls, 0 clqs
0.09/0.14 c presolving (15 rounds):
0.09/0.14 c 85 deleted vars, 627 deleted constraints, 30 tightened bounds, 0 added holes, 18 changed sides, 0 changed coefficients
0.09/0.14 c 6806 implications, 0 cliques
0.09/0.14 c presolved problem has 115 variables (115 bin, 0 int, 0 impl, 0 cont) and 273 constraints
0.09/0.14 c 273 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.14 c
0.09/0.18 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.18 c 0.1s| 1 | 0 | 394 | - |1368k| 0 | 98 | 115 | 273 | 115 | 273 | 0 | 0 | 0 | 8.500000e+01 | -- | Inf
0.19/0.20 o 93
0.19/0.20 c F 0.1s| 1 | 0 | 585 | - |1387k| 0 | 0 | 115 | 273 | 115 | 273 | 0 | 0 | 0 | 8.500000e+01 | 9.300000e+01 | 9.41%
0.19/0.25 c 0.2s| 1 | 0 | 675 | - |1557k| 0 | 100 | 115 | 273 | 115 | 300 | 27 | 0 | 0 | 8.609632e+01 | 9.300000e+01 | 8.02%
0.29/0.32 c 0.2s| 1 | 0 | 754 | - |1803k| 0 | 101 | 115 | 273 | 115 | 317 | 44 | 0 | 0 | 8.654268e+01 | 9.300000e+01 | 7.46%
0.29/0.38 c 0.3s| 1 | 0 | 791 | - |1814k| 0 | 98 | 115 | 273 | 115 | 322 | 49 | 0 | 0 | 8.682305e+01 | 9.300000e+01 | 7.11%
0.39/0.44 c 0.4s| 1 | 0 | 827 | - |1957k| 0 | 102 | 115 | 273 | 115 | 326 | 53 | 0 | 0 | 8.691810e+01 | 9.300000e+01 | 7.00%
0.49/0.51 c 0.4s| 1 | 0 | 896 | - |2033k| 0 | 98 | 115 | 273 | 115 | 329 | 56 | 0 | 0 | 8.712257e+01 | 9.300000e+01 | 6.75%
0.49/0.59 c 0.5s| 1 | 0 | 1002 | - |2061k| 0 | 100 | 115 | 273 | 115 | 332 | 59 | 0 | 0 | 8.728812e+01 | 9.300000e+01 | 6.54%
0.59/0.66 c 0.6s| 1 | 0 | 1021 | - |2065k| 0 | 103 | 115 | 273 | 115 | 335 | 62 | 0 | 0 | 8.729838e+01 | 9.300000e+01 | 6.53%
0.69/0.74 c 0.7s| 1 | 0 | 1059 | - |2066k| 0 | 105 | 115 | 273 | 115 | 336 | 63 | 0 | 0 | 8.730657e+01 | 9.300000e+01 | 6.52%
0.79/0.82 c 0.7s| 1 | 0 | 1102 | - |2067k| 0 | 98 | 115 | 273 | 115 | 337 | 64 | 0 | 0 | 8.731910e+01 | 9.300000e+01 | 6.51%
0.89/0.90 c 0.8s| 1 | 0 | 1120 | - |2069k| 0 | 99 | 115 | 273 | 115 | 338 | 65 | 0 | 0 | 8.733004e+01 | 9.300000e+01 | 6.49%
0.89/0.97 c 0.9s| 1 | 0 | 1221 | - |2134k| 0 | 101 | 115 | 273 | 115 | 324 | 66 | 0 | 0 | 8.740330e+01 | 9.300000e+01 | 6.40%
1.00/1.05 c 0.9s| 1 | 0 | 1276 | - |2951k| 0 | 96 | 115 | 273 | 115 | 325 | 67 | 0 | 0 | 8.741799e+01 | 9.300000e+01 | 6.39%
1.10/1.11 c 1.0s| 1 | 0 | 1308 | - |3032k| 0 | 100 | 115 | 273 | 115 | 326 | 68 | 0 | 0 | 8.742670e+01 | 9.300000e+01 | 6.37%
1.10/1.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.16 c 1.1s| 1 | 0 | 1333 | - |3116k| 0 | 96 | 115 | 273 | 115 | 328 | 70 | 0 | 0 | 8.742799e+01 | 9.300000e+01 | 6.37%
1.19/1.22 c 1.1s| 1 | 0 | 1386 | - |3309k| 0 | 101 | 115 | 273 | 115 | 329 | 71 | 0 | 0 | 8.744192e+01 | 9.300000e+01 | 6.36%
1.19/1.28 c 1.2s| 1 | 0 | 1458 | - |3430k| 0 | 104 | 115 | 273 | 115 | 330 | 72 | 0 | 0 | 8.745694e+01 | 9.300000e+01 | 6.34%
1.29/1.33 c 1.2s| 1 | 0 | 1497 | - |3498k| 0 | 102 | 115 | 273 | 115 | 317 | 73 | 0 | 0 | 8.746096e+01 | 9.300000e+01 | 6.33%
1.29/1.39 c 1.3s| 1 | 0 | 1563 | - |3564k| 0 | 102 | 115 | 273 | 115 | 318 | 74 | 0 | 0 | 8.746702e+01 | 9.300000e+01 | 6.33%
1.39/1.44 c 1.3s| 1 | 0 | 1579 | - |3566k| 0 | 102 | 115 | 273 | 115 | 319 | 75 | 0 | 0 | 8.746842e+01 | 9.300000e+01 | 6.32%
1.39/1.49 c 1.4s| 1 | 0 | 1621 | - |3584k| 0 | 101 | 115 | 273 | 115 | 320 | 76 | 0 | 0 | 8.747151e+01 | 9.300000e+01 | 6.32%
1.49/1.52 c 1.4s| 1 | 0 | 1637 | - |3588k| 0 | 102 | 115 | 273 | 115 | 322 | 78 | 0 | 0 | 8.747277e+01 | 9.300000e+01 | 6.32%
3.39/3.44 c 3.3s| 1 | 2 | 1637 | - |3589k| 0 | 102 | 115 | 273 | 115 | 322 | 78 | 0 | 49 | 8.747277e+01 | 9.300000e+01 | 6.32%
3.39/3.45 o 92
3.39/3.45 c * 3.3s| 44 | 7 | 1637 | 0.0 |3582k| 15 | - | 115 | 280 | 0 | 0 | 78 | 19 | 49 | 8.925000e+01 | 9.200000e+01 | 3.08%
3.39/3.49 c
3.39/3.49 c SCIP Status : problem is solved [optimal solution found]
3.39/3.49 c Solving Time (sec) : 3.33
3.39/3.49 c Solving Nodes : 168
3.39/3.49 c Primal Bound : +9.20000000000000e+01 (3 solutions)
3.39/3.49 c Dual Bound : +9.20000000000000e+01
3.39/3.49 c Gap : 0.00 %
3.39/3.49 s OPTIMUM FOUND
3.39/3.49 v -x200 x199 -x198 x197 -x196 x195 x194 -x193 -x192 x191 -x190 x189 x188 -x187 x186 -x185 -x184 -x183 -x182 x181 -x180 x179 -x178
3.39/3.49 v -x177 x176 -x175 -x174 x173 -x172 x171 -x170 x169 -x168 x167 x166 -x165 -x164 x163 -x162 x161 x160 -x159 -x158 x157 -x156 x155
3.39/3.49 v -x154 x153 x152 -x151 -x150 x149 x148 -x147 -x146 x145 -x144 x143 x142 -x141 -x140 x139 -x138 x137 -x136 x135 x134 -x133 -x132
3.39/3.49 v x131 -x130 x129 -x128 x127 -x126 x125 -x124 x123 x122 -x121 -x120 x119 -x118 x117 -x116 x115 -x114 x113 -x112 x111 -x110
3.39/3.49 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
3.39/3.49 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
3.39/3.49 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
3.39/3.49 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
3.39/3.49 c SCIP Status : problem is solved [optimal solution found]
3.39/3.49 c Solving Time : 3.33
3.39/3.49 c Original Problem :
3.39/3.49 c Problem name : HOME/instance-2667558-1276464733.opb
3.39/3.49 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.49 c Constraints : 900 initial, 900 maximal
3.39/3.49 c Presolved Problem :
3.39/3.49 c Problem name : t_HOME/instance-2667558-1276464733.opb
3.39/3.49 c Variables : 115 (115 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.49 c Constraints : 273 initial, 291 maximal
3.39/3.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.39/3.49 c trivial : 0.00 6 0 0 0 0 0 0 0
3.39/3.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.39/3.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.39/3.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.39/3.49 c implics : 0.00 0 3 0 0 0 0 0 0
3.39/3.49 c probing : 0.03 43 11 0 2 0 0 0 0
3.39/3.49 c linear : 0.02 22 0 0 28 0 281 18 0
3.39/3.49 c logicor : 0.03 0 0 0 0 0 346 0 0
3.39/3.49 c root node : - 114 - - 114 - - - -
3.39/3.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.39/3.49 c integral : 0 0 0 1 0 0 0 0 0 2
3.39/3.49 c logicor : 273+ 22 1660 0 1 97 1568 0 0 0
3.39/3.49 c countsols : 0 0 0 0 1 0 0 0 0 0
3.39/3.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.39/3.49 c integral : 1.86 0.00 0.00 1.86 0.00
3.39/3.49 c logicor : 0.00 0.00 0.00 0.00 0.00
3.39/3.49 c countsols : 0.00 0.00 0.00 0.00 0.00
3.39/3.49 c Propagators : Time Calls Cutoffs DomReds
3.39/3.49 c vbounds : 0.00 2 0 0
3.39/3.49 c rootredcost : 0.00 1 0 0
3.39/3.49 c pseudoobj : 0.02 1045 19 870
3.39/3.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.49 c propagation : 0.00 97 94 94 4.3 1 2.0 -
3.39/3.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.49 c applied globally : - - - 95 4.2 - - -
3.39/3.49 c applied locally : - - - 0 0.0 - - -
3.39/3.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.49 c cut pool : 0.02 21 - - 284 - (maximal pool size: 882)
3.39/3.49 c redcost : 0.00 22 0 0 0 0
3.39/3.49 c impliedbounds : 0.01 22 0 0 68 0
3.39/3.49 c intobj : 0.00 0 0 0 0 0
3.39/3.49 c cgmip : 0.00 0 0 0 0 0
3.39/3.49 c gomory : 0.55 22 0 0 816 0
3.39/3.49 c strongcg : 0.37 20 0 0 1320 0
3.39/3.49 c cmir : 0.06 10 0 0 0 0
3.39/3.49 c flowcover : 0.14 10 0 0 0 0
3.39/3.49 c clique : 0.01 22 0 0 45 0
3.39/3.49 c zerohalf : 0.00 0 0 0 0 0
3.39/3.49 c mcf : 0.00 1 0 0 0 0
3.39/3.49 c rapidlearning : 0.00 0 0 0 0 0
3.39/3.49 c Pricers : Time Calls Vars
3.39/3.49 c problem variables: 0.00 0 0
3.39/3.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.49 c relpscost : 1.86 1 0 0 0 0 2
3.39/3.49 c pscost : 0.00 0 0 0 0 0 0
3.39/3.49 c inference : 0.02 114 0 0 0 0 228
3.39/3.49 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.49 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.49 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.49 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.49 c random : 0.00 0 0 0 0 0 0
3.39/3.49 c Primal Heuristics : Time Calls Found
3.39/3.49 c LP solutions : 0.00 - 0
3.39/3.49 c pseudo solutions : 0.00 - 1
3.39/3.49 c crossover : 0.00 0 0
3.39/3.49 c oneopt : 0.00 1 0
3.39/3.49 c trivial : 0.00 2 0
3.39/3.49 c simplerounding : 0.00 0 0
3.39/3.49 c zirounding : 0.00 1 0
3.39/3.49 c rounding : 0.00 22 0
3.39/3.49 c shifting : 0.01 22 1
3.39/3.49 c intshifting : 0.00 0 0
3.39/3.49 c twoopt : 0.00 0 0
3.39/3.49 c fixandinfer : 0.00 0 0
3.39/3.49 c feaspump : 0.02 1 1
3.39/3.49 c coefdiving : 0.00 0 0
3.39/3.49 c pscostdiving : 0.00 0 0
3.39/3.49 c fracdiving : 0.00 0 0
3.39/3.49 c veclendiving : 0.00 0 0
3.39/3.49 c intdiving : 0.00 0 0
3.39/3.49 c actconsdiving : 0.00 0 0
3.39/3.49 c objpscostdiving : 0.00 0 0
3.39/3.49 c rootsoldiving : 0.00 0 0
3.39/3.49 c linesearchdiving : 0.00 0 0
3.39/3.49 c guideddiving : 0.00 0 0
3.39/3.49 c octane : 0.00 0 0
3.39/3.49 c rens : 0.00 0 0
3.39/3.49 c rins : 0.00 0 0
3.39/3.49 c localbranching : 0.00 0 0
3.39/3.49 c mutation : 0.00 0 0
3.39/3.49 c dins : 0.00 0 0
3.39/3.49 c undercover : 0.00 0 0
3.39/3.49 c nlp : 0.00 0 0
3.39/3.49 c trysol : 0.00 0 0
3.39/3.49 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.49 c primal LP : 0.00 0 0 0.00 -
3.39/3.49 c dual LP : 0.15 22 1446 65.73 9640.00
3.39/3.49 c lex dual LP : 0.00 0 0 0.00 -
3.39/3.49 c barrier LP : 0.00 0 0 0.00 -
3.39/3.49 c diving/probing LP: 0.02 6 191 31.83 9550.00
3.39/3.49 c strong branching : 1.86 49 10831 221.04 5823.12
3.39/3.49 c (at root node) : - 49 10831 221.04 -
3.39/3.49 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.49 c B&B Tree :
3.39/3.49 c number of runs : 1
3.39/3.49 c nodes : 168
3.39/3.49 c nodes (total) : 168
3.39/3.49 c nodes left : 0
3.39/3.49 c max depth : 15
3.39/3.49 c max depth (total): 15
3.39/3.49 c backtracks : 46 (27.4%)
3.39/3.49 c delayed cutoffs : 62
3.39/3.49 c repropagations : 145 (1298 domain reductions, 45 cutoffs)
3.39/3.49 c avg switch length: 2.67
3.39/3.49 c switching time : 0.00
3.39/3.49 c Solution :
3.39/3.49 c Solutions found : 3 (2 improvements)
3.39/3.49 c First Solution : +9.30000000000000e+01 (in run 1, after 1 nodes, 0.14 seconds, depth 0, found by <feaspump>)
3.39/3.49 c Primal Bound : +9.20000000000000e+01 (in run 1, after 44 nodes, 3.30 seconds, depth 13, found by <relaxation>)
3.39/3.49 c Dual Bound : +9.20000000000000e+01
3.39/3.49 c Gap : 0.00 %
3.39/3.49 c Root Dual Bound : +8.74727698359141e+01
3.39/3.49 c Root Iterations : 1637
3.49/3.50 c Time complete: 3.49.