0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2684494-1278432532.opb>
0.19/0.29 c original problem has 5456 variables (5456 bin, 0 int, 0 impl, 0 cont) and 17015 constraints
0.19/0.29 c problem read
0.19/0.29 c No objective function, only one solution is needed.
0.19/0.29 c presolving settings loaded
0.29/0.38 c presolving:
1.00/1.09 c (round 1) 1047 del vars, 2662 del conss, 647 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 975504 impls, 0 clqs
1.29/1.40 c (round 2) 2585 del vars, 7780 del conss, 2049 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 983180 impls, 0 clqs
1.39/1.44 c (round 3) 2986 del vars, 9896 del conss, 2186 chg bounds, 46 chg sides, 26 chg coeffs, 0 upgd conss, 986397 impls, 0 clqs
1.39/1.46 c (round 4) 3070 del vars, 10241 del conss, 2278 chg bounds, 50 chg sides, 28 chg coeffs, 0 upgd conss, 986828 impls, 0 clqs
1.39/1.48 c (round 5) 3155 del vars, 10581 del conss, 2314 chg bounds, 50 chg sides, 28 chg coeffs, 0 upgd conss, 987164 impls, 0 clqs
1.39/1.49 c (round 6) 3176 del vars, 10672 del conss, 2324 chg bounds, 50 chg sides, 28 chg coeffs, 0 upgd conss, 987262 impls, 0 clqs
1.49/1.50 c (round 7) 3177 del vars, 10677 del conss, 2324 chg bounds, 50 chg sides, 28 chg coeffs, 0 upgd conss, 987276 impls, 0 clqs
1.49/1.59 c (round 8) 3177 del vars, 10691 del conss, 2324 chg bounds, 50 chg sides, 28 chg coeffs, 6324 upgd conss, 987276 impls, 0 clqs
1.59/1.66 c (round 9) 3177 del vars, 10691 del conss, 2324 chg bounds, 56 chg sides, 111 chg coeffs, 6324 upgd conss, 987646 impls, 622 clqs
1.69/1.72 c (round 10) 3177 del vars, 10691 del conss, 2324 chg bounds, 58 chg sides, 271 chg coeffs, 6324 upgd conss, 987646 impls, 634 clqs
1.69/1.77 c (round 11) 3177 del vars, 10691 del conss, 2324 chg bounds, 58 chg sides, 380 chg coeffs, 6324 upgd conss, 987718 impls, 706 clqs
1.79/1.81 c (round 12) 3177 del vars, 10691 del conss, 2324 chg bounds, 58 chg sides, 436 chg coeffs, 6324 upgd conss, 987718 impls, 752 clqs
1.79/1.86 c (round 13) 3177 del vars, 10691 del conss, 2324 chg bounds, 59 chg sides, 449 chg coeffs, 6324 upgd conss, 987718 impls, 764 clqs
1.79/1.89 c presolving (14 rounds):
1.79/1.89 c 3177 deleted vars, 10691 deleted constraints, 2324 tightened bounds, 0 added holes, 59 changed sides, 452 changed coefficients
1.79/1.89 c 987718 implications, 764 cliques
1.79/1.89 c presolved problem has 2279 variables (2279 bin, 0 int, 0 impl, 0 cont) and 6324 constraints
1.79/1.89 c 312 constraints of type <knapsack>
1.79/1.89 c 6012 constraints of type <logicor>
1.79/1.89 c transformed objective value is always integral (scale: 1)
1.79/1.89 c Presolving Time: 1.39
1.79/1.89 c - non default parameters ----------------------------------------------------------------------
1.79/1.89 c # SCIP version 1.2.1.2
1.79/1.89 c
1.79/1.89 c # frequency for displaying node information lines
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 100]
1.79/1.89 c display/freq = 10000
1.79/1.89 c
1.79/1.89 c # maximal time in seconds to run
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.89 c limits/time = 1799.72
1.79/1.89 c
1.79/1.89 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.89 c limits/memory = 1620
1.79/1.89 c
1.79/1.89 c # solving stops, if the given number of solutions were found (-1: no limit)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c limits/solutions = 1
1.79/1.89 c
1.79/1.89 c # maximal number of separation rounds per node (-1: unlimited)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 5]
1.79/1.89 c separating/maxrounds = 1
1.79/1.89 c
1.79/1.89 c # maximal number of separation rounds in the root node (-1: unlimited)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c separating/maxroundsroot = 5
1.79/1.89 c
1.79/1.89 c # should presolving try to simplify inequalities
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.89 c constraints/linear/simplifyinequalities = TRUE
1.79/1.89 c
1.79/1.89 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.79/1.89 c constraints/knapsack/disaggregation = FALSE
1.79/1.89 c
1.79/1.89 c # should presolving try to simplify knapsacks
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.89 c constraints/knapsack/simplifyinequalities = TRUE
1.79/1.89 c
1.79/1.89 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c presolving/probing/maxrounds = 0
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/coefdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/coefdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/coefdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 30]
1.79/1.89 c heuristics/crossover/freq = -1
1.79/1.89 c
1.79/1.89 c # number of nodes added to the contingent of the total nodes
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.89 c heuristics/crossover/nodesofs = 750
1.79/1.89 c
1.79/1.89 c # number of nodes without incumbent change that heuristic should wait
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.79/1.89 c heuristics/crossover/nwaitingnodes = 100
1.79/1.89 c
1.79/1.89 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.79/1.89 c # [type: real, range: [0,1], default: 0.1]
1.79/1.89 c heuristics/crossover/nodesquot = 0.15
1.79/1.89 c
1.79/1.89 c # minimum percentage of integer variables that have to be fixed
1.79/1.89 c # [type: real, range: [0,1], default: 0.666]
1.79/1.89 c heuristics/crossover/minfixingrate = 0.5
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/feaspump/freq = -1
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/feaspump/maxlpiterofs = 2000
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/fracdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/fracdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/fracdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/guideddiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/guideddiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/guideddiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/intdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/intshifting/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/linesearchdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/nlp/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/objpscostdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to total iteration number
1.79/1.89 c # [type: real, range: [0,1], default: 0.01]
1.79/1.89 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/oneopt/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/pscostdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/pscostdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c heuristics/rens/freq = -1
1.79/1.89 c
1.79/1.89 c # minimum percentage of integer variables that have to be fixable
1.79/1.89 c # [type: real, range: [0,1], default: 0.5]
1.79/1.89 c heuristics/rens/minfixingrate = 0.3
1.79/1.89 c
1.79/1.89 c # number of nodes added to the contingent of the total nodes
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.89 c heuristics/rens/nodesofs = 2000
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/rootsoldiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.79/1.89 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/rounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/shifting/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/simplerounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c heuristics/trivial/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/trysol/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/veclendiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/veclendiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/veclendiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/zirounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c separating/cmir/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c separating/flowcover/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c separating/rapidlearning/freq = 0
1.79/1.89 c
1.79/1.89 c -----------------------------------------------------------------------------------------------
1.79/1.89 c start solving
1.79/1.89 c
4.99/5.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.99/5.05 c 4.6s| 1 | 0 | 3438 | - | 32M| 0 |1502 |2279 |6324 |2279 |6324 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
31.89/31.92 c 31.0s| 1 | 0 | 11001 | - | 31M| 0 |1645 |2279 |6319 |2279 |5977 | 121 | 0 | 0 | 0.000000e+00 | -- | Inf
45.98/46.02 c 45.1s| 1 | 0 | 14946 | - | 32M| 0 |1699 |2279 |6319 |2279 |6062 | 206 | 0 | 0 | 0.000000e+00 | -- | Inf
59.47/59.57 c 58.6s| 1 | 0 | 18760 | - | 32M| 0 |1668 |2279 |6319 |2279 |6123 | 267 | 0 | 0 | 0.000000e+00 | -- | Inf
73.37/73.45 c 72.4s| 1 | 0 | 22252 | - | 32M| 0 |1632 |2279 |6319 |2279 |6166 | 310 | 0 | 0 | 0.000000e+00 | -- | Inf
86.46/86.51 c 85.4s| 1 | 0 | 25616 | - | 32M| 0 |1665 |2279 |6319 |2279 |6205 | 349 | 0 | 0 | 0.000000e+00 | -- | Inf
108.86/108.96 c 108s| 1 | 2 | 25616 | - | 32M| 0 |1665 |2279 |6319 |2279 |6205 | 349 | 0 | 12 | 0.000000e+00 | -- | Inf
108.86/108.96 c (run 1, node 1) restarting after 145 global fixings of integer variables
108.86/108.96 c
108.86/108.98 c (restart) converted 16 cuts from the global cut pool into linear constraints
108.86/108.98 c
108.95/109.00 c presolving:
108.95/109.08 c (round 1) 234 del vars, 320 del conss, 0 chg bounds, 25 chg sides, 119 chg coeffs, 0 upgd conss, 1001345 impls, 733 clqs
109.05/109.14 c (round 2) 241 del vars, 335 del conss, 3 chg bounds, 26 chg sides, 185 chg coeffs, 231 upgd conss, 1002176 impls, 796 clqs
109.05/109.18 c (round 3) 246 del vars, 349 del conss, 3 chg bounds, 28 chg sides, 220 chg coeffs, 231 upgd conss, 1002180 impls, 828 clqs
109.15/109.21 c presolving (4 rounds):
109.15/109.21 c 246 deleted vars, 349 deleted constraints, 3 tightened bounds, 0 added holes, 28 changed sides, 229 changed coefficients
109.15/109.21 c 1002180 implications, 843 cliques
109.15/109.21 c presolved problem has 2033 variables (2033 bin, 0 int, 0 impl, 0 cont) and 5986 constraints
109.15/109.21 c 313 constraints of type <knapsack>
109.15/109.21 c 15 constraints of type <setppc>
109.15/109.21 c 5658 constraints of type <logicor>
109.15/109.21 c transformed objective value is always integral (scale: 1)
109.15/109.21 c Presolving Time: 1.60
109.15/109.21 c
111.26/111.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
111.26/111.33 c 110s| 1 | 0 | 28568 | - | 31M| 0 |1194 |2033 |5986 |2033 |5583 | 0 | 0 | 12 | 0.000000e+00 | -- | Inf
122.35/122.42 c 121s| 1 | 0 | 31765 | - | 31M| 0 |1511 |2033 |5986 |2033 |5667 | 84 | 0 | 12 | 0.000000e+00 | -- | Inf
159.23/159.35 c 158s| 1 | 2 | 31765 | - | 31M| 0 |1511 |2033 |5986 |2033 |5667 | 84 | 0 | 35 | 0.000000e+00 | -- | Inf
958.06/958.40 c
958.06/958.40 c SCIP Status : problem is solved [infeasible]
958.06/958.40 c Solving Time (sec) : 954.19
958.06/958.40 c Solving Nodes : 297 (total of 298 nodes in 2 runs)
958.06/958.40 c Primal Bound : +1.00000000000000e+20 (0 solutions)
958.06/958.40 c Dual Bound : +1.00000000000000e+20
958.06/958.40 c Gap : 0.00 %
958.06/958.40 s UNSATISFIABLE
958.06/958.40 c SCIP Status : problem is solved [infeasible]
958.06/958.40 c Solving Time : 954.19
958.06/958.40 c Original Problem :
958.06/958.40 c Problem name : HOME/instance-2684494-1278432532.opb
958.06/958.40 c Variables : 5456 (5456 binary, 0 integer, 0 implicit integer, 0 continuous)
958.06/958.40 c Constraints : 17015 initial, 17015 maximal
958.06/958.40 c Presolved Problem :
958.06/958.40 c Problem name : t_HOME/instance-2684494-1278432532.opb
958.06/958.40 c Variables : 2033 (2033 binary, 0 integer, 0 implicit integer, 0 continuous)
958.06/958.40 c Constraints : 5986 initial, 6333 maximal
958.06/958.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
958.06/958.40 c trivial : 0.01 340 0 0 0 0 0 0 0
958.06/958.40 c dualfix : 0.01 29 0 0 0 0 0 0 0
958.06/958.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
958.06/958.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
958.06/958.40 c implics : 0.07 0 94 0 0 0 0 0 0
958.06/958.40 c probing : 0.00 0 0 0 0 0 0 0 0
958.06/958.40 c knapsack : 0.26 0 0 0 0 0 0 26 653
958.06/958.40 c setppc : 0.00 0 0 0 0 0 0 0 0
958.06/958.40 c linear : 1.05 2135 824 0 2324 0 10739 61 28
958.06/958.41 c logicor : 0.13 1 0 0 3 0 301 0 0
958.06/958.41 c root node : - 268 - - 268 - - - -
958.06/958.41 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
958.06/958.41 c integral : 0 0 0 207 0 0 10 0 0 400
958.06/958.41 c knapsack : 313 7 4874 0 0 11 19653 1046 0 0
958.06/958.41 c setppc : 15 1 4861 0 0 0 190 0 0 0
958.06/958.41 c logicor : 5658+ 7 4679 0 0 161 44777 3 0 0
958.06/958.41 c countsols : 0 0 0 0 0 0 0 0 0 0
958.06/958.41 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
958.06/958.41 c integral : 461.20 0.00 0.00 461.20 0.00
958.06/958.41 c knapsack : 0.22 0.04 0.18 0.00 0.00
958.06/958.41 c setppc : 0.00 0.00 0.00 0.00 0.00
958.06/958.41 c logicor : 0.35 0.00 0.35 0.00 0.00
958.06/958.41 c countsols : 0.00 0.00 0.00 0.00 0.00
958.06/958.41 c Propagators : Time Calls Cutoffs DomReds
958.06/958.41 c vbounds : 0.00 2 0 0
958.06/958.41 c rootredcost : 0.00 0 0 0
958.06/958.41 c pseudoobj : 0.00 0 0 0
958.06/958.41 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
958.06/958.41 c propagation : 0.02 172 154 689 13.7 15 7.8 -
958.06/958.41 c infeasible LP : 0.01 4 4 17 9.6 1 4.0 0
958.06/958.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
958.06/958.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
958.06/958.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
958.06/958.41 c applied globally : - - - 382 11.2 - - -
958.06/958.41 c applied locally : - - - 0 0.0 - - -
958.06/958.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
958.06/958.41 c cut pool : 0.00 0 - - 0 - (maximal pool size: 32)
958.06/958.41 c redcost : 0.01 205 0 0 0 0
958.06/958.41 c impliedbounds : 0.04 6 0 0 20 0
958.06/958.41 c intobj : 0.00 0 0 0 0 0
958.06/958.41 c cgmip : 0.00 0 0 0 0 0
958.06/958.41 c gomory : 16.12 6 0 0 750 0
958.06/958.41 c strongcg : 17.29 6 0 0 819 0
958.06/958.41 c cmir : 0.00 0 0 0 0 0
958.06/958.41 c flowcover : 0.00 0 0 0 0 0
958.06/958.41 c clique : 0.78 6 0 0 46 0
958.06/958.41 c zerohalf : 0.00 0 0 0 0 0
958.06/958.41 c mcf : 0.06 2 0 0 0 0
958.06/958.41 c rapidlearning : 5.50 1 0 145 0 559
958.06/958.41 c Pricers : Time Calls Vars
958.06/958.41 c problem variables: 0.00 0 0
958.06/958.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
958.06/958.41 c relpscost : 461.20 207 0 10 0 0 400
958.06/958.41 c pscost : 0.00 0 0 0 0 0 0
958.06/958.41 c inference : 0.00 0 0 0 0 0 0
958.06/958.41 c mostinf : 0.00 0 0 0 0 0 0
958.06/958.41 c leastinf : 0.00 0 0 0 0 0 0
958.06/958.41 c fullstrong : 0.00 0 0 0 0 0 0
958.06/958.41 c allfullstrong : 0.00 0 0 0 0 0 0
958.06/958.41 c random : 0.00 0 0 0 0 0 0
958.06/958.41 c Primal Heuristics : Time Calls Found
958.06/958.41 c LP solutions : 0.00 - 0
958.06/958.41 c pseudo solutions : 0.00 - 0
958.06/958.41 c trivial : 0.01 1 0
958.06/958.41 c simplerounding : 0.00 0 0
958.06/958.41 c zirounding : 0.00 0 0
958.06/958.41 c rounding : 0.00 0 0
958.06/958.41 c shifting : 0.00 0 0
958.06/958.41 c intshifting : 0.00 0 0
958.06/958.41 c oneopt : 0.00 0 0
958.06/958.41 c twoopt : 0.00 0 0
958.06/958.41 c fixandinfer : 0.00 0 0
958.06/958.41 c feaspump : 0.00 0 0
958.06/958.41 c coefdiving : 0.00 0 0
958.06/958.41 c pscostdiving : 0.00 0 0
958.06/958.41 c fracdiving : 0.00 0 0
958.06/958.41 c veclendiving : 0.00 0 0
958.06/958.41 c intdiving : 0.00 0 0
958.06/958.41 c actconsdiving : 0.00 0 0
958.06/958.41 c objpscostdiving : 0.00 0 0
958.06/958.41 c rootsoldiving : 0.00 0 0
958.06/958.41 c linesearchdiving : 0.00 0 0
958.06/958.41 c guideddiving : 0.00 0 0
958.06/958.41 c octane : 0.00 0 0
958.06/958.41 c rens : 0.00 0 0
958.06/958.41 c rins : 0.00 0 0
958.06/958.41 c localbranching : 0.00 0 0
958.06/958.41 c mutation : 0.00 0 0
958.06/958.41 c crossover : 0.00 0 0
958.06/958.41 c dins : 0.00 0 0
958.06/958.41 c undercover : 0.00 0 0
958.06/958.41 c nlp : 0.00 0 0
958.06/958.41 c trysol : 0.00 0 0
958.06/958.41 c LP : Time Calls Iterations Iter/call Iter/sec
958.06/958.41 c primal LP : 0.03 0 0 0.00 0.00
958.06/958.41 c dual LP : 449.62 218 313065 1436.08 696.29
958.06/958.41 c lex dual LP : 0.00 0 0 0.00 -
958.06/958.41 c barrier LP : 0.00 0 0 0.00 -
958.06/958.41 c diving/probing LP: 0.00 0 0 0.00 -
958.06/958.41 c strong branching : 461.10 320 296210 925.66 642.40
958.06/958.41 c (at root node) : - 35 32310 923.14 -
958.06/958.41 c conflict analysis: 0.00 0 0 0.00 -
958.06/958.41 c B&B Tree :
958.06/958.41 c number of runs : 2
958.06/958.41 c nodes : 297
958.06/958.41 c nodes (total) : 298
958.06/958.41 c nodes left : 0
958.06/958.41 c max depth : 21
958.06/958.41 c max depth (total): 21
958.06/958.41 c backtracks : 89 (30.0%)
958.06/958.41 c delayed cutoffs : 102
958.06/958.41 c repropagations : 248 (23017 domain reductions, 78 cutoffs)
958.06/958.41 c avg switch length: 3.17
958.06/958.41 c switching time : 0.30
958.06/958.41 c Solution :
958.06/958.41 c Solutions found : 0 (0 improvements)
958.06/958.41 c Primal Bound : infeasible
958.06/958.41 c Dual Bound : -
958.06/958.41 c Gap : 0.00 %
958.06/958.41 c Root Dual Bound : +0.00000000000000e+00
958.06/958.41 c Root Iterations : 31765
958.06/958.48 c Time complete: 958.14.