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-2665398-1276642543.opb>
0.00/0.01 c original problem has 256 variables (256 bin, 0 int, 0 impl, 0 cont) and 351 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 235098
0.00/0.02 c feasible solution found by trivial heuristic, objective value 2.350980e+05
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 90 del vars, 168 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 490 impls, 0 clqs
0.00/0.03 c (round 2) 91 del vars, 175 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 490 impls, 0 clqs
0.00/0.03 c (round 3) 91 del vars, 175 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 142 upgd conss, 490 impls, 0 clqs
0.00/0.03 c (round 4) 91 del vars, 175 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 176 upgd conss, 490 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/165 (61.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (5 rounds):
0.00/0.04 c 91 deleted vars, 175 deleted constraints, 4 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 490 implications, 0 cliques
0.00/0.04 c presolved problem has 165 variables (165 bin, 0 int, 0 impl, 0 cont) and 176 constraints
0.00/0.04 c 176 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 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.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 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.00/0.04 o 233576
0.00/0.04 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.04 c t 0.0s| 1 | 0 | 0 | - | 879k| 0 | - | 165 | 176 | 0 | 0 | 0 | 0 | 0 | -- | 2.335760e+05 | Inf
0.00/0.04 o 49797
0.00/0.04 c b 0.0s| 1 | 0 | 0 | - |1001k| 0 | - | 165 | 176 | 165 | 176 | 0 | 0 | 0 | -- | 4.979700e+04 | Inf
0.00/0.04 c 0.0s| 1 | 0 | 11 | - | 998k| 0 | 0 | 165 | 176 | 165 | 176 | 0 | 0 | 0 | 1.394900e+04 | 4.979700e+04 | 256.99%
0.00/0.04 o 46167
0.00/0.04 c b 0.0s| 1 | 0 | 11 | - |1004k| 0 | 0 | 165 | 176 | 165 | 176 | 0 | 0 | 0 | 1.394900e+04 | 4.616700e+04 | 230.97%
0.00/0.04 o 13949
0.00/0.04 c * 0.0s| 1 | 0 | 11 | - |1003k| 0 | - | 165 | 176 | 165 | 176 | 0 | 0 | 0 | 1.394900e+04 | 1.394900e+04 | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.02
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +1.39490000000000e+04 (5 solutions)
0.00/0.04 c Dual Bound : +1.39490000000000e+04
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v -x237 -x26 -x232 -x25 -x224 -x24 -x222 -x220 -x218 -x23 -x22 -x21 -x210 -x208 -x206 -x20 -x19 -x201 -x198 -x196 -x194 -x18 -x191
0.00/0.04 v -x189 -x17 -x185 -x183 -x181 -x179 -x177 -x174 -x171 -x168 -x166 -x164 -x162 -x158 -x156 -x154 -x151 -x149 -x16 -x145 -x142
0.00/0.04 v -x15 -x138 -x14 -x13 -x12 -x133 -x130 -x128 -x11 -x126 -x10 -x123 -x120 -x9 -x118 -x116 -x114 -x112 -x109 -x106 -x104 -x102
0.00/0.04 v -x100 -x98 -x96 -x93 -x91 -x89 -x86 -x84 -x8 -x82 -x79 -x7 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x54 -x51 -x48 -x6
0.00/0.04 v -x5 -x43 -x41 -x38 -x36 -x4 -x34 -x3 -x2 -x30 -x1 -x27 -x256 x255 x254 x253 x252 -x251 -x250 x249 -x248 -x247 -x246 -x245
0.00/0.04 v x244 -x243 -x242 -x241 -x240 -x239 -x238 x236 -x235 -x234 -x233 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x223 -x221 -x219 -x217
0.00/0.04 v -x216 -x215 -x214 -x213 -x212 -x211 -x209 -x207 -x205 -x204 -x203 -x202 -x200 -x199 -x197 -x195 -x193 -x192 -x190 -x188
0.00/0.04 v -x187 -x186 -x184 -x182 -x180 -x178 -x176 -x175 -x173 -x172 -x170 -x169 -x167 -x165 -x163 -x161 x160 -x159 -x157 -x155 -x153
0.00/0.04 v -x152 -x150 -x148 -x147 -x146 -x144 -x143 -x141 -x140 -x139 -x137 -x136 -x135 -x134 -x132 -x131 -x129 -x127 -x125 -x124 -x122
0.00/0.04 v -x121 -x119 -x117 -x115 -x113 -x111 -x110 -x108 -x107 -x105 -x103 -x101 -x99 -x97 x95 -x94 -x92 -x90 -x88 -x87 -x85 -x83 -x81
0.00/0.04 v -x80 -x78 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63 -x61 -x59 -x57 x56 -x55 -x53 -x52 -x50 -x49 -x47 -x46 -x45 -x44 -x42 -x40
0.00/0.04 v -x39 -x37 -x35 -x33 -x32 -x31 -x29 -x28
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time : 0.02
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-2665398-1276642543.opb
0.00/0.04 c Variables : 256 (256 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 351 initial, 351 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-2665398-1276642543.opb
0.00/0.04 c Variables : 165 (165 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 176 initial, 176 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 1 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c linear : 0.01 4 86 0 4 0 175 0 0
0.00/0.04 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - 0 - - 0 - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 1 0 0 0 0 0 0
0.00/0.04 c logicor : 176 1 201 1 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 1 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : Time Calls Cutoffs DomReds
0.00/0.04 c vbounds : 0.00 2 0 0
0.00/0.04 c rootredcost : 0.00 0 0 0
0.00/0.04 c pseudoobj : 0.00 2 0 0
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c redcost : 0.00 1 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0 0 0 0 0
0.00/0.05 c clique : 0.00 0 0 0 0 0
0.00/0.05 c zerohalf : 0.00 0 0 0 0 0
0.00/0.05 c mcf : 0.00 0 0 0 0 0
0.00/0.05 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.05 c Pricers : Time Calls Vars
0.00/0.05 c problem variables: 0.00 0 0
0.00/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.05 c pscost : 0.00 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : Time Calls Found
0.00/0.05 c LP solutions : 0.00 - 1
0.00/0.05 c pseudo solutions : 0.00 - 0
0.00/0.05 c crossover : 0.00 0 0
0.00/0.05 c trivial : 0.00 2 2
0.00/0.05 c simplerounding : 0.00 0 0
0.00/0.05 c zirounding : 0.00 0 0
0.00/0.05 c rounding : 0.00 0 0
0.00/0.05 c shifting : 0.00 0 0
0.00/0.05 c intshifting : 0.00 0 0
0.00/0.05 c oneopt : 0.00 2 2
0.00/0.05 c twoopt : 0.00 0 0
0.00/0.05 c fixandinfer : 0.00 0 0
0.00/0.05 c feaspump : 0.00 0 0
0.00/0.05 c coefdiving : 0.00 0 0
0.00/0.05 c pscostdiving : 0.00 0 0
0.00/0.05 c fracdiving : 0.00 0 0
0.00/0.05 c veclendiving : 0.00 0 0
0.00/0.05 c intdiving : 0.00 0 0
0.00/0.05 c actconsdiving : 0.00 0 0
0.00/0.05 c objpscostdiving : 0.00 0 0
0.00/0.05 c rootsoldiving : 0.00 0 0
0.00/0.05 c linesearchdiving : 0.00 0 0
0.00/0.05 c guideddiving : 0.00 0 0
0.00/0.05 c octane : 0.00 0 0
0.00/0.05 c rens : 0.00 0 0
0.00/0.05 c rins : 0.00 0 0
0.00/0.05 c localbranching : 0.00 0 0
0.00/0.05 c mutation : 0.00 0 0
0.00/0.05 c dins : 0.00 0 0
0.00/0.05 c undercover : 0.00 0 0
0.00/0.05 c nlp : 0.00 0 0
0.00/0.05 c trysol : 0.00 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.05 c primal LP : 0.00 0 0 0.00 -
0.00/0.05 c dual LP : 0.00 1 11 11.00 -
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 -
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1
0.00/0.05 c nodes (total) : 1
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 5 (5 improvements)
0.00/0.05 c First Solution : +2.35098000000000e+05 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.05 c Primal Bound : +1.39490000000000e+04 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.05 c Dual Bound : +1.39490000000000e+04
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Root Dual Bound : +1.39490000000000e+04
0.00/0.05 c Root Iterations : 11
0.00/0.05 c Time complete: 0.04.