0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3734197-1338712338.opb>
0.00/0.00 c original problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 244 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 11 del vars, 0 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 324 impls, 0 clqs
0.00/0.01 c (round 2) 29 del vars, 39 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1422 impls, 0 clqs
0.00/0.01 c (round 3) 29 del vars, 71 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1422 impls, 0 clqs
0.00/0.01 c (round 4) 29 del vars, 71 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 172 upgd conss, 1422 impls, 0 clqs
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 29 deleted vars, 71 deleted constraints, 0 added constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 1422 implications, 0 cliques
0.00/0.01 c presolved problem has 70 variables (70 bin, 0 int, 0 impl, 0 cont) and 173 constraints
0.00/0.01 c 118 constraints of type <setppc>
0.00/0.01 c 1 constraints of type <linear>
0.00/0.01 c 54 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 2)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
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 # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
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 -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 69 | - | 619k| 0 | 9 | 70 | 204 | 70 | 173 | 0 | 31 | 0 | 1.445597e+01 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 169 | - | 683k| 0 | 18 | 70 | 194 | 70 | 164 | 3 | 31 | 0 | 1.445597e+01 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 184 | - | 687k| 0 | 4 | 70 | 194 | 70 | 166 | 5 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 218 | - | 708k| 0 | 4 | 70 | 194 | 70 | 169 | 8 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.05 c 0.1s| 1 | 0 | 254 | - | 719k| 0 | 12 | 70 | 194 | 70 | 171 | 10 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 260 | - | 722k| 0 | 12 | 70 | 194 | 70 | 172 | 11 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 284 | - | 733k| 0 | 4 | 70 | 194 | 70 | 174 | 13 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 298 | - | 741k| 0 | 12 | 70 | 194 | 70 | 176 | 15 | 31 | 0 | 1.500000e+01 | -- | Inf
0.01/0.08 c 0.1s| 1 | 2 | 298 | - | 741k| 0 | 12 | 70 | 194 | 70 | 176 | 15 | 31 | 9 | 1.500000e+01 | -- | Inf
0.01/0.08 c (run 1, node 1) restarting after 5 global fixings of integer variables
0.01/0.08 c
0.01/0.08 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.01/0.08 c
0.01/0.08 c presolving:
0.01/0.08 c (round 1) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 2) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 3) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 4) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 5) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 6) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 7) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 8) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 9) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 10) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 11) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 12) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 80 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 13) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 14) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 15) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 100 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.09 c (round 16) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 107 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.01/0.10 c (round 17) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 115 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 18) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 123 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 19) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 130 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 20) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 137 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 21) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 142 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 22) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 145 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 23) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 148 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 24) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 150 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 25) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 152 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 26) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 154 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 27) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 156 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 28) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 29) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 159 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 30) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 160 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c (round 31) 5 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 161 chg coeffs, 11 upgd conss, 1422 impls, 0 clqs
0.09/0.10 c presolving (32 rounds):
0.09/0.10 c 5 deleted vars, 1 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 161 changed coefficients
0.09/0.10 c 1422 implications, 0 cliques
0.09/0.10 c presolved problem has 65 variables (65 bin, 0 int, 0 impl, 0 cont) and 198 constraints
0.09/0.10 c 5 constraints of type <knapsack>
0.09/0.10 c 106 constraints of type <setppc>
0.09/0.10 c 1 constraints of type <linear>
0.09/0.10 c 86 constraints of type <logicor>
0.09/0.10 c transformed objective value is always integral (scale: 2)
0.09/0.10 c Presolving Time: 0.03
0.09/0.10 c
0.09/0.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.11 c 0.1s| 1 | 0 | 367 | - | 684k| 0 | 12 | 65 | 224 | 65 | 162 | 0 | 57 | 9 | 1.500000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 443 | - | 694k| 0 | 16 | 65 | 224 | 65 | 165 | 3 | 57 | 9 | 1.500000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 2 | 443 | - | 695k| 0 | 16 | 65 | 224 | 65 | 165 | 3 | 57 | 25 | 1.500000e+01 | -- | Inf
0.38/0.43 o 83
0.38/0.43 c * 0.4s| 107 | 32 | 2072 | 15.2 | 757k| 11 | - | 65 | 279 | 65 | 163 | 3 | 112 | 515 | 1.705392e+01 | 8.300000e+01 | 386.69%
0.38/0.47 c
0.38/0.47 c SCIP Status : problem is solved [optimal solution found]
0.38/0.47 c Solving Time (sec) : 0.47
0.38/0.47 c Solving Nodes : 192 (total of 193 nodes in 2 runs)
0.38/0.47 c Primal Bound : +8.30000000000000e+01 (1 solutions)
0.38/0.47 c Dual Bound : +8.30000000000000e+01
0.38/0.47 c Gap : 0.00 %
0.38/0.47 s OPTIMUM FOUND
0.38/0.47 v -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 x79 -x78 x77 x76 -x75 -x74
0.38/0.47 v x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 x59 x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48
0.38/0.47 v -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 x32 x31 -x30 -x29 x28 -x18 -x27 -x17 -x26 x16 x25 -x15
0.38/0.47 v -x24 x14 x23 x13 x22 -x12 -x21 -x11 -x20 x10 x19 -x9 -x8 x7 -x6 x5 -x4 -x3 x2 x1
0.38/0.47 c SCIP Status : problem is solved [optimal solution found]
0.38/0.47 c Total Time : 0.47
0.38/0.47 c solving : 0.47
0.38/0.47 c presolving : 0.03 (included in solving)
0.38/0.47 c reading : 0.00 (included in solving)
0.38/0.47 c Original Problem :
0.38/0.47 c Problem name : HOME/instance-3734197-1338712338.opb
0.38/0.47 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.38/0.47 c Constraints : 244 initial, 244 maximal
0.38/0.47 c Presolved Problem :
0.38/0.47 c Problem name : t_HOME/instance-3734197-1338712338.opb
0.38/0.47 c Variables : 65 (65 binary, 0 integer, 0 implicit integer, 0 continuous)
0.38/0.47 c Constraints : 198 initial, 340 maximal
0.38/0.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.38/0.47 c trivial : 0.00 5 0 0 0 0 0 0 0 0
0.38/0.47 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c implics : 0.00 0 16 0 0 0 0 0 0 0
0.38/0.47 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c knapsack : 0.02 0 0 0 0 0 0 0 0 160
0.38/0.47 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.38/0.47 c linear : 0.00 13 0 0 12 0 71 0 0 1
0.38/0.47 c logicor : 0.00 0 0 0 0 0 1 0 0 0
0.38/0.47 c root node : - 18 - - 18 - - - - -
0.38/0.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.38/0.47 c integral : 0 0 0 164 0 7 0 6 122 0 0 216
0.38/0.47 c knapsack : 5 1 628 0 0 0 40 1 26 3 0 0
0.38/0.47 c setppc : 106 9 925 1 0 3 3139 24 1240 0 0 0
0.38/0.47 c linear : 1 9 902 1 0 2 398 71 433 20 0 0
0.38/0.47 c logicor : 86+ 9 664 1 0 0 595 37 435 26 0 0
0.38/0.47 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
0.38/0.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.38/0.47 c integral : 0.29 0.00 0.00 0.29 0.00 0.00 0.00
0.38/0.47 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c linear : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.38/0.47 c vbounds : 0 0 0 0
0.38/0.47 c rootredcost : 1 0 0 1
0.38/0.47 c pseudoobj : 794 49 0 24
0.38/0.47 c Propagator Timings : TotalTime Propagate Resprop
0.38/0.47 c vbounds : 0.00 0.00 0.00
0.38/0.47 c rootredcost : 0.00 0.00 0.00
0.38/0.47 c pseudoobj : 0.00 0.00 0.00
0.38/0.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.38/0.47 c propagation : 0.00 133 91 363 17.3 3 23.3 -
0.38/0.47 c infeasible LP : 0.00 3 3 17 15.9 1 17.0 0
0.38/0.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.38/0.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.38/0.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.38/0.47 c applied globally : - - - 197 13.4 - - -
0.38/0.47 c applied locally : - - - 2 44.0 - - -
0.38/0.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.38/0.47 c cut pool : 0.00 0 - - 0 - (maximal pool size: 6)
0.38/0.47 c redcost : 0.00 173 0 3 0 0
0.38/0.47 c impliedbounds : 0.00 8 0 0 0 0
0.38/0.47 c intobj : 0.00 0 0 0 0 0
0.38/0.47 c gomory : 0.00 8 0 0 56 0
0.38/0.47 c cgmip : 0.00 0 0 0 0 0
0.38/0.47 c closecuts : 0.00 0 0 0 0 0
0.38/0.47 c strongcg : 0.00 8 0 0 54 0
0.38/0.47 c cmir : 0.00 8 0 0 9 0
0.38/0.47 c flowcover : 0.01 8 0 0 15 0
0.38/0.47 c clique : 0.00 8 0 0 0 0
0.38/0.47 c zerohalf : 0.00 0 0 0 0 0
0.38/0.47 c mcf : 0.00 2 0 0 0 0
0.38/0.47 c oddcycle : 0.00 0 0 0 0 0
0.38/0.47 c rapidlearning : 0.02 1 0 5 0 25
0.38/0.47 c Pricers : Time Calls Vars
0.38/0.47 c problem variables: 0.00 0 0
0.38/0.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.38/0.47 c relpscost : 0.29 163 6 122 0 0 216
0.38/0.47 c pscost : 0.00 0 0 0 0 0 0
0.38/0.47 c inference : 0.00 0 0 0 0 0 0
0.38/0.47 c mostinf : 0.00 0 0 0 0 0 0
0.38/0.47 c leastinf : 0.00 0 0 0 0 0 0
0.38/0.47 c fullstrong : 0.00 0 0 0 0 0 0
0.38/0.47 c allfullstrong : 0.00 0 0 0 0 0 0
0.38/0.47 c random : 0.00 0 0 0 0 0 0
0.38/0.47 c Primal Heuristics : Time Calls Found
0.38/0.47 c LP solutions : 0.00 - 1
0.38/0.47 c pseudo solutions : 0.00 - 0
0.38/0.47 c crossover : 0.00 0 0
0.38/0.47 c linesearchdiving : 0.00 0 0
0.38/0.47 c guideddiving : 0.00 0 0
0.38/0.47 c oneopt : 0.00 1 0
0.38/0.47 c fracdiving : 0.00 1 0
0.38/0.47 c veclendiving : 0.00 1 0
0.38/0.47 c rootsoldiving : 0.00 1 0
0.38/0.47 c objpscostdiving : 0.00 1 0
0.38/0.47 c trivial : 0.00 2 0
0.38/0.47 c shiftandpropagate: 0.00 2 0
0.38/0.47 c simplerounding : 0.00 0 0
0.38/0.47 c zirounding : 0.00 0 0
0.38/0.47 c rounding : 0.00 135 0
0.38/0.47 c shifting : 0.00 13 0
0.38/0.47 c intshifting : 0.00 0 0
0.38/0.47 c twoopt : 0.00 0 0
0.38/0.47 c fixandinfer : 0.00 0 0
0.38/0.47 c feaspump : 0.00 1 0
0.38/0.47 c clique : 0.00 0 0
0.38/0.47 c coefdiving : 0.00 1 0
0.38/0.47 c pscostdiving : 0.00 1 0
0.38/0.47 c intdiving : 0.00 0 0
0.38/0.47 c actconsdiving : 0.00 0 0
0.38/0.47 c octane : 0.00 0 0
0.38/0.47 c rens : 0.01 1 0
0.38/0.47 c rins : 0.00 0 0
0.38/0.47 c localbranching : 0.00 0 0
0.38/0.47 c mutation : 0.00 0 0
0.38/0.47 c dins : 0.00 0 0
0.38/0.47 c vbounds : 0.00 0 0
0.38/0.47 c undercover : 0.00 0 0
0.38/0.47 c subnlp : 0.00 0 0
0.38/0.47 c trysol : 0.00 0 0
0.38/0.47 c LP : Time Calls Iterations Iter/call Iter/sec
0.38/0.47 c primal LP : 0.00 0 0 0.00 -
0.38/0.47 c dual LP : 0.05 174 2651 15.24 51298.42
0.38/0.47 c lex dual LP : 0.00 0 0 0.00 -
0.38/0.47 c barrier LP : 0.00 0 0 0.00 -
0.38/0.47 c diving/probing LP: 0.00 16 188 11.75 -
0.38/0.47 c strong branching : 0.29 560 13786 24.62 47778.47
0.38/0.47 c (at root node) : - 25 1378 55.12 -
0.38/0.47 c conflict analysis: 0.00 0 0 0.00 -
0.38/0.47 c B&B Tree :
0.38/0.47 c number of runs : 2
0.38/0.47 c nodes : 192
0.38/0.47 c nodes (total) : 193
0.38/0.47 c nodes left : 0
0.38/0.47 c max depth : 11
0.38/0.47 c max depth (total): 11
0.38/0.47 c backtracks : 49 (25.5%)
0.38/0.47 c delayed cutoffs : 23
0.38/0.47 c repropagations : 84 (341 domain reductions, 18 cutoffs)
0.38/0.47 c avg switch length: 3.62
0.38/0.47 c switching time : 0.00
0.38/0.47 c Solution :
0.38/0.47 c Solutions found : 1 (1 improvements)
0.38/0.47 c First Solution : +8.30000000000000e+01 (in run 2, after 107 nodes, 0.42 seconds, depth 7, found by <relaxation>)
0.38/0.47 c Primal Bound : +8.30000000000000e+01 (in run 2, after 107 nodes, 0.42 seconds, depth 7, found by <relaxation>)
0.38/0.47 c Dual Bound : +8.30000000000000e+01
0.38/0.47 c Gap : 0.00 %
0.38/0.47 c Root Dual Bound : +1.50000000000000e+01
0.38/0.47 c Root Iterations : 443
0.38/0.48 c Time complete: 0.47.