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-2664365-1276278764.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.27 c 2.0s| 10000 | 7221 | 0 | 0.0 |5619k| 75 | - | 169 |2469 | 0 | 0 | 0 |2508 | 0 | 0.000000e+00 | -- | Inf
6.39/6.41 c 6.0s| 20000 | 12678 | 0 | 0.0 |9988k| 75 | - | 169 |3180 | 0 | 0 | 0 |6424 | 0 | 0.000000e+00 | -- | Inf
11.39/11.46 c 10.8s| 30000 | 17303 | 0 | 0.0 | 14M| 75 | - | 169 |4522 | 0 | 0 | 0 | 11k| 0 | 0.000000e+00 | -- | Inf
18.79/18.87 c 17.9s| 40000 | 20281 | 0 | 0.0 | 18M| 75 | - | 169 |6052 | 0 | 0 | 0 | 17k| 0 | 0.000000e+00 | -- | Inf
29.98/30.05 c 28.8s| 50000 | 20985 | 0 | 0.0 | 21M| 75 | - | 169 |5730 | 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
39.78/39.84 c 38.3s| 60000 | 23371 | 0 | 0.0 | 25M| 75 | - | 169 |7773 | 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
52.97/53.03 c 51.2s| 70000 | 24687 | 0 | 0.0 | 28M| 75 | - | 169 |9748 | 0 | 0 | 0 | 39k| 0 | 0.000000e+00 | -- | Inf
70.28/70.32 c 68.2s| 80000 | 24633 | 0 | 0.0 | 31M| 75 | - | 169 | 11k| 0 | 0 | 0 | 48k| 0 | 0.000000e+00 | -- | Inf
90.76/90.84 c 88.4s| 90000 | 23363 | 0 | 0.0 | 33M| 75 | - | 169 | 12k| 0 | 0 | 0 | 57k| 0 | 0.000000e+00 | -- | Inf
118.76/118.82 c 116s|100000 | 19863 | 0 | 0.0 | 31M| 75 | - | 169 | 13k| 0 | 0 | 0 | 69k| 0 | 0.000000e+00 | -- | Inf
149.34/149.44 c 146s|110000 | 15932 | 0 | 0.0 | 30M| 75 | - | 169 | 16k| 0 | 0 | 0 | 81k| 0 | 0.000000e+00 | -- | Inf
188.33/188.44 c 185s|120000 | 9722 | 0 | 0.0 | 26M| 75 | - | 169 | 20k| 0 | 0 | 0 | 94k| 0 | 0.000000e+00 | -- | Inf
235.32/235.48 c
235.32/235.48 c SCIP Status : problem is solved [infeasible]
235.32/235.48 c Solving Time (sec) : 231.55
235.32/235.48 c Solving Nodes : 127589
235.32/235.48 c Primal Bound : +1.00000000000000e+20 (0 solutions)
235.32/235.48 c Dual Bound : +1.00000000000000e+20
235.32/235.48 c Gap : 0.00 %
235.32/235.48 s UNSATISFIABLE
235.32/235.48 c SCIP Status : problem is solved [infeasible]
235.32/235.48 c Solving Time : 231.55
235.32/235.48 c Original Problem :
235.32/235.48 c Problem name : HOME/instance-2664365-1276278764.opb
235.32/235.48 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
235.32/235.48 c Constraints : 101 initial, 101 maximal
235.32/235.48 c Presolved Problem :
235.32/235.48 c Problem name : t_HOME/instance-2664365-1276278764.opb
235.32/235.48 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
235.32/235.48 c Constraints : 73 initial, 25251 maximal
235.32/235.48 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
235.32/235.48 c trivial : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c dualfix : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c boundshift : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c inttobinary : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c implics : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c probing : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c knapsack : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c setppc : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c linear : 0.01 0 0 0 0 0 28 0 0
235.32/235.48 c logicor : 0.00 0 0 0 0 0 0 0 0
235.32/235.48 c root node : - 0 - - 0 - - - -
235.32/235.48 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
235.32/235.48 c integral : 0 0 0 0 0 0 0 0 0 0
235.32/235.48 c knapsack : 1 0 435448 0 80307 9767 1363447 0 0 0
235.32/235.48 c setppc : 68 0 425681 0 80307 59890 997963 0 0 0
235.32/235.48 c logicor : 4+ 0 187396 0 30881 1017 74451 0 0 0
235.32/235.48 c countsols : 0 0 0 0 80307 0 0 0 0 0
235.32/235.48 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
235.32/235.48 c integral : 0.00 0.00 0.00 0.00 0.00
235.32/235.48 c knapsack : 28.11 0.00 27.45 0.00 0.66
235.32/235.48 c setppc : 9.00 0.00 7.73 0.00 1.27
235.32/235.48 c logicor : 98.09 0.00 98.04 0.00 0.05
235.32/235.48 c countsols : 0.02 0.00 0.00 0.00 0.02
235.32/235.48 c Propagators : Time Calls Cutoffs DomReds
235.32/235.48 c vbounds : 0.27 1 0 0
235.32/235.48 c rootredcost : 0.24 0 0 0
235.32/235.48 c pseudoobj : 0.18 0 0 0
235.32/235.48 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
235.32/235.48 c propagation : 3.73 70674 70643 341704 18.3 1906 21.7 -
235.32/235.48 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
235.32/235.48 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
235.32/235.48 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
235.32/235.48 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
235.32/235.48 c applied globally : - - - 107596 13.6 - - -
235.32/235.48 c applied locally : - - - 661 34.2 - - -
235.32/235.48 c Separators : Time Calls Cutoffs DomReds Cuts Conss
235.32/235.48 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
235.32/235.48 c redcost : 0.00 0 0 0 0 0
235.32/235.48 c impliedbounds : 0.00 0 0 0 0 0
235.32/235.48 c intobj : 0.00 0 0 0 0 0
235.32/235.48 c cgmip : 0.00 0 0 0 0 0
235.32/235.48 c gomory : 0.00 0 0 0 0 0
235.32/235.48 c strongcg : 0.00 0 0 0 0 0
235.32/235.48 c cmir : 0.00 0 0 0 0 0
235.32/235.48 c flowcover : 0.00 0 0 0 0 0
235.32/235.48 c clique : 0.00 0 0 0 0 0
235.32/235.48 c zerohalf : 0.00 0 0 0 0 0
235.32/235.48 c mcf : 0.00 0 0 0 0 0
235.32/235.48 c rapidlearning : 0.00 0 0 0 0 0
235.32/235.48 c Pricers : Time Calls Vars
235.32/235.48 c problem variables: 0.00 0 0
235.32/235.48 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
235.32/235.48 c relpscost : 0.00 0 0 0 0 0 0
235.32/235.48 c pscost : 0.00 0 0 0 0 0 0
235.32/235.48 c inference : 1.11 80307 0 0 0 0 160614
235.32/235.48 c mostinf : 0.00 0 0 0 0 0 0
235.32/235.48 c leastinf : 0.00 0 0 0 0 0 0
235.32/235.48 c fullstrong : 0.00 0 0 0 0 0 0
235.32/235.48 c allfullstrong : 0.00 0 0 0 0 0 0
235.32/235.48 c random : 0.00 0 0 0 0 0 0
235.32/235.48 c Primal Heuristics : Time Calls Found
235.32/235.48 c LP solutions : 0.00 - 0
235.32/235.48 c pseudo solutions : 0.00 - 0
235.32/235.48 c trivial : 0.00 1 0
235.32/235.48 c simplerounding : 0.00 0 0
235.32/235.48 c zirounding : 0.00 0 0
235.32/235.48 c rounding : 0.00 0 0
235.32/235.48 c shifting : 0.00 0 0
235.32/235.48 c intshifting : 0.00 0 0
235.32/235.48 c oneopt : 0.00 0 0
235.32/235.48 c twoopt : 0.00 0 0
235.32/235.48 c fixandinfer : 0.00 0 0
235.32/235.48 c feaspump : 0.00 0 0
235.32/235.48 c coefdiving : 0.00 0 0
235.32/235.48 c pscostdiving : 0.00 0 0
235.32/235.48 c fracdiving : 0.00 0 0
235.32/235.48 c veclendiving : 0.00 0 0
235.32/235.48 c intdiving : 0.00 0 0
235.32/235.48 c actconsdiving : 0.00 0 0
235.32/235.48 c objpscostdiving : 0.00 0 0
235.32/235.48 c rootsoldiving : 0.00 0 0
235.32/235.48 c linesearchdiving : 0.00 0 0
235.32/235.48 c guideddiving : 0.00 0 0
235.32/235.48 c octane : 0.00 0 0
235.32/235.48 c rens : 0.00 0 0
235.32/235.48 c rins : 0.00 0 0
235.32/235.48 c localbranching : 0.00 0 0
235.32/235.48 c mutation : 0.00 0 0
235.32/235.48 c crossover : 0.00 0 0
235.32/235.48 c dins : 0.00 0 0
235.32/235.48 c undercover : 0.00 0 0
235.32/235.48 c nlp : 0.00 0 0
235.32/235.48 c trysol : 0.00 0 0
235.32/235.48 c LP : Time Calls Iterations Iter/call Iter/sec
235.32/235.48 c primal LP : 0.00 0 0 0.00 -
235.32/235.48 c dual LP : 0.00 0 0 0.00 -
235.32/235.48 c lex dual LP : 0.00 0 0 0.00 -
235.32/235.48 c barrier LP : 0.00 0 0 0.00 -
235.32/235.48 c diving/probing LP: 0.00 0 0 0.00 -
235.32/235.48 c strong branching : 0.00 0 0 0.00 -
235.32/235.48 c (at root node) : - 0 0 0.00 -
235.32/235.48 c conflict analysis: 0.00 0 0 0.00 -
235.32/235.48 c B&B Tree :
235.32/235.48 c number of runs : 1
235.32/235.48 c nodes : 127589
235.32/235.48 c nodes (total) : 127589
235.32/235.48 c nodes left : 0
235.32/235.48 c max depth : 75
235.32/235.48 c max depth (total): 75
235.32/235.48 c backtracks : 51141 (40.1%)
235.32/235.48 c delayed cutoffs : 33026
235.32/235.48 c repropagations : 158013 (695064 domain reductions, 23392 cutoffs)
235.32/235.48 c avg switch length: 19.75
235.32/235.48 c switching time : 65.98
235.32/235.48 c Solution :
235.32/235.48 c Solutions found : 0 (0 improvements)
235.32/235.48 c Primal Bound : infeasible
235.32/235.48 c Dual Bound : -
235.32/235.48 c Gap : 0.00 %
235.32/235.48 c Root Dual Bound : +0.00000000000000e+00
235.32/235.48 c Root Iterations : 0
235.41/235.55 c Time complete: 235.47.