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-2665980-1276333431.opb>
0.00/0.06 c original problem has 1190 variables (1190 bin, 0 int, 0 impl, 0 cont) and 3183 constraints
0.00/0.06 c problem read
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.07/0.08 c presolving:
0.09/0.13 c (round 1) 124 del vars, 18 del conss, 5 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.09/0.14 c (round 2) 126 del vars, 254 del conss, 7 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.09/0.15 c (round 3) 128 del vars, 259 del conss, 9 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.09/0.15 c (round 4) 132 del vars, 265 del conss, 13 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.09/0.16 c (round 5) 139 del vars, 275 del conss, 17 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60742 impls, 0 clqs
0.09/0.16 c (round 6) 147 del vars, 293 del conss, 21 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60808 impls, 0 clqs
0.09/0.17 c (round 7) 154 del vars, 312 del conss, 25 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60848 impls, 0 clqs
0.09/0.17 c (round 8) 161 del vars, 329 del conss, 29 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60880 impls, 0 clqs
0.09/0.18 c (round 9) 173 del vars, 355 del conss, 37 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60994 impls, 0 clqs
0.09/0.18 c (round 10) 182 del vars, 379 del conss, 43 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61070 impls, 0 clqs
0.09/0.19 c (round 11) 186 del vars, 397 del conss, 47 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.09/0.19 c (round 12) 190 del vars, 405 del conss, 51 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.19/0.20 c (round 13) 196 del vars, 413 del conss, 54 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61110 impls, 0 clqs
0.19/0.20 c (round 14) 201 del vars, 425 del conss, 56 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61180 impls, 0 clqs
0.19/0.21 c (round 15) 206 del vars, 437 del conss, 58 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61338 impls, 0 clqs
0.19/0.21 c (round 16) 208 del vars, 449 del conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61348 impls, 0 clqs
0.19/0.22 c (round 17) 211 del vars, 453 del conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.19/0.22 c (round 18) 211 del vars, 460 del conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.19/0.27 c (round 19) 211 del vars, 468 del conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.19/0.29 c (round 20) 231 del vars, 472 del conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.29/0.31 c presolving (21 rounds):
0.29/0.31 c 231 deleted vars, 472 deleted constraints, 60 tightened bounds, 0 added holes, 64 changed sides, 136 changed coefficients
0.29/0.31 c 61520 implications, 0 cliques
0.29/0.31 c presolved problem has 959 variables (959 bin, 0 int, 0 impl, 0 cont) and 2711 constraints
0.29/0.31 c 112 constraints of type <knapsack>
0.29/0.31 c 2599 constraints of type <logicor>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.17
0.29/0.31 c - non default parameters ----------------------------------------------------------------------
0.29/0.31 c # SCIP version 1.2.1.2
0.29/0.31 c
0.29/0.31 c # frequency for displaying node information lines
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.31 c display/freq = 10000
0.29/0.31 c
0.29/0.31 c # maximal time in seconds to run
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/time = 1799.95
0.29/0.31 c
0.29/0.31 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/memory = 1620
0.29/0.31 c
0.29/0.31 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c limits/solutions = 1
0.29/0.31 c
0.29/0.31 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.31 c separating/maxrounds = 1
0.29/0.31 c
0.29/0.31 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c separating/maxroundsroot = 5
0.29/0.31 c
0.29/0.31 c # should presolving try to simplify inequalities
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/linear/simplifyinequalities = TRUE
0.29/0.31 c
0.29/0.31 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.31 c constraints/knapsack/disaggregation = FALSE
0.29/0.31 c
0.29/0.31 c # should presolving try to simplify knapsacks
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/knapsack/simplifyinequalities = TRUE
0.29/0.31 c
0.29/0.31 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c presolving/probing/maxrounds = 0
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/coefdiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.31 c heuristics/crossover/freq = -1
0.29/0.31 c
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/crossover/nodesofs = 750
0.29/0.31 c
0.29/0.31 c # number of nodes without incumbent change that heuristic should wait
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.31 c heuristics/crossover/nwaitingnodes = 100
0.29/0.31 c
0.29/0.31 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.31 c # [type: real, range: [0,1], default: 0.1]
0.29/0.31 c heuristics/crossover/nodesquot = 0.15
0.29/0.31 c
0.29/0.31 c # minimum percentage of integer variables that have to be fixed
0.29/0.31 c # [type: real, range: [0,1], default: 0.666]
0.29/0.31 c heuristics/crossover/minfixingrate = 0.5
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/feaspump/freq = -1
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/fracdiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/guideddiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/intshifting/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/linesearchdiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/nlp/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/objpscostdiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.31 c # [type: real, range: [0,1], default: 0.01]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/oneopt/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/pscostdiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/rens/freq = -1
0.29/0.31 c
0.29/0.31 c # minimum percentage of integer variables that have to be fixable
0.29/0.31 c # [type: real, range: [0,1], default: 0.5]
0.29/0.31 c heuristics/rens/minfixingrate = 0.3
0.29/0.31 c
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/rens/nodesofs = 2000
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/trivial/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/trysol/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = -1
0.29/0.31 c
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.31 c
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.31 c
0.29/0.31 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/zirounding/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = -1
0.29/0.31 c
0.29/0.31 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c separating/rapidlearning/freq = 0
0.29/0.31 c
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c start solving
0.29/0.31 c
0.29/0.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.2s| 1 | 0 | 200 | - |7550k| 0 | 189 | 959 |2711 | 959 |2711 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.5s| 1 | 0 | 207 | - |6974k| 0 | - | 959 |2711 | 959 |2711 | 0 | 0 | 0 | -- | -- | 0.00%
0.69/0.74 c 0.5s| 1 | 0 | 207 | - |6974k| 0 | - | 959 |2711 | 959 |2711 | 0 | 0 | 0 | -- | -- | 0.00%
0.69/0.74 c
0.69/0.74 c SCIP Status : problem is solved [infeasible]
0.69/0.74 c Solving Time (sec) : 0.54
0.69/0.74 c Solving Nodes : 1
0.69/0.74 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.74 c Dual Bound : +1.00000000000000e+20
0.69/0.74 c Gap : 0.00 %
0.69/0.74 s UNSATISFIABLE
0.69/0.74 c SCIP Status : problem is solved [infeasible]
0.69/0.74 c Solving Time : 0.54
0.69/0.74 c Original Problem :
0.69/0.74 c Problem name : HOME/instance-2665980-1276333431.opb
0.69/0.74 c Variables : 1190 (1190 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 3183 initial, 3183 maximal
0.69/0.74 c Presolved Problem :
0.69/0.74 c Problem name : t_HOME/instance-2665980-1276333431.opb
0.69/0.74 c Variables : 959 (959 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 2711 initial, 2711 maximal
0.69/0.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.74 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c dualfix : 0.01 0 0 0 0 0 0 0 0
0.69/0.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c implics : 0.01 0 146 0 0 0 0 0 0
0.69/0.74 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c knapsack : 0.01 0 0 0 0 0 0 0 0
0.69/0.74 c linear : 0.10 60 25 0 60 0 472 64 136
0.69/0.74 c logicor : 0.03 0 0 0 0 0 0 0 0
0.69/0.74 c root node : - 306 - - 306 - - - -
0.69/0.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.74 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.74 c knapsack : 112 1 1 0 0 0 0 76 0 0
0.69/0.74 c logicor : 2599 1 1 0 0 0 0 0 0 0
0.69/0.74 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.74 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Propagators : Time Calls Cutoffs DomReds
0.69/0.74 c vbounds : 0.00 1 0 0
0.69/0.74 c rootredcost : 0.00 0 0 0
0.69/0.74 c pseudoobj : 0.00 0 0 0
0.69/0.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c applied globally : - - - 0 0.0 - - -
0.69/0.74 c applied locally : - - - 0 0.0 - - -
0.69/0.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 96)
0.69/0.74 c redcost : 0.00 1 0 0 0 0
0.69/0.74 c impliedbounds : 0.00 1 0 0 0 0
0.69/0.74 c intobj : 0.00 0 0 0 0 0
0.69/0.74 c cgmip : 0.00 0 0 0 0 0
0.69/0.74 c gomory : 0.02 1 0 0 500 0
0.69/0.74 c strongcg : 0.01 1 0 0 500 0
0.69/0.74 c cmir : 0.00 0 0 0 0 0
0.69/0.74 c flowcover : 0.00 0 0 0 0 0
0.69/0.74 c clique : 0.03 1 0 0 7 0
0.69/0.74 c zerohalf : 0.00 0 0 0 0 0
0.69/0.74 c mcf : 0.01 1 0 0 0 0
0.69/0.74 c rapidlearning : 0.26 1 0 306 0 0
0.69/0.74 c Pricers : Time Calls Vars
0.69/0.74 c problem variables: 0.00 0 0
0.69/0.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.74 c pscost : 0.00 0 0 0 0 0 0
0.69/0.74 c inference : 0.00 0 0 0 0 0 0
0.69/0.74 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.74 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.74 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c random : 0.00 0 0 0 0 0 0
0.69/0.74 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.74 c Primal Heuristics : Time Calls Found
0.69/0.74 c LP solutions : 0.00 - 0
0.69/0.74 c pseudo solutions : 0.00 - 0
0.69/0.74 c trivial : 0.00 1 0
0.69/0.74 c simplerounding : 0.00 0 0
0.69/0.74 c zirounding : 0.00 0 0
0.69/0.74 c rounding : 0.00 0 0
0.69/0.74 c shifting : 0.00 0 0
0.69/0.74 c intshifting : 0.00 0 0
0.69/0.74 c oneopt : 0.00 0 0
0.69/0.74 c twoopt : 0.00 0 0
0.69/0.74 c fixandinfer : 0.00 0 0
0.69/0.74 c feaspump : 0.00 0 0
0.69/0.74 c coefdiving : 0.00 0 0
0.69/0.74 c pscostdiving : 0.00 0 0
0.69/0.74 c fracdiving : 0.00 0 0
0.69/0.74 c veclendiving : 0.00 0 0
0.69/0.74 c intdiving : 0.00 0 0
0.69/0.74 c actconsdiving : 0.00 0 0
0.69/0.74 c objpscostdiving : 0.00 0 0
0.69/0.74 c rootsoldiving : 0.00 0 0
0.69/0.74 c linesearchdiving : 0.00 0 0
0.69/0.74 c guideddiving : 0.00 0 0
0.69/0.74 c octane : 0.00 0 0
0.69/0.74 c rens : 0.00 0 0
0.69/0.74 c rins : 0.00 0 0
0.69/0.74 c localbranching : 0.00 0 0
0.69/0.74 c mutation : 0.00 0 0
0.69/0.74 c crossover : 0.00 0 0
0.69/0.74 c dins : 0.00 0 0
0.69/0.74 c undercover : 0.00 0 0
0.69/0.74 c nlp : 0.00 0 0
0.69/0.74 c trysol : 0.00 0 0
0.69/0.74 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.74 c primal LP : 0.00 0 0 0.00 -
0.69/0.74 c dual LP : 0.01 2 207 103.50 20700.00
0.69/0.74 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.74 c barrier LP : 0.00 0 0 0.00 -
0.69/0.74 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.74 c strong branching : 0.00 0 0 0.00 -
0.69/0.74 c (at root node) : - 0 0 0.00 -
0.69/0.74 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.74 c B&B Tree :
0.69/0.74 c number of runs : 1
0.69/0.74 c nodes : 1
0.69/0.74 c nodes (total) : 1
0.69/0.74 c nodes left : 0
0.69/0.74 c max depth : 0
0.69/0.74 c max depth (total): 0
0.69/0.74 c backtracks : 0 (0.0%)
0.69/0.74 c delayed cutoffs : 0
0.69/0.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.74 c avg switch length: 2.00
0.69/0.74 c switching time : 0.00
0.69/0.74 c Solution :
0.69/0.74 c Solutions found : 0 (0 improvements)
0.69/0.74 c Primal Bound : infeasible
0.69/0.74 c Dual Bound : -
0.69/0.74 c Gap : 0.00 %
0.69/0.75 c Root Dual Bound : -
0.69/0.75 c Root Iterations : 207
0.69/0.76 c Time complete: 0.76.