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-2666094-1276430564.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.02
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 | 250 | - | 972k| 0 | 170 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.261902e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 294 | - |1694k| 0 | 168 | 200 | 260 | 200 | 264 | 4 | 0 | 0 | 6.340637e+01 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 350 | - |2367k| 0 | 174 | 200 | 260 | 200 | 270 | 10 | 0 | 0 | 6.410262e+01 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 400 | - |3130k| 0 | 176 | 200 | 260 | 200 | 273 | 13 | 0 | 0 | 6.448840e+01 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 456 | - |3995k| 0 | 172 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.465146e+01 | -- | Inf
0.39/0.46 c 0.4s| 1 | 0 | 477 | - |4733k| 0 | 175 | 200 | 260 | 200 | 277 | 17 | 0 | 0 | 6.468135e+01 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 522 | - |5587k| 0 | 176 | 200 | 260 | 200 | 279 | 19 | 0 | 0 | 6.472788e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 567 | - |6303k| 0 | 168 | 200 | 260 | 200 | 281 | 21 | 0 | 0 | 6.476741e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 616 | - |7087k| 0 | 176 | 200 | 260 | 200 | 282 | 22 | 0 | 0 | 6.481989e+01 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 679 | - |7845k| 0 | 170 | 200 | 260 | 200 | 284 | 24 | 0 | 0 | 6.489047e+01 | -- | Inf
0.90/0.95 c 0.9s| 1 | 0 | 713 | - |8306k| 0 | 172 | 200 | 260 | 200 | 285 | 25 | 0 | 0 | 6.490060e+01 | -- | Inf
1.00/1.03 c 1.0s| 1 | 0 | 826 | - |8413k| 0 | 171 | 200 | 260 | 200 | 287 | 28 | 0 | 0 | 6.513318e+01 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 886 | - |9245k| 0 | 169 | 200 | 260 | 200 | 289 | 30 | 0 | 0 | 6.533400e+01 | -- | Inf
1.19/1.20 c 1.2s| 1 | 0 | 909 | - | 10M| 0 | 182 | 200 | 260 | 200 | 290 | 31 | 0 | 0 | 6.537610e+01 | -- | Inf
1.19/1.29 c 1.2s| 1 | 0 | 968 | - | 11M| 0 | 175 | 200 | 260 | 200 | 292 | 33 | 0 | 0 | 6.547512e+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 | 1000 | - | 12M| 0 | 173 | 200 | 260 | 200 | 294 | 35 | 0 | 0 | 6.549962e+01 | -- | Inf
1.39/1.48 c 1.4s| 1 | 0 | 1036 | - | 12M| 0 | 176 | 200 | 260 | 200 | 295 | 36 | 0 | 0 | 6.551369e+01 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 1106 | - | 13M| 0 | 178 | 200 | 260 | 200 | 293 | 38 | 0 | 0 | 6.559344e+01 | -- | Inf
1.59/1.67 c 1.6s| 1 | 0 | 1150 | - | 14M| 0 | 175 | 200 | 260 | 200 | 294 | 39 | 0 | 0 | 6.561335e+01 | -- | Inf
1.69/1.77 c 1.7s| 1 | 0 | 1178 | - | 15M| 0 | 177 | 200 | 260 | 200 | 295 | 40 | 0 | 0 | 6.562305e+01 | -- | Inf
1.79/1.87 c 1.8s| 1 | 0 | 1208 | - | 16M| 0 | 168 | 200 | 260 | 200 | 296 | 41 | 0 | 0 | 6.562941e+01 | -- | Inf
1.89/1.92 c 1.9s| 1 | 0 | 1235 | - | 16M| 0 | 182 | 200 | 260 | 200 | 298 | 43 | 0 | 0 | 6.564082e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 1280 | - | 16M| 0 | 177 | 200 | 260 | 200 | 299 | 44 | 0 | 0 | 6.565123e+01 | -- | Inf
2.39/2.48 c 2.4s| 1 | 2 | 1280 | - | 16M| 0 | 177 | 200 | 260 | 200 | 299 | 44 | 0 | 26 | 6.565123e+01 | -- | Inf
2.59/2.61 o 100
2.59/2.61 c * 2.5s| 435 | 1 | 1280 | 0.0 | 16M| 47 | - | 200 | 155 | 0 | 0 | 44 | 305 | 26 | 9.500000e+01 | 1.000000e+02 | 5.26%
2.59/2.61 c
2.59/2.61 c SCIP Status : problem is solved [optimal solution found]
2.59/2.61 c Solving Time (sec) : 2.51
2.59/2.61 c Solving Nodes : 435
2.59/2.61 c Primal Bound : +1.00000000000000e+02 (1 solutions)
2.59/2.61 c Dual Bound : +1.00000000000000e+02
2.59/2.61 c Gap : 0.00 %
2.59/2.61 s OPTIMUM FOUND
2.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 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.59/2.61 c SCIP Status : problem is solved [optimal solution found]
2.59/2.61 c Solving Time : 2.51
2.59/2.61 c Original Problem :
2.59/2.61 c Problem name : HOME/instance-2666094-1276430564.opb
2.59/2.61 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.61 c Constraints : 260 initial, 260 maximal
2.59/2.61 c Presolved Problem :
2.59/2.61 c Problem name : t_HOME/instance-2666094-1276430564.opb
2.59/2.61 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.61 c Constraints : 260 initial, 338 maximal
2.59/2.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.59/2.61 c trivial : 0.00 0 0 0 0 0 0 0 0
2.59/2.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.59/2.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.59/2.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.59/2.61 c implics : 0.01 0 0 0 0 0 0 0 0
2.59/2.61 c probing : 0.01 0 0 0 0 0 0 0 0
2.59/2.61 c linear : 0.00 0 0 0 0 0 0 0 1
2.59/2.61 c logicor : 0.00 0 0 0 0 0 0 0 0
2.59/2.61 c root node : - 200 - - 200 - - - -
2.59/2.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.59/2.61 c integral : 0 0 0 1 0 0 0 0 0 2
2.59/2.61 c logicor : 260+ 23 3220 0 1 162 3917 0 0 0
2.59/2.61 c countsols : 0 0 0 0 1 0 0 0 0 0
2.59/2.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.59/2.61 c integral : 0.43 0.00 0.00 0.43 0.00
2.59/2.61 c logicor : 0.01 0.00 0.01 0.00 0.00
2.59/2.61 c countsols : 0.00 0.00 0.00 0.00 0.00
2.59/2.61 c Propagators : Time Calls Cutoffs DomReds
2.59/2.61 c vbounds : 0.00 2 0 0
2.59/2.61 c rootredcost : 0.00 0 0 0
2.59/2.61 c pseudoobj : 0.04 3507 0 0
2.59/2.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.59/2.61 c propagation : 0.00 162 161 161 3.6 144 3.3 -
2.59/2.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.59/2.61 c applied globally : - - - 305 3.5 - - -
2.59/2.61 c applied locally : - - - 0 0.0 - - -
2.59/2.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.59/2.61 c cut pool : 0.09 22 - - 205 - (maximal pool size: 2898)
2.59/2.61 c redcost : 0.00 23 0 0 0 0
2.59/2.61 c impliedbounds : 0.00 23 0 0 0 0
2.59/2.61 c intobj : 0.00 0 0 0 0 0
2.59/2.61 c cgmip : 0.00 0 0 0 0 0
2.59/2.61 c gomory : 0.75 23 0 0 167 0
2.59/2.61 c strongcg : 0.81 20 0 0 4624 0
2.59/2.61 c cmir : 0.04 10 0 0 0 0
2.59/2.61 c flowcover : 0.05 10 0 0 1 0
2.59/2.61 c clique : 0.00 1 0 0 0 0
2.59/2.61 c zerohalf : 0.00 0 0 0 0 0
2.59/2.61 c mcf : 0.00 1 0 0 0 0
2.59/2.61 c rapidlearning : 0.00 0 0 0 0 0
2.59/2.61 c Pricers : Time Calls Vars
2.59/2.61 c problem variables: 0.00 0 0
2.59/2.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.59/2.61 c relpscost : 0.43 1 0 0 0 0 2
2.59/2.61 c pscost : 0.00 0 0 0 0 0 0
2.59/2.61 c inference : 0.01 340 0 0 0 0 680
2.59/2.61 c mostinf : 0.00 0 0 0 0 0 0
2.59/2.61 c leastinf : 0.00 0 0 0 0 0 0
2.59/2.61 c fullstrong : 0.00 0 0 0 0 0 0
2.59/2.61 c allfullstrong : 0.00 0 0 0 0 0 0
2.59/2.61 c random : 0.00 0 0 0 0 0 0
2.59/2.61 c Primal Heuristics : Time Calls Found
2.59/2.61 c LP solutions : 0.00 - 0
2.59/2.61 c pseudo solutions : 0.01 - 1
2.59/2.61 c oneopt : 0.00 0 0
2.59/2.61 c crossover : 0.00 0 0
2.59/2.61 c trivial : 0.00 2 0
2.59/2.61 c simplerounding : 0.00 0 0
2.59/2.61 c zirounding : 0.00 1 0
2.59/2.61 c rounding : 0.01 23 0
2.59/2.61 c shifting : 0.02 23 0
2.59/2.61 c intshifting : 0.00 0 0
2.59/2.61 c twoopt : 0.00 0 0
2.59/2.61 c fixandinfer : 0.00 0 0
2.59/2.61 c feaspump : 0.01 1 0
2.59/2.61 c coefdiving : 0.00 0 0
2.59/2.61 c pscostdiving : 0.00 0 0
2.59/2.61 c fracdiving : 0.00 0 0
2.59/2.61 c veclendiving : 0.00 0 0
2.59/2.61 c intdiving : 0.00 0 0
2.59/2.61 c actconsdiving : 0.00 0 0
2.59/2.61 c objpscostdiving : 0.00 0 0
2.59/2.61 c rootsoldiving : 0.00 0 0
2.59/2.61 c linesearchdiving : 0.00 0 0
2.59/2.61 c guideddiving : 0.00 0 0
2.59/2.61 c octane : 0.00 0 0
2.59/2.61 c rens : 0.00 0 0
2.59/2.61 c rins : 0.00 0 0
2.59/2.61 c localbranching : 0.00 0 0
2.59/2.61 c mutation : 0.00 0 0
2.59/2.61 c dins : 0.00 0 0
2.59/2.61 c undercover : 0.00 0 0
2.59/2.61 c nlp : 0.00 0 0
2.59/2.61 c trysol : 0.00 0 0
2.59/2.61 c LP : Time Calls Iterations Iter/call Iter/sec
2.59/2.61 c primal LP : 0.00 0 0 0.00 -
2.59/2.61 c dual LP : 0.14 23 1280 55.65 9142.86
2.59/2.61 c lex dual LP : 0.00 0 0 0.00 -
2.59/2.61 c barrier LP : 0.00 0 0 0.00 -
2.59/2.61 c diving/probing LP: 0.01 0 0 0.00 0.00
2.59/2.61 c strong branching : 0.43 26 3862 148.54 8981.40
2.59/2.61 c (at root node) : - 26 3862 148.54 -
2.59/2.61 c conflict analysis: 0.00 0 0 0.00 -
2.59/2.61 c B&B Tree :
2.59/2.61 c number of runs : 1
2.59/2.61 c nodes : 435
2.59/2.61 c nodes (total) : 435
2.59/2.61 c nodes left : 0
2.59/2.61 c max depth : 47
2.59/2.61 c max depth (total): 47
2.59/2.61 c backtracks : 74 (17.0%)
2.59/2.61 c delayed cutoffs : 248
2.59/2.61 c repropagations : 581 (1827 domain reductions, 69 cutoffs)
2.59/2.61 c avg switch length: 3.96
2.59/2.61 c switching time : 0.01
2.59/2.61 c Solution :
2.59/2.61 c Solutions found : 1 (1 improvements)
2.59/2.61 c First Solution : +1.00000000000000e+02 (in run 1, after 435 nodes, 2.50 seconds, depth 2, found by <relaxation>)
2.59/2.61 c Primal Bound : +1.00000000000000e+02 (in run 1, after 435 nodes, 2.50 seconds, depth 2, found by <relaxation>)
2.59/2.61 c Dual Bound : +1.00000000000000e+02
2.59/2.61 c Gap : 0.00 %
2.59/2.61 c Root Dual Bound : +6.56512339174771e+01
2.59/2.61 c Root Iterations : 1280
2.59/2.62 c Time complete: 2.62.