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-2666185-1276589883.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 100
0.00/0.02 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 0 cliques
0.00/0.03 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.03 c 50 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.00
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 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.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.03/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.03 c t 0.0s| 1 | 0 | 76 | - | 619k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 1.000000e+02 |5652.98%
0.03/0.03 o 33
0.03/0.03 c r 0.0s| 1 | 0 | 76 | - | 622k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.300000e+01 |1798.48%
0.03/0.03 o 32
0.03/0.03 c R 0.0s| 1 | 0 | 76 | - | 625k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.200000e+01 |1740.95%
0.03/0.03 o 31
0.03/0.03 c s 0.0s| 1 | 0 | 76 | - | 628k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.100000e+01 |1683.42%
0.03/0.05 c 0.0s| 1 | 0 | 109 | - | 709k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.100000e+01 |1648.28%
0.03/0.05 o 3
0.03/0.05 c b 0.0s| 1 | 0 | 109 | - | 712k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.000000e+00 | 69.19%
0.03/0.05 o 3
0.03/0.05 c s 0.0s| 1 | 0 | 109 | - | 714k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.000000e+00 | 69.19%
0.03/0.06 c 0.1s| 1 | 0 | 142 | - | 756k| 0 | 36 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.03/0.06 o 3
0.03/0.06 c s 0.1s| 1 | 0 | 142 | - | 759k| 0 | 36 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.03/0.08 c 0.1s| 1 | 0 | 179 | - | 829k| 0 | 42 | 100 | 50 | 100 | 53 | 3 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 234 | - | 839k| 0 | 45 | 100 | 50 | 100 | 54 | 4 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.26 c 0.2s| 1 | 0 | 234 | - | 843k| 0 | - | 100 | 50 | 100 | 54 | 4 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.26 c (run 1, node 1) restarting after 26 global fixings of integer variables
0.19/0.26 c
0.19/0.26 c (restart) converted 4 cuts from the global cut pool into linear constraints
0.19/0.26 c
0.19/0.26 c presolving:
0.19/0.26 c (round 1) 26 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 0 impls, 0 clqs
0.19/0.26 c presolving (2 rounds):
0.19/0.26 c 26 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.26 c 0 implications, 0 cliques
0.19/0.26 c presolved problem has 74 variables (74 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.19/0.26 c 4 constraints of type <knapsack>
0.19/0.26 c 50 constraints of type <logicor>
0.19/0.26 c transformed objective value is always integral (scale: 1)
0.19/0.26 c Presolving Time: 0.00
0.19/0.27 c
0.19/0.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.27 c 0.2s| 1 | 0 | 260 | - | 701k| 0 | 22 | 74 | 54 | 74 | 54 | 0 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.29 c 0.2s| 1 | 0 | 300 | - | 806k| 0 | 38 | 74 | 54 | 74 | 55 | 1 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.29/0.35 c 0.3s| 1 | 0 | 337 | - | 808k| 0 | 42 | 74 | 54 | 74 | 55 | 1 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.42 c 0.4s| 1 | 0 | 376 | - | 809k| 0 | 41 | 74 | 54 | 74 | 55 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.47 c 0.4s| 1 | 0 | 376 | - | 811k| 0 | - | 74 | 54 | 74 | 55 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.47 c (run 2, node 1) restarting after 15 global fixings of integer variables
0.39/0.47 c
0.39/0.47 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.39/0.47 c
0.39/0.47 c presolving:
0.39/0.48 c (round 1) 15 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.39/0.48 c presolving (2 rounds):
0.39/0.48 c 15 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.48 c 0 implications, 0 cliques
0.39/0.48 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.39/0.48 c 5 constraints of type <knapsack>
0.39/0.48 c 50 constraints of type <logicor>
0.39/0.48 c transformed objective value is always integral (scale: 1)
0.39/0.48 c Presolving Time: 0.01
0.39/0.48 c
0.39/0.48 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.48 c 0.4s| 1 | 0 | 411 | - | 690k| 0 | 30 | 59 | 55 | 59 | 55 | 0 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.49/0.50 c 0.4s| 1 | 0 | 451 | - | 716k| 0 | 37 | 59 | 55 | 59 | 56 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.49/0.55 c 0.5s| 1 | 0 | 483 | - | 718k| 0 | 36 | 59 | 55 | 59 | 56 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.49/0.59 c 0.5s| 1 | 0 | 515 | - | 719k| 0 | 33 | 59 | 55 | 59 | 56 | 1 | 0 | 30 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.62 c 0.6s| 1 | 0 | 515 | - | 722k| 0 | - | 59 | 55 | 59 | 56 | 1 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.62 c (run 3, node 1) restarting after 15 global fixings of integer variables
0.59/0.62 c
0.59/0.62 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.59/0.62 c
0.59/0.62 c presolving:
0.59/0.63 c (round 1) 15 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.59/0.63 c presolving (2 rounds):
0.59/0.63 c 15 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.63 c 0 implications, 0 cliques
0.59/0.63 c presolved problem has 44 variables (44 bin, 0 int, 0 impl, 0 cont) and 56 constraints
0.59/0.63 c 6 constraints of type <knapsack>
0.59/0.63 c 50 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.02
0.59/0.63 c
0.59/0.64 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.64 c 0.6s| 1 | 0 | 591 | - | 674k| 0 | - | 44 | 56 | 44 | 56 | 0 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.59/0.64 c 0.6s| 1 | 0 | 591 | - | 674k| 0 | - | 44 | 56 | 44 | 56 | 0 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.59/0.64 c
0.59/0.64 c SCIP Status : problem is solved [optimal solution found]
0.59/0.64 c Solving Time (sec) : 0.56
0.59/0.64 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.59/0.64 c Primal Bound : +3.00000000000000e+00 (25 solutions)
0.59/0.64 c Dual Bound : +3.00000000000000e+00
0.59/0.64 c Gap : 0.00 %
0.59/0.64 s OPTIMUM FOUND
0.59/0.64 v -x100 -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
0.59/0.64 v -x74 -x73 -x72 -x71 x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50
0.59/0.64 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
0.59/0.64 v -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.59/0.64 c SCIP Status : problem is solved [optimal solution found]
0.59/0.64 c Solving Time : 0.56
0.59/0.64 c Original Problem :
0.59/0.64 c Problem name : HOME/instance-2666185-1276589883.opb
0.59/0.64 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.64 c Constraints : 50 initial, 50 maximal
0.59/0.64 c Presolved Problem :
0.59/0.64 c Problem name : t_HOME/instance-2666185-1276589883.opb
0.59/0.64 c Variables : 44 (44 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.64 c Constraints : 56 initial, 56 maximal
0.59/0.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.59/0.64 c trivial : 0.00 56 0 0 0 0 0 0 0
0.59/0.64 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c implics : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c probing : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c knapsack : 0.02 0 0 0 0 0 0 0 0
0.59/0.64 c logicor : 0.00 0 0 0 0 0 0 0 0
0.59/0.64 c root node : - 56 - - 56 - - - -
0.59/0.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.59/0.64 c integral : 0 0 0 7 0 0 35 0 0 0
0.59/0.64 c knapsack : 6 2 7 0 0 0 0 0 0 0
0.59/0.64 c logicor : 50 7 42 0 0 0 0 0 0 0
0.59/0.64 c countsols : 0 0 0 0 0 0 0 0 0 0
0.59/0.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.59/0.64 c integral : 0.32 0.00 0.00 0.32 0.00
0.59/0.64 c knapsack : 0.01 0.01 0.00 0.00 0.00
0.59/0.64 c logicor : 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c countsols : 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c Propagators : Time Calls Cutoffs DomReds
0.59/0.64 c vbounds : 0.00 5 0 0
0.59/0.64 c rootredcost : 0.00 0 0 0
0.59/0.64 c pseudoobj : 0.00 15 1 0
0.59/0.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.64 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.64 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.64 c applied globally : - - - 0 0.0 - - -
0.59/0.64 c applied locally : - - - 0 0.0 - - -
0.59/0.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.64 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.59/0.64 c redcost : 0.00 7 0 21 0 0
0.59/0.64 c impliedbounds : 0.00 7 0 0 0 0
0.59/0.64 c intobj : 0.00 0 0 0 0 0
0.59/0.64 c cgmip : 0.00 0 0 0 0 0
0.59/0.64 c gomory : 0.03 7 0 0 6 0
0.59/0.64 c strongcg : 0.02 7 0 0 117 0
0.59/0.64 c cmir : 0.01 7 0 0 2 0
0.59/0.64 c flowcover : 0.04 7 0 0 1 0
0.59/0.64 c clique : 0.00 3 0 0 0 0
0.59/0.64 c zerohalf : 0.00 0 0 0 0 0
0.59/0.64 c mcf : 0.00 3 0 0 0 0
0.59/0.64 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.64 c Pricers : Time Calls Vars
0.59/0.64 c problem variables: 0.00 0 0
0.59/0.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.64 c relpscost : 0.32 7 0 35 0 0 0
0.59/0.64 c pscost : 0.00 0 0 0 0 0 0
0.59/0.64 c inference : 0.00 0 0 0 0 0 0
0.59/0.64 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.64 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.64 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.64 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.64 c random : 0.00 0 0 0 0 0 0
0.59/0.64 c Primal Heuristics : Time Calls Found
0.59/0.64 c LP solutions : 0.00 - 0
0.59/0.64 c pseudo solutions : 0.00 - 0
0.59/0.64 c oneopt : 0.00 2 1
0.59/0.64 c trivial : 0.00 2 3
0.59/0.64 c simplerounding : 0.00 13 13
0.59/0.64 c zirounding : 0.00 1 1
0.59/0.64 c rounding : 0.00 13 1
0.59/0.64 c shifting : 0.00 13 5
0.59/0.64 c intshifting : 0.00 0 0
0.59/0.64 c twoopt : 0.00 0 0
0.59/0.64 c fixandinfer : 0.00 0 0
0.59/0.64 c feaspump : 0.00 0 0
0.59/0.64 c coefdiving : 0.00 0 0
0.59/0.64 c pscostdiving : 0.00 0 0
0.59/0.64 c fracdiving : 0.00 0 0
0.59/0.64 c veclendiving : 0.00 0 0
0.59/0.64 c intdiving : 0.00 0 0
0.59/0.64 c actconsdiving : 0.00 0 0
0.59/0.64 c objpscostdiving : 0.00 0 0
0.59/0.64 c rootsoldiving : 0.00 0 0
0.59/0.64 c linesearchdiving : 0.00 0 0
0.59/0.64 c guideddiving : 0.00 0 0
0.59/0.64 c octane : 0.00 0 0
0.59/0.64 c rens : 0.05 1 1
0.59/0.64 c rins : 0.00 0 0
0.59/0.64 c localbranching : 0.00 0 0
0.59/0.64 c mutation : 0.00 0 0
0.59/0.64 c crossover : 0.00 0 0
0.59/0.64 c dins : 0.00 0 0
0.59/0.64 c undercover : 0.00 0 0
0.59/0.64 c nlp : 0.00 0 0
0.59/0.64 c trysol : 0.00 0 0
0.59/0.64 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.64 c primal LP : 0.00 0 0 0.00 -
0.59/0.64 c dual LP : 0.02 14 591 42.21 29550.00
0.59/0.64 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.64 c barrier LP : 0.00 0 0 0.00 -
0.59/0.64 c diving/probing LP: 0.00 0 0 0.00 -
0.59/0.64 c strong branching : 0.32 35 5793 165.51 18103.12
0.59/0.64 c (at root node) : - 35 5793 165.51 -
0.59/0.64 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.64 c B&B Tree :
0.59/0.64 c number of runs : 4
0.59/0.64 c nodes : 1
0.59/0.64 c nodes (total) : 4
0.59/0.64 c nodes left : 0
0.59/0.64 c max depth : 0
0.59/0.64 c max depth (total): 0
0.59/0.64 c backtracks : 0 (0.0%)
0.59/0.64 c delayed cutoffs : 0
0.59/0.64 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.59/0.64 c avg switch length: 2.00
0.59/0.64 c switching time : 0.00
0.59/0.64 c Solution :
0.59/0.64 c Solutions found : 25 (7 improvements)
0.59/0.64 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.59/0.64 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <shifting>)
0.59/0.64 c Dual Bound : +3.00000000000000e+00
0.59/0.64 c Gap : 0.00 %
0.59/0.64 c Root Dual Bound : +3.00000000000000e+00
0.59/0.64 c Root Iterations : 591
0.59/0.64 c Time complete: 0.64.