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-2667505-1276423948.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.01/0.02 c presolving:
0.01/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.01/0.03 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.01/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.03 c presolving (2 rounds):
0.01/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 200 implications, 0 cliques
0.01/0.03 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 260 constraints
0.01/0.03 c 260 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.02
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c conflict/interconss = 0
0.01/0.03 c
0.01/0.03 c # should binary conflicts be preferred?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c conflict/preferbinary = TRUE
0.01/0.03 c
0.01/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c constraints/agelimit = 1
0.01/0.03 c
0.01/0.03 c # should enforcement of pseudo solution be disabled?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/disableenfops = TRUE
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c lp/solvefreq = 0
0.01/0.03 c
0.01/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.01/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.03 c lp/pricing = a
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # priority of node selection rule <dfs> in standard mode
0.01/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.03 c nodeselection/dfs/stdpriority = 1000000
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/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.01/0.06 c 0.0s| 1 | 0 | 364 | - | 974k| 0 | 160 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.226862e+01 | -- | Inf
0.10/0.17 c 0.1s| 1 | 0 | 868 | - |1540k| 0 | 161 | 200 | 260 | 200 | 261 | 1 | 0 | 0 | 6.237088e+01 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 920 | - |2146k| 0 | 152 | 200 | 260 | 200 | 263 | 3 | 0 | 0 | 6.254579e+01 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 966 | - |2822k| 0 | 162 | 200 | 260 | 200 | 264 | 4 | 0 | 0 | 6.260071e+01 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 999 | - |3535k| 0 | 169 | 200 | 260 | 200 | 266 | 6 | 0 | 0 | 6.264042e+01 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 1057 | - |4348k| 0 | 168 | 200 | 260 | 200 | 268 | 8 | 0 | 0 | 6.284880e+01 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 1116 | - |5241k| 0 | 167 | 200 | 260 | 200 | 269 | 9 | 0 | 0 | 6.296689e+01 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 1135 | - |6083k| 0 | 165 | 200 | 260 | 200 | 270 | 10 | 0 | 0 | 6.299971e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 1164 | - |6930k| 0 | 168 | 200 | 260 | 200 | 271 | 11 | 0 | 0 | 6.303067e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 1194 | - |7783k| 0 | 171 | 200 | 260 | 200 | 272 | 12 | 0 | 0 | 6.303820e+01 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 1241 | - |8681k| 0 | 169 | 200 | 260 | 200 | 273 | 13 | 0 | 0 | 6.305026e+01 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 1266 | - |9330k| 0 | 174 | 200 | 260 | 200 | 274 | 14 | 0 | 0 | 6.305394e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 1313 | - |9905k| 0 | 171 | 200 | 260 | 200 | 275 | 15 | 0 | 0 | 6.306891e+01 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 1346 | - | 10M| 0 | 172 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.307683e+01 | -- | Inf
1.19/1.29 c 1.2s| 1 | 0 | 1368 | - | 10M| 0 | 175 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.308077e+01 | -- | Inf
1.29/1.38 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.38 c 1.3s| 1 | 0 | 1414 | - | 10M| 0 | 169 | 200 | 260 | 200 | 278 | 18 | 0 | 0 | 6.309336e+01 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 1442 | - | 10M| 0 | 170 | 200 | 260 | 200 | 279 | 19 | 0 | 0 | 6.309971e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 1525 | - | 10M| 0 | 174 | 200 | 260 | 200 | 281 | 21 | 0 | 0 | 6.316566e+01 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 1551 | - | 11M| 0 | 171 | 200 | 260 | 200 | 282 | 22 | 0 | 0 | 6.317488e+01 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 1590 | - | 11M| 0 | 168 | 200 | 260 | 200 | 279 | 23 | 0 | 0 | 6.319803e+01 | -- | Inf
1.69/1.76 c 1.7s| 1 | 0 | 1622 | - | 11M| 0 | 169 | 200 | 260 | 200 | 280 | 24 | 0 | 0 | 6.320139e+01 | -- | Inf
1.79/1.80 c 1.8s| 1 | 0 | 1630 | - | 11M| 0 | 166 | 200 | 260 | 200 | 281 | 25 | 0 | 0 | 6.320185e+01 | -- | Inf
1.79/1.84 c 1.8s| 1 | 0 | 1665 | - | 11M| 0 | 170 | 200 | 260 | 200 | 282 | 26 | 0 | 0 | 6.320530e+01 | -- | Inf
2.49/2.53 c 2.5s| 1 | 2 | 1665 | - | 11M| 0 | 170 | 200 | 260 | 200 | 282 | 26 | 0 | 19 | 6.320530e+01 | -- | Inf
2.49/2.55 o 100
2.49/2.55 c * 2.5s| 72 | 1 | 1665 | 0.0 | 11M| 35 | - | 200 | 40 | 0 | 0 | 26 | 18 | 19 | 6.367669e+01 | 1.000000e+02 | 57.04%
2.49/2.55 c
2.49/2.55 c SCIP Status : problem is solved [optimal solution found]
2.49/2.55 c Solving Time (sec) : 2.48
2.49/2.55 c Solving Nodes : 72
2.49/2.55 c Primal Bound : +1.00000000000000e+02 (1 solutions)
2.49/2.55 c Dual Bound : +1.00000000000000e+02
2.49/2.55 c Gap : 0.00 %
2.49/2.55 s OPTIMUM FOUND
2.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 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.49/2.55 c SCIP Status : problem is solved [optimal solution found]
2.49/2.55 c Solving Time : 2.48
2.49/2.55 c Original Problem :
2.49/2.55 c Problem name : HOME/instance-2667505-1276423948.opb
2.49/2.55 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.55 c Constraints : 260 initial, 260 maximal
2.49/2.55 c Presolved Problem :
2.49/2.55 c Problem name : t_HOME/instance-2667505-1276423948.opb
2.49/2.55 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.55 c Constraints : 260 initial, 266 maximal
2.49/2.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.55 c trivial : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c probing : 0.01 0 0 0 0 0 0 0 0
2.49/2.55 c logicor : 0.00 0 0 0 0 0 0 0 0
2.49/2.55 c root node : - 200 - - 200 - - - -
2.49/2.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.55 c integral : 0 0 0 1 0 0 0 0 0 2
2.49/2.55 c logicor : 260+ 23 621 0 1 15 465 0 0 0
2.49/2.55 c countsols : 0 0 0 0 1 0 0 0 0 0
2.49/2.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.55 c integral : 0.63 0.00 0.00 0.63 0.00
2.49/2.55 c logicor : 0.00 0.00 0.00 0.00 0.00
2.49/2.55 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.55 c Propagators : Time Calls Cutoffs DomReds
2.49/2.55 c vbounds : 0.00 2 0 0
2.49/2.55 c rootredcost : 0.00 0 0 0
2.49/2.55 c pseudoobj : 0.00 507 0 0
2.49/2.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.55 c propagation : 0.00 15 15 15 2.1 3 3.0 -
2.49/2.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.55 c applied globally : - - - 18 2.3 - - -
2.49/2.55 c applied locally : - - - 0 0.0 - - -
2.49/2.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.55 c cut pool : 0.07 22 - - 502 - (maximal pool size: 1949)
2.49/2.55 c redcost : 0.00 23 0 0 0 0
2.49/2.55 c impliedbounds : 0.00 23 0 0 0 0
2.49/2.55 c intobj : 0.00 0 0 0 0 0
2.49/2.55 c cgmip : 0.00 0 0 0 0 0
2.49/2.55 c gomory : 0.73 23 0 0 29 0
2.49/2.55 c strongcg : 0.67 20 0 0 3005 0
2.49/2.55 c cmir : 0.05 10 0 0 0 0
2.49/2.55 c flowcover : 0.02 10 0 0 0 0
2.49/2.55 c clique : 0.01 1 0 0 0 0
2.49/2.55 c zerohalf : 0.00 0 0 0 0 0
2.49/2.55 c mcf : 0.00 1 0 0 0 0
2.49/2.55 c rapidlearning : 0.00 0 0 0 0 0
2.49/2.55 c Pricers : Time Calls Vars
2.49/2.55 c problem variables: 0.00 0 0
2.49/2.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.55 c relpscost : 0.63 1 0 0 0 0 2
2.49/2.55 c pscost : 0.00 0 0 0 0 0 0
2.49/2.55 c inference : 0.00 65 0 0 0 0 130
2.49/2.55 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.55 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.55 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.55 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.55 c random : 0.00 0 0 0 0 0 0
2.49/2.55 c Primal Heuristics : Time Calls Found
2.49/2.55 c LP solutions : 0.00 - 0
2.49/2.55 c pseudo solutions : 0.00 - 1
2.49/2.55 c oneopt : 0.00 0 0
2.49/2.55 c crossover : 0.00 0 0
2.49/2.55 c trivial : 0.01 2 0
2.49/2.55 c simplerounding : 0.00 0 0
2.49/2.55 c zirounding : 0.00 1 0
2.49/2.55 c rounding : 0.00 23 0
2.49/2.55 c shifting : 0.00 23 0
2.49/2.55 c intshifting : 0.00 0 0
2.49/2.55 c twoopt : 0.00 0 0
2.49/2.55 c fixandinfer : 0.00 0 0
2.49/2.55 c feaspump : 0.04 1 0
2.49/2.55 c coefdiving : 0.00 0 0
2.49/2.55 c pscostdiving : 0.00 0 0
2.49/2.55 c fracdiving : 0.00 0 0
2.49/2.55 c veclendiving : 0.00 0 0
2.49/2.55 c intdiving : 0.00 0 0
2.49/2.55 c actconsdiving : 0.00 0 0
2.49/2.55 c objpscostdiving : 0.00 0 0
2.49/2.55 c rootsoldiving : 0.00 0 0
2.49/2.55 c linesearchdiving : 0.00 0 0
2.49/2.55 c guideddiving : 0.00 0 0
2.49/2.55 c octane : 0.00 0 0
2.49/2.55 c rens : 0.00 0 0
2.49/2.55 c rins : 0.00 0 0
2.49/2.55 c localbranching : 0.00 0 0
2.49/2.55 c mutation : 0.00 0 0
2.49/2.55 c dins : 0.00 0 0
2.49/2.55 c undercover : 0.00 0 0
2.49/2.55 c nlp : 0.00 0 0
2.49/2.55 c trysol : 0.00 0 0
2.49/2.55 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.55 c primal LP : 0.00 0 0 0.00 -
2.49/2.55 c dual LP : 0.21 23 1203 52.30 5728.57
2.49/2.55 c lex dual LP : 0.00 0 0 0.00 -
2.49/2.55 c barrier LP : 0.00 0 0 0.00 -
2.49/2.55 c diving/probing LP: 0.03 34 462 13.59 15400.00
2.49/2.55 c strong branching : 0.63 19 3283 172.79 5211.11
2.49/2.55 c (at root node) : - 19 3283 172.79 -
2.49/2.55 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.55 c B&B Tree :
2.49/2.55 c number of runs : 1
2.49/2.55 c nodes : 72
2.49/2.55 c nodes (total) : 72
2.49/2.55 c nodes left : 0
2.49/2.55 c max depth : 35
2.49/2.55 c max depth (total): 35
2.49/2.55 c backtracks : 13 (18.1%)
2.49/2.55 c delayed cutoffs : 61
2.49/2.55 c repropagations : 75 (327 domain reductions, 10 cutoffs)
2.49/2.55 c avg switch length: 3.69
2.49/2.55 c switching time : 0.00
2.49/2.55 c Solution :
2.49/2.55 c Solutions found : 1 (1 improvements)
2.49/2.55 c First Solution : +1.00000000000000e+02 (in run 1, after 72 nodes, 2.48 seconds, depth 2, found by <relaxation>)
2.49/2.55 c Primal Bound : +1.00000000000000e+02 (in run 1, after 72 nodes, 2.48 seconds, depth 2, found by <relaxation>)
2.49/2.55 c Dual Bound : +1.00000000000000e+02
2.49/2.55 c Gap : 0.00 %
2.49/2.55 c Root Dual Bound : +6.32053030682676e+01
2.49/2.55 c Root Iterations : 1665
2.49/2.56 c Time complete: 2.55.