0.00/0.00 c SCIP version 1.1.0.7
0.00/0.00 c LP-Solver SoPlex 1.4.1
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c read problem <HOME/instance-3729409-1338679277.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c start presolving problem
0.00/0.00 c presolving:
0.00/0.01 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.01 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.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 68 constraints of type <setppc>
0.00/0.01 c 4 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c SATUNSAT-LIN
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = c -1
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = c -1
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = c 2000
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = c 0.3
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = c -1
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = c -1
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = c 0.15
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = c 750
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = c -1
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = c 0
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 = c TRUE
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = c FALSE
0.00/0.01 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = c 5
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = c 1
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = c 1
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 = c 13950
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 = c 1791
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 = c 10000
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving problem
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 112 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 142 | 837k| 0 | 53 | 169 | 73 | 73 | 169 | 85 | 12 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 186 |1092k| 0 | 55 | 169 | 73 | 73 | 169 | 93 | 20 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 220 |1226k| 0 | 59 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 266 |1280k| 0 | 61 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.1s| 1 | 0 | 316 |1328k| 0 | 61 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 0 | 1.300000e+01 | -- | Inf
0.29/0.34 c 0.3s| 1 | 2 | 316 |1329k| 0 | 61 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 33 | 1.300000e+01 | -- | Inf
0.69/0.77 c * 0.8s| 3 | 0 | 692 |1385k| 2 | - | 169 | 73 | 5 | 169 | 95 | 36 | 0 | 146 | 1.300000e+01 | 1.300000e+01 | 0.00%
0.69/0.83 c
0.69/0.83 c SCIP Status : problem is solved [optimal solution found]
0.69/0.83 c Solving Time (sec) : 0.75
0.69/0.83 c Solving Nodes : 3
0.69/0.83 c Primal Bound : +1.30000000000000e+01 (1 solutions)
0.69/0.83 c Dual Bound : +1.30000000000000e+01
0.69/0.83 c Gap : 0.00 %
0.69/0.83 c NODE 3
0.69/0.83 c DUAL BOUND 13
0.69/0.83 c PRIMAL BOUND 13
0.69/0.83 c GAP 0
0.69/0.83 s SATISFIABLE
0.69/0.83 v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.69/0.83 v x147 -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.69/0.83 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
0.69/0.83 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.69/0.83 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 -x56
0.69/0.83 v -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.69/0.83 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.69/0.83 v -x4 -x3 -x2 -x1
0.69/0.83 c SCIP Status : problem is solved [optimal solution found]
0.69/0.83 c Solving Time : 0.75
0.69/0.83 c Original Problem :
0.69/0.83 c Problem name : HOME/instance-3729409-1338679277.opb
0.69/0.83 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.83 c Constraints : 101 initial, 101 maximal
0.69/0.83 c Presolved Problem :
0.69/0.83 c Problem name : t_HOME/instance-3729409-1338679277.opb
0.69/0.83 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.83 c Constraints : 73 initial, 73 maximal
0.69/0.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.83 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c setppc : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c linear : 0.00 0 0 0 0 0 28 0 0
0.69/0.83 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.83 c root node : - 0 - - 0 - - - -
0.69/0.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.83 c integral : 0 0 0 16 0 0 65 0 0 4
0.69/0.83 c knapsack : 1 5 22 1 0 0 0 0 0 0
0.69/0.83 c setppc : 68 5 21 0 0 0 102 0 0 0
0.69/0.83 c logicor : 4 5 1 1 0 0 0 0 0 0
0.69/0.83 c countsols : 0 0 0 1 0 0 0 0 0 0
0.69/0.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.83 c integral : 0.69 0.00 0.00 0.69 0.00
0.69/0.83 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.69/0.83 c setppc : 0.00 0.00 0.00 0.00 0.00
0.69/0.83 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.83 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.83 c Propagators : Time Calls Cutoffs DomReds
0.69/0.83 c rootredcost : 0.00 0 0 0
0.69/0.83 c pseudoobj : 0.00 23 0 0
0.69/0.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.83 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.83 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.83 c applied globally : - - - 0 0.0 - - -
0.69/0.83 c applied locally : - - - 0 0.0 - - -
0.69/0.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.83 c cut pool : 0.00 4 - - 5 - (maximal pool size: 187)
0.69/0.83 c redcost : 0.00 7 0 0 0 0
0.69/0.83 c impliedbounds : 0.00 5 0 0 0 0
0.69/0.83 c intobj : 0.00 0 0 0 0 0
0.69/0.83 c gomory : 0.02 5 0 0 0 0
0.69/0.83 c strongcg : 0.02 5 0 0 170 0
0.69/0.83 c cmir : 0.00 0 0 0 0 0
0.69/0.83 c flowcover : 0.00 0 0 0 0 0
0.69/0.83 c clique : 0.01 5 0 0 27 0
0.69/0.83 c zerohalf : 0.00 0 0 0 0 0
0.69/0.83 c mcf : 0.00 1 0 0 0 0
0.69/0.83 c Pricers : Time Calls Vars
0.69/0.83 c problem variables: 0.00 0 0
0.69/0.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.83 c relpscost : 0.69 15 0 65 0 0 4
0.69/0.83 c pscost : 0.00 0 0 0 0 0 0
0.69/0.83 c inference : 0.00 0 0 0 0 0 0
0.69/0.83 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.83 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.83 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.83 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.83 c random : 0.00 0 0 0 0 0 0
0.69/0.83 c Primal Heuristics : Time Calls Found
0.69/0.83 c LP solutions : 0.00 - 1
0.69/0.83 c pseudo solutions : 0.00 - 0
0.69/0.83 c simplerounding : 0.00 0 0
0.69/0.83 c rounding : 0.00 0 0
0.69/0.83 c shifting : 0.00 0 0
0.69/0.83 c intshifting : 0.00 0 0
0.69/0.83 c oneopt : 0.00 0 0
0.69/0.83 c fixandinfer : 0.00 0 0
0.69/0.83 c feaspump : 0.00 0 0
0.69/0.83 c coefdiving : 0.00 0 0
0.69/0.83 c pscostdiving : 0.00 0 0
0.69/0.83 c fracdiving : 0.00 0 0
0.69/0.83 c veclendiving : 0.00 0 0
0.69/0.83 c intdiving : 0.00 0 0
0.69/0.83 c actconsdiving : 0.00 0 0
0.69/0.83 c objpscostdiving : 0.00 0 0
0.69/0.83 c rootsoldiving : 0.00 0 0
0.69/0.83 c linesearchdiving : 0.00 0 0
0.69/0.83 c guideddiving : 0.00 0 0
0.69/0.83 c octane : 0.00 0 0
0.69/0.83 c rens : 0.00 0 0
0.69/0.83 c rins : 0.00 0 0
0.69/0.83 c localbranching : 0.00 0 0
0.69/0.83 c mutation : 0.00 0 0
0.69/0.83 c crossover : 0.00 0 0
0.69/0.83 c dins : 0.00 0 0
0.69/0.83 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.83 c primal LP : 0.00 0 0 0.00 -
0.69/0.83 c dual LP : 0.01 21 692 32.95 69200.00
0.69/0.83 c barrier LP : 0.00 0 0 0.00 -
0.69/0.83 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.83 c strong branching : 0.69 146 18002 123.30 26089.86
0.69/0.83 c (at root node) : - 33 5928 179.64 -
0.69/0.83 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.83 c B&B Tree :
0.69/0.83 c number of runs : 1
0.69/0.83 c nodes : 3
0.69/0.83 c nodes (total) : 3
0.69/0.83 c nodes left : 0
0.69/0.83 c max depth : 2
0.69/0.83 c max depth (total): 2
0.69/0.83 c backtracks : 0 (0.0%)
0.69/0.83 c delayed cutoffs : 0
0.69/0.83 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.83 c avg switch length: 2.00
0.69/0.83 c switching time : 0.00
0.69/0.83 c Solution :
0.69/0.83 c Solutions found : 1 (1 improvements)
0.69/0.83 c Primal Bound : +1.30000000000000e+01 (in run 1, after 3 nodes, 0.75 seconds, depth 2, found by <relaxation>)
0.69/0.83 c Dual Bound : +1.30000000000000e+01
0.69/0.83 c Gap : 0.00 %
0.69/0.83 c Root Dual Bound : +1.30000000000000e+01
0.69/0.83 c Time complete: 0.76.