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-2667322-1276315658.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.96
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.4s| 1 | 0 | 103 | - |3976k| 0 | 41 | 231 |2742 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.6s| 1 | 0 | 129 | - |4587k| 0 | 50 | 231 |2742 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.12 c 1.0s| 1 | 0 | 147 | - |4646k| 0 | 50 | 231 |2742 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 157 | - |4646k| 0 | 50 | 231 |2742 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.88 c 1.7s| 1 | 0 | 179 | - |4647k| 0 | 51 | 231 |2742 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.71 c 2.5s| 1 | 2 | 179 | - |4648k| 0 | 51 | 231 |2742 | 231 |2587 | 23 | 0 | 9 | 0.000000e+00 | -- | Inf
176.83/176.98 c 173s| 10000 | 32 |297927 | 29.8 |6814k| 38 | 28 | 231 |7302 | 231 |2577 | 23 |6991 |2109 | 0.000000e+00 | -- | Inf
310.79/310.93 c 304s| 20000 | 20 |612836 | 30.6 |8393k| 41 | 49 | 231 | 11k| 231 |2577 | 23 | 14k|2435 | 0.000000e+00 | -- | Inf
450.94/451.18 c 441s| 30000 | 46 |926429 | 30.9 | 10M| 49 | - | 231 | 14k| 231 |2577 | 23 | 21k|3013 | 0.000000e+00 | -- | Inf
593.60/593.86 c 582s| 40000 | 20 | 1243k| 31.1 | 10M| 55 | - | 231 | 15k| 0 | 0 | 23 | 28k|3596 | 0.000000e+00 | -- | Inf
653.77/654.03 c
653.77/654.03 c SCIP Status : problem is solved [infeasible]
653.77/654.03 c Solving Time (sec) : 640.88
653.77/654.03 c Solving Nodes : 44442
653.77/654.03 c Primal Bound : +1.00000000000000e+20 (0 solutions)
653.77/654.03 c Dual Bound : +1.00000000000000e+20
653.77/654.03 c Gap : 0.00 %
653.77/654.03 s UNSATISFIABLE
653.77/654.03 c SCIP Status : problem is solved [infeasible]
653.77/654.03 c Solving Time : 640.88
653.77/654.03 c Original Problem :
653.77/654.03 c Problem name : HOME/instance-2667322-1276315658.opb
653.77/654.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
653.77/654.03 c Constraints : 2707 initial, 2707 maximal
653.77/654.03 c Presolved Problem :
653.77/654.03 c Problem name : t_HOME/instance-2667322-1276315658.opb
653.77/654.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
653.77/654.03 c Constraints : 2564 initial, 16735 maximal
653.77/654.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
653.77/654.03 c trivial : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c implics : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c probing : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c knapsack : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c setppc : 0.00 0 0 0 0 0 0 0 0
653.77/654.03 c linear : 0.03 0 0 0 0 0 143 0 0
653.77/654.03 c logicor : 0.02 0 0 0 0 0 0 0 0
653.77/654.03 c root node : - 0 - - 0 - - - -
653.77/654.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
653.77/654.03 c integral : 0 0 0 23277 0 104 1432 0 0 44736
653.77/654.03 c knapsack : 1 5 178661 0 0 218 78998 0 0 0
653.77/654.03 c setppc : 22 5 178567 0 0 1012 246612 0 0 0
653.77/654.03 c linear : 0+ 5 168417 0 0 7 1678 1 0 0
653.77/654.03 c logicor : 2541+ 5 82880 0 0 297 268297 0 0 0
653.77/654.03 c countsols : 0 0 0 0 0 0 0 0 0 0
653.77/654.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
653.77/654.03 c integral : 86.50 0.00 0.00 86.50 0.00
653.77/654.03 c knapsack : 1.37 0.00 1.37 0.00 0.00
653.77/654.03 c setppc : 3.45 0.00 3.45 0.00 0.00
653.77/654.03 c linear : 1.29 0.00 1.29 0.00 0.00
653.77/654.03 c logicor : 18.55 0.00 18.55 0.00 0.00
653.77/654.03 c countsols : 0.00 0.00 0.00 0.00 0.00
653.77/654.03 c Propagators : Time Calls Cutoffs DomReds
653.77/654.03 c vbounds : 0.13 1 0 0
653.77/654.03 c rootredcost : 0.15 0 0 0
653.77/654.03 c pseudoobj : 0.09 0 0 0
653.77/654.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
653.77/654.03 c propagation : 0.11 1534 1528 7654 20.0 31 15.0 -
653.77/654.03 c infeasible LP : 9.07 20721 20440 120330 30.9 110 18.4 0
653.77/654.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
653.77/654.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
653.77/654.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
653.77/654.03 c applied globally : - - - 30928 18.7 - - -
653.77/654.03 c applied locally : - - - 1191 33.8 - - -
653.77/654.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
653.77/654.03 c cut pool : 0.01 4 - - 80 - (maximal pool size: 334)
653.77/654.03 c redcost : 0.25 22519 0 0 0 0
653.77/654.03 c impliedbounds : 0.00 5 0 0 0 0
653.77/654.03 c intobj : 0.00 0 0 0 0 0
653.77/654.03 c cgmip : 0.00 0 0 0 0 0
653.77/654.03 c gomory : 0.77 5 0 0 1000 0
653.77/654.03 c strongcg : 0.59 5 0 0 1067 0
653.77/654.03 c cmir : 0.00 0 0 0 0 0
653.77/654.03 c flowcover : 0.00 0 0 0 0 0
653.77/654.03 c clique : 0.00 5 0 0 0 0
653.77/654.03 c zerohalf : 0.00 0 0 0 0 0
653.77/654.03 c mcf : 0.00 1 0 0 0 0
653.77/654.03 c rapidlearning : 0.21 1 0 0 0 178
653.77/654.03 c Pricers : Time Calls Vars
653.77/654.03 c problem variables: 0.00 0 0
653.77/654.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
653.77/654.03 c relpscost : 86.45 23277 104 1432 0 0 44736
653.77/654.03 c pscost : 0.00 0 0 0 0 0 0
653.77/654.03 c inference : 0.00 0 0 0 0 0 0
653.77/654.03 c mostinf : 0.00 0 0 0 0 0 0
653.77/654.03 c leastinf : 0.00 0 0 0 0 0 0
653.77/654.03 c fullstrong : 0.00 0 0 0 0 0 0
653.77/654.03 c allfullstrong : 0.00 0 0 0 0 0 0
653.77/654.03 c random : 0.00 0 0 0 0 0 0
653.77/654.03 c Primal Heuristics : Time Calls Found
653.77/654.03 c LP solutions : 0.00 - 0
653.77/654.03 c pseudo solutions : 0.00 - 0
653.77/654.03 c trivial : 0.00 1 0
653.77/654.03 c simplerounding : 0.00 0 0
653.77/654.03 c zirounding : 0.00 0 0
653.77/654.03 c rounding : 0.00 0 0
653.77/654.03 c shifting : 0.00 0 0
653.77/654.03 c intshifting : 0.00 0 0
653.77/654.03 c oneopt : 0.00 0 0
653.77/654.03 c twoopt : 0.00 0 0
653.77/654.03 c fixandinfer : 0.00 0 0
653.77/654.03 c feaspump : 0.00 0 0
653.77/654.03 c coefdiving : 0.00 0 0
653.77/654.03 c pscostdiving : 0.00 0 0
653.77/654.03 c fracdiving : 0.00 0 0
653.77/654.03 c veclendiving : 0.00 0 0
653.77/654.03 c intdiving : 0.00 0 0
653.77/654.03 c actconsdiving : 0.00 0 0
653.77/654.03 c objpscostdiving : 0.00 0 0
653.77/654.03 c rootsoldiving : 0.00 0 0
653.77/654.03 c linesearchdiving : 0.00 0 0
653.77/654.03 c guideddiving : 0.00 0 0
653.77/654.03 c octane : 0.00 0 0
653.77/654.03 c rens : 0.00 0 0
653.77/654.03 c rins : 0.00 0 0
653.77/654.03 c localbranching : 0.00 0 0
653.77/654.03 c mutation : 0.00 0 0
653.77/654.03 c crossover : 0.00 0 0
653.77/654.03 c dins : 0.00 0 0
653.77/654.03 c undercover : 0.00 0 0
653.77/654.03 c nlp : 0.00 0 0
653.77/654.03 c trysol : 0.00 0 0
653.77/654.03 c LP : Time Calls Iterations Iter/call Iter/sec
653.77/654.03 c primal LP : 0.00 0 0 0.00 -
653.77/654.03 c dual LP : 476.04 43912 1375066 31.31 2888.55
653.77/654.03 c lex dual LP : 0.00 0 0 0.00 -
653.77/654.03 c barrier LP : 0.00 0 0 0.00 -
653.77/654.03 c diving/probing LP: 0.00 0 0 0.00 -
653.77/654.03 c strong branching : 85.53 3833 236173 61.62 2761.29
653.77/654.03 c (at root node) : - 9 2030 225.56 -
653.77/654.03 c conflict analysis: 0.00 0 0 0.00 -
653.77/654.03 c B&B Tree :
653.77/654.03 c number of runs : 1
653.77/654.03 c nodes : 44442
653.77/654.03 c nodes (total) : 44442
653.77/654.03 c nodes left : 0
653.77/654.03 c max depth : 55
653.77/654.03 c max depth (total): 55
653.77/654.03 c backtracks : 4961 (11.2%)
653.77/654.03 c delayed cutoffs : 295
653.77/654.03 c repropagations : 77467 (87191 domain reductions, 285 cutoffs)
653.77/654.03 c avg switch length: 4.99
653.77/654.03 c switching time : 17.33
653.77/654.03 c Solution :
653.77/654.03 c Solutions found : 0 (0 improvements)
653.77/654.03 c Primal Bound : infeasible
653.77/654.03 c Dual Bound : -
653.77/654.03 c Gap : 0.00 %
653.77/654.03 c Root Dual Bound : +0.00000000000000e+00
653.77/654.03 c Root Iterations : 179
653.77/654.07 c Time complete: 653.85.