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-2664280-1276271586.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.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 # 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.15 c 1.9s| 10000 | 7436 | 0 | 0.0 |5583k| 76 | - | 169 |2201 | 0 | 0 | 0 |2211 | 0 | 0.000000e+00 | -- | Inf
6.29/6.38 c 5.9s| 20000 | 12761 | 0 | 0.0 | 10M| 76 | - | 169 |3173 | 0 | 0 | 0 |6053 | 0 | 0.000000e+00 | -- | Inf
10.59/10.64 c 10.0s| 30000 | 18384 | 0 | 0.0 | 14M| 76 | - | 169 |4726 | 0 | 0 | 0 |9679 | 0 | 0.000000e+00 | -- | Inf
17.19/17.25 c 16.4s| 40000 | 22529 | 0 | 0.0 | 19M| 76 | - | 169 |6727 | 0 | 0 | 0 | 14k| 0 | 0.000000e+00 | -- | Inf
26.99/27.01 c 25.9s| 50000 | 24956 | 0 | 0.0 | 23M| 76 | - | 169 |8145 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
39.98/40.08 c 38.6s| 60000 | 25938 | 0 | 0.0 | 26M| 76 | - | 169 |6729 | 0 | 0 | 0 | 28k| 0 | 0.000000e+00 | -- | Inf
51.38/51.46 c 49.7s| 70000 | 28155 | 0 | 0.0 | 29M| 76 | - | 169 |8928 | 0 | 0 | 0 | 35k| 0 | 0.000000e+00 | -- | Inf
66.17/66.25 c 64.2s| 80000 | 29594 | 0 | 0.0 | 33M| 76 | - | 169 | 11k| 0 | 0 | 0 | 42k| 0 | 0.000000e+00 | -- | Inf
83.87/83.99 c 81.7s| 90000 | 30705 | 0 | 0.0 | 37M| 76 | - | 169 | 14k| 0 | 0 | 0 | 49k| 0 | 0.000000e+00 | -- | Inf
104.75/104.84 c 102s|100000 | 31273 | 0 | 0.0 | 40M| 76 | - | 169 | 16k| 0 | 0 | 0 | 58k| 0 | 0.000000e+00 | -- | Inf
129.44/129.56 c 127s|110000 | 30896 | 0 | 0.0 | 42M| 76 | - | 169 | 18k| 0 | 0 | 0 | 67k| 0 | 0.000000e+00 | -- | Inf
159.64/159.72 c 156s|120000 | 29358 | 0 | 0.0 | 43M| 76 | - | 169 | 19k| 0 | 0 | 0 | 77k| 0 | 0.000000e+00 | -- | Inf
200.82/200.93 c 197s|130000 | 25294 | 0 | 0.0 | 40M| 76 | - | 169 | 16k| 0 | 0 | 0 | 88k| 0 | 0.000000e+00 | -- | Inf
237.51/237.61 c 233s|140000 | 22217 | 0 | 0.0 | 41M| 76 | - | 169 | 20k| 0 | 0 | 0 | 99k| 0 | 0.000000e+00 | -- | Inf
277.89/278.00 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
277.89/278.00 c 273s|150000 | 18894 | 0 | 0.0 | 40M| 76 | - | 169 | 25k| 0 | 0 | 0 | 110k| 0 | 0.000000e+00 | -- | Inf
326.78/326.91 c 322s|160000 | 14109 | 0 | 0.0 | 37M| 76 | - | 169 | 31k| 0 | 0 | 0 | 122k| 0 | 0.000000e+00 | -- | Inf
405.95/406.18 c 401s|170000 | 4370 | 0 | 0.0 | 24M| 76 | - | 169 | 34k| 0 | 0 | 0 | 138k| 0 | 0.000000e+00 | -- | Inf
432.15/432.30 c
432.15/432.30 c SCIP Status : problem is solved [infeasible]
432.15/432.30 c Solving Time (sec) : 426.59
432.15/432.30 c Solving Nodes : 172788
432.15/432.30 c Primal Bound : +1.00000000000000e+20 (0 solutions)
432.15/432.30 c Dual Bound : +1.00000000000000e+20
432.15/432.30 c Gap : 0.00 %
432.15/432.30 s UNSATISFIABLE
432.15/432.30 c SCIP Status : problem is solved [infeasible]
432.15/432.30 c Solving Time : 426.59
432.15/432.30 c Original Problem :
432.15/432.30 c Problem name : HOME/instance-2664280-1276271586.opb
432.15/432.30 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
432.15/432.30 c Constraints : 101 initial, 101 maximal
432.15/432.30 c Presolved Problem :
432.15/432.30 c Problem name : t_HOME/instance-2664280-1276271586.opb
432.15/432.30 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
432.15/432.30 c Constraints : 73 initial, 36968 maximal
432.15/432.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
432.15/432.30 c trivial : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c dualfix : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c boundshift : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c implics : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c probing : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c knapsack : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c setppc : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c linear : 0.01 0 0 0 0 0 28 0 0
432.15/432.30 c logicor : 0.00 0 0 0 0 0 0 0 0
432.15/432.30 c root node : - 1 - - 1 - - - -
432.15/432.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
432.15/432.30 c integral : 0 0 0 0 0 0 0 0 0 0
432.15/432.30 c knapsack : 1 0 599681 0 107815 14965 1633905 0 0 0
432.15/432.30 c setppc : 68 0 584716 0 107815 81174 1450678 0 0 0
432.15/432.30 c logicor : 4+ 0 269497 0 47048 1526 104196 0 0 0
432.15/432.30 c countsols : 0 0 0 0 107815 0 0 0 0 0
432.15/432.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
432.15/432.30 c integral : 0.00 0.00 0.00 0.00 0.00
432.15/432.30 c knapsack : 41.86 0.00 41.15 0.00 0.71
432.15/432.30 c setppc : 14.29 0.00 12.97 0.00 1.32
432.15/432.30 c logicor : 193.84 0.00 193.81 0.00 0.03
432.15/432.30 c countsols : 0.10 0.00 0.00 0.00 0.10
432.15/432.30 c Propagators : Time Calls Cutoffs DomReds
432.15/432.30 c vbounds : 0.37 1 0 0
432.15/432.30 c rootredcost : 0.26 0 0 0
432.15/432.30 c pseudoobj : 0.31 0 0 0
432.15/432.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
432.15/432.30 c propagation : 6.20 97665 97648 497492 20.2 2886 22.6 -
432.15/432.30 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
432.15/432.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
432.15/432.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
432.15/432.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
432.15/432.31 c applied globally : - - - 142812 14.6 - - -
432.15/432.31 c applied locally : - - - 1234 35.0 - - -
432.15/432.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
432.15/432.31 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
432.15/432.31 c redcost : 0.00 0 0 0 0 0
432.15/432.31 c impliedbounds : 0.00 0 0 0 0 0
432.15/432.31 c intobj : 0.00 0 0 0 0 0
432.15/432.31 c cgmip : 0.00 0 0 0 0 0
432.15/432.31 c gomory : 0.00 0 0 0 0 0
432.15/432.31 c strongcg : 0.00 0 0 0 0 0
432.15/432.31 c cmir : 0.00 0 0 0 0 0
432.15/432.31 c flowcover : 0.00 0 0 0 0 0
432.15/432.31 c clique : 0.00 0 0 0 0 0
432.15/432.31 c zerohalf : 0.00 0 0 0 0 0
432.15/432.31 c mcf : 0.00 0 0 0 0 0
432.15/432.31 c rapidlearning : 0.00 0 0 0 0 0
432.15/432.31 c Pricers : Time Calls Vars
432.15/432.31 c problem variables: 0.00 0 0
432.15/432.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
432.15/432.31 c relpscost : 0.00 0 0 0 0 0 0
432.15/432.31 c pscost : 0.00 0 0 0 0 0 0
432.15/432.31 c inference : 1.41 107815 0 0 0 0 215630
432.15/432.31 c mostinf : 0.00 0 0 0 0 0 0
432.15/432.31 c leastinf : 0.00 0 0 0 0 0 0
432.15/432.31 c fullstrong : 0.00 0 0 0 0 0 0
432.15/432.31 c allfullstrong : 0.00 0 0 0 0 0 0
432.15/432.31 c random : 0.00 0 0 0 0 0 0
432.15/432.31 c Primal Heuristics : Time Calls Found
432.15/432.31 c LP solutions : 0.00 - 0
432.15/432.31 c pseudo solutions : 0.00 - 0
432.15/432.31 c trivial : 0.00 1 0
432.15/432.31 c simplerounding : 0.00 0 0
432.15/432.31 c zirounding : 0.00 0 0
432.15/432.31 c rounding : 0.00 0 0
432.15/432.31 c shifting : 0.00 0 0
432.15/432.31 c intshifting : 0.00 0 0
432.15/432.31 c oneopt : 0.00 0 0
432.15/432.31 c twoopt : 0.00 0 0
432.15/432.31 c fixandinfer : 0.00 0 0
432.15/432.31 c feaspump : 0.00 0 0
432.15/432.31 c coefdiving : 0.00 0 0
432.15/432.31 c pscostdiving : 0.00 0 0
432.15/432.31 c fracdiving : 0.00 0 0
432.15/432.31 c veclendiving : 0.00 0 0
432.15/432.31 c intdiving : 0.00 0 0
432.15/432.31 c actconsdiving : 0.00 0 0
432.15/432.31 c objpscostdiving : 0.00 0 0
432.15/432.31 c rootsoldiving : 0.00 0 0
432.15/432.31 c linesearchdiving : 0.00 0 0
432.15/432.31 c guideddiving : 0.00 0 0
432.15/432.31 c octane : 0.00 0 0
432.15/432.31 c rens : 0.00 0 0
432.15/432.31 c rins : 0.00 0 0
432.15/432.31 c localbranching : 0.00 0 0
432.15/432.31 c mutation : 0.00 0 0
432.15/432.31 c crossover : 0.00 0 0
432.15/432.31 c dins : 0.00 0 0
432.15/432.31 c undercover : 0.00 0 0
432.15/432.31 c nlp : 0.00 0 0
432.15/432.31 c trysol : 0.00 0 0
432.15/432.31 c LP : Time Calls Iterations Iter/call Iter/sec
432.15/432.31 c primal LP : 0.00 0 0 0.00 -
432.15/432.31 c dual LP : 0.00 0 0 0.00 -
432.15/432.31 c lex dual LP : 0.00 0 0 0.00 -
432.15/432.31 c barrier LP : 0.00 0 0 0.00 -
432.15/432.31 c diving/probing LP: 0.00 0 0 0.00 -
432.15/432.31 c strong branching : 0.00 0 0 0.00 -
432.15/432.31 c (at root node) : - 0 0 0.00 -
432.15/432.31 c conflict analysis: 0.00 0 0 0.00 -
432.15/432.31 c B&B Tree :
432.15/432.31 c number of runs : 1
432.15/432.31 c nodes : 172788
432.15/432.31 c nodes (total) : 172788
432.15/432.31 c nodes left : 0
432.15/432.31 c max depth : 76
432.15/432.31 c max depth (total): 76
432.15/432.31 c backtracks : 68414 (39.6%)
432.15/432.31 c delayed cutoffs : 42843
432.15/432.31 c repropagations : 206050 (923645 domain reductions, 32692 cutoffs)
432.15/432.31 c avg switch length: 20.15
432.15/432.31 c switching time : 118.58
432.15/432.31 c Solution :
432.15/432.31 c Solutions found : 0 (0 improvements)
432.15/432.31 c Primal Bound : infeasible
432.15/432.31 c Dual Bound : -
432.15/432.31 c Gap : 0.00 %
432.15/432.31 c Root Dual Bound : +0.00000000000000e+00
432.15/432.31 c Root Iterations : 0
432.15/432.40 c Time complete: 432.25.