0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868127-1245115783.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 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 SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
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 = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
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 = c 1620
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 = c 1791
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 = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 49 | 593k| 0 | 39 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 91 | 860k| 0 | 60 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 146 | 868k| 0 | 69 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 241 | 876k| 0 | 75 | 169 | 73 | 73 | 169 | 111 | 38 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 277 | 883k| 0 | 76 | 169 | 73 | 73 | 169 | 115 | 42 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 286 | 884k| 0 | 76 | 169 | 73 | 73 | 169 | 116 | 43 | 0 | 0 | 1.300000e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 2 | 286 | 884k| 0 | 76 | 169 | 73 | 73 | 169 | 116 | 43 | 0 | 33 | 1.300000e+01 | -- | Inf
0.99/1.01 c * 1.0s| 3 | 0 | 466 | 912k| 2 | - | 169 | 73 | 63 | 169 | 106 | 43 | 0 | 101 | 1.300000e+01 | 1.300000e+01 | 0.00%
0.99/1.01 c
0.99/1.01 c SCIP Status : problem is solved [optimal solution found]
0.99/1.01 c Solving Time (sec) : 0.98
0.99/1.01 c Solving Nodes : 3
0.99/1.01 c Primal Bound : +1.30000000000000e+01 (1 solutions)
0.99/1.01 c Dual Bound : +1.30000000000000e+01
0.99/1.01 c Gap : 0.00 %
0.99/1.01 c NODE 3
0.99/1.01 c DUAL BOUND 13
0.99/1.01 c PRIMAL BOUND 13
0.99/1.01 c GAP 0
0.99/1.01 s SATISFIABLE
0.99/1.01 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
0.99/1.01 v -x147 -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.99/1.01 v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106
0.99/1.01 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.99/1.01 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
0.99/1.01 v -x56 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.99/1.01 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.99/1.01 v -x4 -x3 -x2 x1
0.99/1.01 c SCIP Status : problem is solved [optimal solution found]
0.99/1.01 c Solving Time : 0.98
0.99/1.01 c Original Problem :
0.99/1.01 c Problem name : HOME/instance-1868127-1245115783.opb
0.99/1.01 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.01 c Constraints : 101 initial, 101 maximal
0.99/1.01 c Presolved Problem :
0.99/1.01 c Problem name : t_HOME/instance-1868127-1245115783.opb
0.99/1.01 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.01 c Constraints : 73 initial, 73 maximal
0.99/1.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.01 c trivial : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c setppc : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c linear : 0.01 0 0 0 0 0 28 0 0
0.99/1.01 c logicor : 0.00 0 0 0 0 0 0 0 0
0.99/1.01 c root node : - 0 - - 0 - - - -
0.99/1.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.01 c integral : 0 0 0 4 0 0 4 0 0 4
0.99/1.01 c knapsack : 1 5 6 1 0 0 0 0 0 0
0.99/1.01 c setppc : 68 5 6 1 0 0 70 0 0 0
0.99/1.01 c logicor : 4 5 1 1 0 0 0 0 0 0
0.99/1.01 c countsols : 0 0 0 1 0 0 0 0 0 0
0.99/1.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.01 c integral : 0.83 0.00 0.00 0.83 0.00
0.99/1.01 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.99/1.01 c setppc : 0.00 0.00 0.00 0.00 0.00
0.99/1.01 c logicor : 0.00 0.00 0.00 0.00 0.00
0.99/1.01 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.01 c Propagators : Time Calls Cutoffs DomReds
0.99/1.01 c rootredcost : 0.00 0 0 0
0.99/1.01 c pseudoobj : 0.00 7 0 0
0.99/1.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.01 c applied globally : - - - 0 0.0 - - -
0.99/1.01 c applied locally : - - - 0 0.0 - - -
0.99/1.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.01 c cut pool : 0.00 4 - - 9 - (maximal pool size: 93)
0.99/1.01 c redcost : 0.00 7 0 0 0 0
0.99/1.01 c impliedbounds : 0.00 5 0 0 0 0
0.99/1.01 c intobj : 0.00 0 0 0 0 0
0.99/1.01 c gomory : 0.04 5 0 0 31 0
0.99/1.01 c strongcg : 0.04 5 0 0 56 0
0.99/1.01 c cmir : 0.00 0 0 0 0 0
0.99/1.01 c flowcover : 0.00 0 0 0 0 0
0.99/1.01 c clique : 0.00 5 0 0 17 0
0.99/1.01 c zerohalf : 0.00 0 0 0 0 0
0.99/1.01 c mcf : 0.00 1 0 0 0 0
0.99/1.01 c Pricers : Time Calls Vars
0.99/1.01 c problem variables: 0.00 0 0
0.99/1.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.01 c relpscost : 0.83 3 0 4 0 0 4
0.99/1.01 c pscost : 0.00 0 0 0 0 0 0
0.99/1.01 c inference : 0.00 0 0 0 0 0 0
0.99/1.01 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.01 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.01 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.01 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.01 c random : 0.00 0 0 0 0 0 0
0.99/1.01 c Primal Heuristics : Time Calls Found
0.99/1.01 c LP solutions : 0.00 - 1
0.99/1.01 c pseudo solutions : 0.00 - 0
0.99/1.01 c simplerounding : 0.00 0 0
0.99/1.01 c rounding : 0.00 0 0
0.99/1.01 c shifting : 0.00 0 0
0.99/1.01 c intshifting : 0.00 0 0
0.99/1.01 c oneopt : 0.00 0 0
0.99/1.01 c fixandinfer : 0.00 0 0
0.99/1.01 c feaspump : 0.00 0 0
0.99/1.01 c coefdiving : 0.00 0 0
0.99/1.01 c pscostdiving : 0.00 0 0
0.99/1.01 c fracdiving : 0.00 0 0
0.99/1.01 c veclendiving : 0.00 0 0
0.99/1.01 c intdiving : 0.00 0 0
0.99/1.01 c actconsdiving : 0.00 0 0
0.99/1.01 c objpscostdiving : 0.00 0 0
0.99/1.01 c rootsoldiving : 0.00 0 0
0.99/1.01 c linesearchdiving : 0.00 0 0
0.99/1.01 c guideddiving : 0.00 0 0
0.99/1.01 c octane : 0.00 0 0
0.99/1.01 c rens : 0.00 0 0
0.99/1.01 c rins : 0.00 0 0
0.99/1.01 c localbranching : 0.00 0 0
0.99/1.01 c mutation : 0.00 0 0
0.99/1.01 c crossover : 0.00 0 0
0.99/1.01 c dins : 0.00 0 0
0.99/1.01 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.01 c primal LP : 0.00 0 0 0.00 -
0.99/1.01 c dual LP : 0.06 9 466 51.78 7766.67
0.99/1.01 c barrier LP : 0.00 0 0 0.00 -
0.99/1.01 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.01 c strong branching : 0.83 101 11793 116.76 14208.43
0.99/1.01 c (at root node) : - 33 4862 147.33 -
0.99/1.01 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.01 c B&B Tree :
0.99/1.01 c number of runs : 1
0.99/1.01 c nodes : 3
0.99/1.01 c nodes (total) : 3
0.99/1.01 c nodes left : 0
0.99/1.01 c max depth : 2
0.99/1.01 c max depth (total): 2
0.99/1.01 c backtracks : 0 (0.0%)
0.99/1.01 c delayed cutoffs : 0
0.99/1.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.01 c avg switch length: 2.00
0.99/1.01 c switching time : 0.00
0.99/1.01 c Solution :
0.99/1.01 c Solutions found : 1 (1 improvements)
0.99/1.01 c Primal Bound : +1.30000000000000e+01 (in run 1, after 3 nodes, 0.98 seconds, depth 2, found by <relaxation>)
0.99/1.01 c Dual Bound : +1.30000000000000e+01
0.99/1.01 c Gap : 0.00 %
0.99/1.01 c Root Dual Bound : +1.30000000000000e+01
0.99/1.02 c Time complete: 1.01.