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-2667524-1276430567.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 260 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 208 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 260 upgd conss, 208 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.03 c 208 implications, 0 cliques
0.00/0.03 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 260 constraints
0.00/0.03 c 260 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 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.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.04/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.06 c 0.0s| 1 | 0 | 398 | - | 972k| 0 | 171 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.261902e+01 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 831 | - |1704k| 0 | 160 | 200 | 260 | 200 | 264 | 4 | 0 | 0 | 6.325216e+01 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 900 | - |2285k| 0 | 174 | 200 | 260 | 200 | 269 | 9 | 0 | 0 | 6.389359e+01 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 938 | - |3079k| 0 | 175 | 200 | 260 | 200 | 272 | 12 | 0 | 0 | 6.423964e+01 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 989 | - |3924k| 0 | 169 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.456008e+01 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 1015 | - |4777k| 0 | 176 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.462769e+01 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 1053 | - |5578k| 0 | 177 | 200 | 260 | 200 | 279 | 19 | 0 | 0 | 6.478280e+01 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 1090 | - |6431k| 0 | 173 | 200 | 260 | 200 | 280 | 20 | 0 | 0 | 6.486295e+01 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 1113 | - |7253k| 0 | 172 | 200 | 260 | 200 | 283 | 23 | 0 | 0 | 6.487564e+01 | -- | Inf
0.79/0.88 c 0.8s| 1 | 0 | 1145 | - |8058k| 0 | 173 | 200 | 260 | 200 | 284 | 24 | 0 | 0 | 6.491259e+01 | -- | Inf
0.89/0.98 c 0.9s| 1 | 0 | 1173 | - |8948k| 0 | 169 | 200 | 260 | 200 | 285 | 25 | 0 | 0 | 6.491976e+01 | -- | Inf
0.99/1.08 c 1.0s| 1 | 0 | 1239 | - |9680k| 0 | 176 | 200 | 260 | 200 | 287 | 27 | 0 | 0 | 6.501205e+01 | -- | Inf
1.10/1.17 c 1.1s| 1 | 0 | 1264 | - | 10M| 0 | 175 | 200 | 260 | 200 | 288 | 28 | 0 | 0 | 6.502967e+01 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 1294 | - | 11M| 0 | 171 | 200 | 260 | 200 | 286 | 29 | 0 | 0 | 6.504299e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 1321 | - | 12M| 0 | 179 | 200 | 260 | 200 | 287 | 30 | 0 | 0 | 6.504974e+01 | -- | Inf
1.39/1.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.46 c 1.4s| 1 | 0 | 1351 | - | 13M| 0 | 179 | 200 | 260 | 200 | 288 | 31 | 0 | 0 | 6.505385e+01 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 1384 | - | 13M| 0 | 181 | 200 | 260 | 200 | 289 | 32 | 0 | 0 | 6.506132e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 1429 | - | 13M| 0 | 177 | 200 | 260 | 200 | 290 | 33 | 0 | 0 | 6.507775e+01 | -- | Inf
1.69/1.72 c 1.6s| 1 | 0 | 1458 | - | 13M| 0 | 180 | 200 | 260 | 200 | 291 | 34 | 0 | 0 | 6.508535e+01 | -- | Inf
1.79/1.81 c 1.7s| 1 | 0 | 1501 | - | 13M| 0 | 180 | 200 | 260 | 200 | 289 | 35 | 0 | 0 | 6.509147e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 1519 | - | 13M| 0 | 179 | 200 | 260 | 200 | 290 | 36 | 0 | 0 | 6.509689e+01 | -- | Inf
1.89/1.93 c 1.9s| 1 | 0 | 1550 | - | 13M| 0 | 180 | 200 | 260 | 200 | 291 | 37 | 0 | 0 | 6.510277e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 1563 | - | 13M| 0 | 180 | 200 | 260 | 200 | 292 | 38 | 0 | 0 | 6.510322e+01 | -- | Inf
3.59/3.62 c 3.5s| 1 | 2 | 1563 | - | 13M| 0 | 180 | 200 | 260 | 200 | 292 | 38 | 0 | 53 | 6.510322e+01 | -- | Inf
3.59/3.67 o 100
3.59/3.67 c * 3.5s| 179 | 5 | 1563 | 0.0 | 14M| 33 | - | 200 | 251 | 0 | 0 | 38 | 151 | 53 | 6.543643e+01 | 1.000000e+02 | 52.82%
3.59/3.68 c
3.59/3.68 c SCIP Status : problem is solved [optimal solution found]
3.59/3.68 c Solving Time (sec) : 3.56
3.59/3.68 c Solving Nodes : 186
3.59/3.68 c Primal Bound : +1.00000000000000e+02 (1 solutions)
3.59/3.68 c Dual Bound : +1.00000000000000e+02
3.59/3.68 c Gap : 0.00 %
3.59/3.68 s OPTIMUM FOUND
3.59/3.68 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.59/3.68 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.59/3.68 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.59/3.68 v -x131 -x130 x129 x128 -x127 x126 -x125 -x124 x123 x122 -x121 -x120 x119 -x118 x117 x116 -x115 -x114 x113 x112 -x111 -x110 x109
3.59/3.68 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
3.59/3.68 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
3.59/3.68 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
3.59/3.68 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
3.59/3.68 c SCIP Status : problem is solved [optimal solution found]
3.59/3.68 c Solving Time : 3.56
3.59/3.68 c Original Problem :
3.59/3.68 c Problem name : HOME/instance-2667524-1276430567.opb
3.59/3.68 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.68 c Constraints : 260 initial, 260 maximal
3.59/3.68 c Presolved Problem :
3.59/3.68 c Problem name : t_HOME/instance-2667524-1276430567.opb
3.59/3.68 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.68 c Constraints : 260 initial, 292 maximal
3.59/3.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.59/3.68 c trivial : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c implics : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c probing : 0.00 0 0 0 0 0 0 0 0
3.59/3.68 c linear : 0.00 0 0 0 0 0 0 0 1
3.59/3.68 c logicor : 0.01 0 0 0 0 0 0 0 0
3.59/3.68 c root node : - 70 - - 70 - - - -
3.59/3.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.59/3.68 c integral : 0 0 0 1 0 0 0 0 0 2
3.59/3.68 c logicor : 260+ 23 1726 0 1 87 1782 0 0 0
3.59/3.68 c countsols : 0 0 0 0 1 0 0 0 0 0
3.59/3.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.59/3.68 c integral : 1.55 0.00 0.00 1.55 0.00
3.59/3.68 c logicor : 0.01 0.00 0.01 0.00 0.00
3.59/3.68 c countsols : 0.00 0.00 0.00 0.00 0.00
3.59/3.68 c Propagators : Time Calls Cutoffs DomReds
3.59/3.68 c vbounds : 0.00 2 0 0
3.59/3.68 c rootredcost : 0.00 1 0 0
3.59/3.68 c pseudoobj : 0.02 1769 0 3
3.59/3.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.59/3.68 c propagation : 0.00 87 87 87 2.9 71 2.9 -
3.59/3.68 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.59/3.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.59/3.68 c applied globally : - - - 158 2.9 - - -
3.59/3.68 c applied locally : - - - 0 0.0 - - -
3.59/3.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.59/3.68 c cut pool : 0.04 22 - - 268 - (maximal pool size: 2438)
3.59/3.68 c redcost : 0.00 23 0 0 0 0
3.59/3.68 c impliedbounds : 0.00 23 0 0 0 0
3.59/3.68 c intobj : 0.00 0 0 0 0 0
3.59/3.68 c cgmip : 0.00 0 0 0 0 0
3.59/3.68 c gomory : 0.78 23 0 0 85 0
3.59/3.68 c strongcg : 0.76 20 0 0 3873 0
3.59/3.68 c cmir : 0.05 10 0 0 0 0
3.59/3.68 c flowcover : 0.03 10 0 0 0 0
3.59/3.68 c clique : 0.00 1 0 0 0 0
3.59/3.68 c zerohalf : 0.00 0 0 0 0 0
3.59/3.68 c mcf : 0.00 1 0 0 0 0
3.59/3.68 c rapidlearning : 0.00 0 0 0 0 0
3.59/3.68 c Pricers : Time Calls Vars
3.59/3.68 c problem variables: 0.00 0 0
3.59/3.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.59/3.68 c relpscost : 1.55 1 0 0 0 0 2
3.59/3.68 c pscost : 0.00 0 0 0 0 0 0
3.59/3.68 c inference : 0.00 135 0 0 0 0 270
3.59/3.68 c mostinf : 0.00 0 0 0 0 0 0
3.59/3.68 c leastinf : 0.00 0 0 0 0 0 0
3.59/3.68 c fullstrong : 0.00 0 0 0 0 0 0
3.59/3.68 c allfullstrong : 0.00 0 0 0 0 0 0
3.59/3.68 c random : 0.00 0 0 0 0 0 0
3.59/3.68 c Primal Heuristics : Time Calls Found
3.59/3.68 c LP solutions : 0.00 - 0
3.59/3.68 c pseudo solutions : 0.00 - 1
3.59/3.68 c oneopt : 0.00 0 0
3.59/3.68 c crossover : 0.00 0 0
3.59/3.68 c trivial : 0.00 2 0
3.59/3.68 c simplerounding : 0.00 0 0
3.59/3.68 c zirounding : 0.00 1 0
3.59/3.68 c rounding : 0.01 23 0
3.59/3.68 c shifting : 0.02 23 0
3.59/3.68 c intshifting : 0.00 0 0
3.59/3.68 c twoopt : 0.00 0 0
3.59/3.68 c fixandinfer : 0.00 0 0
3.59/3.68 c feaspump : 0.03 1 0
3.59/3.68 c coefdiving : 0.00 0 0
3.59/3.68 c pscostdiving : 0.00 0 0
3.59/3.68 c fracdiving : 0.00 0 0
3.59/3.68 c veclendiving : 0.00 0 0
3.59/3.68 c intdiving : 0.00 0 0
3.59/3.68 c actconsdiving : 0.00 0 0
3.59/3.68 c objpscostdiving : 0.00 0 0
3.59/3.68 c rootsoldiving : 0.00 0 0
3.59/3.68 c linesearchdiving : 0.00 0 0
3.59/3.68 c guideddiving : 0.00 0 0
3.59/3.68 c octane : 0.00 0 0
3.59/3.68 c rens : 0.00 0 0
3.59/3.68 c rins : 0.00 0 0
3.59/3.68 c localbranching : 0.00 0 0
3.59/3.68 c mutation : 0.00 0 0
3.59/3.68 c dins : 0.00 0 0
3.59/3.68 c undercover : 0.00 0 0
3.59/3.68 c nlp : 0.00 0 0
3.59/3.68 c trysol : 0.00 0 0
3.59/3.68 c LP : Time Calls Iterations Iter/call Iter/sec
3.59/3.68 c primal LP : 0.00 0 0 0.00 -
3.59/3.68 c dual LP : 0.18 23 1178 51.22 6544.44
3.59/3.68 c lex dual LP : 0.00 0 0 0.00 -
3.59/3.68 c barrier LP : 0.00 0 0 0.00 -
3.59/3.68 c diving/probing LP: 0.02 22 385 17.50 19250.00
3.59/3.68 c strong branching : 1.55 53 7892 148.91 5091.61
3.59/3.68 c (at root node) : - 53 7892 148.91 -
3.59/3.68 c conflict analysis: 0.00 0 0 0.00 -
3.59/3.68 c B&B Tree :
3.59/3.68 c number of runs : 1
3.59/3.68 c nodes : 186
3.59/3.68 c nodes (total) : 186
3.59/3.68 c nodes left : 0
3.59/3.68 c max depth : 33
3.59/3.68 c max depth (total): 33
3.59/3.68 c backtracks : 46 (24.7%)
3.59/3.68 c delayed cutoffs : 87
3.59/3.68 c repropagations : 301 (930 domain reductions, 38 cutoffs)
3.59/3.68 c avg switch length: 4.35
3.59/3.68 c switching time : 0.01
3.59/3.68 c Solution :
3.59/3.68 c Solutions found : 1 (1 improvements)
3.59/3.68 c First Solution : +1.00000000000000e+02 (in run 1, after 179 nodes, 3.55 seconds, depth 9, found by <relaxation>)
3.59/3.68 c Primal Bound : +1.00000000000000e+02 (in run 1, after 179 nodes, 3.55 seconds, depth 9, found by <relaxation>)
3.59/3.68 c Dual Bound : +1.00000000000000e+02
3.59/3.68 c Gap : 0.00 %
3.59/3.68 c Root Dual Bound : +6.51032172595725e+01
3.59/3.68 c Root Iterations : 1563
3.59/3.69 c Time complete: 3.69.