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-2703993-1278548306.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 | 107 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 134 | - |1160k| 0 | 50 | 169 | 223 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 168 | - |1406k| 0 | 57 | 169 | 223 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 219 | - |1653k| 0 | 57 | 169 | 223 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 279 | - |1699k| 0 | 57 | 169 | 223 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 319 | - |1707k| 0 | 60 | 169 | 223 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 342 | - |1671k| 0 | 60 | 169 | 185 | 169 | 107 | 34 | 0 | 8 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 357 | - |1651k| 0 | 60 | 169 | 165 | 169 | 107 | 34 | 0 | 15 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 0 | 403 | - |1634k| 0 | 50 | 169 | 147 | 169 | 107 | 34 | 0 | 22 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 456 | - |1625k| 0 | 53 | 169 | 139 | 169 | 107 | 34 | 0 | 28 | 0.000000e+00 | -- | Inf
0.99/1.06 c 1.0s| 1 | 0 | 505 | - |1617k| 0 | 52 | 169 | 132 | 169 | 107 | 34 | 0 | 37 | 0.000000e+00 | -- | Inf
1.29/1.30 c 1.3s| 1 | 0 | 545 | - |1585k| 0 | 47 | 169 | 104 | 169 | 96 | 34 | 0 | 49 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 545 | - |1585k| 0 | - | 169 | 104 | 169 | 96 | 34 | 0 | 58 | 0.000000e+00 | -- | Inf
1.39/1.42 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.39/1.42 c
1.39/1.42 c (restart) converted 23 cuts from the global cut pool into linear constraints
1.39/1.42 c
1.39/1.42 c presolving:
1.39/1.43 c (round 1) 35 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 56 upgd conss, 14 impls, 79 clqs
1.39/1.44 c (round 2) 35 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 56 upgd conss, 14 impls, 79 clqs
1.39/1.44 c presolving (3 rounds):
1.39/1.44 c 35 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.44 c 14 implications, 79 cliques
1.39/1.44 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 123 constraints
1.39/1.44 c 10 constraints of type <knapsack>
1.39/1.44 c 80 constraints of type <setppc>
1.39/1.44 c 33 constraints of type <logicor>
1.39/1.44 c transformed objective value is always integral (scale: 1)
1.39/1.44 c Presolving Time: 0.03
1.39/1.44 c
1.39/1.44 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.44 c 1.4s| 1 | 0 | 641 | - | 895k| 0 | 40 | 134 | 123 | 134 | 90 | 0 | 0 | 58 | 0.000000e+00 | -- | Inf
1.39/1.47 c 1.5s| 1 | 0 | 683 | - |1186k| 0 | 48 | 134 | 123 | 134 | 105 | 15 | 0 | 58 | 0.000000e+00 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 730 | - |1186k| 0 | 42 | 134 | 123 | 134 | 105 | 15 | 0 | 69 | 0.000000e+00 | -- | Inf
1.59/1.69 c 1.7s| 1 | 0 | 824 | - |1185k| 0 | 39 | 134 | 120 | 134 | 105 | 15 | 0 | 77 | 0.000000e+00 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 854 | - |1185k| 0 | 39 | 134 | 120 | 134 | 105 | 15 | 0 | 82 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 854 | - |1185k| 0 | 39 | 134 | 120 | 134 | 105 | 15 | 0 | 83 | -- | -- | 0.00%
1.69/1.74 c
1.69/1.74 c SCIP Status : problem is solved [infeasible]
1.69/1.74 c Solving Time (sec) : 1.72
1.69/1.74 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
1.69/1.74 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.69/1.74 c Dual Bound : +1.00000000000000e+20
1.69/1.74 c Gap : 0.00 %
1.69/1.74 s UNSATISFIABLE
1.69/1.74 c SCIP Status : problem is solved [infeasible]
1.69/1.74 c Solving Time : 1.72
1.69/1.74 c Original Problem :
1.69/1.74 c Problem name : HOME/instance-2703993-1278548306.opb
1.69/1.74 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.74 c Constraints : 101 initial, 101 maximal
1.69/1.74 c Presolved Problem :
1.69/1.74 c Problem name : t_HOME/instance-2703993-1278548306.opb
1.69/1.74 c Variables : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.74 c Constraints : 123 initial, 123 maximal
1.69/1.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.74 c trivial : 0.00 35 0 0 0 0 0 0 0
1.69/1.74 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c probing : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c knapsack : 0.01 0 0 0 0 0 0 0 0
1.69/1.74 c setppc : 0.00 0 0 0 0 0 4 0 0
1.69/1.74 c linear : 0.01 0 0 0 0 0 28 0 0
1.69/1.74 c logicor : 0.00 0 0 0 0 0 0 0 0
1.69/1.74 c root node : - 50 - - 50 - - - -
1.69/1.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.74 c integral : 0 0 0 11 0 1 50 0 0 0
1.69/1.74 c knapsack : 10 6 11 0 0 0 0 0 0 0
1.69/1.74 c setppc : 80 6 11 0 0 0 0 0 0 0
1.69/1.74 c logicor : 33 1 3 0 0 0 0 0 0 0
1.69/1.74 c countsols : 0 0 0 0 0 0 0 0 0 0
1.69/1.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.74 c integral : 1.34 0.00 0.00 1.34 0.00
1.69/1.74 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.69/1.74 c setppc : 0.00 0.00 0.00 0.00 0.00
1.69/1.74 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.74 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.74 c Propagators : Time Calls Cutoffs DomReds
1.69/1.74 c vbounds : 0.00 2 0 0
1.69/1.74 c rootredcost : 0.00 0 0 0
1.69/1.74 c pseudoobj : 0.00 0 0 0
1.69/1.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.74 c applied globally : - - - 0 0.0 - - -
1.69/1.74 c applied locally : - - - 0 0.0 - - -
1.69/1.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 91)
1.69/1.74 c redcost : 0.00 6 0 0 0 0
1.69/1.74 c impliedbounds : 0.00 6 0 0 0 0
1.69/1.74 c intobj : 0.00 0 0 0 0 0
1.69/1.74 c cgmip : 0.00 0 0 0 0 0
1.69/1.74 c gomory : 0.04 6 0 0 19 0
1.69/1.74 c strongcg : 0.05 6 0 0 246 0
1.69/1.74 c cmir : 0.00 0 0 0 0 0
1.69/1.74 c flowcover : 0.00 0 0 0 0 0
1.69/1.74 c clique : 0.00 6 0 0 27 0
1.69/1.74 c zerohalf : 0.00 0 0 0 0 0
1.69/1.74 c mcf : 0.00 2 0 0 0 0
1.69/1.74 c rapidlearning : 0.16 1 0 0 0 150
1.69/1.74 c Pricers : Time Calls Vars
1.69/1.74 c problem variables: 0.00 0 0
1.69/1.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.74 c relpscost : 1.34 11 1 50 0 0 0
1.69/1.74 c pscost : 0.00 0 0 0 0 0 0
1.69/1.74 c inference : 0.00 0 0 0 0 0 0
1.69/1.74 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.74 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.74 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.74 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.74 c random : 0.00 0 0 0 0 0 0
1.69/1.74 c Primal Heuristics : Time Calls Found
1.69/1.74 c LP solutions : 0.00 - 0
1.69/1.74 c pseudo solutions : 0.00 - 0
1.69/1.74 c trivial : 0.00 1 0
1.69/1.74 c simplerounding : 0.00 0 0
1.69/1.74 c zirounding : 0.00 0 0
1.69/1.74 c rounding : 0.00 0 0
1.69/1.74 c shifting : 0.00 0 0
1.69/1.74 c intshifting : 0.00 0 0
1.69/1.74 c oneopt : 0.00 0 0
1.69/1.74 c twoopt : 0.00 0 0
1.69/1.74 c fixandinfer : 0.00 0 0
1.69/1.74 c feaspump : 0.00 0 0
1.69/1.74 c coefdiving : 0.00 0 0
1.69/1.74 c pscostdiving : 0.00 0 0
1.69/1.74 c fracdiving : 0.00 0 0
1.69/1.74 c veclendiving : 0.00 0 0
1.69/1.74 c intdiving : 0.00 0 0
1.69/1.74 c actconsdiving : 0.00 0 0
1.69/1.74 c objpscostdiving : 0.00 0 0
1.69/1.74 c rootsoldiving : 0.00 0 0
1.69/1.74 c linesearchdiving : 0.00 0 0
1.69/1.74 c guideddiving : 0.00 0 0
1.69/1.74 c octane : 0.00 0 0
1.69/1.74 c rens : 0.00 0 0
1.69/1.74 c rins : 0.00 0 0
1.69/1.74 c localbranching : 0.00 0 0
1.69/1.74 c mutation : 0.00 0 0
1.69/1.74 c crossover : 0.00 0 0
1.69/1.74 c dins : 0.00 0 0
1.69/1.74 c undercover : 0.00 0 0
1.69/1.74 c nlp : 0.00 0 0
1.69/1.74 c trysol : 0.00 0 0
1.69/1.74 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.74 c primal LP : 0.00 0 0 0.00 -
1.69/1.74 c dual LP : 0.07 17 854 50.24 12559.19
1.69/1.74 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.74 c barrier LP : 0.00 0 0 0.00 -
1.69/1.74 c diving/probing LP: 0.00 0 0 0.00 -
1.69/1.74 c strong branching : 1.34 83 13868 167.08 10380.61
1.69/1.74 c (at root node) : - 83 13868 167.08 -
1.69/1.74 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.74 c B&B Tree :
1.69/1.74 c number of runs : 2
1.69/1.74 c nodes : 1
1.69/1.74 c nodes (total) : 2
1.69/1.74 c nodes left : 0
1.69/1.74 c max depth : 0
1.69/1.74 c max depth (total): 0
1.69/1.74 c backtracks : 0 (0.0%)
1.69/1.74 c delayed cutoffs : 0
1.69/1.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.69/1.74 c avg switch length: 2.00
1.69/1.74 c switching time : 0.00
1.69/1.74 c Solution :
1.69/1.74 c Solutions found : 0 (0 improvements)
1.69/1.74 c Primal Bound : infeasible
1.69/1.74 c Dual Bound : -
1.69/1.74 c Gap : 0.00 %
1.69/1.74 c Root Dual Bound : -
1.69/1.74 c Root Iterations : 854
1.69/1.74 c Time complete: 1.74.