0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704036-1278548333.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.02 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 72 constraints of type <setppc>
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.3
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 = 1789.99
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = 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 | 84 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 107 | - |1159k| 0 | 54 | 169 | 207 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 131 | - |1323k| 0 | 57 | 169 | 207 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 160 | - |1415k| 0 | 58 | 169 | 207 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 195 | - |1449k| 0 | 64 | 169 | 207 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.30 c 0.3s| 1 | 0 | 209 | - |1462k| 0 | 67 | 169 | 207 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.40/0.49 c 0.5s| 1 | 0 | 218 | - |1456k| 0 | 65 | 169 | 200 | 169 | 108 | 35 | 0 | 10 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 230 | - |1443k| 0 | 67 | 169 | 188 | 169 | 108 | 35 | 0 | 21 | 0.000000e+00 | -- | Inf
0.89/0.95 c 0.9s| 1 | 0 | 236 | - |1430k| 0 | 66 | 169 | 176 | 169 | 108 | 35 | 0 | 34 | 0.000000e+00 | -- | Inf
1.09/1.14 c 1.1s| 1 | 0 | 243 | - |1410k| 0 | 65 | 169 | 159 | 169 | 108 | 35 | 0 | 45 | 0.000000e+00 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 249 | - |1407k| 0 | 65 | 169 | 156 | 169 | 108 | 35 | 0 | 57 | 0.000000e+00 | -- | Inf
1.49/1.57 c 1.6s| 1 | 0 | 257 | - |1406k| 0 | 67 | 169 | 155 | 169 | 106 | 35 | 0 | 69 | 0.000000e+00 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 265 | - |1401k| 0 | 66 | 169 | 151 | 169 | 106 | 35 | 0 | 77 | 0.000000e+00 | -- | Inf
1.79/1.89 c 1.9s| 1 | 0 | 271 | - |1385k| 0 | 67 | 169 | 136 | 169 | 106 | 35 | 0 | 89 | 0.000000e+00 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 282 | - |1385k| 0 | 65 | 169 | 136 | 169 | 106 | 35 | 0 | 100 | 0.000000e+00 | -- | Inf
2.10/2.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.14 c 2.1s| 1 | 0 | 282 | - |1385k| 0 | - | 169 | 136 | 169 | 106 | 35 | 0 | 105 | 0.000000e+00 | -- | Inf
2.10/2.14 c (run 1, node 1) restarting after 34 global fixings of integer variables
2.10/2.14 c
2.10/2.14 c (restart) converted 33 cuts from the global cut pool into linear constraints
2.10/2.14 c
2.10/2.14 c presolving:
2.10/2.14 c (round 1) 34 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 88 clqs
2.10/2.15 c (round 2) 34 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 88 clqs
2.10/2.15 c (round 3) 34 del vars, 8 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 92 upgd conss, 12 impls, 88 clqs
2.10/2.16 c presolving (4 rounds):
2.10/2.16 c 34 deleted vars, 8 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
2.10/2.16 c 12 implications, 88 cliques
2.10/2.16 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 161 constraints
2.10/2.16 c 12 constraints of type <knapsack>
2.10/2.16 c 89 constraints of type <setppc>
2.10/2.16 c 60 constraints of type <logicor>
2.10/2.16 c transformed objective value is always integral (scale: 1)
2.10/2.16 c Presolving Time: 0.04
2.10/2.16 c
2.10/2.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.17 c 2.2s| 1 | 0 | 375 | - | 939k| 0 | 47 | 135 | 161 | 135 | 101 | 0 | 0 | 105 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.2s| 1 | 0 | 407 | - |1177k| 0 | 56 | 135 | 161 | 135 | 113 | 12 | 0 | 105 | 0.000000e+00 | -- | Inf
2.39/2.41 c 2.4s| 1 | 2 | 407 | - |1178k| 0 | 56 | 135 | 161 | 135 | 113 | 12 | 0 | 122 | 0.000000e+00 | -- | Inf
3.99/4.07 c
3.99/4.07 c SCIP Status : problem is solved [infeasible]
3.99/4.07 c Solving Time (sec) : 4.06
3.99/4.07 c Solving Nodes : 17 (total of 18 nodes in 2 runs)
3.99/4.07 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.99/4.07 c Dual Bound : +1.00000000000000e+20
3.99/4.07 c Gap : 0.00 %
3.99/4.07 s UNSATISFIABLE
3.99/4.07 c SCIP Status : problem is solved [infeasible]
3.99/4.07 c Solving Time : 4.06
3.99/4.07 c Original Problem :
3.99/4.07 c Problem name : HOME/instance-2704036-1278548333.opb
3.99/4.07 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.07 c Constraints : 101 initial, 101 maximal
3.99/4.07 c Presolved Problem :
3.99/4.07 c Problem name : t_HOME/instance-2704036-1278548333.opb
3.99/4.07 c Variables : 135 (135 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.07 c Constraints : 161 initial, 161 maximal
3.99/4.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.07 c trivial : 0.00 34 0 0 0 0 0 0 0
3.99/4.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c knapsack : 0.01 0 0 0 0 0 0 0 0
3.99/4.07 c setppc : 0.00 0 0 0 0 0 1 0 0
3.99/4.07 c linear : 0.01 0 0 0 0 0 34 3 0
3.99/4.07 c logicor : 0.00 0 0 0 0 0 1 0 0
3.99/4.07 c root node : - 86 - - 86 - - - -
3.99/4.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.07 c integral : 0 0 0 81 0 9 246 0 0 16
3.99/4.07 c knapsack : 12 6 92 0 0 0 0 0 0 0
3.99/4.07 c setppc : 89 6 92 0 0 0 244 0 0 0
3.99/4.07 c logicor : 60 1 47 0 0 0 0 0 0 0
3.99/4.07 c countsols : 0 0 0 0 0 0 0 0 0 0
3.99/4.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.07 c integral : 3.61 0.00 0.00 3.61 0.00
3.99/4.07 c knapsack : 0.01 0.00 0.00 0.00 0.00
3.99/4.07 c setppc : 0.00 0.00 0.00 0.00 0.00
3.99/4.07 c logicor : 0.00 0.00 0.00 0.00 0.00
3.99/4.07 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.07 c Propagators : Time Calls Cutoffs DomReds
3.99/4.07 c vbounds : 0.00 2 0 0
3.99/4.07 c rootredcost : 0.00 0 0 0
3.99/4.07 c pseudoobj : 0.00 0 0 0
3.99/4.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.07 c applied globally : - - - 0 0.0 - - -
3.99/4.07 c applied locally : - - - 0 0.0 - - -
3.99/4.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 75)
3.99/4.07 c redcost : 0.00 22 0 0 0 0
3.99/4.07 c impliedbounds : 0.00 6 0 0 0 0
3.99/4.07 c intobj : 0.00 0 0 0 0 0
3.99/4.07 c cgmip : 0.00 0 0 0 0 0
3.99/4.07 c gomory : 0.04 6 0 0 6 0
3.99/4.07 c strongcg : 0.05 6 0 0 198 0
3.99/4.07 c cmir : 0.00 0 0 0 0 0
3.99/4.07 c flowcover : 0.00 0 0 0 0 0
3.99/4.07 c clique : 0.00 6 0 0 34 0
3.99/4.07 c zerohalf : 0.00 0 0 0 0 0
3.99/4.07 c mcf : 0.00 2 0 0 0 0
3.99/4.07 c rapidlearning : 0.17 1 0 0 0 134
3.99/4.07 c Pricers : Time Calls Vars
3.99/4.07 c problem variables: 0.00 0 0
3.99/4.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.07 c relpscost : 3.61 81 9 246 0 0 16
3.99/4.07 c pscost : 0.00 0 0 0 0 0 0
3.99/4.07 c inference : 0.00 0 0 0 0 0 0
3.99/4.07 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.07 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.07 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.07 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.07 c random : 0.00 0 0 0 0 0 0
3.99/4.07 c Primal Heuristics : Time Calls Found
3.99/4.07 c LP solutions : 0.00 - 0
3.99/4.07 c pseudo solutions : 0.00 - 0
3.99/4.07 c trivial : 0.00 1 0
3.99/4.07 c simplerounding : 0.00 0 0
3.99/4.07 c zirounding : 0.00 0 0
3.99/4.07 c rounding : 0.00 0 0
3.99/4.07 c shifting : 0.00 0 0
3.99/4.07 c intshifting : 0.00 0 0
3.99/4.07 c oneopt : 0.00 0 0
3.99/4.07 c twoopt : 0.00 0 0
3.99/4.07 c fixandinfer : 0.00 0 0
3.99/4.07 c feaspump : 0.00 0 0
3.99/4.07 c coefdiving : 0.00 0 0
3.99/4.07 c pscostdiving : 0.00 0 0
3.99/4.07 c fracdiving : 0.00 0 0
3.99/4.07 c veclendiving : 0.00 0 0
3.99/4.07 c intdiving : 0.00 0 0
3.99/4.07 c actconsdiving : 0.00 0 0
3.99/4.07 c objpscostdiving : 0.00 0 0
3.99/4.07 c rootsoldiving : 0.00 0 0
3.99/4.07 c linesearchdiving : 0.00 0 0
3.99/4.07 c guideddiving : 0.00 0 0
3.99/4.07 c octane : 0.00 0 0
3.99/4.07 c rens : 0.00 0 0
3.99/4.07 c rins : 0.00 0 0
3.99/4.07 c localbranching : 0.00 0 0
3.99/4.07 c mutation : 0.00 0 0
3.99/4.07 c crossover : 0.00 0 0
3.99/4.07 c dins : 0.00 0 0
3.99/4.07 c undercover : 0.00 0 0
3.99/4.07 c nlp : 0.00 0 0
3.99/4.07 c trysol : 0.00 0 0
3.99/4.07 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.07 c primal LP : 0.00 0 0 0.00 -
3.99/4.07 c dual LP : 0.12 87 1583 18.20 12664.30
3.99/4.07 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.07 c barrier LP : 0.00 0 0 0.00 -
3.99/4.07 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.07 c strong branching : 3.60 566 43031 76.03 11946.59
3.99/4.07 c (at root node) : - 122 19437 159.32 -
3.99/4.07 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.07 c B&B Tree :
3.99/4.07 c number of runs : 2
3.99/4.07 c nodes : 17
3.99/4.07 c nodes (total) : 18
3.99/4.07 c nodes left : 0
3.99/4.07 c max depth : 6
3.99/4.07 c max depth (total): 6
3.99/4.07 c backtracks : 3 (17.6%)
3.99/4.07 c delayed cutoffs : 0
3.99/4.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.99/4.07 c avg switch length: 2.00
3.99/4.07 c switching time : 0.00
3.99/4.07 c Solution :
3.99/4.07 c Solutions found : 0 (0 improvements)
3.99/4.07 c Primal Bound : infeasible
3.99/4.07 c Dual Bound : -
3.99/4.07 c Gap : 0.00 %
3.99/4.07 c Root Dual Bound : +0.00000000000000e+00
3.99/4.07 c Root Iterations : 407
3.99/4.08 c Time complete: 4.07.