0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665740-1276274394.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.02
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.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 52 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 82 | - |1147k| 0 | 49 | 169 | 216 | 169 | 88 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 122 | - |1440k| 0 | 58 | 169 | 216 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 168 | - |1723k| 0 | 58 | 169 | 216 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 190 | - |1932k| 0 | 59 | 169 | 216 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 229 | - |2105k| 0 | 56 | 169 | 216 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 251 | - |2059k| 0 | 57 | 169 | 174 | 169 | 105 | 32 | 0 | 12 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 372 | - |2052k| 0 | 53 | 169 | 167 | 169 | 105 | 32 | 0 | 19 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 392 | - |2032k| 0 | 54 | 169 | 148 | 169 | 105 | 32 | 0 | 29 | 0.000000e+00 | -- | Inf
1.00/1.02 c 0.9s| 1 | 0 | 409 | - |2026k| 0 | 54 | 169 | 142 | 169 | 105 | 32 | 0 | 36 | 0.000000e+00 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 456 | - |2014k| 0 | 52 | 169 | 132 | 169 | 105 | 32 | 0 | 42 | 0.000000e+00 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 472 | - |2007k| 0 | 52 | 169 | 124 | 169 | 94 | 32 | 0 | 51 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 484 | - |2005k| 0 | 53 | 169 | 123 | 169 | 94 | 32 | 0 | 57 | 0.000000e+00 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 484 | - |2005k| 0 | - | 169 | 123 | 169 | 94 | 32 | 0 | 66 | 0.000000e+00 | -- | Inf
1.39/1.47 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.39/1.47 c
1.39/1.47 c (restart) converted 21 cuts from the global cut pool into linear constraints
1.39/1.47 c
1.39/1.47 c presolving:
1.39/1.48 c (round 1) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
1.39/1.48 c (round 2) 38 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
1.39/1.48 c (round 3) 38 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 65 upgd conss, 16 impls, 77 clqs
1.39/1.49 c presolving (4 rounds):
1.39/1.49 c 38 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.39/1.49 c 16 implications, 77 cliques
1.39/1.49 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 137 constraints
1.39/1.49 c 8 constraints of type <knapsack>
1.39/1.49 c 77 constraints of type <setppc>
1.39/1.49 c 52 constraints of type <logicor>
1.39/1.49 c transformed objective value is always integral (scale: 1)
1.39/1.49 c Presolving Time: 0.04
1.39/1.49 c
1.49/1.50 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.50 c 1.4s| 1 | 0 | 562 | - | 876k| 0 | 40 | 131 | 137 | 131 | 90 | 0 | 0 | 66 | 0.000000e+00 | -- | Inf
1.49/1.53 c 1.4s| 1 | 0 | 711 | - |1128k| 0 | 43 | 131 | 137 | 131 | 102 | 12 | 0 | 66 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.7s| 1 | 0 | 775 | - |1128k| 0 | 47 | 131 | 137 | 131 | 102 | 12 | 0 | 85 | 0.000000e+00 | -- | Inf
1.89/1.91 c 1.8s| 1 | 0 | 854 | - |1128k| 0 | 48 | 131 | 136 | 131 | 102 | 12 | 0 | 92 | 0.000000e+00 | -- | Inf
1.99/2.03 c 1.9s| 1 | 0 | 1007 | - |1128k| 0 | 43 | 131 | 136 | 131 | 102 | 12 | 0 | 99 | 0.000000e+00 | -- | Inf
1.99/2.09 c 2.0s| 1 | 0 | 1166 | - |1128k| 0 | 43 | 131 | 136 | 131 | 102 | 12 | 0 | 104 | 0.000000e+00 | -- | Inf
1.99/2.09 c 2.0s| 1 | 0 | 1166 | - |1128k| 0 | 43 | 131 | 136 | 131 | 102 | 12 | 0 | 106 | -- | -- | 0.00%
1.99/2.09 c
1.99/2.09 c SCIP Status : problem is solved [infeasible]
1.99/2.09 c Solving Time (sec) : 1.98
1.99/2.09 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
1.99/2.09 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.99/2.09 c Dual Bound : +1.00000000000000e+20
1.99/2.09 c Gap : 0.00 %
1.99/2.09 s UNSATISFIABLE
1.99/2.09 c SCIP Status : problem is solved [infeasible]
1.99/2.09 c Solving Time : 1.98
1.99/2.09 c Original Problem :
1.99/2.09 c Problem name : HOME/instance-2665740-1276274394.opb
1.99/2.09 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09 c Constraints : 101 initial, 101 maximal
1.99/2.09 c Presolved Problem :
1.99/2.09 c Problem name : t_HOME/instance-2665740-1276274394.opb
1.99/2.09 c Variables : 131 (131 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09 c Constraints : 137 initial, 137 maximal
1.99/2.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.99/2.09 c trivial : 0.00 38 0 0 0 0 0 0 0
1.99/2.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c implics : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c probing : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c knapsack : 0.01 0 0 0 0 0 0 0 0
1.99/2.09 c setppc : 0.01 0 0 0 0 0 0 0 0
1.99/2.09 c linear : 0.02 0 0 0 0 0 34 3 0
1.99/2.09 c logicor : 0.00 0 0 0 0 0 1 0 0
1.99/2.09 c root node : - 58 - - 58 - - - -
1.99/2.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.99/2.09 c integral : 0 0 0 13 0 1 58 0 0 0
1.99/2.09 c knapsack : 8 6 13 0 0 0 0 0 0 0
1.99/2.09 c setppc : 77 6 13 0 0 0 0 0 0 0
1.99/2.09 c logicor : 52 6 6 0 0 0 0 0 0 0
1.99/2.09 c countsols : 0 0 0 0 0 0 0 0 0 0
1.99/2.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.99/2.09 c integral : 1.61 0.00 0.00 1.61 0.00
1.99/2.09 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.99/2.09 c setppc : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c logicor : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c countsols : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c Propagators : Time Calls Cutoffs DomReds
1.99/2.09 c vbounds : 0.00 2 0 0
1.99/2.09 c rootredcost : 0.00 0 0 0
1.99/2.09 c pseudoobj : 0.00 0 0 0
1.99/2.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.09 c applied globally : - - - 0 0.0 - - -
1.99/2.09 c applied locally : - - - 0 0.0 - - -
1.99/2.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.99/2.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 79)
1.99/2.09 c redcost : 0.00 6 0 0 0 0
1.99/2.09 c impliedbounds : 0.00 6 0 0 0 0
1.99/2.09 c intobj : 0.00 0 0 0 0 0
1.99/2.09 c cgmip : 0.00 0 0 0 0 0
1.99/2.09 c gomory : 0.03 6 0 0 9 0
1.99/2.09 c strongcg : 0.05 6 0 0 340 0
1.99/2.09 c cmir : 0.00 0 0 0 0 0
1.99/2.09 c flowcover : 0.00 0 0 0 0 0
1.99/2.09 c clique : 0.01 6 0 0 27 0
1.99/2.09 c zerohalf : 0.00 0 0 0 0 0
1.99/2.09 c mcf : 0.00 2 0 0 0 0
1.99/2.09 c rapidlearning : 0.15 1 0 0 0 143
1.99/2.09 c Pricers : Time Calls Vars
1.99/2.09 c problem variables: 0.00 0 0
1.99/2.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.99/2.09 c relpscost : 1.61 13 1 58 0 0 0
1.99/2.09 c pscost : 0.00 0 0 0 0 0 0
1.99/2.09 c inference : 0.00 0 0 0 0 0 0
1.99/2.09 c mostinf : 0.00 0 0 0 0 0 0
1.99/2.09 c leastinf : 0.00 0 0 0 0 0 0
1.99/2.09 c fullstrong : 0.00 0 0 0 0 0 0
1.99/2.09 c allfullstrong : 0.00 0 0 0 0 0 0
1.99/2.09 c random : 0.00 0 0 0 0 0 0
1.99/2.09 c Primal Heuristics : Time Calls Found
1.99/2.09 c LP solutions : 0.00 - 0
1.99/2.09 c pseudo solutions : 0.00 - 0
1.99/2.09 c trivial : 0.00 1 0
1.99/2.09 c simplerounding : 0.00 0 0
1.99/2.09 c zirounding : 0.00 0 0
1.99/2.09 c rounding : 0.00 0 0
1.99/2.09 c shifting : 0.00 0 0
1.99/2.09 c intshifting : 0.00 0 0
1.99/2.09 c oneopt : 0.00 0 0
1.99/2.09 c twoopt : 0.00 0 0
1.99/2.09 c fixandinfer : 0.00 0 0
1.99/2.09 c feaspump : 0.00 0 0
1.99/2.09 c coefdiving : 0.00 0 0
1.99/2.09 c pscostdiving : 0.00 0 0
1.99/2.09 c fracdiving : 0.00 0 0
1.99/2.09 c veclendiving : 0.00 0 0
1.99/2.09 c intdiving : 0.00 0 0
1.99/2.09 c actconsdiving : 0.00 0 0
1.99/2.09 c objpscostdiving : 0.00 0 0
1.99/2.09 c rootsoldiving : 0.00 0 0
1.99/2.09 c linesearchdiving : 0.00 0 0
1.99/2.09 c guideddiving : 0.00 0 0
1.99/2.09 c octane : 0.00 0 0
1.99/2.09 c rens : 0.00 0 0
1.99/2.09 c rins : 0.00 0 0
1.99/2.09 c localbranching : 0.00 0 0
1.99/2.09 c mutation : 0.00 0 0
1.99/2.09 c crossover : 0.00 0 0
1.99/2.09 c dins : 0.00 0 0
1.99/2.09 c undercover : 0.00 0 0
1.99/2.09 c nlp : 0.00 0 0
1.99/2.09 c trysol : 0.00 0 0
1.99/2.09 c LP : Time Calls Iterations Iter/call Iter/sec
1.99/2.09 c primal LP : 0.00 0 0 0.00 -
1.99/2.09 c dual LP : 0.04 19 1166 61.37 29150.00
1.99/2.09 c lex dual LP : 0.00 0 0 0.00 -
1.99/2.09 c barrier LP : 0.00 0 0 0.00 -
1.99/2.09 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.09 c strong branching : 1.61 106 28034 264.47 17412.42
1.99/2.09 c (at root node) : - 106 28034 264.47 -
1.99/2.09 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.09 c B&B Tree :
1.99/2.09 c number of runs : 2
1.99/2.09 c nodes : 1
1.99/2.09 c nodes (total) : 2
1.99/2.09 c nodes left : 0
1.99/2.09 c max depth : 0
1.99/2.09 c max depth (total): 0
1.99/2.09 c backtracks : 0 (0.0%)
1.99/2.09 c delayed cutoffs : 0
1.99/2.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.99/2.09 c avg switch length: 2.00
1.99/2.09 c switching time : 0.00
1.99/2.09 c Solution :
1.99/2.09 c Solutions found : 0 (0 improvements)
1.99/2.09 c Primal Bound : infeasible
1.99/2.09 c Dual Bound : -
1.99/2.09 c Gap : 0.00 %
1.99/2.09 c Root Dual Bound : -
1.99/2.09 c Root Iterations : 1166
1.99/2.10 c Time complete: 2.09.