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-2665817-1276287209.opb>
0.01/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.01/0.06 c problem read
0.01/0.06 c No objective function, only one solution is needed.
0.01/0.06 c presolving settings loaded
0.01/0.07 c presolving:
0.10/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.10/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.10/0.15 c presolving (3 rounds):
0.10/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.15 c 242 implications, 22 cliques
0.10/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.10/0.15 c 1 constraints of type <knapsack>
0.10/0.15 c 22 constraints of type <setppc>
0.10/0.15 c 2541 constraints of type <logicor>
0.10/0.15 c transformed objective value is always integral (scale: 1)
0.10/0.15 c Presolving Time: 0.06
0.10/0.15 c - non default parameters ----------------------------------------------------------------------
0.10/0.15 c # SCIP version 1.2.1.2
0.10/0.15 c
0.10/0.15 c # frequency for displaying node information lines
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.15 c display/freq = 10000
0.10/0.15 c
0.10/0.15 c # maximal time in seconds to run
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/time = 1799.95
0.10/0.15 c
0.10/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/memory = 1620
0.10/0.15 c
0.10/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c limits/solutions = 1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.15 c separating/maxrounds = 1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/maxroundsroot = 5
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify inequalities
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/linear/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.15 c constraints/knapsack/disaggregation = FALSE
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify knapsacks
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c presolving/probing/maxrounds = 0
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/coefdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.15 c heuristics/crossover/freq = -1
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/crossover/nodesofs = 750
0.10/0.15 c
0.10/0.15 c # number of nodes without incumbent change that heuristic should wait
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.15 c heuristics/crossover/nwaitingnodes = 100
0.10/0.15 c
0.10/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.15 c # [type: real, range: [0,1], default: 0.1]
0.10/0.15 c heuristics/crossover/nodesquot = 0.15
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixed
0.10/0.15 c # [type: real, range: [0,1], default: 0.666]
0.10/0.15 c heuristics/crossover/minfixingrate = 0.5
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/feaspump/freq = -1
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/fracdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/guideddiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/intshifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/linesearchdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/nlp/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/objpscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.15 c # [type: real, range: [0,1], default: 0.01]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/oneopt/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/pscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/rens/freq = -1
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixable
0.10/0.15 c # [type: real, range: [0,1], default: 0.5]
0.10/0.15 c heuristics/rens/minfixingrate = 0.3
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/rens/nodesofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/rootsoldiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/rounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/shifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/simplerounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/trivial/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/trysol/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/veclendiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/zirounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/cmir/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/flowcover/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/rapidlearning/freq = 0
0.10/0.15 c
0.10/0.15 c -----------------------------------------------------------------------------------------------
0.10/0.15 c start solving
0.10/0.15 c
0.10/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.10/0.17 c 0.1s| 1 | 0 | 65 | - |3551k| 0 | 33 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.4s| 1 | 0 | 94 | - |3973k| 0 | 39 | 231 |2781 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.6s| 1 | 0 | 363 | - |4539k| 0 | 64 | 231 |2781 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.30/1.31 c 1.2s| 1 | 0 | 670 | - |4965k| 0 | 66 | 231 |2781 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.7s| 1 | 0 | 1165 | - |5373k| 0 | 72 | 231 |2781 | 231 |2590 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.62 c 2.5s| 1 | 0 | 1958 | - |5747k| 0 | 52 | 231 |2781 | 231 |2593 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.91 c 4.7s| 1 | 2 | 1958 | - |5748k| 0 | 52 | 231 |2781 | 231 |2593 | 29 | 0 | 10 | 0.000000e+00 | -- | Inf
147.95/148.05 c 144s| 10000 | 41 |309781 | 30.8 |7394k| 36 | - | 231 |5913 | 231 |2571 | 29 |5458 |2061 | 0.000000e+00 | -- | Inf
264.71/264.82 c 257s| 20000 | 35 |629930 | 31.4 |7570k| 39 | 23 | 231 |5986 | 231 |2571 | 29 | 10k|2528 | 0.000000e+00 | -- | Inf
398.88/399.03 c 387s| 30000 | 52 | 1023k| 34.0 |9076k| 53 | - | 231 |9438 | 231 |2571 | 29 | 16k|3022 | 0.000000e+00 | -- | Inf
542.44/542.63 c 526s| 40000 | 20 | 1439k| 36.0 |7899k| 57 | 26 | 231 |6052 | 231 |2571 | 29 | 22k|3656 | 0.000000e+00 | -- | Inf
611.92/612.10 c
611.92/612.10 c SCIP Status : problem is solved [infeasible]
611.92/612.10 c Solving Time (sec) : 593.60
611.92/612.10 c Solving Nodes : 45044
611.92/612.10 c Primal Bound : +1.00000000000000e+20 (0 solutions)
611.92/612.10 c Dual Bound : +1.00000000000000e+20
611.92/612.10 c Gap : 0.00 %
611.92/612.10 s UNSATISFIABLE
611.92/612.10 c SCIP Status : problem is solved [infeasible]
611.92/612.10 c Solving Time : 593.60
611.92/612.10 c Original Problem :
611.92/612.10 c Problem name : HOME/instance-2665817-1276287209.opb
611.92/612.10 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
611.92/612.10 c Constraints : 2707 initial, 2707 maximal
611.92/612.10 c Presolved Problem :
611.92/612.10 c Problem name : t_HOME/instance-2665817-1276287209.opb
611.92/612.10 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
611.92/612.10 c Constraints : 2564 initial, 9489 maximal
611.92/612.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
611.92/612.10 c trivial : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c dualfix : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c boundshift : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c implics : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c probing : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c knapsack : 0.00 0 0 0 0 0 0 0 0
611.92/612.10 c setppc : 0.01 0 0 0 0 0 0 0 0
611.92/612.10 c linear : 0.02 0 0 0 0 0 143 0 0
611.92/612.10 c logicor : 0.02 0 0 0 0 0 0 0 0
611.92/612.10 c root node : - 3 - - 3 - - - -
611.92/612.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
611.92/612.10 c integral : 0 0 0 23665 0 178 1387 0 0 45226
611.92/612.10 c knapsack : 1 5 153667 0 0 203 74490 0 0 0
611.92/612.10 c setppc : 22 5 153575 0 0 826 260979 0 0 0
611.92/612.10 c linear : 0+ 5 149456 0 0 5 3222 3 0 0
611.92/612.10 c logicor : 2541+ 5 82769 0 0 257 267889 0 0 0
611.92/612.10 c countsols : 0 0 0 0 0 0 0 0 0 0
611.92/612.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
611.92/612.10 c integral : 68.44 0.00 0.00 68.44 0.00
611.92/612.10 c knapsack : 1.33 0.00 1.33 0.00 0.00
611.92/612.10 c setppc : 2.55 0.00 2.55 0.00 0.00
611.92/612.10 c linear : 1.26 0.00 1.26 0.00 0.00
611.92/612.10 c logicor : 11.70 0.00 11.70 0.00 0.00
611.92/612.10 c countsols : 0.00 0.00 0.00 0.00 0.00
611.92/612.10 c Propagators : Time Calls Cutoffs DomReds
611.92/612.10 c vbounds : 0.12 1 0 0
611.92/612.10 c rootredcost : 0.11 0 0 0
611.92/612.10 c pseudoobj : 0.08 0 0 0
611.92/612.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
611.92/612.10 c propagation : 0.12 1291 1285 6018 18.7 22 20.5 -
611.92/612.10 c infeasible LP : 7.88 21145 16447 92148 31.7 57 18.6 0
611.92/612.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
611.92/612.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
611.92/612.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
611.92/612.10 c applied globally : - - - 24323 18.4 - - -
611.92/612.10 c applied locally : - - - 586 34.6 - - -
611.92/612.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
611.92/612.10 c cut pool : 0.00 4 - - 5 - (maximal pool size: 565)
611.92/612.10 c redcost : 0.14 22831 0 0 0 0
611.92/612.10 c impliedbounds : 0.00 5 0 0 0 0
611.92/612.10 c intobj : 0.00 0 0 0 0 0
611.92/612.10 c cgmip : 0.00 0 0 0 0 0
611.92/612.10 c gomory : 0.75 5 0 0 1008 0
611.92/612.10 c strongcg : 0.56 5 0 0 2154 0
611.92/612.10 c cmir : 0.00 0 0 0 0 0
611.92/612.10 c flowcover : 0.00 0 0 0 0 0
611.92/612.10 c clique : 0.00 5 0 0 0 0
611.92/612.10 c zerohalf : 0.00 0 0 0 0 0
611.92/612.10 c mcf : 0.01 1 0 0 0 0
611.92/612.10 c rapidlearning : 0.20 1 0 0 0 217
611.92/612.10 c Pricers : Time Calls Vars
611.92/612.10 c problem variables: 0.00 0 0
611.92/612.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
611.92/612.10 c relpscost : 68.38 23665 178 1387 0 0 45226
611.92/612.10 c pscost : 0.00 0 0 0 0 0 0
611.92/612.10 c inference : 0.00 0 0 0 0 0 0
611.92/612.10 c mostinf : 0.00 0 0 0 0 0 0
611.92/612.10 c leastinf : 0.00 0 0 0 0 0 0
611.92/612.10 c fullstrong : 0.00 0 0 0 0 0 0
611.92/612.11 c allfullstrong : 0.00 0 0 0 0 0 0
611.92/612.11 c random : 0.00 0 0 0 0 0 0
611.92/612.11 c Primal Heuristics : Time Calls Found
611.92/612.11 c LP solutions : 0.00 - 0
611.92/612.11 c pseudo solutions : 0.00 - 0
611.92/612.11 c trivial : 0.01 1 0
611.92/612.11 c simplerounding : 0.00 0 0
611.92/612.11 c zirounding : 0.00 0 0
611.92/612.11 c rounding : 0.00 0 0
611.92/612.11 c shifting : 0.00 0 0
611.92/612.11 c intshifting : 0.00 0 0
611.92/612.11 c oneopt : 0.00 0 0
611.92/612.11 c twoopt : 0.00 0 0
611.92/612.11 c fixandinfer : 0.00 0 0
611.92/612.11 c feaspump : 0.00 0 0
611.92/612.11 c coefdiving : 0.00 0 0
611.92/612.11 c pscostdiving : 0.00 0 0
611.92/612.11 c fracdiving : 0.00 0 0
611.92/612.11 c veclendiving : 0.00 0 0
611.92/612.11 c intdiving : 0.00 0 0
611.92/612.11 c actconsdiving : 0.00 0 0
611.92/612.11 c objpscostdiving : 0.00 0 0
611.92/612.11 c rootsoldiving : 0.00 0 0
611.92/612.11 c linesearchdiving : 0.00 0 0
611.92/612.11 c guideddiving : 0.00 0 0
611.92/612.11 c octane : 0.00 0 0
611.92/612.11 c rens : 0.00 0 0
611.92/612.11 c rins : 0.00 0 0
611.92/612.11 c localbranching : 0.00 0 0
611.92/612.11 c mutation : 0.00 0 0
611.92/612.11 c crossover : 0.00 0 0
611.92/612.11 c dins : 0.00 0 0
611.92/612.11 c undercover : 0.00 0 0
611.92/612.11 c nlp : 0.00 0 0
611.92/612.11 c trysol : 0.00 0 0
611.92/612.11 c LP : Time Calls Iterations Iter/call Iter/sec
611.92/612.11 c primal LP : 0.00 0 0 0.00 -
611.92/612.11 c dual LP : 467.27 44783 1639924 36.62 3509.59
611.92/612.11 c lex dual LP : 0.00 0 0 0.00 -
611.92/612.11 c barrier LP : 0.00 0 0 0.00 -
611.92/612.11 c diving/probing LP: 0.00 0 0 0.00 -
611.92/612.11 c strong branching : 67.38 3944 270394 68.56 4012.97
611.92/612.11 c (at root node) : - 10 5929 592.90 -
611.92/612.11 c conflict analysis: 0.00 0 0 0.00 -
611.92/612.11 c B&B Tree :
611.92/612.11 c number of runs : 1
611.92/612.11 c nodes : 45044
611.92/612.11 c nodes (total) : 45044
611.92/612.11 c nodes left : 0
611.92/612.11 c max depth : 57
611.92/612.11 c max depth (total): 57
611.92/612.11 c backtracks : 4587 (10.2%)
611.92/612.11 c delayed cutoffs : 183
611.92/612.11 c repropagations : 53859 (71156 domain reductions, 183 cutoffs)
611.92/612.11 c avg switch length: 4.23
611.92/612.11 c switching time : 12.67
611.92/612.11 c Solution :
611.92/612.11 c Solutions found : 0 (0 improvements)
611.92/612.11 c Primal Bound : infeasible
611.92/612.11 c Dual Bound : -
611.92/612.11 c Gap : 0.00 %
611.92/612.11 c Root Dual Bound : +0.00000000000000e+00
611.92/612.11 c Root Iterations : 1958
611.92/612.13 c Time complete: 611.94.