0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664428-1276302068.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.06 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.92 c 4.6s| 10000 | 7151 | 0 | 0.0 |7377k| 91 | - | 231 |5028 | 0 | 0 | 0 |3791 | 0 | 0.000000e+00 | -- | Inf
10.68/10.79 c 10.2s| 20000 | 13998 | 0 | 0.0 | 12M| 91 | - | 231 |5872 | 0 | 0 | 0 |7472 | 0 | 0.000000e+00 | -- | Inf
17.39/17.46 c 16.6s| 30000 | 20770 | 0 | 0.0 | 16M| 91 | - | 231 |6987 | 0 | 0 | 0 | 11k| 0 | 0.000000e+00 | -- | Inf
26.88/26.94 c 25.8s| 40000 | 26029 | 0 | 0.0 | 21M| 91 | - | 231 |8288 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
41.47/41.53 c 40.0s| 50000 | 29259 | 0 | 0.0 | 26M| 91 | - | 231 | 10k| 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
58.96/59.07 c 57.2s| 60000 | 31810 | 0 | 0.0 | 30M| 91 | - | 231 | 10k| 0 | 0 | 0 | 34k| 0 | 0.000000e+00 | -- | Inf
73.46/73.55 c 71.4s| 70000 | 36758 | 0 | 0.0 | 35M| 91 | - | 231 | 11k| 0 | 0 | 0 | 40k| 0 | 0.000000e+00 | -- | Inf
90.45/90.59 c 88.2s| 80000 | 40948 | 0 | 0.0 | 40M| 91 | - | 231 | 12k| 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
109.74/109.86 c 107s| 90000 | 44555 | 0 | 0.0 | 45M| 91 | - | 231 | 13k| 0 | 0 | 0 | 55k| 0 | 0.000000e+00 | -- | Inf
131.74/131.81 c 129s|100000 | 47489 | 0 | 0.0 | 49M| 91 | - | 231 | 13k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
156.13/156.30 c 153s|110000 | 49747 | 0 | 0.0 | 54M| 91 | - | 231 | 14k| 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
182.43/182.59 c 179s|120000 | 51553 | 0 | 0.0 | 58M| 91 | - | 231 | 15k| 0 | 0 | 0 | 82k| 0 | 0.000000e+00 | -- | Inf
212.60/212.73 c 208s|130000 | 52416 | 0 | 0.0 | 62M| 91 | - | 231 | 16k| 0 | 0 | 0 | 93k| 0 | 0.000000e+00 | -- | Inf
246.00/246.12 c 241s|140000 | 52534 | 0 | 0.0 | 66M| 91 | - | 231 | 17k| 0 | 0 | 0 | 105k| 0 | 0.000000e+00 | -- | Inf
283.68/283.83 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
283.68/283.83 c 279s|150000 | 52122 | 0 | 0.0 | 68M| 91 | - | 231 | 19k| 0 | 0 | 0 | 119k| 0 | 0.000000e+00 | -- | Inf
328.96/329.18 c 324s|160000 | 50411 | 0 | 0.0 | 69M| 91 | - | 231 | 18k| 0 | 0 | 0 | 132k| 0 | 0.000000e+00 | -- | Inf
373.14/373.38 c 367s|170000 | 49819 | 0 | 0.0 | 73M| 91 | - | 231 | 19k| 0 | 0 | 0 | 145k| 0 | 0.000000e+00 | -- | Inf
429.31/429.56 c 423s|180000 | 47204 | 0 | 0.0 | 76M| 91 | - | 231 | 21k| 0 | 0 | 0 | 159k| 0 | 0.000000e+00 | -- | Inf
495.19/495.43 c 488s|190000 | 43170 | 0 | 0.0 | 77M| 91 | - | 231 | 23k| 0 | 0 | 0 | 174k| 0 | 0.000000e+00 | -- | Inf
567.28/567.57 c 560s|200000 | 38020 | 0 | 0.0 | 75M| 91 | - | 231 | 24k| 0 | 0 | 0 | 191k| 0 | 0.000000e+00 | -- | Inf
644.14/644.44 c 636s|210000 | 32414 | 0 | 0.0 | 72M| 91 | - | 231 | 25k| 0 | 0 | 0 | 208k| 0 | 0.000000e+00 | -- | Inf
719.02/719.38 c 711s|220000 | 26986 | 0 | 0.0 | 67M| 91 | - | 231 | 27k| 0 | 0 | 0 | 226k| 0 | 0.000000e+00 | -- | Inf
795.78/796.11 c 787s|230000 | 21182 | 0 | 0.0 | 61M| 91 | - | 231 | 31k| 0 | 0 | 0 | 247k| 0 | 0.000000e+00 | -- | Inf
911.73/912.15 c 902s|240000 | 10092 | 0 | 0.0 | 41M| 91 | - | 231 | 32k| 0 | 0 | 0 | 269k| 0 | 0.000000e+00 | -- | Inf
1008.79/1009.23 c
1008.79/1009.23 c SCIP Status : problem is solved [infeasible]
1008.79/1009.23 c Solving Time (sec) : 998.51
1008.79/1009.23 c Solving Nodes : 248344
1008.79/1009.23 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1008.79/1009.23 c Dual Bound : +1.00000000000000e+20
1008.79/1009.23 c Gap : 0.00 %
1008.79/1009.23 s UNSATISFIABLE
1008.79/1009.23 c SCIP Status : problem is solved [infeasible]
1008.79/1009.23 c Solving Time : 998.51
1008.79/1009.23 c Original Problem :
1008.79/1009.23 c Problem name : HOME/instance-2664428-1276302068.opb
1008.79/1009.23 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
1008.79/1009.23 c Constraints : 2707 initial, 2707 maximal
1008.79/1009.23 c Presolved Problem :
1008.79/1009.23 c Problem name : t_HOME/instance-2664428-1276302068.opb
1008.79/1009.23 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
1008.79/1009.23 c Constraints : 2564 initial, 42138 maximal
1008.79/1009.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1008.79/1009.23 c trivial : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c implics : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c probing : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c knapsack : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c setppc : 0.00 0 0 0 0 0 0 0 0
1008.79/1009.23 c linear : 0.02 0 0 0 0 0 143 0 0
1008.79/1009.23 c logicor : 0.03 0 0 0 0 0 0 0 0
1008.79/1009.23 c root node : - 1 - - 1 - - - -
1008.79/1009.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1008.79/1009.23 c integral : 0 0 0 0 0 0 0 0 0 0
1008.79/1009.23 c knapsack : 1 0 1105847 0 156244 43515 3868877 0 0 0
1008.79/1009.23 c setppc : 22 0 1070077 0 156244 52157 1379684 0 0 0
1008.79/1009.23 c logicor : 2541+ 0 785753 0 156244 40432 3556621 0 0 0
1008.79/1009.23 c countsols : 0 0 0 0 156244 0 0 0 0 0
1008.79/1009.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1008.79/1009.23 c integral : 0.00 0.00 0.00 0.00 0.00
1008.79/1009.23 c knapsack : 26.93 0.00 26.18 0.00 0.75
1008.79/1009.23 c setppc : 16.30 0.00 14.40 0.00 1.90
1008.79/1009.23 c logicor : 522.51 0.00 500.98 0.00 21.53
1008.79/1009.23 c countsols : 0.04 0.00 0.00 0.00 0.04
1008.79/1009.23 c Propagators : Time Calls Cutoffs DomReds
1008.79/1009.23 c vbounds : 0.67 1 0 0
1008.79/1009.23 c rootredcost : 0.66 0 0 0
1008.79/1009.23 c pseudoobj : 0.49 0 0 0
1008.79/1009.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1008.79/1009.23 c propagation : 7.88 136104 136044 588997 16.0 2977 18.5 -
1008.79/1009.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1008.79/1009.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1008.79/1009.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1008.79/1009.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1008.79/1009.23 c applied globally : - - - 290296 13.1 - - -
1008.79/1009.23 c applied locally : - - - 1058 35.6 - - -
1008.79/1009.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1008.79/1009.23 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1008.79/1009.23 c redcost : 0.00 0 0 0 0 0
1008.79/1009.23 c impliedbounds : 0.00 0 0 0 0 0
1008.79/1009.23 c intobj : 0.00 0 0 0 0 0
1008.79/1009.23 c cgmip : 0.00 0 0 0 0 0
1008.79/1009.23 c gomory : 0.00 0 0 0 0 0
1008.79/1009.23 c strongcg : 0.00 0 0 0 0 0
1008.79/1009.23 c cmir : 0.00 0 0 0 0 0
1008.79/1009.23 c flowcover : 0.00 0 0 0 0 0
1008.79/1009.23 c clique : 0.00 0 0 0 0 0
1008.79/1009.23 c zerohalf : 0.00 0 0 0 0 0
1008.79/1009.23 c mcf : 0.00 0 0 0 0 0
1008.79/1009.23 c rapidlearning : 0.00 0 0 0 0 0
1008.79/1009.23 c Pricers : Time Calls Vars
1008.79/1009.23 c problem variables: 0.00 0 0
1008.79/1009.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1008.79/1009.23 c relpscost : 0.00 0 0 0 0 0 0
1008.79/1009.23 c pscost : 0.00 0 0 0 0 0 0
1008.79/1009.23 c inference : 4.49 156244 0 0 0 0 312488
1008.79/1009.23 c mostinf : 0.00 0 0 0 0 0 0
1008.79/1009.23 c leastinf : 0.00 0 0 0 0 0 0
1008.79/1009.23 c fullstrong : 0.00 0 0 0 0 0 0
1008.79/1009.23 c allfullstrong : 0.00 0 0 0 0 0 0
1008.79/1009.23 c random : 0.00 0 0 0 0 0 0
1008.79/1009.23 c Primal Heuristics : Time Calls Found
1008.79/1009.23 c LP solutions : 0.00 - 0
1008.79/1009.23 c pseudo solutions : 0.00 - 0
1008.79/1009.23 c trivial : 0.00 1 0
1008.79/1009.23 c simplerounding : 0.00 0 0
1008.79/1009.23 c zirounding : 0.00 0 0
1008.79/1009.23 c rounding : 0.00 0 0
1008.79/1009.23 c shifting : 0.00 0 0
1008.79/1009.23 c intshifting : 0.00 0 0
1008.79/1009.23 c oneopt : 0.00 0 0
1008.79/1009.23 c twoopt : 0.00 0 0
1008.79/1009.23 c fixandinfer : 0.00 0 0
1008.79/1009.23 c feaspump : 0.00 0 0
1008.79/1009.23 c coefdiving : 0.00 0 0
1008.79/1009.23 c pscostdiving : 0.00 0 0
1008.79/1009.23 c fracdiving : 0.00 0 0
1008.79/1009.23 c veclendiving : 0.00 0 0
1008.79/1009.23 c intdiving : 0.00 0 0
1008.79/1009.23 c actconsdiving : 0.00 0 0
1008.79/1009.23 c objpscostdiving : 0.00 0 0
1008.79/1009.23 c rootsoldiving : 0.00 0 0
1008.79/1009.23 c linesearchdiving : 0.00 0 0
1008.79/1009.23 c guideddiving : 0.00 0 0
1008.79/1009.23 c octane : 0.00 0 0
1008.79/1009.23 c rens : 0.00 0 0
1008.79/1009.23 c rins : 0.00 0 0
1008.79/1009.23 c localbranching : 0.00 0 0
1008.79/1009.23 c mutation : 0.00 0 0
1008.79/1009.23 c crossover : 0.00 0 0
1008.79/1009.23 c dins : 0.00 0 0
1008.79/1009.23 c undercover : 0.00 0 0
1008.79/1009.23 c nlp : 0.00 0 0
1008.79/1009.23 c trysol : 0.00 0 0
1008.79/1009.23 c LP : Time Calls Iterations Iter/call Iter/sec
1008.79/1009.23 c primal LP : 0.00 0 0 0.00 -
1008.79/1009.23 c dual LP : 0.00 0 0 0.00 -
1008.79/1009.23 c lex dual LP : 0.00 0 0 0.00 -
1008.79/1009.23 c barrier LP : 0.00 0 0 0.00 -
1008.79/1009.23 c diving/probing LP: 0.00 0 0 0.00 -
1008.79/1009.23 c strong branching : 0.00 0 0 0.00 -
1008.79/1009.23 c (at root node) : - 0 0 0.00 -
1008.79/1009.23 c conflict analysis: 0.00 0 0 0.00 -
1008.79/1009.23 c B&B Tree :
1008.79/1009.23 c number of runs : 1
1008.79/1009.23 c nodes : 248344
1008.79/1009.23 c nodes (total) : 248344
1008.79/1009.23 c nodes left : 0
1008.79/1009.23 c max depth : 91
1008.79/1009.23 c max depth (total): 91
1008.79/1009.23 c backtracks : 103211 (41.6%)
1008.79/1009.23 c delayed cutoffs : 64145
1008.79/1009.23 c repropagations : 355207 (2542260 domain reductions, 44004 cutoffs)
1008.79/1009.23 c avg switch length: 22.30
1008.79/1009.23 c switching time : 281.12
1008.79/1009.23 c Solution :
1008.79/1009.23 c Solutions found : 0 (0 improvements)
1008.79/1009.23 c Primal Bound : infeasible
1008.79/1009.23 c Dual Bound : -
1008.79/1009.23 c Gap : 0.00 %
1008.79/1009.23 c Root Dual Bound : +0.00000000000000e+00
1008.79/1009.23 c Root Iterations : 0
1008.90/1009.35 c Time complete: 1008.95.