0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667226-1276278820.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 problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
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.03 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.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 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.01
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 # 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 # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
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 disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
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 # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 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 0.0s| 1 | 0 | 111 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 160 | - |1147k| 0 | 49 | 169 | 202 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 218 | - |1160k| 0 | 44 | 169 | 202 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 303 | - |1181k| 0 | 52 | 169 | 202 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 321 | - |1189k| 0 | 56 | 169 | 202 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 395 | - |1201k| 0 | 55 | 169 | 202 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.4s| 1 | 0 | 450 | - |1130k| 0 | 52 | 169 | 131 | 169 | 110 | 37 | 0 | 9 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 557 | - |1104k| 0 | 46 | 169 | 110 | 169 | 110 | 37 | 0 | 15 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 580 | - |1079k| 0 | 37 | 169 | 83 | 169 | 110 | 37 | 0 | 26 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 580 | - |1078k| 0 | - | 169 | 83 | 169 | 110 | 37 | 0 | 31 | 0.000000e+00 | -- | Inf
0.69/0.76 c (run 1, node 1) restarting after 59 global fixings of integer variables
0.69/0.76 c
0.69/0.76 c (restart) converted 37 cuts from the global cut pool into linear constraints
0.69/0.76 c
0.69/0.76 c presolving:
0.69/0.76 c (round 1) 85 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 61 clqs
0.69/0.76 c (round 2) 85 del vars, 25 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 61 clqs
0.69/0.77 c (round 3) 85 del vars, 25 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 37 upgd conss, 34 impls, 61 clqs
0.69/0.77 c presolving (4 rounds):
0.69/0.77 c 85 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.69/0.77 c 34 implications, 61 cliques
0.69/0.77 c presolved problem has 84 variables (84 bin, 0 int, 0 impl, 0 cont) and 95 constraints
0.69/0.77 c 15 constraints of type <knapsack>
0.69/0.77 c 66 constraints of type <setppc>
0.69/0.77 c 14 constraints of type <logicor>
0.69/0.77 c transformed objective value is always integral (scale: 1)
0.69/0.77 c Presolving Time: 0.03
0.69/0.77 c
0.69/0.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.78 c 0.7s| 1 | 0 | 653 | - | 864k| 0 | 29 | 84 | 95 | 84 | 88 | 0 | 0 | 31 | 0.000000e+00 | -- | Inf
0.69/0.79 c 0.7s| 1 | 0 | 654 | - |1142k| 0 | 0 | 84 | 95 | 84 | 96 | 8 | 0 | 31 | 0.000000e+00 | -- | Inf
0.69/0.79 c * 0.7s| 1 | 0 | 654 | - |1145k| 0 | - | 84 | 95 | 84 | 96 | 8 | 0 | 31 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.69/0.79 c
0.69/0.79 c SCIP Status : problem is solved [optimal solution found]
0.69/0.79 c Solving Time (sec) : 0.72
0.69/0.79 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.69/0.79 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.69/0.79 c Dual Bound : +0.00000000000000e+00
0.69/0.79 c Gap : 0.00 %
0.69/0.79 s SATISFIABLE
0.69/0.79 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.79 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.79 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.79 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.79 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.69/0.79 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.69/0.79 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.79 v -x4 -x3 -x2 -x1
0.69/0.79 c SCIP Status : problem is solved [optimal solution found]
0.69/0.79 c Solving Time : 0.72
0.69/0.79 c Original Problem :
0.69/0.79 c Problem name : HOME/instance-2667226-1276278820.opb
0.69/0.79 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.79 c Constraints : 101 initial, 101 maximal
0.69/0.79 c Presolved Problem :
0.69/0.79 c Problem name : t_HOME/instance-2667226-1276278820.opb
0.69/0.79 c Variables : 84 (84 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.79 c Constraints : 95 initial, 95 maximal
0.69/0.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.79 c trivial : 0.00 59 0 0 0 0 0 0 0
0.69/0.79 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c knapsack : 0.01 0 0 0 0 0 0 0 0
0.69/0.79 c setppc : 0.00 26 0 0 0 0 8 0 0
0.69/0.79 c linear : 0.02 0 0 0 0 0 42 2 0
0.69/0.79 c logicor : 0.00 0 0 0 0 0 3 0 0
0.69/0.79 c root node : - 59 - - 59 - - - -
0.69/0.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.79 c integral : 0 0 0 5 0 0 20 0 0 0
0.69/0.79 c knapsack : 15 6 6 1 0 0 0 0 0 0
0.69/0.79 c setppc : 66 6 6 1 0 0 39 0 0 0
0.69/0.79 c logicor : 14 6 2 1 0 0 0 0 0 0
0.69/0.79 c countsols : 0 0 0 1 0 0 0 0 0 0
0.69/0.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.79 c integral : 0.40 0.00 0.00 0.40 0.00
0.69/0.79 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.69/0.79 c setppc : 0.00 0.00 0.00 0.00 0.00
0.69/0.79 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.79 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.79 c Propagators : Time Calls Cutoffs DomReds
0.69/0.79 c vbounds : 0.00 2 0 0
0.69/0.79 c rootredcost : 0.00 0 0 0
0.69/0.79 c pseudoobj : 0.00 0 0 0
0.69/0.79 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.79 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.79 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.79 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.79 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.79 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.79 c applied globally : - - - 0 0.0 - - -
0.69/0.79 c applied locally : - - - 0 0.0 - - -
0.69/0.79 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.79 c cut pool : 0.00 0 - - 0 - (maximal pool size: 117)
0.69/0.79 c redcost : 0.00 6 0 0 0 0
0.69/0.79 c impliedbounds : 0.00 6 0 0 0 0
0.69/0.79 c intobj : 0.00 0 0 0 0 0
0.69/0.79 c cgmip : 0.00 0 0 0 0 0
0.69/0.79 c gomory : 0.03 6 0 0 74 0
0.69/0.79 c strongcg : 0.03 6 0 0 130 0
0.69/0.80 c cmir : 0.00 0 0 0 0 0
0.69/0.80 c flowcover : 0.00 0 0 0 0 0
0.69/0.80 c clique : 0.03 6 0 0 29 0
0.69/0.80 c zerohalf : 0.00 0 0 0 0 0
0.69/0.80 c mcf : 0.00 2 0 0 0 0
0.69/0.80 c rapidlearning : 0.16 1 0 0 0 129
0.69/0.80 c Pricers : Time Calls Vars
0.69/0.80 c problem variables: 0.00 0 0
0.69/0.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.80 c relpscost : 0.40 4 0 20 0 0 0
0.69/0.80 c pscost : 0.00 0 0 0 0 0 0
0.69/0.80 c inference : 0.00 0 0 0 0 0 0
0.69/0.80 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.80 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.80 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.80 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.80 c random : 0.00 0 0 0 0 0 0
0.69/0.80 c Primal Heuristics : Time Calls Found
0.69/0.80 c LP solutions : 0.00 - 1
0.69/0.80 c pseudo solutions : 0.00 - 0
0.69/0.80 c trivial : 0.00 1 0
0.69/0.80 c simplerounding : 0.00 0 0
0.69/0.80 c zirounding : 0.00 0 0
0.69/0.80 c rounding : 0.00 0 0
0.69/0.80 c shifting : 0.00 0 0
0.69/0.80 c intshifting : 0.00 0 0
0.69/0.80 c oneopt : 0.00 0 0
0.69/0.80 c twoopt : 0.00 0 0
0.69/0.80 c fixandinfer : 0.00 0 0
0.69/0.80 c feaspump : 0.00 0 0
0.69/0.80 c coefdiving : 0.00 0 0
0.69/0.80 c pscostdiving : 0.00 0 0
0.69/0.80 c fracdiving : 0.00 0 0
0.69/0.80 c veclendiving : 0.00 0 0
0.69/0.80 c intdiving : 0.00 0 0
0.69/0.80 c actconsdiving : 0.00 0 0
0.69/0.80 c objpscostdiving : 0.00 0 0
0.69/0.80 c rootsoldiving : 0.00 0 0
0.69/0.80 c linesearchdiving : 0.00 0 0
0.69/0.80 c guideddiving : 0.00 0 0
0.69/0.80 c octane : 0.00 0 0
0.69/0.80 c rens : 0.00 0 0
0.69/0.80 c rins : 0.00 0 0
0.69/0.80 c localbranching : 0.00 0 0
0.69/0.80 c mutation : 0.00 0 0
0.69/0.80 c crossover : 0.00 0 0
0.69/0.80 c dins : 0.00 0 0
0.69/0.80 c undercover : 0.00 0 0
0.69/0.80 c nlp : 0.00 0 0
0.69/0.80 c trysol : 0.00 0 0
0.69/0.80 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.80 c primal LP : 0.00 0 0 0.00 -
0.69/0.80 c dual LP : 0.04 11 654 59.45 16350.00
0.69/0.80 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.80 c barrier LP : 0.00 0 0 0.00 -
0.69/0.80 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.80 c strong branching : 0.40 31 4190 135.16 10475.00
0.69/0.80 c (at root node) : - 31 4190 135.16 -
0.69/0.80 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.80 c B&B Tree :
0.69/0.80 c number of runs : 2
0.69/0.80 c nodes : 1
0.69/0.80 c nodes (total) : 2
0.69/0.80 c nodes left : 0
0.69/0.80 c max depth : 0
0.69/0.80 c max depth (total): 0
0.69/0.80 c backtracks : 0 (0.0%)
0.69/0.80 c delayed cutoffs : 0
0.69/0.80 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.80 c avg switch length: 2.00
0.69/0.80 c switching time : 0.00
0.69/0.80 c Solution :
0.69/0.80 c Solutions found : 1 (1 improvements)
0.69/0.80 c First Solution : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.72 seconds, depth 0, found by <relaxation>)
0.69/0.80 c Primal Bound : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.72 seconds, depth 0, found by <relaxation>)
0.69/0.80 c Dual Bound : +0.00000000000000e+00
0.69/0.80 c Gap : 0.00 %
0.69/0.80 c Root Dual Bound : +0.00000000000000e+00
0.69/0.80 c Root Iterations : 654
0.79/0.80 c Time complete: 0.8.