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-2667167-1276274064.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 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 # 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.03 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 | 0 | 120 | - | 743k| 0 | 46 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 145 | - |1190k| 0 | 55 | 169 | 231 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 171 | - |1455k| 0 | 59 | 169 | 231 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 209 | - |1569k| 0 | 68 | 169 | 231 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 228 | - |1571k| 0 | 69 | 169 | 231 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 287 | - |1584k| 0 | 69 | 169 | 231 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 294 | - |1576k| 0 | 67 | 169 | 224 | 169 | 111 | 38 | 0 | 10 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 299 | - |1550k| 0 | 69 | 169 | 197 | 169 | 111 | 38 | 0 | 22 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 316 | - |1481k| 0 | 66 | 169 | 137 | 169 | 111 | 38 | 0 | 31 | 0.000000e+00 | -- | Inf
1.39/1.44 c 1.4s| 1 | 0 | 341 | - |1481k| 0 | 69 | 169 | 137 | 169 | 111 | 38 | 0 | 43 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 352 | - |1466k| 0 | 67 | 169 | 123 | 169 | 111 | 38 | 0 | 49 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 360 | - |1464k| 0 | 67 | 169 | 121 | 169 | 105 | 38 | 0 | 55 | 0.000000e+00 | -- | Inf
1.89/1.92 c 1.8s| 1 | 0 | 372 | - |1463k| 0 | 65 | 169 | 120 | 169 | 105 | 38 | 0 | 63 | 0.000000e+00 | -- | Inf
2.09/2.18 c 2.1s| 1 | 0 | 406 | - |1456k| 0 | 69 | 169 | 113 | 169 | 105 | 38 | 0 | 76 | 0.000000e+00 | -- | Inf
2.30/2.33 c 2.2s| 1 | 0 | 406 | - |1456k| 0 | - | 169 | 113 | 169 | 105 | 38 | 0 | 84 | 0.000000e+00 | -- | Inf
2.30/2.33 c (run 1, node 1) restarting after 37 global fixings of integer variables
2.30/2.33 c
2.30/2.33 c (restart) converted 32 cuts from the global cut pool into linear constraints
2.30/2.33 c
2.30/2.33 c presolving:
2.30/2.34 c (round 1) 37 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 85 clqs
2.30/2.35 c (round 2) 37 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 69 upgd conss, 10 impls, 85 clqs
2.30/2.36 c presolving (3 rounds):
2.30/2.36 c 37 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.30/2.36 c 10 implications, 85 cliques
2.30/2.36 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 141 constraints
2.30/2.36 c 15 constraints of type <knapsack>
2.30/2.36 c 85 constraints of type <setppc>
2.30/2.36 c 41 constraints of type <logicor>
2.30/2.36 c transformed objective value is always integral (scale: 1)
2.30/2.36 c Presolving Time: 0.03
2.30/2.36 c
2.30/2.37 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.30/2.37 c 2.3s| 1 | 0 | 524 | - | 959k| 0 | 57 | 132 | 141 | 132 | 104 | 0 | 0 | 84 | 0.000000e+00 | -- | Inf
2.39/2.40 c 2.3s| 1 | 0 | 573 | - |1205k| 0 | 65 | 132 | 141 | 132 | 111 | 7 | 0 | 84 | 0.000000e+00 | -- | Inf
2.79/2.84 c 2.7s| 1 | 2 | 573 | - |1206k| 0 | 65 | 132 | 141 | 132 | 111 | 7 | 0 | 103 | 0.000000e+00 | -- | Inf
4.09/4.17 c
4.09/4.17 c SCIP Status : problem is solved [infeasible]
4.09/4.17 c Solving Time (sec) : 4.02
4.09/4.17 c Solving Nodes : 7 (total of 8 nodes in 2 runs)
4.09/4.17 c Primal Bound : +1.00000000000000e+20 (0 solutions)
4.09/4.17 c Dual Bound : +1.00000000000000e+20
4.09/4.17 c Gap : 0.00 %
4.09/4.17 s UNSATISFIABLE
4.09/4.17 c SCIP Status : problem is solved [infeasible]
4.09/4.17 c Solving Time : 4.02
4.09/4.17 c Original Problem :
4.09/4.17 c Problem name : HOME/instance-2667167-1276274064.opb
4.09/4.17 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.17 c Constraints : 101 initial, 101 maximal
4.09/4.17 c Presolved Problem :
4.09/4.17 c Problem name : t_HOME/instance-2667167-1276274064.opb
4.09/4.17 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.17 c Constraints : 141 initial, 141 maximal
4.09/4.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.09/4.17 c trivial : 0.00 37 0 0 0 0 0 0 0
4.09/4.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.09/4.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.09/4.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.09/4.17 c implics : 0.00 0 0 0 0 0 0 0 0
4.09/4.17 c probing : 0.00 0 0 0 0 0 0 0 0
4.09/4.17 c knapsack : 0.01 0 0 0 0 0 0 0 0
4.09/4.17 c setppc : 0.02 0 0 0 0 0 0 0 0
4.09/4.17 c linear : 0.00 0 0 0 0 0 31 0 0
4.09/4.17 c logicor : 0.00 0 0 0 0 0 1 0 0
4.09/4.17 c root node : - 109 - - 109 - - - -
4.09/4.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.09/4.17 c integral : 0 0 0 42 0 3 126 0 0 6
4.09/4.17 c knapsack : 15 6 48 0 0 0 0 0 0 0
4.09/4.17 c setppc : 85 6 48 0 0 0 96 0 0 0
4.09/4.17 c logicor : 41 6 18 0 0 0 0 0 0 0
4.09/4.17 c countsols : 0 0 0 0 0 0 0 0 0 0
4.09/4.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.09/4.17 c integral : 3.56 0.00 0.00 3.56 0.00
4.09/4.17 c knapsack : 0.01 0.01 0.00 0.00 0.00
4.09/4.17 c setppc : 0.00 0.00 0.00 0.00 0.00
4.09/4.17 c logicor : 0.00 0.00 0.00 0.00 0.00
4.09/4.17 c countsols : 0.00 0.00 0.00 0.00 0.00
4.09/4.17 c Propagators : Time Calls Cutoffs DomReds
4.09/4.17 c vbounds : 0.00 2 0 0
4.09/4.17 c rootredcost : 0.00 0 0 0
4.09/4.17 c pseudoobj : 0.00 0 0 0
4.09/4.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.09/4.17 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.17 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
4.09/4.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.17 c applied globally : - - - 0 0.0 - - -
4.09/4.17 c applied locally : - - - 0 0.0 - - -
4.09/4.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.09/4.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 71)
4.09/4.17 c redcost : 0.00 12 0 0 0 0
4.09/4.17 c impliedbounds : 0.00 6 0 0 0 0
4.09/4.17 c intobj : 0.00 0 0 0 0 0
4.09/4.17 c cgmip : 0.00 0 0 0 0 0
4.09/4.17 c gomory : 0.05 6 0 0 0 0
4.09/4.17 c strongcg : 0.06 6 0 0 213 0
4.09/4.17 c cmir : 0.00 0 0 0 0 0
4.09/4.17 c flowcover : 0.00 0 0 0 0 0
4.09/4.17 c clique : 0.00 6 0 0 31 0
4.09/4.17 c zerohalf : 0.00 0 0 0 0 0
4.09/4.17 c mcf : 0.00 2 0 0 0 0
4.09/4.17 c rapidlearning : 0.16 1 0 0 0 158
4.09/4.17 c Pricers : Time Calls Vars
4.09/4.17 c problem variables: 0.00 0 0
4.09/4.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.09/4.17 c relpscost : 3.56 42 3 126 0 0 6
4.09/4.17 c pscost : 0.00 0 0 0 0 0 0
4.09/4.17 c inference : 0.00 0 0 0 0 0 0
4.09/4.17 c mostinf : 0.00 0 0 0 0 0 0
4.09/4.17 c leastinf : 0.00 0 0 0 0 0 0
4.09/4.17 c fullstrong : 0.00 0 0 0 0 0 0
4.09/4.17 c allfullstrong : 0.00 0 0 0 0 0 0
4.09/4.17 c random : 0.00 0 0 0 0 0 0
4.09/4.17 c Primal Heuristics : Time Calls Found
4.09/4.17 c LP solutions : 0.00 - 0
4.09/4.17 c pseudo solutions : 0.00 - 0
4.09/4.17 c trivial : 0.00 1 0
4.09/4.17 c simplerounding : 0.00 0 0
4.09/4.17 c zirounding : 0.00 0 0
4.09/4.17 c rounding : 0.00 0 0
4.09/4.17 c shifting : 0.00 0 0
4.09/4.17 c intshifting : 0.00 0 0
4.09/4.17 c oneopt : 0.00 0 0
4.09/4.17 c twoopt : 0.00 0 0
4.09/4.17 c fixandinfer : 0.00 0 0
4.09/4.17 c feaspump : 0.00 0 0
4.09/4.17 c coefdiving : 0.00 0 0
4.09/4.17 c pscostdiving : 0.00 0 0
4.09/4.17 c fracdiving : 0.00 0 0
4.09/4.17 c veclendiving : 0.00 0 0
4.09/4.17 c intdiving : 0.00 0 0
4.09/4.17 c actconsdiving : 0.00 0 0
4.09/4.17 c objpscostdiving : 0.00 0 0
4.09/4.17 c rootsoldiving : 0.00 0 0
4.09/4.17 c linesearchdiving : 0.00 0 0
4.09/4.17 c guideddiving : 0.00 0 0
4.09/4.17 c octane : 0.00 0 0
4.09/4.17 c rens : 0.00 0 0
4.09/4.17 c rins : 0.00 0 0
4.09/4.17 c localbranching : 0.00 0 0
4.09/4.17 c mutation : 0.00 0 0
4.09/4.17 c crossover : 0.00 0 0
4.09/4.17 c dins : 0.00 0 0
4.09/4.17 c undercover : 0.00 0 0
4.09/4.17 c nlp : 0.00 0 0
4.09/4.17 c trysol : 0.00 0 0
4.09/4.17 c LP : Time Calls Iterations Iter/call Iter/sec
4.09/4.17 c primal LP : 0.00 0 0 0.00 -
4.09/4.17 c dual LP : 0.13 49 1154 23.55 8876.92
4.09/4.17 c lex dual LP : 0.00 0 0 0.00 -
4.09/4.17 c barrier LP : 0.00 0 0 0.00 -
4.09/4.17 c diving/probing LP: 0.00 0 0 0.00 -
4.09/4.17 c strong branching : 3.56 308 35161 114.16 9876.69
4.09/4.17 c (at root node) : - 103 19879 193.00 -
4.09/4.17 c conflict analysis: 0.00 0 0 0.00 -
4.09/4.17 c B&B Tree :
4.09/4.17 c number of runs : 2
4.09/4.17 c nodes : 7
4.09/4.17 c nodes (total) : 8
4.09/4.17 c nodes left : 0
4.09/4.17 c max depth : 3
4.09/4.17 c max depth (total): 3
4.09/4.17 c backtracks : 0 (0.0%)
4.09/4.17 c delayed cutoffs : 0
4.09/4.17 c repropagations : 1 (0 domain reductions, 0 cutoffs)
4.09/4.17 c avg switch length: 2.29
4.09/4.17 c switching time : 0.00
4.09/4.17 c Solution :
4.09/4.17 c Solutions found : 0 (0 improvements)
4.09/4.17 c Primal Bound : infeasible
4.09/4.17 c Dual Bound : -
4.09/4.17 c Gap : 0.00 %
4.09/4.17 c Root Dual Bound : +0.00000000000000e+00
4.09/4.17 c Root Iterations : 573
4.09/4.18 c Time complete: 4.17.