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-2667507-1276424657.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 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, 2 chg coeffs, 0 upgd conss, 216 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 300 upgd conss, 216 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, 2 changed coefficients
0.00/0.03 c 216 implications, 0 cliques
0.00/0.03 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 constraints
0.00/0.03 c 300 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.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.07/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.09 c 0.1s| 1 | 0 | 622 | - |1001k| 0 | 200 | 200 | 300 | 200 | 300 | 0 | 0 | 0 | 6.709752e+01 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 1886 | - |2464k| 0 | 199 | 200 | 300 | 200 | 301 | 1 | 0 | 0 | 6.715124e+01 | -- | Inf
0.39/0.47 c 0.4s| 1 | 0 | 1907 | - |3877k| 0 | 200 | 200 | 300 | 200 | 302 | 2 | 0 | 0 | 6.723650e+01 | -- | Inf
0.49/0.58 c 0.5s| 1 | 0 | 1930 | - |5295k| 0 | 200 | 200 | 300 | 200 | 303 | 3 | 0 | 0 | 6.732120e+01 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 1977 | - |6729k| 0 | 199 | 200 | 300 | 200 | 304 | 4 | 0 | 0 | 6.736705e+01 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 2014 | - |8157k| 0 | 200 | 200 | 300 | 200 | 305 | 5 | 0 | 0 | 6.738163e+01 | -- | Inf
0.89/0.95 c 0.9s| 1 | 0 | 2075 | - |9266k| 0 | 200 | 200 | 300 | 200 | 306 | 6 | 0 | 0 | 6.739284e+01 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 2086 | - |9603k| 0 | 200 | 200 | 300 | 200 | 307 | 7 | 0 | 0 | 6.739807e+01 | -- | Inf
1.10/1.16 c 1.1s| 1 | 0 | 2107 | - |9779k| 0 | 199 | 200 | 300 | 200 | 308 | 8 | 0 | 0 | 6.741211e+01 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 2123 | - |9838k| 0 | 199 | 200 | 300 | 200 | 309 | 9 | 0 | 0 | 6.742592e+01 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 2172 | - |9985k| 0 | 199 | 200 | 300 | 200 | 310 | 10 | 0 | 0 | 6.744424e+01 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 2182 | - | 10M| 0 | 199 | 200 | 300 | 200 | 311 | 11 | 0 | 0 | 6.744663e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 2192 | - | 10M| 0 | 199 | 200 | 300 | 200 | 312 | 12 | 0 | 0 | 6.744966e+01 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 2204 | - | 10M| 0 | 199 | 200 | 300 | 200 | 313 | 13 | 0 | 0 | 6.745344e+01 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 2211 | - | 10M| 0 | 200 | 200 | 300 | 200 | 314 | 14 | 0 | 0 | 6.745366e+01 | -- | Inf
1.79/1.82 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.82 c 1.8s| 1 | 0 | 2248 | - | 10M| 0 | 200 | 200 | 300 | 200 | 315 | 15 | 0 | 0 | 6.746287e+01 | -- | Inf
1.89/1.92 c 1.9s| 1 | 0 | 2276 | - | 10M| 0 | 200 | 200 | 300 | 200 | 316 | 16 | 0 | 0 | 6.746874e+01 | -- | Inf
3.59/3.63 c 3.5s| 1 | 2 | 2276 | - | 10M| 0 | 200 | 200 | 300 | 200 | 316 | 16 | 0 | 34 | 6.746874e+01 | -- | Inf
3.69/3.72 o 100
3.69/3.72 c * 3.6s| 323 | 2 | 2276 | 0.0 | 10M| 29 | - | 200 | 116 | 0 | 0 | 16 | 179 | 34 | 7.800000e+01 | 1.000000e+02 | 28.21%
3.69/3.72 c
3.69/3.72 c SCIP Status : problem is solved [optimal solution found]
3.69/3.72 c Solving Time (sec) : 3.62
3.69/3.72 c Solving Nodes : 324
3.69/3.72 c Primal Bound : +1.00000000000000e+02 (1 solutions)
3.69/3.72 c Dual Bound : +1.00000000000000e+02
3.69/3.72 c Gap : 0.00 %
3.69/3.72 s OPTIMUM FOUND
3.69/3.72 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
3.69/3.72 v -x176 x175 -x174 x173 -x172 x171 x170 -x169 -x168 x167 x166 -x165 x164 -x163 x162 -x161 x160 -x159 x158 -x157 -x156 x155
3.69/3.72 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.69/3.72 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.69/3.72 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.69/3.72 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.69/3.72 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.69/3.72 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.69/3.72 c SCIP Status : problem is solved [optimal solution found]
3.69/3.72 c Solving Time : 3.62
3.69/3.72 c Original Problem :
3.69/3.72 c Problem name : HOME/instance-2667507-1276424657.opb
3.69/3.72 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.72 c Constraints : 300 initial, 300 maximal
3.69/3.72 c Presolved Problem :
3.69/3.72 c Problem name : t_HOME/instance-2667507-1276424657.opb
3.69/3.72 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.72 c Constraints : 300 initial, 320 maximal
3.69/3.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.69/3.72 c trivial : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c implics : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c probing : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c linear : 0.00 0 0 0 0 0 0 0 2
3.69/3.72 c logicor : 0.01 0 0 0 0 0 0 0 0
3.69/3.72 c root node : - 199 - - 199 - - - -
3.69/3.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.69/3.72 c integral : 0 0 0 1 0 0 0 0 0 2
3.69/3.72 c logicor : 300+ 17 2176 0 1 116 2805 0 0 0
3.69/3.72 c countsols : 0 0 0 0 1 0 0 0 0 0
3.69/3.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.69/3.72 c integral : 1.59 0.00 0.00 1.59 0.00
3.69/3.72 c logicor : 0.03 0.01 0.02 0.00 0.00
3.69/3.72 c countsols : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c Propagators : Time Calls Cutoffs DomReds
3.69/3.72 c vbounds : 0.00 2 0 0
3.69/3.72 c rootredcost : 0.00 1 0 0
3.69/3.72 c pseudoobj : 0.01 2316 1 1
3.69/3.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.69/3.72 c propagation : 0.00 117 115 115 2.9 65 2.9 -
3.69/3.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.72 c applied globally : - - - 180 2.9 - - -
3.69/3.72 c applied locally : - - - 0 0.0 - - -
3.69/3.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.69/3.72 c cut pool : 0.02 16 - - 576 - (maximal pool size: 1686)
3.69/3.72 c redcost : 0.00 17 0 0 0 0
3.69/3.72 c impliedbounds : 0.00 17 0 0 0 0
3.69/3.72 c intobj : 0.00 0 0 0 0 0
3.69/3.72 c cgmip : 0.00 0 0 0 0 0
3.69/3.72 c gomory : 0.69 17 0 0 0 0
3.69/3.72 c strongcg : 0.74 17 0 0 1836 0
3.69/3.72 c cmir : 0.02 10 0 0 0 0
3.69/3.72 c flowcover : 0.06 10 0 0 0 0
3.69/3.72 c clique : 0.00 1 0 0 0 0
3.69/3.72 c zerohalf : 0.00 0 0 0 0 0
3.69/3.72 c mcf : 0.00 1 0 0 0 0
3.69/3.72 c rapidlearning : 0.00 0 0 0 0 0
3.69/3.72 c Pricers : Time Calls Vars
3.69/3.72 c problem variables: 0.00 0 0
3.69/3.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.69/3.72 c relpscost : 1.59 1 0 0 0 0 2
3.69/3.72 c pscost : 0.00 0 0 0 0 0 0
3.69/3.72 c inference : 0.02 253 0 0 0 0 506
3.69/3.72 c mostinf : 0.00 0 0 0 0 0 0
3.69/3.72 c leastinf : 0.00 0 0 0 0 0 0
3.69/3.72 c fullstrong : 0.00 0 0 0 0 0 0
3.69/3.72 c allfullstrong : 0.00 0 0 0 0 0 0
3.69/3.72 c random : 0.00 0 0 0 0 0 0
3.69/3.72 c Primal Heuristics : Time Calls Found
3.69/3.72 c LP solutions : 0.00 - 0
3.69/3.72 c pseudo solutions : 0.00 - 1
3.69/3.72 c oneopt : 0.00 0 0
3.69/3.72 c crossover : 0.00 0 0
3.69/3.72 c trivial : 0.00 2 0
3.69/3.72 c simplerounding : 0.00 0 0
3.69/3.72 c zirounding : 0.00 1 0
3.69/3.72 c rounding : 0.01 17 0
3.69/3.72 c shifting : 0.01 17 0
3.69/3.72 c intshifting : 0.00 0 0
3.69/3.72 c twoopt : 0.00 0 0
3.69/3.72 c fixandinfer : 0.00 0 0
3.69/3.72 c feaspump : 0.17 1 0
3.69/3.72 c coefdiving : 0.00 0 0
3.69/3.72 c pscostdiving : 0.00 0 0
3.69/3.72 c fracdiving : 0.00 0 0
3.69/3.72 c veclendiving : 0.00 0 0
3.69/3.72 c intdiving : 0.00 0 0
3.69/3.72 c actconsdiving : 0.00 0 0
3.69/3.72 c objpscostdiving : 0.00 0 0
3.69/3.72 c rootsoldiving : 0.00 0 0
3.69/3.72 c linesearchdiving : 0.00 0 0
3.69/3.72 c guideddiving : 0.00 0 0
3.69/3.72 c octane : 0.00 0 0
3.69/3.72 c rens : 0.00 0 0
3.69/3.72 c rins : 0.00 0 0
3.69/3.72 c localbranching : 0.00 0 0
3.69/3.72 c mutation : 0.00 0 0
3.69/3.72 c dins : 0.00 0 0
3.69/3.72 c undercover : 0.00 0 0
3.69/3.72 c nlp : 0.00 0 0
3.69/3.72 c trysol : 0.00 0 0
3.69/3.72 c LP : Time Calls Iterations Iter/call Iter/sec
3.69/3.72 c primal LP : 0.00 0 0 0.00 -
3.69/3.72 c dual LP : 0.18 17 1043 61.35 5794.44
3.69/3.72 c lex dual LP : 0.00 0 0 0.00 -
3.69/3.72 c barrier LP : 0.00 0 0 0.00 -
3.69/3.72 c diving/probing LP: 0.17 37 1233 33.32 7252.94
3.69/3.72 c strong branching : 1.59 34 5958 175.24 3747.17
3.69/3.72 c (at root node) : - 34 5958 175.24 -
3.69/3.72 c conflict analysis: 0.00 0 0 0.00 -
3.69/3.72 c B&B Tree :
3.69/3.72 c number of runs : 1
3.69/3.72 c nodes : 324
3.69/3.72 c nodes (total) : 324
3.69/3.72 c nodes left : 0
3.69/3.72 c max depth : 29
3.69/3.72 c max depth (total): 29
3.69/3.72 c backtracks : 51 (15.7%)
3.69/3.72 c delayed cutoffs : 185
3.69/3.72 c repropagations : 348 (1620 domain reductions, 48 cutoffs)
3.69/3.72 c avg switch length: 3.47
3.69/3.72 c switching time : 0.00
3.69/3.72 c Solution :
3.69/3.72 c Solutions found : 1 (1 improvements)
3.69/3.72 c First Solution : +1.00000000000000e+02 (in run 1, after 323 nodes, 3.62 seconds, depth 4, found by <relaxation>)
3.69/3.72 c Primal Bound : +1.00000000000000e+02 (in run 1, after 323 nodes, 3.62 seconds, depth 4, found by <relaxation>)
3.69/3.72 c Dual Bound : +1.00000000000000e+02
3.69/3.72 c Gap : 0.00 %
3.69/3.72 c Root Dual Bound : +6.74687439337539e+01
3.69/3.72 c Root Iterations : 2276
3.69/3.73 c Time complete: 3.73.