0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704543-1278561450.opb>
0.00/0.02 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 91 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.02/0.03 o 240
0.02/0.03 c feasible solution found by trivial heuristic, objective value 2.400000e+02
0.02/0.03 c presolving:
0.02/0.04 c (round 1) 0 del vars, 41 del conss, 0 chg bounds, 41 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.02/0.05 c (round 2) 0 del vars, 41 del conss, 0 chg bounds, 41 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.02/0.05 c (0.0s) probing: 101/240 (42.1%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.02/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.05 c presolving (3 rounds):
0.02/0.05 c 0 deleted vars, 41 deleted constraints, 0 tightened bounds, 0 added holes, 41 changed sides, 0 changed coefficients
0.02/0.05 c 0 implications, 0 cliques
0.02/0.05 c presolved problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.02/0.05 c 50 constraints of type <logicor>
0.02/0.05 c transformed objective value is always integral (scale: 1)
0.02/0.05 c Presolving Time: 0.02
0.02/0.05 c - non default parameters ----------------------------------------------------------------------
0.02/0.05 c # SCIP version 1.2.1.3
0.02/0.05 c
0.02/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c conflict/interconss = 0
0.02/0.05 c
0.02/0.05 c # should binary conflicts be preferred?
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c conflict/preferbinary = TRUE
0.02/0.05 c
0.02/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05 c constraints/agelimit = 1
0.02/0.05 c
0.02/0.05 c # should enforcement of pseudo solution be disabled?
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/disableenfops = TRUE
0.02/0.05 c
0.02/0.05 c # frequency for displaying node information lines
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.05 c display/freq = 10000
0.02/0.05 c
0.02/0.05 c # maximal time in seconds to run
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/time = 1789.98
0.02/0.05 c
0.02/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/memory = 1620
0.02/0.05 c
0.02/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.05 c lp/solvefreq = 0
0.02/0.05 c
0.02/0.05 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.02/0.05 c # [type: char, range: {lafpsqd}, default: l]
0.02/0.05 c lp/pricing = a
0.02/0.05 c
0.02/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.05 c # [type: int, range: [1,2], default: 1]
0.02/0.05 c timing/clocktype = 2
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify inequalities
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/linear/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/indicator/addCouplingCons = TRUE
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify knapsacks
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # priority of node selection rule <dfs> in standard mode
0.02/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.02/0.05 c nodeselection/dfs/stdpriority = 1000000
0.02/0.05 c
0.02/0.05 c -----------------------------------------------------------------------------------------------
0.02/0.05 c start solving
0.02/0.05 c
0.02/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.02/0.06 c t 0.0s| 1 | 0 | 60 | - |1340k| 0 | 16 | 240 | 50 | 240 | 50 | 0 | 0 | 0 | 4.000000e+00 | 2.400000e+02 |5900.00%
0.02/0.06 o 16
0.02/0.06 c r 0.0s| 1 | 0 | 60 | - |1346k| 0 | 16 | 240 | 50 | 240 | 50 | 0 | 0 | 0 | 4.000000e+00 | 1.600000e+01 | 300.00%
0.02/0.06 o 15
0.02/0.06 c R 0.0s| 1 | 0 | 60 | - |1353k| 0 | 16 | 240 | 50 | 240 | 50 | 0 | 0 | 0 | 4.000000e+00 | 1.500000e+01 | 275.00%
0.02/0.06 o 14
0.02/0.06 c s 0.0s| 1 | 0 | 60 | - |1359k| 0 | 16 | 240 | 50 | 240 | 50 | 0 | 0 | 0 | 4.000000e+00 | 1.400000e+01 | 250.00%
0.02/0.08 c 0.1s| 1 | 0 | 81 | - |1533k| 0 | 18 | 240 | 50 | 240 | 51 | 1 | 0 | 0 | 4.000000e+00 | 1.400000e+01 | 250.00%
0.02/0.08 o 6
0.02/0.08 c b 0.1s| 1 | 0 | 81 | - |1539k| 0 | 18 | 240 | 50 | 240 | 51 | 1 | 0 | 0 | 4.000000e+00 | 6.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 115 | - |1667k| 0 | 24 | 240 | 50 | 240 | 52 | 2 | 0 | 0 | 4.000000e+00 | 6.000000e+00 | 50.00%
0.09/0.19 o 5
0.09/0.19 c E 0.2s| 1 | 0 | 115 | - |1679k| 0 | 24 | 240 | 50 | 240 | 52 | 2 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.19/0.20 c 0.2s| 1 | 0 | 115 | - |1679k| 0 | 24 | 240 | 50 | 240 | 52 | 2 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.19/0.22 c 0.2s| 1 | 0 | 115 | - |1679k| 0 | 24 | 240 | 50 | 240 | 52 | 2 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.19/0.25 c 0.2s| 1 | 0 | 142 | - |1679k| 0 | 23 | 240 | 50 | 240 | 52 | 2 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.19/0.28 c 0.3s| 1 | 0 | 221 | - |1797k| 0 | 20 | 240 | 50 | 240 | 53 | 3 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.29/0.31 c 0.3s| 1 | 0 | 269 | - |1800k| 0 | 16 | 240 | 50 | 240 | 53 | 3 | 0 | 11 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.29/0.34 c 0.3s| 1 | 0 | 279 | - |1911k| 0 | - | 240 | 50 | 240 | 54 | 4 | 0 | 11 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.29/0.34 c 0.3s| 1 | 0 | 279 | - |1911k| 0 | - | 240 | 50 | 240 | 54 | 4 | 0 | 11 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.29/0.34 c
0.29/0.34 c SCIP Status : problem is solved [optimal solution found]
0.29/0.34 c Solving Time (sec) : 0.31
0.29/0.34 c Solving Nodes : 1
0.29/0.34 c Primal Bound : +5.00000000000000e+00 (14 solutions)
0.29/0.34 c Dual Bound : +5.00000000000000e+00
0.29/0.34 c Gap : 0.00 %
0.29/0.34 s OPTIMUM FOUND
0.29/0.34 v -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219
0.29/0.34 v -x218 -x217 -x216 -x215 -x214 x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198
0.29/0.34 v -x197 -x196 -x195 -x194 x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177
0.29/0.34 v -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157
0.29/0.34 v -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136
0.29/0.34 v -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115
0.29/0.34 v -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 x95 -x94 -x93
0.29/0.34 v -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68
0.29/0.34 v -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43
0.29/0.34 v -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17
0.29/0.34 v -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.29/0.34 c SCIP Status : problem is solved [optimal solution found]
0.29/0.34 c Solving Time : 0.31
0.29/0.34 c Original Problem :
0.29/0.34 c Problem name : HOME/instance-2704543-1278561450.opb
0.29/0.34 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.34 c Constraints : 91 initial, 91 maximal
0.29/0.34 c Presolved Problem :
0.29/0.34 c Problem name : t_HOME/instance-2704543-1278561450.opb
0.29/0.34 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.34 c Constraints : 50 initial, 50 maximal
0.29/0.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.34 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c probing : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c linear : 0.01 0 0 0 0 0 41 41 0
0.29/0.34 c logicor : 0.00 0 0 0 0 0 0 0 0
0.29/0.34 c root node : - 42 - - 42 - - - -
0.29/0.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.34 c integral : 0 0 0 2 0 0 10 0 0 0
0.29/0.34 c logicor : 50 6 20 0 0 0 0 0 0 0
0.29/0.34 c countsols : 0 0 0 0 0 0 0 0 0 0
0.29/0.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.34 c integral : 0.06 0.00 0.00 0.06 0.00
0.29/0.34 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.34 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.34 c Propagators : Time Calls Cutoffs DomReds
0.29/0.34 c vbounds : 0.00 2 0 0
0.29/0.34 c rootredcost : 0.00 0 0 0
0.29/0.34 c pseudoobj : 0.00 7 1 0
0.29/0.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.34 c applied globally : - - - 0 0.0 - - -
0.29/0.34 c applied locally : - - - 0 0.0 - - -
0.29/0.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.34 c cut pool : 0.00 4 - - 0 - (maximal pool size: 79)
0.29/0.34 c redcost : 0.00 6 0 32 0 0
0.29/0.34 c impliedbounds : 0.00 6 0 0 0 0
0.29/0.34 c intobj : 0.00 0 0 0 0 0
0.29/0.34 c cgmip : 0.00 0 0 0 0 0
0.29/0.34 c gomory : 0.04 6 0 0 96 0
0.29/0.34 c strongcg : 0.03 6 0 0 48 0
0.29/0.34 c cmir : 0.01 6 0 0 0 0
0.29/0.34 c flowcover : 0.04 6 0 0 0 0
0.29/0.34 c clique : 0.00 1 0 0 0 0
0.29/0.34 c zerohalf : 0.00 0 0 0 0 0
0.29/0.34 c mcf : 0.00 1 0 0 0 0
0.29/0.34 c rapidlearning : 0.00 0 0 0 0 0
0.29/0.34 c Pricers : Time Calls Vars
0.29/0.34 c problem variables: 0.00 0 0
0.29/0.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.34 c relpscost : 0.06 2 0 10 0 0 0
0.29/0.34 c pscost : 0.00 0 0 0 0 0 0
0.29/0.34 c inference : 0.00 0 0 0 0 0 0
0.29/0.34 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.34 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.34 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.34 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.34 c random : 0.00 0 0 0 0 0 0
0.29/0.34 c Primal Heuristics : Time Calls Found
0.29/0.34 c LP solutions : 0.00 - 0
0.29/0.34 c pseudo solutions : 0.00 - 0
0.29/0.34 c crossover : 0.00 0 0
0.29/0.34 c oneopt : 0.00 3 1
0.29/0.34 c trivial : 0.00 2 3
0.29/0.34 c simplerounding : 0.00 6 6
0.29/0.34 c zirounding : 0.00 1 1
0.29/0.34 c rounding : 0.00 6 1
0.29/0.34 c shifting : 0.00 6 1
0.29/0.34 c intshifting : 0.00 0 0
0.29/0.34 c twoopt : 0.00 0 0
0.29/0.34 c fixandinfer : 0.00 0 0
0.29/0.34 c feaspump : 0.00 0 0
0.29/0.34 c coefdiving : 0.00 0 0
0.29/0.34 c pscostdiving : 0.00 0 0
0.29/0.34 c fracdiving : 0.00 0 0
0.29/0.34 c veclendiving : 0.00 0 0
0.29/0.34 c intdiving : 0.00 0 0
0.29/0.34 c actconsdiving : 0.00 0 0
0.29/0.34 c objpscostdiving : 0.00 0 0
0.29/0.34 c rootsoldiving : 0.00 0 0
0.29/0.34 c linesearchdiving : 0.00 0 0
0.29/0.34 c guideddiving : 0.00 0 0
0.29/0.34 c octane : 0.00 0 0
0.29/0.34 c rens : 0.08 1 1
0.29/0.34 c rins : 0.00 0 0
0.29/0.34 c localbranching : 0.00 0 0
0.29/0.34 c mutation : 0.00 0 0
0.29/0.34 c dins : 0.00 0 0
0.29/0.34 c undercover : 0.00 0 0
0.29/0.34 c nlp : 0.00 0 0
0.29/0.34 c trysol : 0.00 0 0
0.29/0.34 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.34 c primal LP : 0.00 0 0 0.00 -
0.29/0.34 c dual LP : 0.02 7 279 39.86 15500.86
0.29/0.34 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.34 c barrier LP : 0.00 0 0 0.00 -
0.29/0.34 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.34 c strong branching : 0.06 11 726 66.00 12964.98
0.29/0.34 c (at root node) : - 11 726 66.00 -
0.29/0.34 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.34 c B&B Tree :
0.29/0.34 c number of runs : 1
0.29/0.34 c nodes : 1
0.29/0.34 c nodes (total) : 1
0.29/0.34 c nodes left : 0
0.29/0.34 c max depth : 0
0.29/0.34 c max depth (total): 0
0.29/0.34 c backtracks : 0 (0.0%)
0.29/0.34 c delayed cutoffs : 0
0.29/0.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.34 c avg switch length: 2.00
0.29/0.34 c switching time : 0.00
0.29/0.34 c Solution :
0.29/0.34 c Solutions found : 14 (6 improvements)
0.29/0.34 c First Solution : +2.40000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.29/0.34 c Primal Bound : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.17 seconds, depth 0, found by <rens>)
0.29/0.34 c Dual Bound : +5.00000000000000e+00
0.29/0.34 c Gap : 0.00 %
0.29/0.34 c Root Dual Bound : +5.00000000000000e+00
0.29/0.34 c Root Iterations : 279
0.29/0.35 c Time complete: 0.34.