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-2664337-1276276801.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 [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.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.01
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -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.03 c
0.00/0.03 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.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.09/2.14 c 1.9s| 10000 | 7550 | 0 | 0.0 |5757k| 68 | - | 169 |2254 | 0 | 0 | 0 |2237 | 0 | 0.000000e+00 | -- | Inf
5.99/6.09 c 5.7s| 20000 | 13625 | 0 | 0.0 | 10M| 75 | - | 169 |3837 | 0 | 0 | 0 |5717 | 0 | 0.000000e+00 | -- | Inf
10.00/10.09 c 9.5s| 30000 | 19764 | 0 | 0.0 | 14M| 75 | - | 169 |4552 | 0 | 0 | 0 |9152 | 0 | 0.000000e+00 | -- | Inf
15.68/15.77 c 14.9s| 40000 | 24659 | 0 | 0.0 | 19M| 75 | - | 169 |5840 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
23.19/23.28 c 22.2s| 50000 | 28540 | 0 | 0.0 | 23M| 75 | - | 169 |7168 | 0 | 0 | 0 | 19k| 0 | 0.000000e+00 | -- | Inf
32.98/33.07 c 31.7s| 60000 | 31291 | 0 | 0.0 | 27M| 75 | - | 169 |8208 | 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
44.87/44.91 c 43.3s| 70000 | 33747 | 0 | 0.0 | 30M| 75 | - | 169 |8704 | 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
56.77/56.89 c 55.0s| 80000 | 36895 | 0 | 0.0 | 34M| 75 | - | 169 |9966 | 0 | 0 | 0 | 38k| 0 | 0.000000e+00 | -- | Inf
70.56/70.69 c 68.5s| 90000 | 39608 | 0 | 0.0 | 38M| 75 | - | 169 | 12k| 0 | 0 | 0 | 44k| 0 | 0.000000e+00 | -- | Inf
86.36/86.42 c 83.9s|100000 | 42140 | 0 | 0.0 | 42M| 75 | - | 169 | 14k| 0 | 0 | 0 | 51k| 0 | 0.000000e+00 | -- | Inf
105.66/105.71 c 103s|110000 | 43966 | 0 | 0.0 | 46M| 75 | - | 169 | 16k| 0 | 0 | 0 | 58k| 0 | 0.000000e+00 | -- | Inf
127.44/127.54 c 124s|120000 | 45255 | 0 | 0.0 | 50M| 75 | - | 169 | 18k| 0 | 0 | 0 | 66k| 0 | 0.000000e+00 | -- | Inf
153.53/153.68 c 150s|130000 | 45572 | 0 | 0.0 | 52M| 75 | - | 169 | 20k| 0 | 0 | 0 | 75k| 0 | 0.000000e+00 | -- | Inf
181.22/181.34 c 178s|140000 | 45723 | 0 | 0.0 | 54M| 75 | - | 169 | 20k| 0 | 0 | 0 | 84k| 0 | 0.000000e+00 | -- | Inf
210.91/211.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
210.91/211.09 c 207s|150000 | 45417 | 0 | 0.0 | 56M| 75 | - | 169 | 20k| 0 | 0 | 0 | 93k| 0 | 0.000000e+00 | -- | Inf
249.00/249.15 c 245s|160000 | 43117 | 0 | 0.0 | 56M| 75 | - | 169 | 20k| 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
288.98/289.10 c 284s|170000 | 41544 | 0 | 0.0 | 58M| 75 | - | 169 | 22k| 0 | 0 | 0 | 113k| 0 | 0.000000e+00 | -- | Inf
337.77/337.92 c 333s|180000 | 38796 | 0 | 0.0 | 59M| 75 | - | 169 | 25k| 0 | 0 | 0 | 124k| 0 | 0.000000e+00 | -- | Inf
389.75/389.97 c 384s|190000 | 35813 | 0 | 0.0 | 59M| 75 | - | 169 | 28k| 0 | 0 | 0 | 136k| 0 | 0.000000e+00 | -- | Inf
446.32/446.57 c 441s|200000 | 32433 | 0 | 0.0 | 59M| 75 | - | 169 | 32k| 0 | 0 | 0 | 147k| 0 | 0.000000e+00 | -- | Inf
507.50/507.71 c 501s|210000 | 28485 | 0 | 0.0 | 58M| 75 | - | 169 | 36k| 0 | 0 | 0 | 160k| 0 | 0.000000e+00 | -- | Inf
572.08/572.37 c 566s|220000 | 24288 | 0 | 0.0 | 54M| 75 | - | 169 | 37k| 0 | 0 | 0 | 172k| 0 | 0.000000e+00 | -- | Inf
670.34/670.69 c 663s|230000 | 15200 | 0 | 0.0 | 44M| 75 | - | 169 | 38k| 0 | 0 | 0 | 187k| 0 | 0.000000e+00 | -- | Inf
776.80/777.14 c 769s|240000 | 4389 | 0 | 0.0 | 30M| 75 | - | 169 | 44k| 0 | 0 | 0 | 204k| 0 | 0.000000e+00 | -- | Inf
810.69/811.06 c
810.69/811.06 c SCIP Status : problem is solved [infeasible]
810.69/811.06 c Solving Time (sec) : 803.07
810.69/811.06 c Solving Nodes : 242092
810.69/811.06 c Primal Bound : +1.00000000000000e+20 (0 solutions)
810.69/811.06 c Dual Bound : +1.00000000000000e+20
810.69/811.06 c Gap : 0.00 %
810.69/811.06 s UNSATISFIABLE
810.69/811.06 c SCIP Status : problem is solved [infeasible]
810.69/811.06 c Solving Time : 803.07
810.69/811.06 c Original Problem :
810.69/811.06 c Problem name : HOME/instance-2664337-1276276801.opb
810.69/811.06 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
810.69/811.06 c Constraints : 101 initial, 101 maximal
810.69/811.06 c Presolved Problem :
810.69/811.06 c Problem name : t_HOME/instance-2664337-1276276801.opb
810.69/811.06 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
810.69/811.06 c Constraints : 73 initial, 46652 maximal
810.69/811.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
810.69/811.06 c trivial : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c implics : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c probing : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c knapsack : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c setppc : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c linear : 0.00 0 0 0 0 0 28 0 0
810.69/811.06 c logicor : 0.00 0 0 0 0 0 0 0 0
810.69/811.06 c root node : - 0 - - 0 - - - -
810.69/811.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
810.69/811.06 c integral : 0 0 0 0 0 0 0 0 0 0
810.69/811.06 c knapsack : 1 0 846234 0 151664 22396 1930745 0 0 0
810.69/811.06 c setppc : 68 0 823838 0 151664 110456 1919561 0 0 0
810.69/811.06 c logicor : 4+ 0 375128 0 24469 2351 151022 0 0 0
810.69/811.06 c countsols : 0 0 0 0 151664 0 0 0 0 0
810.69/811.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
810.69/811.06 c integral : 0.00 0.00 0.00 0.00 0.00
810.69/811.06 c knapsack : 60.49 0.00 59.30 0.00 1.19
810.69/811.06 c setppc : 22.55 0.00 20.31 0.00 2.24
810.69/811.06 c logicor : 391.04 0.00 391.00 0.00 0.04
810.69/811.06 c countsols : 0.03 0.00 0.00 0.00 0.03
810.69/811.06 c Propagators : Time Calls Cutoffs DomReds
810.69/811.06 c vbounds : 0.51 1 0 0
810.69/811.06 c rootredcost : 0.37 0 0 0
810.69/811.06 c pseudoobj : 0.40 0 0 0
810.69/811.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
810.69/811.06 c propagation : 9.56 135203 135185 713964 21.3 4020 22.5 -
810.69/811.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
810.69/811.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
810.69/811.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
810.69/811.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
810.69/811.06 c applied globally : - - - 207472 15.1 - - -
810.69/811.06 c applied locally : - - - 2132 34.9 - - -
810.69/811.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
810.69/811.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
810.69/811.06 c redcost : 0.00 0 0 0 0 0
810.69/811.06 c impliedbounds : 0.00 0 0 0 0 0
810.69/811.06 c intobj : 0.00 0 0 0 0 0
810.69/811.06 c cgmip : 0.00 0 0 0 0 0
810.69/811.06 c gomory : 0.00 0 0 0 0 0
810.69/811.06 c strongcg : 0.00 0 0 0 0 0
810.69/811.06 c cmir : 0.00 0 0 0 0 0
810.69/811.06 c flowcover : 0.00 0 0 0 0 0
810.69/811.06 c clique : 0.00 0 0 0 0 0
810.69/811.06 c zerohalf : 0.00 0 0 0 0 0
810.69/811.06 c mcf : 0.00 0 0 0 0 0
810.69/811.06 c rapidlearning : 0.00 0 0 0 0 0
810.69/811.06 c Pricers : Time Calls Vars
810.69/811.06 c problem variables: 0.00 0 0
810.69/811.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
810.69/811.06 c relpscost : 0.00 0 0 0 0 0 0
810.69/811.06 c pscost : 0.00 0 0 0 0 0 0
810.69/811.06 c inference : 2.09 151664 0 0 0 0 303328
810.69/811.06 c mostinf : 0.00 0 0 0 0 0 0
810.69/811.06 c leastinf : 0.00 0 0 0 0 0 0
810.69/811.06 c fullstrong : 0.00 0 0 0 0 0 0
810.69/811.06 c allfullstrong : 0.00 0 0 0 0 0 0
810.69/811.06 c random : 0.00 0 0 0 0 0 0
810.69/811.06 c Primal Heuristics : Time Calls Found
810.69/811.06 c LP solutions : 0.00 - 0
810.69/811.06 c pseudo solutions : 0.00 - 0
810.69/811.06 c trivial : 0.00 1 0
810.69/811.06 c simplerounding : 0.00 0 0
810.69/811.06 c zirounding : 0.00 0 0
810.69/811.06 c rounding : 0.00 0 0
810.69/811.06 c shifting : 0.00 0 0
810.69/811.06 c intshifting : 0.00 0 0
810.69/811.06 c oneopt : 0.00 0 0
810.69/811.06 c twoopt : 0.00 0 0
810.69/811.06 c fixandinfer : 0.00 0 0
810.69/811.06 c feaspump : 0.00 0 0
810.69/811.06 c coefdiving : 0.00 0 0
810.69/811.06 c pscostdiving : 0.00 0 0
810.69/811.06 c fracdiving : 0.00 0 0
810.69/811.06 c veclendiving : 0.00 0 0
810.69/811.06 c intdiving : 0.00 0 0
810.69/811.06 c actconsdiving : 0.00 0 0
810.69/811.06 c objpscostdiving : 0.00 0 0
810.69/811.06 c rootsoldiving : 0.00 0 0
810.69/811.06 c linesearchdiving : 0.00 0 0
810.69/811.06 c guideddiving : 0.00 0 0
810.69/811.06 c octane : 0.00 0 0
810.69/811.06 c rens : 0.00 0 0
810.69/811.06 c rins : 0.00 0 0
810.69/811.06 c localbranching : 0.00 0 0
810.69/811.06 c mutation : 0.00 0 0
810.69/811.06 c crossover : 0.00 0 0
810.69/811.06 c dins : 0.00 0 0
810.69/811.06 c undercover : 0.00 0 0
810.69/811.06 c nlp : 0.00 0 0
810.69/811.06 c trysol : 0.00 0 0
810.69/811.06 c LP : Time Calls Iterations Iter/call Iter/sec
810.69/811.06 c primal LP : 0.00 0 0 0.00 -
810.69/811.06 c dual LP : 0.00 0 0 0.00 -
810.69/811.06 c lex dual LP : 0.00 0 0 0.00 -
810.69/811.06 c barrier LP : 0.00 0 0 0.00 -
810.69/811.06 c diving/probing LP: 0.00 0 0 0.00 -
810.69/811.06 c strong branching : 0.00 0 0 0.00 -
810.69/811.06 c (at root node) : - 0 0 0.00 -
810.69/811.06 c conflict analysis: 0.00 0 0 0.00 -
810.69/811.06 c B&B Tree :
810.69/811.06 c number of runs : 1
810.69/811.06 c nodes : 242092
810.69/811.06 c nodes (total) : 242092
810.69/811.06 c nodes left : 0
810.69/811.06 c max depth : 75
810.69/811.06 c max depth (total): 75
810.69/811.06 c backtracks : 97144 (40.1%)
810.69/811.06 c delayed cutoffs : 61237
810.69/811.06 c repropagations : 298176 (1154473 domain reductions, 44775 cutoffs)
810.69/811.06 c avg switch length: 21.18
810.69/811.06 c switching time : 218.17
810.69/811.06 c Solution :
810.69/811.06 c Solutions found : 0 (0 improvements)
810.69/811.06 c Primal Bound : infeasible
810.69/811.06 c Dual Bound : -
810.69/811.06 c Gap : 0.00 %
810.69/811.06 c Root Dual Bound : +0.00000000000000e+00
810.69/811.06 c Root Iterations : 0
810.79/811.19 c Time complete: 810.88.