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-2704520-1278561295.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.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.02 c 50 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1789.99
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.03 c
0.00/0.04 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.04 c t 0.0s| 1 | 0 | 235 | - | 620k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 1.000000e+02 |5652.98%
0.00/0.04 o 33
0.00/0.04 c r 0.0s| 1 | 0 | 235 | - | 623k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.300000e+01 |1798.48%
0.00/0.04 o 32
0.00/0.04 c R 0.0s| 1 | 0 | 235 | - | 626k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.200000e+01 |1740.95%
0.00/0.04 o 31
0.00/0.04 c s 0.0s| 1 | 0 | 235 | - | 629k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.100000e+01 |1683.42%
0.00/0.05 c 0.0s| 1 | 0 | 269 | - | 710k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.100000e+01 |1648.28%
0.00/0.06 o 3
0.00/0.06 c b 0.0s| 1 | 0 | 269 | - | 713k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.000000e+00 | 69.19%
0.00/0.06 o 3
0.00/0.06 c s 0.0s| 1 | 0 | 269 | - | 715k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.000000e+00 | 69.19%
0.06/0.07 c 0.1s| 1 | 0 | 311 | - | 757k| 0 | 43 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.24 c 0.2s| 1 | 0 | 311 | - | 762k| 0 | - | 100 | 50 | 100 | 52 | 2 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.24 c (run 1, node 1) restarting after 26 global fixings of integer variables
0.19/0.24 c
0.19/0.24 c (restart) converted 2 cuts from the global cut pool into linear constraints
0.19/0.24 c
0.19/0.24 c presolving:
0.19/0.24 c (round 1) 26 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 0 impls, 0 clqs
0.19/0.24 c presolving (2 rounds):
0.19/0.24 c 26 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.24 c 0 implications, 0 cliques
0.19/0.24 c presolved problem has 74 variables (74 bin, 0 int, 0 impl, 0 cont) and 52 constraints
0.19/0.24 c 2 constraints of type <knapsack>
0.19/0.24 c 50 constraints of type <logicor>
0.19/0.24 c transformed objective value is always integral (scale: 1)
0.19/0.24 c Presolving Time: 0.01
0.19/0.24 c
0.19/0.25 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.25 c 0.2s| 1 | 0 | 357 | - | 681k| 0 | 33 | 74 | 52 | 74 | 52 | 0 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.26 c 0.2s| 1 | 0 | 409 | - | 701k| 0 | 44 | 74 | 52 | 74 | 53 | 1 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.26 o 3
0.19/0.26 c s 0.3s| 1 | 0 | 409 | - | 704k| 0 | 44 | 74 | 52 | 74 | 53 | 1 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.29/0.34 c 0.3s| 1 | 0 | 451 | - | 704k| 0 | 43 | 74 | 52 | 74 | 53 | 1 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.41 c 0.4s| 1 | 0 | 485 | - | 707k| 0 | 44 | 74 | 52 | 74 | 53 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.48 c 0.5s| 1 | 0 | 485 | - | 709k| 0 | - | 74 | 52 | 74 | 53 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.39/0.48 c (run 2, node 1) restarting after 15 global fixings of integer variables
0.39/0.48 c
0.39/0.48 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.39/0.48 c
0.39/0.48 c presolving:
0.39/0.49 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.49 c presolving (2 rounds):
0.39/0.49 c 15 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.49 c 0 implications, 0 cliques
0.39/0.49 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 53 constraints
0.39/0.49 c 3 constraints of type <knapsack>
0.39/0.49 c 50 constraints of type <logicor>
0.39/0.49 c transformed objective value is always integral (scale: 1)
0.39/0.49 c Presolving Time: 0.02
0.39/0.49 c
0.39/0.49 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.49 c 0.5s| 1 | 0 | 533 | - | 671k| 0 | 35 | 59 | 53 | 59 | 53 | 0 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.49/0.51 c 0.5s| 1 | 0 | 579 | - | 681k| 0 | 38 | 59 | 53 | 59 | 54 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.49/0.57 c 0.6s| 1 | 0 | 619 | - | 682k| 0 | 37 | 59 | 53 | 59 | 54 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.62 c 0.6s| 1 | 0 | 673 | - | 684k| 0 | 34 | 59 | 53 | 59 | 54 | 1 | 0 | 30 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.66 c 0.6s| 1 | 0 | 673 | - | 685k| 0 | - | 59 | 53 | 59 | 54 | 1 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.66 c (run 3, node 1) restarting after 15 global fixings of integer variables
0.59/0.66 c
0.59/0.66 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.59/0.66 c
0.59/0.66 c presolving:
0.59/0.66 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.67 c presolving (2 rounds):
0.59/0.67 c 15 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.67 c 0 implications, 0 cliques
0.59/0.67 c presolved problem has 44 variables (44 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.59/0.67 c 4 constraints of type <knapsack>
0.59/0.67 c 50 constraints of type <logicor>
0.59/0.67 c transformed objective value is always integral (scale: 1)
0.59/0.67 c Presolving Time: 0.02
0.59/0.67 c
0.59/0.67 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.67 c 0.7s| 1 | 0 | 732 | - | 656k| 0 | 30 | 44 | 54 | 44 | 54 | 0 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.59/0.68 c 0.7s| 1 | 0 | 772 | - | 692k| 0 | 34 | 44 | 54 | 44 | 55 | 1 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.69/0.73 c 0.7s| 1 | 0 | 842 | - | 695k| 0 | - | 44 | 54 | 44 | 55 | 1 | 0 | 40 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.73 c 0.7s| 1 | 0 | 842 | - | 695k| 0 | - | 44 | 54 | 44 | 55 | 1 | 0 | 40 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.73 c
0.69/0.73 c SCIP Status : problem is solved [optimal solution found]
0.69/0.73 c Solving Time (sec) : 0.71
0.69/0.73 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.69/0.73 c Primal Bound : +3.00000000000000e+00 (26 solutions)
0.69/0.73 c Dual Bound : +3.00000000000000e+00
0.69/0.73 c Gap : 0.00 %
0.69/0.73 s OPTIMUM FOUND
0.69/0.73 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.69/0.73 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.69/0.73 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.69/0.73 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.69/0.73 c SCIP Status : problem is solved [optimal solution found]
0.69/0.73 c Solving Time : 0.71
0.69/0.73 c Original Problem :
0.69/0.73 c Problem name : HOME/instance-2704520-1278561295.opb
0.69/0.73 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.73 c Constraints : 50 initial, 50 maximal
0.69/0.73 c Presolved Problem :
0.69/0.73 c Problem name : t_HOME/instance-2704520-1278561295.opb
0.69/0.73 c Variables : 44 (44 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.73 c Constraints : 54 initial, 54 maximal
0.69/0.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.73 c trivial : 0.00 56 0 0 0 0 0 0 0
0.69/0.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c knapsack : 0.01 0 0 0 0 0 0 0 0
0.69/0.73 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.73 c root node : - 61 - - 61 - - - -
0.69/0.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.73 c integral : 0 0 0 8 0 0 40 0 0 0
0.69/0.73 c knapsack : 4 3 8 0 0 0 0 0 0 0
0.69/0.73 c logicor : 50 6 44 0 0 0 0 0 0 0
0.69/0.73 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.73 c integral : 0.46 0.00 0.00 0.46 0.00
0.69/0.73 c knapsack : 0.01 0.01 0.00 0.00 0.00
0.69/0.73 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.73 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.73 c Propagators : Time Calls Cutoffs DomReds
0.69/0.73 c vbounds : 0.00 5 0 0
0.69/0.73 c rootredcost : 0.00 0 0 0
0.69/0.73 c pseudoobj : 0.00 17 1 0
0.69/0.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.73 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.73 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.73 c applied globally : - - - 0 0.0 - - -
0.69/0.73 c applied locally : - - - 0 0.0 - - -
0.69/0.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.73 c cut pool : 0.00 0 - - 0 - (maximal pool size: 24)
0.69/0.73 c redcost : 0.00 6 0 21 0 0
0.69/0.73 c impliedbounds : 0.00 6 0 0 0 0
0.69/0.73 c intobj : 0.00 0 0 0 0 0
0.69/0.73 c cgmip : 0.00 0 0 0 0 0
0.69/0.73 c gomory : 0.01 6 0 0 0 0
0.69/0.73 c strongcg : 0.01 6 0 0 73 0
0.69/0.73 c cmir : 0.01 6 0 0 1 0
0.69/0.73 c flowcover : 0.02 6 0 0 0 0
0.69/0.73 c clique : 0.00 4 0 0 0 0
0.69/0.73 c zerohalf : 0.00 0 0 0 0 0
0.69/0.73 c mcf : 0.00 4 0 0 0 0
0.69/0.73 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.73 c Pricers : Time Calls Vars
0.69/0.73 c problem variables: 0.00 0 0
0.69/0.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.73 c relpscost : 0.46 8 0 40 0 0 0
0.69/0.73 c pscost : 0.00 0 0 0 0 0 0
0.69/0.73 c inference : 0.00 0 0 0 0 0 0
0.69/0.73 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.73 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.73 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.73 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.73 c random : 0.00 0 0 0 0 0 0
0.69/0.73 c Primal Heuristics : Time Calls Found
0.69/0.73 c LP solutions : 0.00 - 0
0.69/0.73 c pseudo solutions : 0.00 - 0
0.69/0.73 c oneopt : 0.00 3 1
0.69/0.73 c trivial : 0.00 2 3
0.69/0.73 c simplerounding : 0.00 13 13
0.69/0.73 c zirounding : 0.00 1 1
0.69/0.73 c rounding : 0.00 13 1
0.69/0.73 c shifting : 0.00 13 6
0.69/0.73 c intshifting : 0.00 0 0
0.69/0.73 c twoopt : 0.00 0 0
0.69/0.73 c fixandinfer : 0.00 0 0
0.69/0.73 c feaspump : 0.00 0 0
0.69/0.73 c coefdiving : 0.00 0 0
0.69/0.73 c pscostdiving : 0.00 0 0
0.69/0.73 c fracdiving : 0.00 0 0
0.69/0.73 c veclendiving : 0.00 0 0
0.69/0.73 c intdiving : 0.00 0 0
0.69/0.73 c actconsdiving : 0.00 0 0
0.69/0.73 c objpscostdiving : 0.00 0 0
0.69/0.73 c rootsoldiving : 0.00 0 0
0.69/0.73 c linesearchdiving : 0.00 0 0
0.69/0.73 c guideddiving : 0.00 0 0
0.69/0.73 c octane : 0.00 0 0
0.69/0.73 c rens : 0.08 1 1
0.69/0.73 c rins : 0.00 0 0
0.69/0.73 c localbranching : 0.00 0 0
0.69/0.73 c mutation : 0.00 0 0
0.69/0.73 c crossover : 0.00 0 0
0.69/0.73 c dins : 0.00 0 0
0.69/0.73 c undercover : 0.00 0 0
0.69/0.73 c nlp : 0.00 0 0
0.69/0.73 c trysol : 0.00 0 0
0.69/0.73 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.73 c primal LP : 0.00 0 0 0.00 -
0.69/0.73 c dual LP : 0.06 14 842 60.14 13580.86
0.69/0.73 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.73 c barrier LP : 0.00 0 0 0.00 -
0.69/0.73 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.73 c strong branching : 0.46 40 5046 126.15 10898.68
0.69/0.73 c (at root node) : - 40 5046 126.15 -
0.69/0.73 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.73 c B&B Tree :
0.69/0.73 c number of runs : 4
0.69/0.73 c nodes : 1
0.69/0.73 c nodes (total) : 4
0.69/0.73 c nodes left : 0
0.69/0.73 c max depth : 0
0.69/0.73 c max depth (total): 0
0.69/0.73 c backtracks : 0 (0.0%)
0.69/0.73 c delayed cutoffs : 0
0.69/0.73 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.73 c avg switch length: 2.00
0.69/0.73 c switching time : 0.00
0.69/0.73 c Solution :
0.69/0.73 c Solutions found : 26 (7 improvements)
0.69/0.73 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.69/0.73 c Primal Bound : +3.00000000000000e+00 (in run 2, after 1 nodes, 0.25 seconds, depth 0, found by <shifting>)
0.69/0.73 c Dual Bound : +3.00000000000000e+00
0.69/0.73 c Gap : 0.00 %
0.69/0.73 c Root Dual Bound : +3.00000000000000e+00
0.69/0.73 c Root Iterations : 842
0.69/0.74 c Time complete: 0.72.