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-2667268-1276294146.opb>
0.00/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 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.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.95
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.18 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.18 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.4s| 1 | 0 | 105 | - |3938k| 0 | 42 | 231 |2714 | 231 |2577 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 134 | - |4555k| 0 | 47 | 231 |2714 | 231 |2582 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.08 c 0.9s| 1 | 0 | 160 | - |4960k| 0 | 47 | 231 |2714 | 231 |2583 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.43 c 1.3s| 1 | 0 | 167 | - |5041k| 0 | 49 | 231 |2714 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.6s| 1 | 0 | 186 | - |5049k| 0 | 51 | 231 |2714 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.94 c 2.8s| 1 | 2 | 186 | - |5049k| 0 | 51 | 231 |2714 | 231 |2587 | 23 | 0 | 10 | 0.000000e+00 | -- | Inf
166.24/166.34 c 163s| 10000 | 79 |291276 | 29.1 |7195k| 36 | 27 | 231 |7008 | 231 |2578 | 23 |6551 |2269 | 0.000000e+00 | -- | Inf
287.71/287.88 c 282s| 20000 | 97 |582384 | 29.1 |7910k| 39 | - | 231 |7957 | 231 |2578 | 23 | 13k|2508 | 0.000000e+00 | -- | Inf
416.28/416.41 c 408s| 30000 | 125 |871496 | 29.0 |8893k| 51 | - | 231 |9987 | 231 |2578 | 23 | 20k|3143 | 0.000000e+00 | -- | Inf
553.83/554.07 c 543s| 40000 | 74 | 1190k| 29.7 |8879k| 51 | - | 231 |9890 | 231 |2578 | 23 | 27k|3670 | 0.000000e+00 | -- | Inf
633.91/634.19 c
633.91/634.19 c SCIP Status : problem is solved [infeasible]
633.91/634.19 c Solving Time (sec) : 621.40
633.91/634.19 c Solving Nodes : 45907
633.91/634.19 c Primal Bound : +1.00000000000000e+20 (0 solutions)
633.91/634.19 c Dual Bound : +1.00000000000000e+20
633.91/634.19 c Gap : 0.00 %
633.91/634.19 s UNSATISFIABLE
633.91/634.19 c SCIP Status : problem is solved [infeasible]
633.91/634.19 c Solving Time : 621.40
633.91/634.19 c Original Problem :
633.91/634.19 c Problem name : HOME/instance-2667268-1276294146.opb
633.91/634.19 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
633.91/634.19 c Constraints : 2707 initial, 2707 maximal
633.91/634.19 c Presolved Problem :
633.91/634.19 c Problem name : t_HOME/instance-2667268-1276294146.opb
633.91/634.19 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
633.91/634.19 c Constraints : 2564 initial, 10911 maximal
633.91/634.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
633.91/634.19 c trivial : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c implics : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c probing : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c knapsack : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c setppc : 0.00 0 0 0 0 0 0 0 0
633.91/634.19 c linear : 0.03 0 0 0 0 0 143 0 0
633.91/634.19 c logicor : 0.03 0 0 0 0 0 0 0 0
633.91/634.19 c root node : - 2 - - 2 - - - -
633.91/634.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
633.91/634.19 c integral : 0 0 0 23947 0 81 1394 0 0 46320
633.91/634.19 c knapsack : 1 5 178787 0 0 319 101629 0 0 0
633.91/634.19 c setppc : 22 5 178667 0 0 1198 253640 0 0 0
633.91/634.19 c linear : 0+ 5 173085 0 0 4 2497 2 0 0
633.91/634.19 c logicor : 2541+ 5 87811 0 0 341 294552 0 0 0
633.91/634.19 c countsols : 0 0 0 0 0 0 0 0 0 0
633.91/634.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
633.91/634.19 c integral : 79.10 0.00 0.00 79.10 0.00
633.91/634.19 c knapsack : 1.28 0.00 1.28 0.00 0.00
633.91/634.19 c setppc : 2.59 0.00 2.59 0.00 0.00
633.91/634.19 c linear : 1.05 0.00 1.05 0.00 0.00
633.91/634.19 c logicor : 13.98 0.00 13.98 0.00 0.00
633.91/634.19 c countsols : 0.00 0.00 0.00 0.00 0.00
633.91/634.19 c Propagators : Time Calls Cutoffs DomReds
633.91/634.19 c vbounds : 0.13 1 0 0
633.91/634.19 c rootredcost : 0.10 0 0 0
633.91/634.19 c pseudoobj : 0.11 0 0 0
633.91/634.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
633.91/634.19 c propagation : 0.10 1862 1848 9259 20.5 34 15.7 -
633.91/634.19 c infeasible LP : 8.77 21208 20856 125025 31.8 120 18.8 0
633.91/634.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
633.91/634.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
633.91/634.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
633.91/634.19 c applied globally : - - - 30804 18.7 - - -
633.91/634.19 c applied locally : - - - 663 33.9 - - -
633.91/634.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
633.91/634.19 c cut pool : 0.01 4 - - 139 - (maximal pool size: 446)
633.91/634.19 c redcost : 0.31 23294 0 0 0 0
633.91/634.19 c impliedbounds : 0.00 5 0 0 0 0
633.91/634.19 c intobj : 0.00 0 0 0 0 0
633.91/634.19 c cgmip : 0.00 0 0 0 0 0
633.91/634.19 c gomory : 0.70 5 0 0 1096 0
633.91/634.19 c strongcg : 0.59 5 0 0 1560 0
633.91/634.19 c cmir : 0.00 0 0 0 0 0
633.91/634.19 c flowcover : 0.00 0 0 0 0 0
633.91/634.19 c clique : 0.00 5 0 0 0 0
633.91/634.19 c zerohalf : 0.00 0 0 0 0 0
633.91/634.19 c mcf : 0.00 1 0 0 0 0
633.91/634.19 c rapidlearning : 0.19 1 0 0 0 150
633.91/634.19 c Pricers : Time Calls Vars
633.91/634.19 c problem variables: 0.00 0 0
633.91/634.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
633.91/634.19 c relpscost : 79.03 23947 81 1394 0 0 46320
633.91/634.19 c pscost : 0.00 0 0 0 0 0 0
633.91/634.19 c inference : 0.00 0 0 0 0 0 0
633.91/634.19 c mostinf : 0.00 0 0 0 0 0 0
633.91/634.19 c leastinf : 0.00 0 0 0 0 0 0
633.91/634.19 c fullstrong : 0.00 0 0 0 0 0 0
633.91/634.19 c allfullstrong : 0.00 0 0 0 0 0 0
633.91/634.19 c random : 0.00 0 0 0 0 0 0
633.91/634.19 c Primal Heuristics : Time Calls Found
633.91/634.19 c LP solutions : 0.00 - 0
633.91/634.19 c pseudo solutions : 0.00 - 0
633.91/634.19 c trivial : 0.00 1 0
633.91/634.19 c simplerounding : 0.00 0 0
633.91/634.19 c zirounding : 0.00 0 0
633.91/634.19 c rounding : 0.00 0 0
633.91/634.19 c shifting : 0.00 0 0
633.91/634.19 c intshifting : 0.00 0 0
633.91/634.19 c oneopt : 0.00 0 0
633.91/634.19 c twoopt : 0.00 0 0
633.91/634.19 c fixandinfer : 0.00 0 0
633.91/634.19 c feaspump : 0.00 0 0
633.91/634.19 c coefdiving : 0.00 0 0
633.91/634.19 c pscostdiving : 0.00 0 0
633.91/634.19 c fracdiving : 0.00 0 0
633.91/634.19 c veclendiving : 0.00 0 0
633.91/634.19 c intdiving : 0.00 0 0
633.91/634.19 c actconsdiving : 0.00 0 0
633.91/634.19 c objpscostdiving : 0.00 0 0
633.91/634.19 c rootsoldiving : 0.00 0 0
633.91/634.19 c linesearchdiving : 0.00 0 0
633.91/634.19 c guideddiving : 0.00 0 0
633.91/634.19 c octane : 0.00 0 0
633.91/634.19 c rens : 0.00 0 0
633.91/634.19 c rins : 0.00 0 0
633.91/634.19 c localbranching : 0.00 0 0
633.91/634.19 c mutation : 0.00 0 0
633.91/634.19 c crossover : 0.00 0 0
633.91/634.19 c dins : 0.00 0 0
633.91/634.19 c undercover : 0.00 0 0
633.91/634.19 c nlp : 0.00 0 0
633.91/634.19 c trysol : 0.00 0 0
633.91/634.19 c LP : Time Calls Iterations Iter/call Iter/sec
633.91/634.19 c primal LP : 0.00 0 0 0.00 -
633.91/634.19 c dual LP : 472.53 45053 1376728 30.56 2913.53
633.91/634.19 c lex dual LP : 0.00 0 0 0.00 -
633.91/634.19 c barrier LP : 0.00 0 0 0.00 -
633.91/634.19 c diving/probing LP: 0.00 0 0 0.00 -
633.91/634.19 c strong branching : 77.79 3962 219519 55.41 2821.94
633.91/634.19 c (at root node) : - 10 2761 276.10 -
633.91/634.19 c conflict analysis: 0.00 0 0 0.00 -
633.91/634.19 c B&B Tree :
633.91/634.19 c number of runs : 1
633.91/634.19 c nodes : 45907
633.91/634.19 c nodes (total) : 45907
633.91/634.19 c nodes left : 0
633.91/634.19 c max depth : 51
633.91/634.19 c max depth (total): 51
633.91/634.19 c backtracks : 5747 (12.5%)
633.91/634.19 c delayed cutoffs : 414
633.91/634.19 c repropagations : 72255 (106332 domain reductions, 404 cutoffs)
633.91/634.19 c avg switch length: 4.96
633.91/634.19 c switching time : 14.79
633.91/634.19 c Solution :
633.91/634.19 c Solutions found : 0 (0 improvements)
633.91/634.19 c Primal Bound : infeasible
633.91/634.19 c Dual Bound : -
633.91/634.19 c Gap : 0.00 %
633.91/634.19 c Root Dual Bound : +0.00000000000000e+00
633.91/634.19 c Root Iterations : 186
634.01/634.22 c Time complete: 634.02.