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-2666075-1276423947.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 | 256 | - | 974k| 0 | 159 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.226862e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 302 | - |1531k| 0 | 162 | 200 | 260 | 200 | 261 | 1 | 0 | 0 | 6.236736e+01 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 362 | - |2259k| 0 | 161 | 200 | 260 | 200 | 263 | 3 | 0 | 0 | 6.245854e+01 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 416 | - |2929k| 0 | 163 | 200 | 260 | 200 | 265 | 5 | 0 | 0 | 6.270567e+01 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 452 | - |3685k| 0 | 157 | 200 | 260 | 200 | 266 | 6 | 0 | 0 | 6.276249e+01 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 490 | - |4422k| 0 | 161 | 200 | 260 | 200 | 267 | 7 | 0 | 0 | 6.280635e+01 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 548 | - |5134k| 0 | 163 | 200 | 260 | 200 | 268 | 8 | 0 | 0 | 6.284520e+01 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 572 | - |5949k| 0 | 163 | 200 | 260 | 200 | 269 | 9 | 0 | 0 | 6.286176e+01 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 617 | - |6786k| 0 | 163 | 200 | 260 | 200 | 270 | 10 | 0 | 0 | 6.287036e+01 | -- | Inf
0.79/0.80 c 0.8s| 1 | 0 | 644 | - |7494k| 0 | 159 | 200 | 260 | 200 | 271 | 11 | 0 | 0 | 6.287446e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 677 | - |7798k| 0 | 164 | 200 | 260 | 200 | 272 | 12 | 0 | 0 | 6.287731e+01 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 723 | - |8095k| 0 | 158 | 200 | 260 | 200 | 273 | 13 | 0 | 0 | 6.289002e+01 | -- | Inf
0.99/1.04 c 1.0s| 1 | 0 | 811 | - |8311k| 0 | 171 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.301246e+01 | -- | Inf
1.09/1.12 c 1.1s| 1 | 0 | 852 | - |9185k| 0 | 165 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.310546e+01 | -- | Inf
1.09/1.20 c 1.2s| 1 | 0 | 892 | - |9995k| 0 | 174 | 200 | 260 | 200 | 279 | 19 | 0 | 0 | 6.318696e+01 | -- | Inf
1.20/1.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.20/1.29 c 1.2s| 1 | 0 | 933 | - | 10M| 0 | 164 | 200 | 260 | 200 | 280 | 20 | 0 | 0 | 6.325677e+01 | -- | Inf
1.29/1.38 c 1.3s| 1 | 0 | 1002 | - | 11M| 0 | 174 | 200 | 260 | 200 | 282 | 22 | 0 | 0 | 6.343224e+01 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 1035 | - | 12M| 0 | 171 | 200 | 260 | 200 | 281 | 23 | 0 | 0 | 6.349020e+01 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 1063 | - | 13M| 0 | 172 | 200 | 260 | 200 | 282 | 24 | 0 | 0 | 6.353218e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 1092 | - | 14M| 0 | 161 | 200 | 260 | 200 | 283 | 25 | 0 | 0 | 6.356200e+01 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 1138 | - | 15M| 0 | 167 | 200 | 260 | 200 | 284 | 26 | 0 | 0 | 6.360778e+01 | -- | Inf
2.20/2.26 c 2.2s| 1 | 2 | 1138 | - | 15M| 0 | 167 | 200 | 260 | 200 | 284 | 26 | 0 | 27 | 6.360778e+01 | -- | Inf
2.20/2.28 o 100
2.20/2.28 c * 2.2s| 69 | 0 | 1138 | 0.0 | 15M| 35 | - | 200 | 38 | 0 | 0 | 26 | 20 | 27 | 1.000000e+02 | 1.000000e+02 | 0.00%
2.20/2.28 c
2.20/2.28 c SCIP Status : problem is solved [optimal solution found]
2.20/2.28 c Solving Time (sec) : 2.20
2.20/2.28 c Solving Nodes : 69
2.20/2.28 c Primal Bound : +1.00000000000000e+02 (1 solutions)
2.20/2.28 c Dual Bound : +1.00000000000000e+02
2.20/2.28 c Gap : 0.00 %
2.20/2.28 s OPTIMUM FOUND
2.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 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.20/2.28 c SCIP Status : problem is solved [optimal solution found]
2.20/2.28 c Solving Time : 2.20
2.20/2.28 c Original Problem :
2.20/2.28 c Problem name : HOME/instance-2666075-1276423947.opb
2.20/2.28 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.28 c Constraints : 260 initial, 260 maximal
2.20/2.28 c Presolved Problem :
2.20/2.28 c Problem name : t_HOME/instance-2666075-1276423947.opb
2.20/2.28 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.28 c Constraints : 260 initial, 268 maximal
2.20/2.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.20/2.28 c trivial : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c implics : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c probing : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c logicor : 0.00 0 0 0 0 0 0 0 0
2.20/2.28 c root node : - 200 - - 200 - - - -
2.20/2.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.20/2.28 c integral : 0 0 0 1 0 0 0 0 0 2
2.20/2.28 c logicor : 260+ 21 632 0 1 14 523 0 0 0
2.20/2.28 c countsols : 0 0 0 0 1 0 0 0 0 0
2.20/2.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.20/2.28 c integral : 0.45 0.00 0.00 0.45 0.00
2.20/2.28 c logicor : 0.01 0.00 0.01 0.00 0.00
2.20/2.28 c countsols : 0.00 0.00 0.00 0.00 0.00
2.20/2.28 c Propagators : Time Calls Cutoffs DomReds
2.20/2.28 c vbounds : 0.00 2 0 0
2.20/2.28 c rootredcost : 0.00 0 0 0
2.20/2.28 c pseudoobj : 0.00 497 0 0
2.20/2.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.20/2.28 c propagation : 0.00 14 14 14 2.1 6 3.3 -
2.20/2.28 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.28 c applied globally : - - - 20 2.5 - - -
2.20/2.28 c applied locally : - - - 0 0.0 - - -
2.20/2.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.20/2.28 c cut pool : 0.07 20 - - 377 - (maximal pool size: 2711)
2.20/2.28 c redcost : 0.00 21 0 0 0 0
2.20/2.28 c impliedbounds : 0.00 21 0 0 0 0
2.20/2.28 c intobj : 0.00 0 0 0 0 0
2.20/2.28 c cgmip : 0.00 0 0 0 0 0
2.20/2.28 c gomory : 0.63 21 0 0 64 0
2.20/2.28 c strongcg : 0.77 20 0 0 4213 0
2.20/2.28 c cmir : 0.03 10 0 0 0 0
2.20/2.28 c flowcover : 0.06 10 0 0 0 0
2.20/2.28 c clique : 0.00 1 0 0 0 0
2.20/2.28 c zerohalf : 0.00 0 0 0 0 0
2.20/2.28 c mcf : 0.00 1 0 0 0 0
2.20/2.28 c rapidlearning : 0.00 0 0 0 0 0
2.20/2.28 c Pricers : Time Calls Vars
2.20/2.28 c problem variables: 0.00 0 0
2.20/2.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.20/2.28 c relpscost : 0.45 1 0 0 0 0 2
2.20/2.28 c pscost : 0.00 0 0 0 0 0 0
2.20/2.28 c inference : 0.00 61 0 0 0 0 122
2.20/2.28 c mostinf : 0.00 0 0 0 0 0 0
2.20/2.28 c leastinf : 0.00 0 0 0 0 0 0
2.20/2.28 c fullstrong : 0.00 0 0 0 0 0 0
2.20/2.28 c allfullstrong : 0.00 0 0 0 0 0 0
2.20/2.28 c random : 0.00 0 0 0 0 0 0
2.20/2.28 c Primal Heuristics : Time Calls Found
2.20/2.28 c LP solutions : 0.00 - 0
2.20/2.28 c pseudo solutions : 0.00 - 1
2.20/2.28 c oneopt : 0.00 0 0
2.20/2.28 c crossover : 0.00 0 0
2.20/2.28 c trivial : 0.00 2 0
2.20/2.28 c simplerounding : 0.00 0 0
2.20/2.28 c zirounding : 0.00 1 0
2.20/2.28 c rounding : 0.02 21 0
2.20/2.28 c shifting : 0.01 21 0
2.20/2.28 c intshifting : 0.00 0 0
2.20/2.28 c twoopt : 0.00 0 0
2.20/2.28 c fixandinfer : 0.00 0 0
2.20/2.28 c feaspump : 0.01 1 0
2.20/2.28 c coefdiving : 0.00 0 0
2.20/2.28 c pscostdiving : 0.00 0 0
2.20/2.28 c fracdiving : 0.00 0 0
2.20/2.28 c veclendiving : 0.00 0 0
2.20/2.28 c intdiving : 0.00 0 0
2.20/2.28 c actconsdiving : 0.00 0 0
2.20/2.28 c objpscostdiving : 0.00 0 0
2.20/2.28 c rootsoldiving : 0.00 0 0
2.20/2.28 c linesearchdiving : 0.00 0 0
2.20/2.28 c guideddiving : 0.00 0 0
2.20/2.28 c octane : 0.00 0 0
2.20/2.28 c rens : 0.00 0 0
2.20/2.28 c rins : 0.00 0 0
2.20/2.28 c localbranching : 0.00 0 0
2.20/2.28 c mutation : 0.00 0 0
2.20/2.28 c dins : 0.00 0 0
2.20/2.28 c undercover : 0.00 0 0
2.20/2.28 c nlp : 0.00 0 0
2.20/2.28 c trysol : 0.00 0 0
2.20/2.28 c LP : Time Calls Iterations Iter/call Iter/sec
2.20/2.28 c primal LP : 0.01 0 0 0.00 0.00
2.20/2.28 c dual LP : 0.11 21 1138 54.19 10345.45
2.20/2.28 c lex dual LP : 0.00 0 0 0.00 -
2.20/2.28 c barrier LP : 0.00 0 0 0.00 -
2.20/2.28 c diving/probing LP: 0.00 0 0 0.00 -
2.20/2.28 c strong branching : 0.45 27 4185 155.00 9300.00
2.20/2.28 c (at root node) : - 27 4185 155.00 -
2.20/2.28 c conflict analysis: 0.00 0 0 0.00 -
2.20/2.28 c B&B Tree :
2.20/2.28 c number of runs : 1
2.20/2.28 c nodes : 69
2.20/2.28 c nodes (total) : 69
2.20/2.28 c nodes left : 0
2.20/2.28 c max depth : 35
2.20/2.28 c max depth (total): 35
2.20/2.28 c backtracks : 10 (14.5%)
2.20/2.28 c delayed cutoffs : 56
2.20/2.28 c repropagations : 48 (330 domain reductions, 8 cutoffs)
2.20/2.28 c avg switch length: 2.99
2.20/2.28 c switching time : 0.01
2.20/2.28 c Solution :
2.20/2.28 c Solutions found : 1 (1 improvements)
2.20/2.28 c First Solution : +1.00000000000000e+02 (in run 1, after 69 nodes, 2.20 seconds, depth 1, found by <relaxation>)
2.20/2.28 c Primal Bound : +1.00000000000000e+02 (in run 1, after 69 nodes, 2.20 seconds, depth 1, found by <relaxation>)
2.20/2.28 c Dual Bound : +1.00000000000000e+02
2.20/2.28 c Gap : 0.00 %
2.20/2.28 c Root Dual Bound : +6.36077837904436e+01
2.20/2.28 c Root Iterations : 1138
2.20/2.29 c Time complete: 2.28.