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-2666109-1276451216.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 = 1800
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 | 266 | - | 975k| 0 | 167 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.272445e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 337 | - |1608k| 0 | 168 | 200 | 260 | 200 | 263 | 3 | 0 | 0 | 6.316650e+01 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 365 | - |2466k| 0 | 166 | 200 | 260 | 200 | 266 | 6 | 0 | 0 | 6.336953e+01 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 403 | - |2779k| 0 | 164 | 200 | 260 | 200 | 268 | 8 | 0 | 0 | 6.355744e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 470 | - |3209k| 0 | 169 | 200 | 260 | 200 | 272 | 12 | 0 | 0 | 6.386548e+01 | -- | Inf
0.39/0.47 c 0.4s| 1 | 0 | 503 | - |3465k| 0 | 169 | 200 | 260 | 200 | 274 | 14 | 0 | 0 | 6.397614e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 539 | - |3668k| 0 | 168 | 200 | 260 | 200 | 275 | 15 | 0 | 0 | 6.400563e+01 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 586 | - |3833k| 0 | 169 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.409687e+01 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 619 | - |4095k| 0 | 176 | 200 | 260 | 200 | 279 | 19 | 0 | 0 | 6.424910e+01 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 646 | - |4228k| 0 | 175 | 200 | 260 | 200 | 280 | 20 | 0 | 0 | 6.427692e+01 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 692 | - |4922k| 0 | 173 | 200 | 260 | 200 | 281 | 21 | 0 | 0 | 6.428422e+01 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 748 | - |5179k| 0 | 173 | 200 | 260 | 200 | 281 | 22 | 0 | 0 | 6.429553e+01 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 783 | - |5380k| 0 | 175 | 200 | 260 | 200 | 282 | 23 | 0 | 0 | 6.430325e+01 | -- | Inf
1.09/1.14 c 1.1s| 1 | 0 | 805 | - |5538k| 0 | 175 | 200 | 260 | 200 | 283 | 24 | 0 | 0 | 6.430995e+01 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 846 | - |5596k| 0 | 175 | 200 | 260 | 200 | 284 | 25 | 0 | 0 | 6.431563e+01 | -- | Inf
1.19/1.28 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.28 c 1.2s| 1 | 0 | 877 | - |5677k| 0 | 176 | 200 | 260 | 200 | 285 | 26 | 0 | 0 | 6.432336e+01 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 915 | - |5724k| 0 | 175 | 200 | 260 | 200 | 286 | 27 | 0 | 0 | 6.432803e+01 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 919 | - |5734k| 0 | 175 | 200 | 260 | 200 | 282 | 28 | 0 | 0 | 6.432804e+01 | -- | Inf
1.39/1.49 c 1.4s| 1 | 0 | 956 | - |5742k| 0 | 175 | 200 | 260 | 200 | 283 | 29 | 0 | 0 | 6.433280e+01 | -- | Inf
1.49/1.56 c 1.5s| 1 | 0 | 1017 | - |5744k| 0 | 176 | 200 | 260 | 200 | 284 | 30 | 0 | 0 | 6.436734e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 1051 | - |5976k| 0 | 176 | 200 | 260 | 200 | 285 | 31 | 0 | 0 | 6.438649e+01 | -- | Inf
1.99/2.02 c 1.9s| 1 | 2 | 1051 | - |5976k| 0 | 176 | 200 | 260 | 200 | 285 | 31 | 0 | 19 | 6.438649e+01 | -- | Inf
1.99/2.04 o 100
1.99/2.04 c * 2.0s| 70 | 3 | 1051 | 0.0 |5949k| 29 | - | 200 | 88 | 0 | 0 | 31 | 29 | 19 | 6.489548e+01 | 1.000000e+02 | 54.09%
1.99/2.04 c
1.99/2.04 c SCIP Status : problem is solved [optimal solution found]
1.99/2.04 c Solving Time (sec) : 1.97
1.99/2.04 c Solving Nodes : 75
1.99/2.04 c Primal Bound : +1.00000000000000e+02 (1 solutions)
1.99/2.04 c Dual Bound : +1.00000000000000e+02
1.99/2.04 c Gap : 0.00 %
1.99/2.04 s OPTIMUM FOUND
1.99/2.04 v -x200 x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 x188 -x187 -x186 x185 x184 -x183 x182 -x181 -x180 x179 -x178
1.99/2.04 v x177 -x176 x175 x174 -x173 x172 -x171 x170 -x169 -x168 x167 -x166 x165 -x164 x163 -x162 x161 x160 -x159 -x158 x157 -x156 x155
1.99/2.04 v x154 -x153 x152 -x151 x150 -x149 -x148 x147 -x146 x145 x144 -x143 -x142 x141 x140 -x139 -x138 x137 -x136 x135 x134 -x133 x132
1.99/2.04 v -x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 x122 -x121 x120 -x119 -x118 x117 -x116 x115 -x114 x113 x112 -x111 x110 -x109
1.99/2.04 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
1.99/2.04 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
1.99/2.04 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
1.99/2.04 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
1.99/2.04 c SCIP Status : problem is solved [optimal solution found]
1.99/2.04 c Solving Time : 1.97
1.99/2.04 c Original Problem :
1.99/2.04 c Problem name : HOME/instance-2666109-1276451216.opb
1.99/2.04 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.04 c Constraints : 260 initial, 260 maximal
1.99/2.04 c Presolved Problem :
1.99/2.04 c Problem name : t_HOME/instance-2666109-1276451216.opb
1.99/2.04 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.04 c Constraints : 260 initial, 273 maximal
1.99/2.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.99/2.04 c trivial : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c implics : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c probing : 0.01 0 0 0 0 0 0 0 0
1.99/2.04 c linear : 0.00 0 0 0 0 0 0 0 1
1.99/2.04 c logicor : 0.00 0 0 0 0 0 0 0 0
1.99/2.04 c root node : - 199 - - 199 - - - -
1.99/2.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.99/2.04 c integral : 0 0 0 1 0 0 0 0 0 2
1.99/2.04 c logicor : 260+ 21 767 0 1 22 668 0 0 0
1.99/2.04 c countsols : 0 0 0 0 1 0 0 0 0 0
1.99/2.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.99/2.04 c integral : 0.33 0.00 0.00 0.33 0.00
1.99/2.04 c logicor : 0.00 0.00 0.00 0.00 0.00
1.99/2.04 c countsols : 0.00 0.00 0.00 0.00 0.00
1.99/2.04 c Propagators : Time Calls Cutoffs DomReds
1.99/2.04 c vbounds : 0.00 2 0 0
1.99/2.04 c rootredcost : 0.00 1 0 0
1.99/2.04 c pseudoobj : 0.01 656 1 1
1.99/2.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.04 c propagation : 0.00 23 22 22 2.3 12 2.7 -
1.99/2.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.04 c applied globally : - - - 34 2.4 - - -
1.99/2.04 c applied locally : - - - 0 0.0 - - -
1.99/2.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.99/2.04 c cut pool : 0.03 20 - - 214 - (maximal pool size: 1014)
1.99/2.04 c redcost : 0.00 21 0 0 0 0
1.99/2.04 c impliedbounds : 0.00 21 0 0 0 0
1.99/2.04 c intobj : 0.00 0 0 0 0 0
1.99/2.04 c cgmip : 0.00 0 0 0 0 0
1.99/2.04 c gomory : 0.64 21 0 0 371 0
1.99/2.04 c strongcg : 0.58 20 0 0 1575 0
1.99/2.04 c cmir : 0.04 10 0 0 0 0
1.99/2.04 c flowcover : 0.12 10 0 0 0 0
1.99/2.04 c clique : 0.00 1 0 0 0 0
1.99/2.04 c zerohalf : 0.00 0 0 0 0 0
1.99/2.04 c mcf : 0.00 1 0 0 0 0
1.99/2.04 c rapidlearning : 0.00 0 0 0 0 0
1.99/2.04 c Pricers : Time Calls Vars
1.99/2.04 c problem variables: 0.00 0 0
1.99/2.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.99/2.04 c relpscost : 0.33 1 0 0 0 0 2
1.99/2.04 c pscost : 0.00 0 0 0 0 0 0
1.99/2.04 c inference : 0.00 60 0 0 0 0 120
1.99/2.04 c mostinf : 0.00 0 0 0 0 0 0
1.99/2.04 c leastinf : 0.00 0 0 0 0 0 0
1.99/2.04 c fullstrong : 0.00 0 0 0 0 0 0
1.99/2.04 c allfullstrong : 0.00 0 0 0 0 0 0
1.99/2.04 c random : 0.00 0 0 0 0 0 0
1.99/2.04 c Primal Heuristics : Time Calls Found
1.99/2.04 c LP solutions : 0.00 - 0
1.99/2.04 c pseudo solutions : 0.00 - 1
1.99/2.04 c oneopt : 0.00 0 0
1.99/2.04 c crossover : 0.00 0 0
1.99/2.04 c trivial : 0.00 2 0
1.99/2.04 c simplerounding : 0.00 0 0
1.99/2.04 c zirounding : 0.00 1 0
1.99/2.04 c rounding : 0.01 21 0
1.99/2.04 c shifting : 0.01 21 0
1.99/2.04 c intshifting : 0.00 0 0
1.99/2.04 c twoopt : 0.00 0 0
1.99/2.04 c fixandinfer : 0.00 0 0
1.99/2.04 c feaspump : 0.01 1 0
1.99/2.04 c coefdiving : 0.00 0 0
1.99/2.04 c pscostdiving : 0.00 0 0
1.99/2.04 c fracdiving : 0.00 0 0
1.99/2.04 c veclendiving : 0.00 0 0
1.99/2.04 c intdiving : 0.00 0 0
1.99/2.04 c actconsdiving : 0.00 0 0
1.99/2.04 c objpscostdiving : 0.00 0 0
1.99/2.04 c rootsoldiving : 0.00 0 0
1.99/2.04 c linesearchdiving : 0.00 0 0
1.99/2.04 c guideddiving : 0.00 0 0
1.99/2.04 c octane : 0.00 0 0
1.99/2.04 c rens : 0.00 0 0
1.99/2.04 c rins : 0.00 0 0
1.99/2.04 c localbranching : 0.00 0 0
1.99/2.04 c mutation : 0.00 0 0
1.99/2.04 c dins : 0.00 0 0
1.99/2.04 c undercover : 0.00 0 0
1.99/2.04 c nlp : 0.00 0 0
1.99/2.04 c trysol : 0.00 0 0
1.99/2.04 c LP : Time Calls Iterations Iter/call Iter/sec
1.99/2.04 c primal LP : 0.00 0 0 0.00 -
1.99/2.04 c dual LP : 0.13 21 1051 50.05 8084.62
1.99/2.04 c lex dual LP : 0.00 0 0 0.00 -
1.99/2.04 c barrier LP : 0.00 0 0 0.00 -
1.99/2.04 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.04 c strong branching : 0.33 19 2780 146.32 8424.24
1.99/2.04 c (at root node) : - 19 2780 146.32 -
1.99/2.04 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.04 c B&B Tree :
1.99/2.04 c number of runs : 1
1.99/2.04 c nodes : 75
1.99/2.04 c nodes (total) : 75
1.99/2.04 c nodes left : 0
1.99/2.04 c max depth : 29
1.99/2.04 c max depth (total): 29
1.99/2.04 c backtracks : 17 (22.7%)
1.99/2.04 c delayed cutoffs : 48
1.99/2.04 c repropagations : 80 (401 domain reductions, 10 cutoffs)
1.99/2.04 c avg switch length: 3.63
1.99/2.04 c switching time : 0.00
1.99/2.04 c Solution :
1.99/2.04 c Solutions found : 1 (1 improvements)
1.99/2.04 c First Solution : +1.00000000000000e+02 (in run 1, after 70 nodes, 1.97 seconds, depth 5, found by <relaxation>)
1.99/2.04 c Primal Bound : +1.00000000000000e+02 (in run 1, after 70 nodes, 1.97 seconds, depth 5, found by <relaxation>)
1.99/2.04 c Dual Bound : +1.00000000000000e+02
1.99/2.04 c Gap : 0.00 %
1.99/2.04 c Root Dual Bound : +6.43864910622477e+01
1.99/2.04 c Root Iterations : 1051
1.99/2.05 c Time complete: 2.05.