0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666113-1276453170.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.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 260 upgd conss, 200 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 (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 200 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.00/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.05 c 0.0s| 1 | 0 | 272 | - | 975k| 0 | 170 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.250464e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 306 | - |1746k| 0 | 172 | 200 | 260 | 200 | 262 | 2 | 0 | 0 | 6.272156e+01 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 345 | - |2584k| 0 | 169 | 200 | 260 | 200 | 263 | 3 | 0 | 0 | 6.281363e+01 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 366 | - |3394k| 0 | 169 | 200 | 260 | 200 | 264 | 4 | 0 | 0 | 6.284391e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 391 | - |4214k| 0 | 170 | 200 | 260 | 200 | 265 | 5 | 0 | 0 | 6.288575e+01 | -- | Inf
0.39/0.47 c 0.4s| 1 | 0 | 439 | - |5075k| 0 | 164 | 200 | 260 | 200 | 266 | 6 | 0 | 0 | 6.291733e+01 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 477 | - |5890k| 0 | 171 | 200 | 260 | 200 | 268 | 8 | 0 | 0 | 6.293712e+01 | -- | Inf
0.59/0.67 c 0.6s| 1 | 0 | 556 | - |6614k| 0 | 175 | 200 | 260 | 200 | 270 | 10 | 0 | 0 | 6.309256e+01 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 620 | - |7488k| 0 | 174 | 200 | 260 | 200 | 273 | 13 | 0 | 0 | 6.329207e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 651 | - |8368k| 0 | 169 | 200 | 260 | 200 | 274 | 14 | 0 | 0 | 6.337796e+01 | -- | Inf
0.90/0.97 c 0.9s| 1 | 0 | 689 | - |9263k| 0 | 167 | 200 | 260 | 200 | 275 | 15 | 0 | 0 | 6.347347e+01 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 712 | - | 10M| 0 | 167 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.348205e+01 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 761 | - | 10M| 0 | 166 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.349606e+01 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 795 | - | 11M| 0 | 166 | 200 | 260 | 200 | 278 | 18 | 0 | 0 | 6.351236e+01 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 864 | - | 12M| 0 | 168 | 200 | 260 | 200 | 280 | 20 | 0 | 0 | 6.362298e+01 | -- | Inf
1.39/1.43 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.43 c 1.4s| 1 | 0 | 914 | - | 13M| 0 | 173 | 200 | 260 | 200 | 281 | 21 | 0 | 0 | 6.371408e+01 | -- | Inf
1.50/1.52 c 1.5s| 1 | 0 | 948 | - | 14M| 0 | 173 | 200 | 260 | 200 | 282 | 22 | 0 | 0 | 6.374408e+01 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 990 | - | 15M| 0 | 171 | 200 | 260 | 200 | 282 | 24 | 0 | 0 | 6.383643e+01 | -- | Inf
1.69/1.71 c 1.6s| 1 | 0 | 1020 | - | 16M| 0 | 175 | 200 | 260 | 200 | 283 | 25 | 0 | 0 | 6.389227e+01 | -- | Inf
1.79/1.81 c 1.8s| 1 | 0 | 1057 | - | 17M| 0 | 174 | 200 | 260 | 200 | 284 | 26 | 0 | 0 | 6.393247e+01 | -- | Inf
1.89/1.91 c 1.8s| 1 | 0 | 1092 | - | 17M| 0 | 174 | 200 | 260 | 200 | 285 | 27 | 0 | 0 | 6.395284e+01 | -- | Inf
1.89/1.96 c 1.9s| 1 | 0 | 1119 | - | 17M| 0 | 177 | 200 | 260 | 200 | 286 | 28 | 0 | 0 | 6.396782e+01 | -- | Inf
1.99/2.01 c 1.9s| 1 | 0 | 1151 | - | 17M| 0 | 171 | 200 | 260 | 200 | 287 | 29 | 0 | 0 | 6.401176e+01 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 1172 | - | 17M| 0 | 175 | 200 | 260 | 200 | 281 | 30 | 0 | 0 | 6.402238e+01 | -- | Inf
2.10/2.10 c 2.0s| 1 | 0 | 1184 | - | 17M| 0 | 172 | 200 | 260 | 200 | 282 | 31 | 0 | 0 | 6.402573e+01 | -- | Inf
2.10/2.15 c 2.1s| 1 | 0 | 1194 | - | 17M| 0 | 173 | 200 | 260 | 200 | 283 | 32 | 0 | 0 | 6.402774e+01 | -- | Inf
2.10/2.20 c 2.1s| 1 | 0 | 1243 | - | 17M| 0 | 171 | 200 | 260 | 200 | 284 | 33 | 0 | 0 | 6.414786e+01 | -- | Inf
2.49/2.59 c 2.5s| 1 | 2 | 1243 | - | 17M| 0 | 171 | 200 | 260 | 200 | 284 | 33 | 0 | 24 | 6.414786e+01 | -- | Inf
2.69/2.70 o 100
2.69/2.70 c * 2.6s| 410 | 4 | 1243 | 0.0 | 18M| 44 | - | 200 | 323 | 0 | 0 | 33 | 259 | 24 | 6.453404e+01 | 1.000000e+02 | 54.96%
2.69/2.73 c
2.69/2.73 c SCIP Status : problem is solved [optimal solution found]
2.69/2.73 c Solving Time (sec) : 2.62
2.69/2.73 c Solving Nodes : 494
2.69/2.73 c Primal Bound : +1.00000000000000e+02 (1 solutions)
2.69/2.73 c Dual Bound : +1.00000000000000e+02
2.69/2.73 c Gap : 0.00 %
2.69/2.73 s OPTIMUM FOUND
2.69/2.73 v x200 -x199 -x198 x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 -x188 x187 x186 -x185 -x184 x183 -x182 x181 -x180 x179 -x178
2.69/2.73 v x177 x176 -x175 x174 -x173 -x172 x171 -x170 x169 x168 -x167 -x166 x165 x164 -x163 x162 -x161 -x160 x159 -x158 x157 -x156 x155
2.69/2.73 v x154 -x153 -x152 x151 x150 -x149 -x148 x147 x146 -x145 -x144 x143 x142 -x141 x140 -x139 -x138 x137 -x136 x135 -x134 x133 x132
2.69/2.73 v -x131 x130 -x129 x128 -x127 -x126 x125 -x124 x123 x122 -x121 x120 -x119 x118 -x117 -x116 x115 -x114 x113 x112 -x111 x110 -x109
2.69/2.73 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
2.69/2.73 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
2.69/2.73 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
2.69/2.73 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
2.69/2.73 c SCIP Status : problem is solved [optimal solution found]
2.69/2.73 c Solving Time : 2.62
2.69/2.73 c Original Problem :
2.69/2.73 c Problem name : HOME/instance-2666113-1276453170.opb
2.69/2.73 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.73 c Constraints : 260 initial, 260 maximal
2.69/2.73 c Presolved Problem :
2.69/2.73 c Problem name : t_HOME/instance-2666113-1276453170.opb
2.69/2.73 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.73 c Constraints : 260 initial, 326 maximal
2.69/2.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.73 c trivial : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c implics : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c probing : 0.01 0 0 0 0 0 0 0 0
2.69/2.73 c logicor : 0.00 0 0 0 0 0 0 0 0
2.69/2.73 c root node : - 7 - - 7 - - - -
2.69/2.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.73 c integral : 0 0 0 1 0 0 0 0 0 2
2.69/2.73 c logicor : 260+ 27 3354 0 1 151 3989 0 0 0
2.69/2.73 c countsols : 0 0 0 0 1 0 0 0 0 0
2.69/2.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.73 c integral : 0.32 0.00 0.00 0.32 0.00
2.69/2.73 c logicor : 0.00 0.00 0.00 0.00 0.00
2.69/2.73 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.73 c Propagators : Time Calls Cutoffs DomReds
2.69/2.73 c vbounds : 0.01 2 0 0
2.69/2.73 c rootredcost : 0.00 1 0 0
2.69/2.73 c pseudoobj : 0.02 3719 0 0
2.69/2.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.73 c propagation : 0.00 151 147 147 3.7 149 3.1 -
2.69/2.73 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.73 c applied globally : - - - 296 3.4 - - -
2.69/2.73 c applied locally : - - - 0 0.0 - - -
2.69/2.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.73 c cut pool : 0.08 26 - - 533 - (maximal pool size: 3170)
2.69/2.73 c redcost : 0.00 27 0 0 0 0
2.69/2.73 c impliedbounds : 0.00 27 0 0 0 0
2.69/2.73 c intobj : 0.00 0 0 0 0 0
2.69/2.73 c cgmip : 0.00 0 0 0 0 0
2.69/2.73 c gomory : 0.94 27 0 0 58 0
2.69/2.73 c strongcg : 0.82 20 0 0 4868 0
2.69/2.73 c cmir : 0.03 10 0 0 0 0
2.69/2.73 c flowcover : 0.07 10 0 0 0 0
2.69/2.73 c clique : 0.00 1 0 0 0 0
2.69/2.73 c zerohalf : 0.00 0 0 0 0 0
2.69/2.73 c mcf : 0.00 1 0 0 0 0
2.69/2.73 c rapidlearning : 0.00 0 0 0 0 0
2.69/2.73 c Pricers : Time Calls Vars
2.69/2.73 c problem variables: 0.00 0 0
2.69/2.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.73 c relpscost : 0.32 1 0 0 0 0 2
2.69/2.73 c pscost : 0.00 0 0 0 0 0 0
2.69/2.73 c inference : 0.03 401 0 0 0 0 802
2.69/2.73 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.73 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.73 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.73 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.73 c random : 0.00 0 0 0 0 0 0
2.69/2.73 c Primal Heuristics : Time Calls Found
2.69/2.73 c LP solutions : 0.00 - 0
2.69/2.73 c pseudo solutions : 0.00 - 1
2.69/2.73 c oneopt : 0.00 0 0
2.69/2.73 c crossover : 0.00 0 0
2.69/2.73 c trivial : 0.00 2 0
2.69/2.73 c simplerounding : 0.00 0 0
2.69/2.73 c zirounding : 0.00 1 0
2.69/2.73 c rounding : 0.00 27 0
2.69/2.73 c shifting : 0.04 27 0
2.69/2.73 c intshifting : 0.00 0 0
2.69/2.73 c twoopt : 0.00 0 0
2.69/2.73 c fixandinfer : 0.00 0 0
2.69/2.73 c feaspump : 0.00 1 0
2.69/2.73 c coefdiving : 0.00 0 0
2.69/2.73 c pscostdiving : 0.00 0 0
2.69/2.73 c fracdiving : 0.00 0 0
2.69/2.73 c veclendiving : 0.00 0 0
2.69/2.73 c intdiving : 0.00 0 0
2.69/2.73 c actconsdiving : 0.00 0 0
2.69/2.73 c objpscostdiving : 0.00 0 0
2.69/2.73 c rootsoldiving : 0.00 0 0
2.69/2.73 c linesearchdiving : 0.00 0 0
2.69/2.73 c guideddiving : 0.00 0 0
2.69/2.73 c octane : 0.00 0 0
2.69/2.73 c rens : 0.01 0 0
2.69/2.73 c rins : 0.00 0 0
2.69/2.73 c localbranching : 0.00 0 0
2.69/2.73 c mutation : 0.00 0 0
2.69/2.73 c dins : 0.00 0 0
2.69/2.73 c undercover : 0.00 0 0
2.69/2.73 c nlp : 0.00 0 0
2.69/2.73 c trysol : 0.00 0 0
2.69/2.73 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.73 c primal LP : 0.01 0 0 0.00 0.00
2.69/2.73 c dual LP : 0.17 27 1243 46.04 7311.76
2.69/2.73 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.73 c barrier LP : 0.00 0 0 0.00 -
2.69/2.73 c diving/probing LP: 0.00 0 0 0.00 -
2.69/2.73 c strong branching : 0.32 24 2867 119.46 8959.38
2.69/2.73 c (at root node) : - 24 2867 119.46 -
2.69/2.73 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.73 c B&B Tree :
2.69/2.73 c number of runs : 1
2.69/2.73 c nodes : 494
2.69/2.73 c nodes (total) : 494
2.69/2.73 c nodes left : 0
2.69/2.73 c max depth : 44
2.69/2.73 c max depth (total): 44
2.69/2.73 c backtracks : 69 (14.0%)
2.69/2.73 c delayed cutoffs : 311
2.69/2.73 c repropagations : 554 (1743 domain reductions, 60 cutoffs)
2.69/2.73 c avg switch length: 3.66
2.69/2.73 c switching time : 0.01
2.69/2.73 c Solution :
2.69/2.73 c Solutions found : 1 (1 improvements)
2.69/2.73 c First Solution : +1.00000000000000e+02 (in run 1, after 410 nodes, 2.61 seconds, depth 9, found by <relaxation>)
2.69/2.73 c Primal Bound : +1.00000000000000e+02 (in run 1, after 410 nodes, 2.61 seconds, depth 9, found by <relaxation>)
2.69/2.73 c Dual Bound : +1.00000000000000e+02
2.69/2.73 c Gap : 0.00 %
2.69/2.73 c Root Dual Bound : +6.41478598644902e+01
2.69/2.73 c Root Iterations : 1243
2.69/2.74 c Time complete: 2.73.