0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2684716-1278432606.opb>
0.19/0.29 c original problem has 4960 variables (4960 bin, 0 int, 0 impl, 0 cont) and 16157 constraints
0.19/0.29 c problem read
0.19/0.29 c No objective function, only one solution is needed.
0.19/0.29 c presolving settings loaded
0.19/0.29 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.29/0.38 c presolving:
1.00/1.09 c (round 1) 1038 del vars, 2612 del conss, 655 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 896908 impls, 0 clqs
1.29/1.40 c (round 2) 2276 del vars, 7083 del conss, 1759 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 904261 impls, 0 clqs
1.39/1.45 c (round 3) 2701 del vars, 8987 del conss, 1955 chg bounds, 18 chg sides, 32 chg coeffs, 0 upgd conss, 907366 impls, 0 clqs
1.39/1.47 c (round 4) 2844 del vars, 9711 del conss, 2015 chg bounds, 37 chg sides, 52 chg coeffs, 0 upgd conss, 909514 impls, 0 clqs
1.39/1.49 c (round 5) 2882 del vars, 9889 del conss, 2027 chg bounds, 38 chg sides, 53 chg coeffs, 0 upgd conss, 910121 impls, 0 clqs
1.49/1.50 c (round 6) 2893 del vars, 9946 del conss, 2029 chg bounds, 38 chg sides, 53 chg coeffs, 0 upgd conss, 910274 impls, 0 clqs
1.49/1.51 c (round 7) 2896 del vars, 9959 del conss, 2030 chg bounds, 38 chg sides, 53 chg coeffs, 0 upgd conss, 910342 impls, 0 clqs
1.49/1.52 c (round 8) 2897 del vars, 9966 del conss, 2030 chg bounds, 38 chg sides, 53 chg coeffs, 0 upgd conss, 910362 impls, 0 clqs
1.59/1.62 c (round 9) 2897 del vars, 9966 del conss, 2030 chg bounds, 38 chg sides, 53 chg coeffs, 6191 upgd conss, 910362 impls, 0 clqs
1.69/1.70 c (round 10) 2897 del vars, 9966 del conss, 2030 chg bounds, 42 chg sides, 114 chg coeffs, 6191 upgd conss, 910962 impls, 275 clqs
1.69/1.77 c (round 11) 2897 del vars, 9966 del conss, 2030 chg bounds, 46 chg sides, 129 chg coeffs, 6191 upgd conss, 910962 impls, 280 clqs
1.79/1.80 c presolving (12 rounds):
1.79/1.80 c 2897 deleted vars, 9966 deleted constraints, 2030 tightened bounds, 0 added holes, 46 changed sides, 129 changed coefficients
1.79/1.80 c 910962 implications, 281 cliques
1.79/1.80 c presolved problem has 2063 variables (2063 bin, 0 int, 0 impl, 0 cont) and 6191 constraints
1.79/1.80 c 254 constraints of type <knapsack>
1.79/1.80 c 5937 constraints of type <logicor>
1.79/1.80 c transformed objective value is always integral (scale: 1)
1.79/1.80 c Presolving Time: 1.34
1.79/1.80 c - non default parameters ----------------------------------------------------------------------
1.79/1.80 c # SCIP version 1.2.1.2
1.79/1.80 c
1.79/1.80 c # frequency for displaying node information lines
1.79/1.80 c # [type: int, range: [-1,2147483647], default: 100]
1.79/1.80 c display/freq = 10000
1.79/1.80 c
1.79/1.80 c # maximal time in seconds to run
1.79/1.80 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.80 c limits/time = 1799.72
1.79/1.80 c
1.79/1.80 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.79/1.80 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.80 c limits/memory = 1620
1.79/1.80 c
1.79/1.80 c # solving stops, if the given number of solutions were found (-1: no limit)
1.79/1.80 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.80 c limits/solutions = 1
1.79/1.80 c
1.79/1.80 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.79/1.80 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.80 c lp/solvefreq = -1
1.79/1.80 c
1.79/1.80 c # maximal number of separation rounds per node (-1: unlimited)
1.79/1.80 c # [type: int, range: [-1,2147483647], default: 5]
1.79/1.80 c separating/maxrounds = 1
1.79/1.80 c
1.79/1.80 c # maximal number of separation rounds in the root node (-1: unlimited)
1.79/1.80 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.80 c separating/maxroundsroot = 5
1.79/1.80 c
1.79/1.80 c # should presolving try to simplify inequalities
1.79/1.80 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.80 c constraints/linear/simplifyinequalities = TRUE
1.79/1.80 c
1.79/1.80 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.79/1.80 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.79/1.81 c constraints/knapsack/disaggregation = FALSE
1.79/1.81 c
1.79/1.81 c # should presolving try to simplify knapsacks
1.79/1.81 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.81 c constraints/knapsack/simplifyinequalities = TRUE
1.79/1.81 c
1.79/1.81 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.81 c presolving/probing/maxrounds = 0
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/coefdiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/coefdiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/coefdiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 30]
1.79/1.81 c heuristics/crossover/freq = -1
1.79/1.81 c
1.79/1.81 c # number of nodes added to the contingent of the total nodes
1.79/1.81 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.81 c heuristics/crossover/nodesofs = 750
1.79/1.81 c
1.79/1.81 c # number of nodes without incumbent change that heuristic should wait
1.79/1.81 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.79/1.81 c heuristics/crossover/nwaitingnodes = 100
1.79/1.81 c
1.79/1.81 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.79/1.81 c # [type: real, range: [0,1], default: 0.1]
1.79/1.81 c heuristics/crossover/nodesquot = 0.15
1.79/1.81 c
1.79/1.81 c # minimum percentage of integer variables that have to be fixed
1.79/1.81 c # [type: real, range: [0,1], default: 0.666]
1.79/1.81 c heuristics/crossover/minfixingrate = 0.5
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.81 c heuristics/feaspump/freq = -1
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/feaspump/maxlpiterofs = 2000
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/fracdiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/fracdiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/fracdiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/guideddiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/guideddiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/guideddiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/intdiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/intshifting/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/linesearchdiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/nlp/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.81 c heuristics/objpscostdiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to total iteration number
1.79/1.81 c # [type: real, range: [0,1], default: 0.01]
1.79/1.81 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/oneopt/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/pscostdiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/pscostdiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.81 c heuristics/rens/freq = -1
1.79/1.81 c
1.79/1.81 c # minimum percentage of integer variables that have to be fixable
1.79/1.81 c # [type: real, range: [0,1], default: 0.5]
1.79/1.81 c heuristics/rens/minfixingrate = 0.3
1.79/1.81 c
1.79/1.81 c # number of nodes added to the contingent of the total nodes
1.79/1.81 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.81 c heuristics/rens/nodesofs = 2000
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.81 c heuristics/rootsoldiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.79/1.81 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/rounding/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/shifting/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/simplerounding/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.81 c heuristics/trivial/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/trysol/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.81 c heuristics/veclendiving/freq = -1
1.79/1.81 c
1.79/1.81 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.81 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.81 c heuristics/veclendiving/maxlpiterquot = 0.075
1.79/1.81 c
1.79/1.81 c # additional number of allowed LP iterations
1.79/1.81 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.81 c heuristics/veclendiving/maxlpiterofs = 1500
1.79/1.81 c
1.79/1.81 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.81 c heuristics/zirounding/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.81 c separating/cmir/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.81 c separating/flowcover/freq = -1
1.79/1.81 c
1.79/1.81 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.79/1.81 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.81 c separating/rapidlearning/freq = 0
1.79/1.81 c
1.79/1.81 c -----------------------------------------------------------------------------------------------
1.79/1.81 c start solving
1.79/1.81 c
1.79/1.82 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.82 c 1.4s| 1 | 2 | 0 | - | 27M| 0 | - |2063 |6191 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
40.48/40.50 c 39.2s| 10000 | 3474 | 0 | 0.0 | 51M| 58 | - |2063 |9776 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
87.57/87.66 c 85.5s| 20000 | 5345 | 0 | 0.0 | 67M| 58 | - |2063 | 13k| 0 | 0 | 0 | 34k| 0 | 0.000000e+00 | -- | Inf
145.35/145.48 c 142s| 30000 | 5965 | 0 | 0.0 | 81M| 58 | - |2063 | 15k| 0 | 0 | 0 | 55k| 0 | 0.000000e+00 | -- | Inf
210.53/210.61 c 206s| 40000 | 5878 | 0 | 0.0 | 88M| 58 | - |2063 | 17k| 0 | 0 | 0 | 77k| 0 | 0.000000e+00 | -- | Inf
285.11/285.20 c 280s| 50000 | 4634 | 0 | 0.0 | 84M| 58 | - |2063 | 16k| 0 | 0 | 0 | 100k| 0 | 0.000000e+00 | -- | Inf
366.99/367.13 c 361s| 60000 | 1956 | 0 | 0.0 | 61M| 61 | - |2063 | 16k| 0 | 0 | 0 | 124k| 0 | 0.000000e+00 | -- | Inf
394.99/395.18 c
394.99/395.18 c SCIP Status : problem is solved [infeasible]
394.99/395.18 c Solving Time (sec) : 388.59
394.99/395.18 c Solving Nodes : 62770
394.99/395.18 c Primal Bound : +1.00000000000000e+20 (0 solutions)
394.99/395.18 c Dual Bound : +1.00000000000000e+20
394.99/395.18 c Gap : 0.00 %
394.99/395.18 s UNSATISFIABLE
394.99/395.18 c SCIP Status : problem is solved [infeasible]
394.99/395.18 c Solving Time : 388.59
394.99/395.18 c Original Problem :
394.99/395.18 c Problem name : HOME/instance-2684716-1278432606.opb
394.99/395.18 c Variables : 4960 (4960 binary, 0 integer, 0 implicit integer, 0 continuous)
394.99/395.18 c Constraints : 16157 initial, 16157 maximal
394.99/395.18 c Presolved Problem :
394.99/395.18 c Problem name : t_HOME/instance-2684716-1278432606.opb
394.99/395.18 c Variables : 2063 (2063 binary, 0 integer, 0 implicit integer, 0 continuous)
394.99/395.18 c Constraints : 6191 initial, 18469 maximal
394.99/395.18 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
394.99/395.18 c trivial : 0.00 165 0 0 0 0 0 0 0
394.99/395.18 c dualfix : 0.02 31 0 0 0 0 0 0 0
394.99/395.18 c boundshift : 0.00 0 0 0 0 0 0 0 0
394.99/395.18 c inttobinary : 0.00 0 0 0 0 0 0 0 0
394.99/395.18 c implics : 0.02 0 0 0 0 0 0 0 0
394.99/395.18 c probing : 0.00 0 0 0 0 0 0 0 0
394.99/395.18 c knapsack : 0.10 0 0 0 0 0 0 8 76
394.99/395.18 c linear : 1.06 1865 836 0 2030 0 9966 38 53
394.99/395.18 c logicor : 0.09 0 0 0 0 0 0 0 0
394.99/395.18 c root node : - 37 - - 37 - - - -
394.99/395.18 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
394.99/395.18 c integral : 0 0 0 0 0 0 0 0 0 0
394.99/395.18 c knapsack : 254 0 878709 0 40897 3954 2602614 0 0 0
394.99/395.18 c logicor : 5937+ 0 832771 0 40897 29621 7137972 0 0 0
394.99/395.18 c countsols : 0 0 0 0 40897 0 0 0 0 0
394.99/395.18 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
394.99/395.18 c integral : 0.00 0.00 0.00 0.00 0.00
394.99/395.18 c knapsack : 61.02 0.00 58.13 0.00 2.89
394.99/395.18 c logicor : 162.93 0.00 127.83 0.00 35.10
394.99/395.18 c countsols : 0.00 0.00 0.00 0.00 0.00
394.99/395.18 c Propagators : Time Calls Cutoffs DomReds
394.99/395.18 c vbounds : 0.44 1 0 0
394.99/395.18 c rootredcost : 0.54 0 0 0
394.99/395.18 c pseudoobj : 0.37 0 0 0
394.99/395.18 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
394.99/395.18 c propagation : 11.83 33575 33465 358390 38.3 3795 15.8 -
394.99/395.18 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
394.99/395.18 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
394.99/395.18 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
394.99/395.18 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
394.99/395.18 c applied globally : - - - 132010 32.0 - - -
394.99/395.18 c applied locally : - - - 0 0.0 - - -
394.99/395.18 c Separators : Time Calls Cutoffs DomReds Cuts Conss
394.99/395.18 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
394.99/395.18 c redcost : 0.00 0 0 0 0 0
394.99/395.18 c impliedbounds : 0.00 0 0 0 0 0
394.99/395.18 c intobj : 0.00 0 0 0 0 0
394.99/395.18 c cgmip : 0.00 0 0 0 0 0
394.99/395.18 c gomory : 0.00 0 0 0 0 0
394.99/395.18 c strongcg : 0.00 0 0 0 0 0
394.99/395.18 c cmir : 0.00 0 0 0 0 0
394.99/395.18 c flowcover : 0.00 0 0 0 0 0
394.99/395.18 c clique : 0.00 0 0 0 0 0
394.99/395.18 c zerohalf : 0.00 0 0 0 0 0
394.99/395.18 c mcf : 0.00 0 0 0 0 0
394.99/395.18 c rapidlearning : 0.00 0 0 0 0 0
394.99/395.18 c Pricers : Time Calls Vars
394.99/395.18 c problem variables: 0.00 0 0
394.99/395.18 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
394.99/395.18 c relpscost : 0.00 0 0 0 0 0 0
394.99/395.18 c pscost : 0.00 0 0 0 0 0 0
394.99/395.18 c inference : 14.87 40897 0 0 0 0 81794
394.99/395.18 c mostinf : 0.00 0 0 0 0 0 0
394.99/395.18 c leastinf : 0.00 0 0 0 0 0 0
394.99/395.18 c fullstrong : 0.00 0 0 0 0 0 0
394.99/395.18 c allfullstrong : 0.00 0 0 0 0 0 0
394.99/395.18 c random : 0.00 0 0 0 0 0 0
394.99/395.18 c Primal Heuristics : Time Calls Found
394.99/395.18 c LP solutions : 0.00 - 0
394.99/395.18 c pseudo solutions : 0.00 - 0
394.99/395.18 c trivial : 0.01 1 0
394.99/395.18 c simplerounding : 0.00 0 0
394.99/395.18 c zirounding : 0.00 0 0
394.99/395.18 c rounding : 0.00 0 0
394.99/395.18 c shifting : 0.00 0 0
394.99/395.18 c intshifting : 0.00 0 0
394.99/395.18 c oneopt : 0.00 0 0
394.99/395.18 c twoopt : 0.00 0 0
394.99/395.18 c fixandinfer : 0.00 0 0
394.99/395.18 c feaspump : 0.00 0 0
394.99/395.18 c coefdiving : 0.00 0 0
394.99/395.18 c pscostdiving : 0.00 0 0
394.99/395.18 c fracdiving : 0.00 0 0
394.99/395.18 c veclendiving : 0.00 0 0
394.99/395.18 c intdiving : 0.00 0 0
394.99/395.18 c actconsdiving : 0.00 0 0
394.99/395.18 c objpscostdiving : 0.00 0 0
394.99/395.18 c rootsoldiving : 0.00 0 0
394.99/395.18 c linesearchdiving : 0.00 0 0
394.99/395.18 c guideddiving : 0.00 0 0
394.99/395.18 c octane : 0.00 0 0
394.99/395.18 c rens : 0.00 0 0
394.99/395.18 c rins : 0.00 0 0
394.99/395.18 c localbranching : 0.00 0 0
394.99/395.18 c mutation : 0.00 0 0
394.99/395.18 c crossover : 0.00 0 0
394.99/395.18 c dins : 0.00 0 0
394.99/395.18 c undercover : 0.00 0 0
394.99/395.18 c nlp : 0.00 0 0
394.99/395.18 c trysol : 0.00 0 0
394.99/395.18 c LP : Time Calls Iterations Iter/call Iter/sec
394.99/395.18 c primal LP : 0.00 0 0 0.00 -
394.99/395.18 c dual LP : 0.00 0 0 0.00 -
394.99/395.18 c lex dual LP : 0.00 0 0 0.00 -
394.99/395.18 c barrier LP : 0.00 0 0 0.00 -
394.99/395.18 c diving/probing LP: 0.00 0 0 0.00 -
394.99/395.18 c strong branching : 0.00 0 0 0.00 -
394.99/395.18 c (at root node) : - 0 0 0.00 -
394.99/395.18 c conflict analysis: 0.00 0 0 0.00 -
394.99/395.18 c B&B Tree :
394.99/395.18 c number of runs : 1
394.99/395.18 c nodes : 62770
394.99/395.18 c nodes (total) : 62770
394.99/395.18 c nodes left : 0
394.99/395.18 c max depth : 61
394.99/395.18 c max depth (total): 61
394.99/395.18 c backtracks : 18339 (29.2%)
394.99/395.18 c delayed cutoffs : 19025
394.99/395.18 c repropagations : 67328 (3230841 domain reductions, 11702 cutoffs)
394.99/395.18 c avg switch length: 10.10
394.99/395.18 c switching time : 117.17
394.99/395.18 c Solution :
394.99/395.18 c Solutions found : 0 (0 improvements)
394.99/395.18 c Primal Bound : infeasible
394.99/395.18 c Dual Bound : -
394.99/395.18 c Gap : 0.00 %
394.99/395.18 c Root Dual Bound : +0.00000000000000e+00
394.99/395.18 c Root Iterations : 0
395.08/395.28 c Time complete: 395.17.