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-2704038-1278548334.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 = 1790
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 | 123 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 163 | - |1118k| 0 | 46 | 169 | 183 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 205 | - |1331k| 0 | 50 | 169 | 183 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 242 | - |1508k| 0 | 53 | 169 | 183 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 313 | - |1600k| 0 | 54 | 169 | 183 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 337 | - |1609k| 0 | 60 | 169 | 183 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.45 c 0.4s| 1 | 0 | 373 | - |1594k| 0 | 59 | 169 | 169 | 169 | 108 | 35 | 0 | 9 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 462 | - |1563k| 0 | 48 | 169 | 141 | 169 | 108 | 35 | 0 | 20 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 509 | - |1562k| 0 | 41 | 169 | 140 | 169 | 108 | 35 | 0 | 30 | 0.000000e+00 | -- | Inf
0.69/0.79 c 0.8s| 1 | 0 | 543 | - |1560k| 0 | 42 | 169 | 138 | 169 | 108 | 35 | 0 | 36 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 559 | - |1552k| 0 | 42 | 169 | 131 | 169 | 108 | 35 | 0 | 41 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 579 | - |1535k| 0 | 42 | 169 | 114 | 169 | 99 | 35 | 0 | 46 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.9s| 1 | 0 | 579 | - |1535k| 0 | - | 169 | 114 | 169 | 99 | 35 | 0 | 51 | 0.000000e+00 | -- | Inf
0.79/0.87 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.79/0.87 c
0.79/0.87 c (restart) converted 26 cuts from the global cut pool into linear constraints
0.79/0.87 c
0.79/0.87 c presolving:
0.79/0.88 c (round 1) 35 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
0.79/0.88 c (round 2) 35 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
0.79/0.88 c (round 3) 35 del vars, 9 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 64 upgd conss, 18 impls, 81 clqs
0.79/0.89 c (round 4) 35 del vars, 11 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 64 upgd conss, 18 impls, 81 clqs
0.79/0.89 c presolving (5 rounds):
0.79/0.89 c 35 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.79/0.89 c 18 implications, 81 cliques
0.79/0.89 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 129 constraints
0.79/0.89 c 7 constraints of type <knapsack>
0.79/0.89 c 85 constraints of type <setppc>
0.79/0.89 c 37 constraints of type <logicor>
0.79/0.89 c transformed objective value is always integral (scale: 1)
0.79/0.89 c Presolving Time: 0.03
0.79/0.89 c
0.89/0.90 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.90 c 0.9s| 1 | 0 | 702 | - | 867k| 0 | 43 | 134 | 129 | 134 | 92 | 0 | 0 | 51 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 752 | - |1085k| 0 | 43 | 134 | 129 | 134 | 102 | 10 | 0 | 51 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 752 | - |1085k| 0 | 43 | 134 | 129 | 134 | 102 | 10 | 0 | 53 | -- | -- | 0.00%
0.89/0.94 c
0.89/0.94 c SCIP Status : problem is solved [infeasible]
0.89/0.94 c Solving Time (sec) : 0.92
0.89/0.94 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.89/0.94 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.89/0.94 c Dual Bound : +1.00000000000000e+20
0.89/0.94 c Gap : 0.00 %
0.89/0.94 s UNSATISFIABLE
0.89/0.94 c SCIP Status : problem is solved [infeasible]
0.89/0.94 c Solving Time : 0.92
0.89/0.94 c Original Problem :
0.89/0.94 c Problem name : HOME/instance-2704038-1278548334.opb
0.89/0.94 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.94 c Constraints : 101 initial, 101 maximal
0.89/0.94 c Presolved Problem :
0.89/0.94 c Problem name : t_HOME/instance-2704038-1278548334.opb
0.89/0.94 c Variables : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.94 c Constraints : 129 initial, 129 maximal
0.89/0.94 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.94 c trivial : 0.00 35 0 0 0 0 0 0 0
0.89/0.94 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c knapsack : 0.01 0 0 0 0 0 0 0 0
0.89/0.94 c setppc : 0.01 0 0 0 0 0 2 0 0
0.89/0.94 c linear : 0.01 0 0 0 0 0 33 1 0
0.89/0.94 c logicor : 0.00 0 0 0 0 0 4 0 0
0.89/0.94 c root node : - 35 - - 35 - - - -
0.89/0.94 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.94 c integral : 0 0 0 8 0 1 35 0 0 0
0.89/0.94 c knapsack : 7 6 8 0 0 0 0 0 0 0
0.89/0.94 c setppc : 85 6 8 0 0 0 0 0 0 0
0.89/0.94 c logicor : 37 1 1 0 0 0 0 0 0 0
0.89/0.94 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.94 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.94 c integral : 0.57 0.00 0.00 0.57 0.00
0.89/0.94 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c Propagators : Time Calls Cutoffs DomReds
0.89/0.94 c vbounds : 0.00 2 0 0
0.89/0.94 c rootredcost : 0.00 0 0 0
0.89/0.94 c pseudoobj : 0.00 0 0 0
0.89/0.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.94 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.94 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.94 c applied globally : - - - 0 0.0 - - -
0.89/0.94 c applied locally : - - - 0 0.0 - - -
0.89/0.94 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.94 c cut pool : 0.00 0 - - 0 - (maximal pool size: 68)
0.89/0.94 c redcost : 0.00 6 0 0 0 0
0.89/0.94 c impliedbounds : 0.00 6 0 0 0 0
0.89/0.94 c intobj : 0.00 0 0 0 0 0
0.89/0.94 c cgmip : 0.00 0 0 0 0 0
0.89/0.94 c gomory : 0.04 6 0 0 8 0
0.89/0.94 c strongcg : 0.05 6 0 0 231 0
0.89/0.94 c cmir : 0.00 0 0 0 0 0
0.89/0.94 c flowcover : 0.00 0 0 0 0 0
0.89/0.94 c clique : 0.00 6 0 0 30 0
0.89/0.94 c zerohalf : 0.00 0 0 0 0 0
0.89/0.94 c mcf : 0.00 2 0 0 0 0
0.89/0.94 c rapidlearning : 0.16 1 0 0 0 110
0.89/0.94 c Pricers : Time Calls Vars
0.89/0.94 c problem variables: 0.00 0 0
0.89/0.94 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.94 c relpscost : 0.57 8 1 35 0 0 0
0.89/0.94 c pscost : 0.00 0 0 0 0 0 0
0.89/0.94 c inference : 0.00 0 0 0 0 0 0
0.89/0.94 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.94 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.94 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.94 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.94 c random : 0.00 0 0 0 0 0 0
0.89/0.94 c Primal Heuristics : Time Calls Found
0.89/0.94 c LP solutions : 0.00 - 0
0.89/0.94 c pseudo solutions : 0.00 - 0
0.89/0.94 c trivial : 0.00 1 0
0.89/0.94 c simplerounding : 0.00 0 0
0.89/0.94 c zirounding : 0.00 0 0
0.89/0.94 c rounding : 0.00 0 0
0.89/0.94 c shifting : 0.00 0 0
0.89/0.94 c intshifting : 0.00 0 0
0.89/0.94 c oneopt : 0.00 0 0
0.89/0.94 c twoopt : 0.00 0 0
0.89/0.94 c fixandinfer : 0.00 0 0
0.89/0.94 c feaspump : 0.00 0 0
0.89/0.94 c coefdiving : 0.00 0 0
0.89/0.94 c pscostdiving : 0.00 0 0
0.89/0.94 c fracdiving : 0.00 0 0
0.89/0.94 c veclendiving : 0.00 0 0
0.89/0.94 c intdiving : 0.00 0 0
0.89/0.94 c actconsdiving : 0.00 0 0
0.89/0.94 c objpscostdiving : 0.00 0 0
0.89/0.94 c rootsoldiving : 0.00 0 0
0.89/0.94 c linesearchdiving : 0.00 0 0
0.89/0.94 c guideddiving : 0.00 0 0
0.89/0.94 c octane : 0.00 0 0
0.89/0.94 c rens : 0.00 0 0
0.89/0.94 c rins : 0.00 0 0
0.89/0.94 c localbranching : 0.00 0 0
0.89/0.94 c mutation : 0.00 0 0
0.89/0.94 c crossover : 0.00 0 0
0.89/0.94 c dins : 0.00 0 0
0.89/0.94 c undercover : 0.00 0 0
0.89/0.94 c nlp : 0.00 0 0
0.89/0.94 c trysol : 0.00 0 0
0.89/0.94 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.94 c primal LP : 0.00 0 0 0.00 -
0.89/0.94 c dual LP : 0.05 14 752 53.71 15346.94
0.89/0.94 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.94 c barrier LP : 0.00 0 0 0.00 -
0.89/0.94 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.94 c strong branching : 0.57 53 6299 118.85 11109.70
0.89/0.94 c (at root node) : - 53 6299 118.85 -
0.89/0.94 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.94 c B&B Tree :
0.89/0.94 c number of runs : 2
0.89/0.94 c nodes : 1
0.89/0.94 c nodes (total) : 2
0.89/0.94 c nodes left : 0
0.89/0.94 c max depth : 0
0.89/0.94 c max depth (total): 0
0.89/0.94 c backtracks : 0 (0.0%)
0.89/0.94 c delayed cutoffs : 0
0.89/0.94 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.94 c avg switch length: 2.00
0.89/0.94 c switching time : 0.00
0.89/0.94 c Solution :
0.89/0.94 c Solutions found : 0 (0 improvements)
0.89/0.94 c Primal Bound : infeasible
0.89/0.94 c Dual Bound : -
0.89/0.94 c Gap : 0.00 %
0.89/0.94 c Root Dual Bound : -
0.89/0.94 c Root Iterations : 752
0.89/0.95 c Time complete: 0.94.