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-3717603-1338205320.wbo>
0.00/0.00 c original problem has 666 variables (666 bin, 0 int, 0 impl, 0 cont) and 517 constraints
0.00/0.00 c problem read in 0.00
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 add conss, 486 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 30 clqs
0.00/0.02 c (round 2) 0 del vars, 0 del conss, 0 add conss, 486 chg bounds, 0 chg sides, 0 chg coeffs, 31 upgd conss, 0 impls, 30 clqs
0.01/0.07 c (0.1s) probing: 537/666 (80.6%) - 0 fixings, 0 aggregations, 486 implications, 0 bound changes
0.01/0.07 c (0.1s) probing aborted: 50/50 successive totally useless probings
0.01/0.07 c presolving (3 rounds):
0.01/0.07 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 486 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.07 c 486 implications, 30 cliques
0.01/0.07 c presolved problem has 1152 variables (666 bin, 0 int, 486 impl, 0 cont) and 1003 constraints
0.01/0.07 c 1 constraints of type <knapsack>
0.01/0.07 c 30 constraints of type <setppc>
0.01/0.07 c 486 constraints of type <linear>
0.01/0.07 c 486 constraints of type <indicator>
0.01/0.07 c transformed objective value is always integral (scale: 1)
0.01/0.07 c Presolving Time: 0.07
0.01/0.07 c - non default parameters ----------------------------------------------------------------------
0.01/0.07 c # SCIP version 2.1.1.4
0.01/0.07 c
0.01/0.07 c # maximal time in seconds to run
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/time = 1797
0.01/0.07 c
0.01/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/memory = 13950
0.01/0.07 c
0.01/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.07 c # [type: int, range: [1,2], default: 1]
0.01/0.07 c timing/clocktype = 2
0.01/0.07 c
0.01/0.07 c # belongs reading time to solving time?
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c timing/reading = TRUE
0.01/0.07 c
0.01/0.07 c # force restart if we have a max FS instance and gap is 1?
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/indicator/forcerestart = TRUE
0.01/0.07 c
0.01/0.07 c # priority of branching rule <inference>
0.01/0.07 c # [type: int, range: [-536870912,536870911], default: 1000]
0.01/0.07 c branching/inference/priority = 1000000
0.01/0.07 c
0.01/0.07 c # frequency offset for calling primal heuristic <coefdiving>
0.01/0.07 c # [type: int, range: [0,2147483647], default: 1]
0.01/0.07 c heuristics/coefdiving/freqofs = 0
0.01/0.07 c
0.01/0.07 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.07 c heuristics/shiftandpropagate/freq = -1
0.01/0.07 c
0.01/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.07 c heuristics/undercover/freq = -1
0.01/0.07 c
0.01/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.07 c separating/rapidlearning/freq = 0
0.01/0.07 c
0.01/0.07 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.07 c heuristics/indrounding/freq = 1
0.01/0.07 c
0.01/0.07 c -----------------------------------------------------------------------------------------------
0.01/0.07 c start solving
0.01/0.07 c
0.01/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.08 c 0.1s| 1 | 0 | 61 | - |4298k| 0 | 60 |1152 |1003 |1152 |1002 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 316 | - |4384k| 0 | 60 |1152 |1003 |1152 |1010 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 o 34
0.09/0.16 c s 0.2s| 1 | 0 | 316 | - |4425k| 0 | 60 |1152 |1003 |1152 |1010 | 8 | 0 | 0 | 0.000000e+00 | 3.400000e+01 | Inf
0.09/0.16 o 19
0.09/0.16 c y 0.2s| 1 | 0 | 316 | - |4425k| 0 | 60 |1152 |1003 |1152 |1010 | 8 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.09/0.18 c 0.2s| 1 | 0 | 337 | - |4433k| 0 | 60 |1152 |1003 |1152 |1015 | 13 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.19/0.20 c 0.2s| 1 | 0 | 375 | - |4441k| 0 | 65 |1152 |1003 |1152 |1020 | 18 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.19/0.22 c 0.2s| 1 | 0 | 417 | - |4471k| 0 | 68 |1152 |1003 |1152 |1026 | 24 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.19/0.24 c 0.2s| 1 | 0 | 451 | - |4531k| 0 | 77 |1152 |1003 |1152 |1034 | 32 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.19/0.26 c 0.3s| 1 | 0 | 484 | - |4684k| 0 | 77 |1152 |1003 |1152 |1041 | 39 | 0 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.19/0.26 o 17
0.19/0.26 c y 0.3s| 1 | 0 | 484 | - |4724k| 0 | 77 |1152 |1003 |1152 |1041 | 39 | 0 | 0 | 0.000000e+00 | 1.700000e+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 c 0.3s| 1 | 0 | 685 | - |4836k| 0 | - |1152 |1003 |1152 |1041 | 39 | 0 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.32 c (run 1, node 1) performing user restart
0.29/0.32 c
0.29/0.32 c (restart) converted 525 cuts from the global cut pool into linear constraints
0.29/0.32 c
0.29/0.33 c presolving:
0.29/0.34 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 486 upgd conss, 486 impls, 30 clqs
0.29/0.34 c (round 2) 0 del vars, 0 del conss, 0 add conss, 486 chg bounds, 0 chg sides, 0 chg coeffs, 486 upgd conss, 486 impls, 30 clqs
0.29/0.34 c (round 3) 972 del vars, 973 del conss, 0 add conss, 972 chg bounds, 0 chg sides, 0 chg coeffs, 486 upgd conss, 1458 impls, 46 clqs
0.29/0.35 c (round 4) 972 del vars, 1017 del conss, 0 add conss, 972 chg bounds, 44 chg sides, 0 chg coeffs, 486 upgd conss, 1458 impls, 46 clqs
0.29/0.35 c (round 5) 972 del vars, 1017 del conss, 0 add conss, 972 chg bounds, 44 chg sides, 0 chg coeffs, 967 upgd conss, 1458 impls, 46 clqs
0.29/0.35 c (round 6) 972 del vars, 1064 del conss, 28 add conss, 972 chg bounds, 69 chg sides, 67 chg coeffs, 967 upgd conss, 1458 impls, 51 clqs
0.29/0.35 c (round 7) 972 del vars, 1072 del conss, 34 add conss, 972 chg bounds, 70 chg sides, 71 chg coeffs, 967 upgd conss, 1458 impls, 51 clqs
0.29/0.36 c (round 8) 972 del vars, 1072 del conss, 34 add conss, 972 chg bounds, 70 chg sides, 72 chg coeffs, 967 upgd conss, 1458 impls, 51 clqs
0.29/0.36 c (round 9) 972 del vars, 1072 del conss, 34 add conss, 972 chg bounds, 70 chg sides, 73 chg coeffs, 967 upgd conss, 1458 impls, 51 clqs
0.29/0.36 c (round 10) 972 del vars, 1072 del conss, 34 add conss, 972 chg bounds, 70 chg sides, 74 chg coeffs, 967 upgd conss, 1458 impls, 51 clqs
0.29/0.36 c presolving (11 rounds):
0.29/0.36 c 972 deleted vars, 1072 deleted constraints, 34 added constraints, 972 tightened bounds, 0 added holes, 70 changed sides, 74 changed coefficients
0.29/0.36 c 1458 implications, 51 cliques
0.29/0.36 c presolved problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 490 constraints
0.29/0.36 c 11 constraints of type <knapsack>
0.29/0.36 c 473 constraints of type <setppc>
0.29/0.36 c 6 constraints of type <logicor>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.10
0.29/0.36 c
0.29/0.36 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.36 c 0.4s| 1 | 0 | 772 | - |3566k| 0 | 67 | 180 | 490 | 180 | 490 | 0 | 0 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.37 c 0.4s| 1 | 0 | 814 | - |3647k| 0 | 76 | 180 | 490 | 180 | 502 | 12 | 0 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.38 c 0.4s| 1 | 2 | 911 | - |3667k| 0 | 76 | 180 | 492 | 180 | 502 | 12 | 2 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.39 o 0
0.29/0.39 c p 0.4s| 4 | 0 | 1004 | 97.8 |3705k| 3 | - | 180 | 492 | 180 | 487 | 12 | 2 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.29/0.39 c
0.29/0.39 c SCIP Status : problem is solved [optimal solution found]
0.29/0.39 c Solving Time (sec) : 0.40
0.29/0.39 c Solving Nodes : 4 (total of 5 nodes in 2 runs)
0.29/0.39 c Primal Bound : +0.00000000000000e+00 (6 solutions)
0.29/0.39 c Dual Bound : +0.00000000000000e+00
0.29/0.39 c Gap : 0.00 %
0.29/0.39 s OPTIMUM FOUND
0.29/0.39 v -x180 -x179 -x178 -x177 x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 x159
0.29/0.39 v -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 x140 -x139 -x138 -x137
0.29/0.39 v -x136 x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 x121 -x120 -x119 -x118 -x117 x116
0.29/0.39 v -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 -x95 -x94
0.29/0.39 v -x93 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.39 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 -x42
0.29/0.39 v -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 -x16
0.29/0.39 v x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 x3 -x2 -x1
0.29/0.39 c SCIP Status : problem is solved [optimal solution found]
0.29/0.39 c Total Time : 0.40
0.29/0.39 c solving : 0.40
0.29/0.39 c presolving : 0.10 (included in solving)
0.29/0.39 c reading : 0.00 (included in solving)
0.29/0.39 c copying : 0.02 (2 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.29/0.39 c Original Problem :
0.29/0.39 c Problem name : HOME/instance-3717603-1338205320.wbo
0.29/0.39 c Variables : 666 (666 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.39 c Constraints : 517 initial, 517 maximal
0.29/0.39 c Objective sense : minimize
0.29/0.39 c Presolved Problem :
0.29/0.39 c Problem name : t_HOME/instance-3717603-1338205320.wbo
0.29/0.39 c Variables : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.39 c Constraints : 490 initial, 492 maximal
0.29/0.39 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.29/0.39 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c trivial : 0.00 0.00 486 0 0 0 0 0 0 0 0
0.29/0.39 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c pseudoobj : 0.00 0.00 0 0 0 486 0 0 0 0 0
0.29/0.39 c probing : 0.05 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c varbound : 0.00 0.00 0 0 0 486 0 486 0 0 0
0.29/0.39 c knapsack : 0.01 0.00 0 0 0 0 0 7 34 26 74
0.29/0.39 c setppc : 0.00 0.00 0 0 0 0 0 49 0 0 0
0.29/0.39 c linear : 0.02 0.00 486 0 0 486 0 44 0 44 0
0.29/0.39 c indicator : 0.00 0.00 0 0 0 0 0 486 0 0 0
0.29/0.39 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c root node : - - 0 - - 0 - - - - -
0.29/0.39 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.29/0.39 c integral : 0 0 0 0 4 0 61 0 0 0 0 0 8
0.29/0.39 c knapsack : 11 11 1 1268 0 0 52 0 0 0 0 0 0
0.29/0.39 c setppc : 473 473 7 1268 0 0 54 36 2 11 0 0 0
0.29/0.39 c logicor : 6+ 8 1 28 0 0 0 0 0 0 0 0 0
0.29/0.39 c countsols : 0 0 0 0 0 0 8 0 0 0 0 0 0
0.29/0.39 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.29/0.39 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.29/0.39 c rootredcost : 0 0 0 0
0.29/0.39 c pseudoobj : 70 0 0 0
0.29/0.39 c vbounds : 1 0 0 0
0.29/0.39 c redcost : 12 0 0 0
0.29/0.39 c probing : 0 0 0 0
0.29/0.39 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.29/0.39 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c redcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c probing : 0.05 0.00 0.05 0.00 0.00
0.29/0.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.39 c propagation : 0.00 2 2 2 23.5 0 0.0 -
0.29/0.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.39 c applied globally : - - - 2 23.5 - - -
0.29/0.39 c applied locally : - - - 0 0.0 - - -
0.29/0.39 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.29/0.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 80)
0.29/0.39 c closecuts : 0.00 0.00 0 0 0 0 0
0.29/0.39 c impliedbounds : 0.00 0.00 7 0 0 0 0
0.29/0.39 c intobj : 0.00 0.00 0 0 0 0 0
0.29/0.39 c gomory : 0.01 0.00 7 0 0 350 0
0.29/0.39 c cgmip : 0.00 0.00 0 0 0 0 0
0.29/0.39 c strongcg : 0.02 0.00 7 0 0 1187 0
0.29/0.39 c cmir : 0.04 0.00 7 0 0 0 0
0.29/0.39 c flowcover : 0.04 0.00 7 0 0 0 0
0.29/0.39 c clique : 0.00 0.00 7 0 0 7 0
0.29/0.39 c zerohalf : 0.00 0.00 0 0 0 0 0
0.29/0.39 c mcf : 0.00 0.00 2 0 0 0 0
0.29/0.39 c oddcycle : 0.00 0.00 0 0 0 0 0
0.29/0.39 c rapidlearning : 0.05 0.00 1 0 0 0 0
0.29/0.39 c Pricers : ExecTime SetupTime Calls Vars
0.29/0.39 c problem variables: 0.00 - 0 0
0.29/0.39 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.29/0.39 c inference : 0.00 0.00 4 0 0 0 0 8
0.29/0.39 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c pscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c random : 0.00 0.00 0 0 0 0 0 0
0.29/0.39 c Primal Heuristics : ExecTime SetupTime Calls Found
0.29/0.39 c LP solutions : 0.00 - - 0
0.29/0.39 c pseudo solutions : 0.00 - - 0
0.29/0.39 c crossover : 0.00 0.00 0 0
0.29/0.39 c oneopt : 0.00 0.00 1 0
0.29/0.39 c smallcard : 0.00 0.00 0 0
0.29/0.39 c trivial : 0.00 0.00 2 0
0.29/0.39 c shiftandpropagate: 0.00 0.00 0 0
0.29/0.39 c simplerounding : 0.00 0.00 0 0
0.29/0.39 c zirounding : 0.00 0.00 0 0
0.29/0.39 c rounding : 0.00 0.00 12 0
0.29/0.39 c shifting : 0.00 0.00 9 2
0.29/0.39 c intshifting : 0.00 0.00 0 0
0.29/0.39 c twoopt : 0.00 0.00 0 0
0.29/0.39 c indoneopt : 0.00 0.00 3 0
0.29/0.39 c indtwoopt : 0.00 0.00 0 0
0.29/0.39 c fixandinfer : 0.00 0.00 0 0
0.29/0.39 c feaspump : 0.01 0.00 1 0
0.29/0.39 c clique : 0.00 0.00 0 0
0.29/0.39 c coefdiving : 0.05 0.00 2 1
0.29/0.39 c indrounding : 0.00 0.00 4 0
0.29/0.39 c indcoefdiving : 0.00 0.00 0 0
0.29/0.39 c pscostdiving : 0.01 0.00 1 1
0.29/0.39 c nlpdiving : 0.00 0.00 0 0
0.29/0.39 c fracdiving : 0.00 0.00 0 0
0.29/0.39 c veclendiving : 0.00 0.00 0 0
0.29/0.39 c intdiving : 0.00 0.00 0 0
0.29/0.39 c actconsdiving : 0.00 0.00 0 0
0.29/0.39 c objpscostdiving : 0.00 0.00 0 0
0.29/0.39 c rootsoldiving : 0.00 0.00 0 0
0.29/0.39 c linesearchdiving : 0.00 0.00 0 0
0.29/0.39 c guideddiving : 0.00 0.00 0 0
0.29/0.39 c octane : 0.00 0.00 0 0
0.29/0.39 c rens : 0.03 0.00 1 0
0.29/0.39 c rins : 0.00 0.00 0 0
0.29/0.39 c localbranching : 0.00 0.00 0 0
0.29/0.39 c mutation : 0.00 0.00 0 0
0.29/0.39 c dins : 0.00 0.00 0 0
0.29/0.39 c vbounds : 0.00 0.00 0 0
0.29/0.39 c undercover : 0.00 0.00 0 0
0.29/0.39 c subnlp : 0.00 0.00 0 0
0.29/0.39 c trysol : 0.00 0.00 2 2
0.29/0.39 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.29/0.39 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.29/0.39 c dual LP : 0.02 13 420 35.00 27932.96 0.00 1
0.29/0.39 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.39 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.29/0.39 c diving/probing LP: 0.04 176 584 3.32 13972.29
0.29/0.39 c strong branching : 0.00 0 0 0.00 -
0.29/0.39 c (at root node) : - 0 0 0.00 -
0.29/0.39 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.39 c B&B Tree :
0.29/0.39 c number of runs : 2
0.29/0.39 c nodes : 4
0.29/0.39 c nodes (total) : 5
0.29/0.39 c nodes left : 0
0.29/0.39 c max depth : 3
0.29/0.39 c max depth (total): 3
0.29/0.39 c backtracks : 0 (0.0%)
0.29/0.39 c delayed cutoffs : 0
0.29/0.39 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.39 c avg switch length: 2.00
0.29/0.39 c switching time : 0.00
0.29/0.39 c Solution :
0.29/0.39 c Solutions found : 6 (5 improvements)
0.29/0.39 c First Solution : +3.40000000000000e+01 (in run 1, after 1 nodes, 0.16 seconds, depth 0, found by <shifting>)
0.29/0.39 c Primal Bound : +0.00000000000000e+00 (in run 2, after 4 nodes, 0.39 seconds, depth 37, found by <pscostdiving>)
0.29/0.39 c Dual Bound : +0.00000000000000e+00
0.29/0.39 c Gap : 0.00 %
0.29/0.39 c Root Dual Bound : +0.00000000000000e+00
0.29/0.39 c Root Iterations : 613
0.39/0.40 c Time complete: 0.39.