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-2667297-1276305318.opb>
0.04/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.04/0.06 c problem read
0.04/0.06 c No objective function, only one solution is needed.
0.04/0.06 c presolving settings loaded
0.04/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.55 c 0.4s| 1 | 0 | 103 | - |3973k| 0 | 41 | 231 |2742 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.6s| 1 | 0 | 127 | - |4580k| 0 | 47 | 231 |2742 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.09 c 0.9s| 1 | 0 | 171 | - |4632k| 0 | 52 | 231 |2742 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.38/1.47 c 1.3s| 1 | 0 | 179 | - |4633k| 0 | 54 | 231 |2742 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.85 c 1.7s| 1 | 0 | 183 | - |4634k| 0 | 54 | 231 |2742 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.3s| 1 | 2 | 183 | - |4634k| 0 | 54 | 231 |2742 | 231 |2587 | 23 | 0 | 10 | 0.000000e+00 | -- | Inf
167.13/167.22 c 164s| 10000 | 29 |284366 | 28.4 |6407k| 41 | 29 | 231 |6228 | 231 |2578 | 23 |7137 |2266 | 0.000000e+00 | -- | Inf
290.57/290.73 c 285s| 20000 | 19 |580094 | 29.0 |7769k| 41 | - | 231 |9651 | 231 |2578 | 23 | 14k|2467 | 0.000000e+00 | -- | Inf
423.61/423.85 c 415s| 30000 | 34 |871131 | 29.0 |9024k| 41 | - | 231 | 12k| 231 |2578 | 23 | 22k|3184 | 0.000000e+00 | -- | Inf
556.86/557.14 c 546s| 40000 | 49 | 1170k| 29.2 | 10M| 46 | - | 231 | 16k| 231 |2578 | 23 | 29k|3804 | 0.000000e+00 | -- | Inf
688.81/689.17 c
688.81/689.17 c SCIP Status : problem is solved [infeasible]
688.81/689.17 c Solving Time (sec) : 675.32
688.81/689.17 c Solving Nodes : 49578
688.81/689.17 c Primal Bound : +1.00000000000000e+20 (0 solutions)
688.81/689.17 c Dual Bound : +1.00000000000000e+20
688.81/689.17 c Gap : 0.00 %
688.81/689.17 s UNSATISFIABLE
688.81/689.17 c SCIP Status : problem is solved [infeasible]
688.81/689.17 c Solving Time : 675.32
688.81/689.17 c Original Problem :
688.81/689.17 c Problem name : HOME/instance-2667297-1276305318.opb
688.81/689.17 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
688.81/689.17 c Constraints : 2707 initial, 2707 maximal
688.81/689.17 c Presolved Problem :
688.81/689.17 c Problem name : t_HOME/instance-2667297-1276305318.opb
688.81/689.17 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
688.81/689.17 c Constraints : 2564 initial, 16212 maximal
688.81/689.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
688.81/689.17 c trivial : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c implics : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c probing : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c knapsack : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c setppc : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c linear : 0.03 0 0 0 0 0 143 0 0
688.81/689.17 c logicor : 0.00 0 0 0 0 0 0 0 0
688.81/689.17 c root node : - 1 - - 1 - - - -
688.81/689.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
688.81/689.17 c integral : 0 0 0 26124 0 101 1872 0 0 50016
688.81/689.17 c knapsack : 1 5 197374 0 0 316 114512 0 0 0
688.81/689.17 c setppc : 22 5 197244 0 0 1444 284386 0 0 0
688.81/689.17 c linear : 0+ 5 167139 0 0 9 3919 0 0 0
688.81/689.17 c logicor : 2541+ 5 96037 0 0 496 323039 0 0 0
688.81/689.17 c countsols : 0 0 0 0 0 0 0 0 0 0
688.81/689.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
688.81/689.17 c integral : 86.85 0.00 0.00 86.85 0.00
688.81/689.17 c knapsack : 1.77 0.00 1.77 0.00 0.00
688.81/689.17 c setppc : 2.92 0.00 2.92 0.00 0.00
688.81/689.17 c linear : 1.57 0.00 1.57 0.00 0.00
688.81/689.17 c logicor : 18.63 0.00 18.63 0.00 0.00
688.81/689.17 c countsols : 0.00 0.00 0.00 0.00 0.00
688.81/689.17 c Propagators : Time Calls Cutoffs DomReds
688.81/689.17 c vbounds : 0.14 1 0 0
688.81/689.17 c rootredcost : 0.15 0 0 0
688.81/689.17 c pseudoobj : 0.05 0 0 0
688.81/689.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
688.81/689.17 c propagation : 0.23 2265 2251 11612 20.5 31 17.0 -
688.81/689.17 c infeasible LP : 9.47 22639 22448 133749 31.3 132 16.4 0
688.81/689.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
688.81/689.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
688.81/689.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
688.81/689.17 c applied globally : - - - 35146 18.9 - - -
688.81/689.17 c applied locally : - - - 989 33.3 - - -
688.81/689.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
688.81/689.17 c cut pool : 0.00 4 - - 71 - (maximal pool size: 345)
688.81/689.17 c redcost : 0.23 25143 0 0 0 0
688.81/689.17 c impliedbounds : 0.00 5 0 0 0 0
688.81/689.17 c intobj : 0.00 0 0 0 0 0
688.81/689.17 c cgmip : 0.00 0 0 0 0 0
688.81/689.17 c gomory : 0.74 5 0 0 1275 0
688.81/689.17 c strongcg : 0.57 5 0 0 1306 0
688.81/689.17 c cmir : 0.00 0 0 0 0 0
688.81/689.17 c flowcover : 0.00 0 0 0 0 0
688.81/689.17 c clique : 0.00 5 0 0 0 0
688.81/689.17 c zerohalf : 0.00 0 0 0 0 0
688.81/689.17 c mcf : 0.01 1 0 0 0 0
688.81/689.17 c rapidlearning : 0.22 1 0 0 0 178
688.81/689.17 c Pricers : Time Calls Vars
688.81/689.17 c problem variables: 0.00 0 0
688.81/689.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
688.81/689.17 c relpscost : 86.77 26124 101 1872 0 0 50016
688.81/689.17 c pscost : 0.00 0 0 0 0 0 0
688.81/689.17 c inference : 0.00 0 0 0 0 0 0
688.81/689.17 c mostinf : 0.00 0 0 0 0 0 0
688.81/689.17 c leastinf : 0.00 0 0 0 0 0 0
688.81/689.17 c fullstrong : 0.00 0 0 0 0 0 0
688.81/689.17 c allfullstrong : 0.00 0 0 0 0 0 0
688.81/689.17 c random : 0.00 0 0 0 0 0 0
688.81/689.17 c Primal Heuristics : Time Calls Found
688.81/689.17 c LP solutions : 0.00 - 0
688.81/689.17 c pseudo solutions : 0.00 - 0
688.81/689.17 c trivial : 0.01 1 0
688.81/689.17 c simplerounding : 0.00 0 0
688.81/689.17 c zirounding : 0.00 0 0
688.81/689.17 c rounding : 0.00 0 0
688.81/689.17 c shifting : 0.00 0 0
688.81/689.17 c intshifting : 0.00 0 0
688.81/689.17 c oneopt : 0.00 0 0
688.81/689.17 c twoopt : 0.00 0 0
688.81/689.17 c fixandinfer : 0.00 0 0
688.81/689.17 c feaspump : 0.00 0 0
688.81/689.17 c coefdiving : 0.00 0 0
688.81/689.17 c pscostdiving : 0.00 0 0
688.81/689.17 c fracdiving : 0.00 0 0
688.81/689.17 c veclendiving : 0.00 0 0
688.81/689.17 c intdiving : 0.00 0 0
688.81/689.17 c actconsdiving : 0.00 0 0
688.81/689.17 c objpscostdiving : 0.00 0 0
688.81/689.17 c rootsoldiving : 0.00 0 0
688.81/689.17 c linesearchdiving : 0.00 0 0
688.81/689.17 c guideddiving : 0.00 0 0
688.81/689.17 c octane : 0.00 0 0
688.81/689.17 c rens : 0.00 0 0
688.81/689.17 c rins : 0.00 0 0
688.81/689.17 c localbranching : 0.00 0 0
688.81/689.17 c mutation : 0.00 0 0
688.81/689.17 c crossover : 0.00 0 0
688.81/689.17 c dins : 0.00 0 0
688.81/689.17 c undercover : 0.00 0 0
688.81/689.17 c nlp : 0.00 0 0
688.81/689.17 c trysol : 0.00 0 0
688.81/689.17 c LP : Time Calls Iterations Iter/call Iter/sec
688.81/689.17 c primal LP : 0.00 0 0 0.00 -
688.81/689.17 c dual LP : 507.59 48670 1467851 30.16 2891.80
688.81/689.17 c lex dual LP : 0.00 0 0 0.00 -
688.81/689.17 c barrier LP : 0.00 0 0 0.00 -
688.81/689.17 c diving/probing LP: 0.00 0 0 0.00 -
688.81/689.17 c strong branching : 85.72 4294 241149 56.16 2813.22
688.81/689.17 c (at root node) : - 10 1672 167.20 -
688.81/689.17 c conflict analysis: 0.00 0 0 0.00 -
688.81/689.17 c B&B Tree :
688.81/689.17 c number of runs : 1
688.81/689.17 c nodes : 49578
688.81/689.17 c nodes (total) : 49578
688.81/689.17 c nodes left : 0
688.81/689.17 c max depth : 52
688.81/689.17 c max depth (total): 52
688.81/689.17 c backtracks : 5970 (12.0%)
688.81/689.17 c delayed cutoffs : 439
688.81/689.17 c repropagations : 80730 (112729 domain reductions, 435 cutoffs)
688.81/689.17 c avg switch length: 4.81
688.81/689.17 c switching time : 17.30
688.81/689.17 c Solution :
688.81/689.17 c Solutions found : 0 (0 improvements)
688.81/689.17 c Primal Bound : infeasible
688.81/689.17 c Dual Bound : -
688.81/689.17 c Gap : 0.00 %
688.81/689.17 c Root Dual Bound : +0.00000000000000e+00
688.81/689.17 c Root Iterations : 183
688.91/689.20 c Time complete: 688.92.