0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3717739-1338198869.wbo>
0.00/0.00 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 102 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 o 5033
0.00/0.00 c feasible solution found by trivial heuristic, objective value 5.033000e+03
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 1 del conss, 0 add conss, 101 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/270 (18.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 101 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 101 implications, 0 cliques
0.00/0.01 c presolved problem has 371 variables (270 bin, 0 int, 101 impl, 0 cont) and 202 constraints
0.00/0.01 c 101 constraints of type <linear>
0.00/0.01 c 101 constraints of type <indicator>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # force restart if we have a max FS instance and gap is 1?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/forcerestart = TRUE
0.00/0.01 c
0.00/0.01 c # priority of branching rule <inference>
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.01 c branching/inference/priority = 1000000
0.00/0.01 c
0.00/0.01 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.01 c heuristics/coefdiving/freqofs = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/indrounding/freq = 1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 o 1228
0.00/0.01 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.01 c 6 0.0s| 1 | 0 | 0 | - |1064k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 1.228000e+03 | Inf
0.00/0.01 o 250
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1073k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 2.500000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 182 | - |1338k| 0 | 39 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.500000e+02 | Inf
0.00/0.02 o 103
0.00/0.02 c 6 0.0s| 1 | 0 | 182 | - |1374k| 0 | 39 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.00/0.06 c 0.1s| 1 | 0 | 204 | - |1430k| 0 | 43 | 371 | 202 | 371 | 203 | 1 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.00/0.08 c 0.1s| 1 | 0 | 234 | - |1506k| 0 | 44 | 371 | 202 | 371 | 204 | 2 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.07/0.09 c 0.1s| 1 | 0 | 254 | - |1565k| 0 | 44 | 371 | 202 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.08/0.10 c 0.1s| 1 | 0 | 276 | - |1594k| 0 | 46 | 371 | 202 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.08/0.18 c 0.2s| 1 | 2 | 819 | - |1691k| 0 | 46 | 371 | 202 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.19/0.20 o 41
0.19/0.20 c p 0.2s| 6 | 7 | 1326 | 210.0 |1746k| 5 | - | 371 | 202 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 4.100000e+01 | Inf
0.19/0.23 o 12
0.19/0.23 c 5 0.2s| 16 | 14 | 2039 | 117.5 |1795k| 7 | 29 | 371 | 152 | 371 | 206 | 4 | 7 | 0 | 0.000000e+00 | 1.200000e+01 | Inf
0.19/0.24 o 10
0.19/0.24 c v 0.2s| 17 | 13 | 2272 | 124.8 |1821k| 7 | - | 371 | 153 | 371 | 206 | 4 | 8 | 0 | 0.000000e+00 | 1.000000e+01 | Inf
0.29/0.30 o 1
0.29/0.30 c Forcing restart, since the absolute gap is 1.000000.
0.29/0.30 c l 0.3s| 24 | 6 | 3584 | 143.8 |1864k| 7 | - | 371 | 146 | 371 | 206 | 4 | 37 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.30 c (run 1, node 24) performing user restart
0.29/0.30 c
0.29/0.30 c (restart) converted 105 cuts from the global cut pool into linear constraints
0.29/0.30 c
0.29/0.30 c presolving:
0.29/0.30 c (round 1) 178 del vars, 89 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 109 impls, 61 clqs
0.29/0.30 c (round 2) 178 del vars, 109 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 64 upgd conss, 109 impls, 61 clqs
0.29/0.30 c (round 3) 178 del vars, 109 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 82 upgd conss, 109 impls, 61 clqs
0.29/0.31 c (round 4) 178 del vars, 109 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 82 upgd conss, 109 impls, 61 clqs
0.29/0.31 c (round 5) 202 del vars, 133 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 88 upgd conss, 109 impls, 68 clqs
0.29/0.31 c (round 6) 202 del vars, 139 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 111 impls, 68 clqs
0.29/0.31 c (round 7) 202 del vars, 140 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 102 upgd conss, 111 impls, 68 clqs
0.29/0.31 c presolving (8 rounds):
0.29/0.31 c 202 deleted vars, 140 deleted constraints, 0 added constraints, 24 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.31 c 111 implications, 68 cliques
0.29/0.31 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 111 constraints
0.29/0.31 c 5 constraints of type <knapsack>
0.29/0.31 c 72 constraints of type <setppc>
0.29/0.31 c 28 constraints of type <logicor>
0.29/0.31 c 6 constraints of type <bounddisjunction>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.02
0.29/0.31 c
0.29/0.32 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.32 c 0.3s| 1 | 0 | 3668 | - |1658k| 0 | 42 | 169 | 111 | 169 | 84 | 0 | 37 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.33 c 0.3s| 1 | 0 | 3695 | - |1919k| 0 | 47 | 169 | 111 | 169 | 95 | 11 | 37 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.35 c 0.4s| 1 | 2 | 3951 | - |1920k| 0 | 47 | 169 | 111 | 169 | 95 | 11 | 39 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.37 c
0.29/0.37 c SCIP Status : problem is solved [optimal solution found]
0.29/0.37 c Solving Time (sec) : 0.37
0.29/0.37 c Solving Nodes : 32 (total of 56 nodes in 2 runs)
0.29/0.37 c Primal Bound : +1.00000000000000e+00 (29 solutions)
0.29/0.37 c Dual Bound : +1.00000000000000e+00
0.29/0.37 c Gap : 0.00 %
0.29/0.37 s OPTIMUM FOUND
0.29/0.37 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148
0.29/0.37 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
0.29/0.37 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.29/0.37 v x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82
0.29/0.37 v -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
0.29/0.37 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
0.29/0.37 v -x30 -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5
0.29/0.37 v -x4 -x3 -x2 -x1
0.29/0.37 c SCIP Status : problem is solved [optimal solution found]
0.29/0.37 c Total Time : 0.37
0.29/0.37 c solving : 0.37
0.29/0.37 c presolving : 0.02 (included in solving)
0.29/0.37 c reading : 0.00 (included in solving)
0.29/0.37 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.29/0.37 c Original Problem :
0.29/0.37 c Problem name : HOME/instance-3717739-1338198869.wbo
0.29/0.37 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.37 c Constraints : 102 initial, 102 maximal
0.29/0.37 c Objective sense : minimize
0.29/0.37 c Presolved Problem :
0.29/0.37 c Problem name : t_HOME/instance-3717739-1338198869.wbo
0.29/0.37 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.37 c Constraints : 111 initial, 125 maximal
0.29/0.37 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.29/0.37 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c trivial : 0.00 0.00 190 0 0 0 0 0 0 0 0
0.29/0.37 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c pseudoobj : 0.00 0.00 0 0 0 12 0 0 0 0 0
0.29/0.37 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c varbound : 0.00 0.00 0 0 0 12 0 12 0 0 0
0.29/0.37 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c setppc : 0.00 0.00 0 0 0 0 0 6 0 0 0
0.29/0.37 c linear : 0.00 0.00 12 0 0 101 0 111 0 0 0
0.29/0.37 c indicator : 0.00 0.00 0 0 0 0 0 12 0 0 0
0.29/0.37 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c bounddisjunction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.37 c root node : - - 280 - - 280 - - - - -
0.29/0.37 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.29/0.37 c integral : 0 0 0 0 40 0 97 0 0 0 0 0 80
0.29/0.37 c knapsack : 5 5 1 217 0 0 16 5 0 36 0 0 0
0.29/0.37 c setppc : 72 72 1 217 0 0 16 128 1 569 0 0 0
0.29/0.37 c logicor : 28+ 42 1 99 0 0 0 16 1 13 0 0 0
0.29/0.37 c bounddisjunction : 6 6 0 55 0 0 0 0 0 0 0 0 0
0.29/0.37 c countsols : 0 0 0 0 0 0 57 0 0 0 0 0 0
0.29/0.37 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.29/0.37 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c knapsack : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.29/0.37 c rootredcost : 3 0 0 32
0.29/0.37 c pseudoobj : 498 13 0 12
0.29/0.37 c vbounds : 40 18 0 23
0.29/0.37 c redcost : 52 0 0 183
0.29/0.37 c probing : 0 0 0 0
0.29/0.37 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.29/0.37 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c redcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c probing : 0.00 0.00 0.00 0.00 0.00
0.29/0.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.37 c propagation : 0.00 9 9 47 27.9 0 0.0 -
0.29/0.37 c infeasible LP : 0.00 22 17 47 15.5 0 0.0 0
0.29/0.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.37 c applied globally : - - - 52 14.3 - - -
0.29/0.37 c applied locally : - - - 2 45.0 - - -
0.29/0.37 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.29/0.37 c cut pool : 0.00 0 - - 0 - (maximal pool size: 68)
0.29/0.37 c closecuts : 0.00 0.00 0 0 0 0 0
0.29/0.37 c impliedbounds : 0.00 0.00 6 0 0 0 0
0.29/0.37 c intobj : 0.00 0.00 0 0 0 0 0
0.29/0.37 c gomory : 0.02 0.00 6 0 0 15 0
0.29/0.37 c cgmip : 0.00 0.00 0 0 0 0 0
0.29/0.37 c strongcg : 0.02 0.00 6 0 0 101 0
0.29/0.37 c cmir : 0.01 0.00 6 0 0 0 0
0.29/0.37 c flowcover : 0.02 0.00 6 0 0 0 0
0.29/0.37 c clique : 0.00 0.00 2 0 0 7 0
0.29/0.37 c zerohalf : 0.00 0.00 0 0 0 0 0
0.29/0.37 c mcf : 0.00 0.00 2 0 0 0 0
0.29/0.37 c oddcycle : 0.00 0.00 0 0 0 0 0
0.29/0.37 c rapidlearning : 0.03 0.00 1 0 0 0 0
0.29/0.37 c Pricers : ExecTime SetupTime Calls Vars
0.29/0.37 c problem variables: 0.00 - 0 0
0.29/0.37 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.29/0.37 c inference : 0.00 0.00 40 0 0 0 0 80
0.29/0.37 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c pscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c random : 0.00 0.00 0 0 0 0 0 0
0.29/0.37 c Primal Heuristics : ExecTime SetupTime Calls Found
0.29/0.37 c LP solutions : 0.00 - - 0
0.29/0.37 c pseudo solutions : 0.00 - - 0
0.29/0.37 c crossover : 0.00 0.00 0 0
0.29/0.37 c oneopt : 0.00 0.00 4 0
0.29/0.37 c fracdiving : 0.00 0.00 1 1
0.29/0.37 c guideddiving : 0.01 0.00 1 0
0.29/0.37 c pscostdiving : 0.03 0.00 2 4
0.29/0.37 c veclendiving : 0.01 0.00 2 1
0.29/0.37 c objpscostdiving : 0.00 0.00 1 0
0.29/0.37 c rootsoldiving : 0.01 0.00 1 0
0.29/0.37 c linesearchdiving : 0.01 0.00 2 1
0.29/0.37 c smallcard : 0.00 0.00 0 0
0.29/0.37 c trivial : 0.00 0.00 2 1
0.29/0.37 c shiftandpropagate: 0.00 0.00 0 0
0.29/0.37 c simplerounding : 0.00 0.00 45 0
0.29/0.37 c zirounding : 0.00 0.00 24 0
0.29/0.37 c rounding : 0.00 0.00 45 0
0.29/0.37 c shifting : 0.00 0.00 7 4
0.29/0.37 c intshifting : 0.00 0.00 0 0
0.29/0.37 c twoopt : 0.00 0.00 0 0
0.29/0.37 c indoneopt : 0.02 0.00 6 3
0.29/0.37 c indtwoopt : 0.00 0.00 0 0
0.29/0.37 c fixandinfer : 0.00 0.00 0 0
0.29/0.37 c feaspump : 0.00 0.00 0 0
0.29/0.37 c clique : 0.00 0.00 0 0
0.29/0.37 c indrounding : 0.00 0.00 40 6
0.29/0.37 c coefdiving : 0.06 0.00 2 5
0.29/0.37 c indcoefdiving : 0.00 0.00 0 0
0.29/0.37 c nlpdiving : 0.00 0.00 0 0
0.29/0.37 c intdiving : 0.00 0.00 0 0
0.29/0.37 c actconsdiving : 0.00 0.00 0 0
0.29/0.37 c octane : 0.00 0.00 0 0
0.29/0.37 c rens : 0.02 0.00 1 0
0.29/0.37 c rins : 0.00 0.00 0 0
0.29/0.37 c localbranching : 0.00 0.00 0 0
0.29/0.37 c mutation : 0.00 0.00 0 0
0.29/0.37 c dins : 0.00 0.00 0 0
0.29/0.37 c vbounds : 0.00 0.00 0 0
0.29/0.37 c undercover : 0.00 0.00 0 0
0.29/0.37 c subnlp : 0.00 0.00 0 0
0.29/0.37 c trysol : 0.00 0.00 6 3
0.29/0.37 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.29/0.37 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.29/0.37 c dual LP : 0.06 70 2181 35.75 38449.33 0.00 9
0.29/0.37 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.37 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.29/0.37 c diving/probing LP: 0.10 481 2531 5.26 24495.29
0.29/0.37 c strong branching : 0.00 0 0 0.00 -
0.29/0.37 c (at root node) : - 0 0 0.00 -
0.29/0.37 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.37 c B&B Tree :
0.29/0.37 c number of runs : 2
0.29/0.37 c nodes : 32
0.29/0.37 c nodes (total) : 56
0.29/0.37 c nodes left : 0
0.29/0.37 c max depth : 7
0.29/0.37 c max depth (total): 7
0.29/0.37 c backtracks : 12 (37.5%)
0.29/0.37 c delayed cutoffs : 1
0.29/0.37 c repropagations : 17 (249 domain reductions, 1 cutoffs)
0.29/0.37 c avg switch length: 2.88
0.29/0.37 c switching time : 0.00
0.29/0.37 c Solution :
0.29/0.37 c Solutions found : 29 (8 improvements)
0.29/0.37 c First Solution : +5.03300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.29/0.37 c Primal Bound : +1.00000000000000e+00 (in run 1, after 24 nodes, 0.30 seconds, depth 15, found by <linesearchdiving>)
0.29/0.37 c Dual Bound : +1.00000000000000e+00
0.29/0.37 c Gap : 0.00 %
0.29/0.37 c Root Dual Bound : +0.00000000000000e+00
0.29/0.37 c Root Iterations : 387
0.29/0.38 c Time complete: 0.37.