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-2664371-1276279174.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.19/2.25 c 2.0s| 10000 | 7220 | 0 | 0.0 |5595k| 70 | - | 169 |2419 | 0 | 0 | 0 |2445 | 0 | 0.000000e+00 | -- | Inf
6.09/6.17 c 5.7s| 20000 | 13255 | 0 | 0.0 | 10M| 76 | - | 169 |3761 | 0 | 0 | 0 |6002 | 0 | 0.000000e+00 | -- | Inf
11.00/11.05 c 10.4s| 30000 | 18196 | 0 | 0.0 | 14M| 76 | - | 169 |4247 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
17.69/17.78 c 16.9s| 40000 | 21683 | 0 | 0.0 | 18M| 76 | - | 169 |5116 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
27.78/27.83 c 26.6s| 50000 | 22881 | 0 | 0.0 | 21M| 76 | - | 169 |6268 | 0 | 0 | 0 | 24k| 0 | 0.000000e+00 | -- | Inf
35.98/36.09 c 34.6s| 60000 | 26452 | 0 | 0.0 | 25M| 76 | - | 169 |6354 | 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
46.08/46.18 c 44.5s| 70000 | 29077 | 0 | 0.0 | 29M| 76 | - | 169 |8443 | 0 | 0 | 0 | 36k| 0 | 0.000000e+00 | -- | Inf
60.57/60.60 c 58.6s| 80000 | 30242 | 0 | 0.0 | 32M| 76 | - | 169 | 10k| 0 | 0 | 0 | 44k| 0 | 0.000000e+00 | -- | Inf
78.56/78.65 c 76.3s| 90000 | 30191 | 0 | 0.0 | 35M| 76 | - | 169 | 11k| 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
99.85/99.91 c 97.2s|100000 | 29205 | 0 | 0.0 | 36M| 76 | - | 169 | 12k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
126.94/127.08 c 124s|110000 | 26328 | 0 | 0.0 | 36M| 76 | - | 169 | 13k| 0 | 0 | 0 | 74k| 0 | 0.000000e+00 | -- | Inf
154.53/154.65 c 151s|120000 | 24901 | 0 | 0.0 | 38M| 76 | - | 169 | 15k| 0 | 0 | 0 | 84k| 0 | 0.000000e+00 | -- | Inf
188.13/188.20 c 184s|130000 | 22484 | 0 | 0.0 | 39M| 76 | - | 169 | 18k| 0 | 0 | 0 | 96k| 0 | 0.000000e+00 | -- | Inf
231.51/231.64 c 228s|140000 | 17713 | 0 | 0.0 | 36M| 76 | - | 169 | 21k| 0 | 0 | 0 | 109k| 0 | 0.000000e+00 | -- | Inf
287.20/287.37 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
287.20/287.37 c 283s|150000 | 9692 | 0 | 0.0 | 28M| 76 | - | 169 | 22k| 0 | 0 | 0 | 124k| 0 | 0.000000e+00 | -- | Inf
340.98/341.17 c
340.98/341.17 c SCIP Status : problem is solved [infeasible]
340.98/341.17 c Solving Time (sec) : 336.21
340.98/341.17 c Solving Nodes : 157147
340.98/341.17 c Primal Bound : +1.00000000000000e+20 (0 solutions)
340.98/341.17 c Dual Bound : +1.00000000000000e+20
340.98/341.17 c Gap : 0.00 %
340.98/341.17 s UNSATISFIABLE
340.98/341.17 c SCIP Status : problem is solved [infeasible]
340.98/341.17 c Solving Time : 336.21
340.98/341.17 c Original Problem :
340.98/341.17 c Problem name : HOME/instance-2664371-1276279174.opb
340.98/341.17 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
340.98/341.17 c Constraints : 101 initial, 101 maximal
340.98/341.17 c Presolved Problem :
340.98/341.17 c Problem name : t_HOME/instance-2664371-1276279174.opb
340.98/341.17 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
340.98/341.17 c Constraints : 73 initial, 27436 maximal
340.98/341.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
340.98/341.17 c trivial : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c implics : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c probing : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c knapsack : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c setppc : 0.01 0 0 0 0 0 0 0 0
340.98/341.17 c linear : 0.00 0 0 0 0 0 28 0 0
340.98/341.17 c logicor : 0.00 0 0 0 0 0 0 0 0
340.98/341.17 c root node : - 1 - - 1 - - - -
340.98/341.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
340.98/341.17 c integral : 0 0 0 0 0 0 0 0 0 0
340.98/341.17 c knapsack : 1 0 546348 0 98248 12386 1479532 0 0 0
340.98/341.17 c setppc : 68 0 533962 0 98248 72334 1180530 0 0 0
340.98/341.17 c logicor : 4+ 0 229566 0 39236 1174 91968 0 0 0
340.98/341.17 c countsols : 0 0 0 0 98248 0 0 0 0 0
340.98/341.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
340.98/341.17 c integral : 0.00 0.00 0.00 0.00 0.00
340.98/341.17 c knapsack : 35.07 0.00 34.33 0.00 0.74
340.98/341.17 c setppc : 11.48 0.00 10.33 0.00 1.15
340.98/341.17 c logicor : 150.10 0.00 150.07 0.00 0.03
340.98/341.17 c countsols : 0.05 0.00 0.00 0.00 0.05
340.98/341.17 c Propagators : Time Calls Cutoffs DomReds
340.98/341.17 c vbounds : 0.31 1 0 0
340.98/341.17 c rootredcost : 0.30 0 0 0
340.98/341.17 c pseudoobj : 0.30 0 0 0
340.98/341.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
340.98/341.17 c propagation : 4.86 85894 85871 430572 19.4 2310 21.9 -
340.98/341.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
340.98/341.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
340.98/341.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
340.98/341.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
340.98/341.17 c applied globally : - - - 137143 14.1 - - -
340.98/341.17 c applied locally : - - - 777 34.8 - - -
340.98/341.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
340.98/341.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
340.98/341.17 c redcost : 0.00 0 0 0 0 0
340.98/341.17 c impliedbounds : 0.00 0 0 0 0 0
340.98/341.17 c intobj : 0.00 0 0 0 0 0
340.98/341.17 c cgmip : 0.00 0 0 0 0 0
340.98/341.17 c gomory : 0.00 0 0 0 0 0
340.98/341.17 c strongcg : 0.00 0 0 0 0 0
340.98/341.17 c cmir : 0.00 0 0 0 0 0
340.98/341.17 c flowcover : 0.00 0 0 0 0 0
340.98/341.17 c clique : 0.00 0 0 0 0 0
340.98/341.17 c zerohalf : 0.00 0 0 0 0 0
340.98/341.17 c mcf : 0.00 0 0 0 0 0
340.98/341.17 c rapidlearning : 0.00 0 0 0 0 0
340.98/341.17 c Pricers : Time Calls Vars
340.98/341.17 c problem variables: 0.00 0 0
340.98/341.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
340.98/341.17 c relpscost : 0.00 0 0 0 0 0 0
340.98/341.17 c pscost : 0.00 0 0 0 0 0 0
340.98/341.17 c inference : 1.55 98248 0 0 0 0 196496
340.98/341.17 c mostinf : 0.00 0 0 0 0 0 0
340.98/341.17 c leastinf : 0.00 0 0 0 0 0 0
340.98/341.17 c fullstrong : 0.00 0 0 0 0 0 0
340.98/341.17 c allfullstrong : 0.00 0 0 0 0 0 0
340.98/341.17 c random : 0.00 0 0 0 0 0 0
340.98/341.17 c Primal Heuristics : Time Calls Found
340.98/341.17 c LP solutions : 0.00 - 0
340.98/341.17 c pseudo solutions : 0.00 - 0
340.98/341.17 c trivial : 0.00 1 0
340.98/341.17 c simplerounding : 0.00 0 0
340.98/341.17 c zirounding : 0.00 0 0
340.98/341.17 c rounding : 0.00 0 0
340.98/341.17 c shifting : 0.00 0 0
340.98/341.17 c intshifting : 0.00 0 0
340.98/341.17 c oneopt : 0.00 0 0
340.98/341.17 c twoopt : 0.00 0 0
340.98/341.17 c fixandinfer : 0.00 0 0
340.98/341.17 c feaspump : 0.00 0 0
340.98/341.17 c coefdiving : 0.00 0 0
340.98/341.17 c pscostdiving : 0.00 0 0
340.98/341.17 c fracdiving : 0.00 0 0
340.98/341.17 c veclendiving : 0.00 0 0
340.98/341.17 c intdiving : 0.00 0 0
340.98/341.17 c actconsdiving : 0.00 0 0
340.98/341.17 c objpscostdiving : 0.00 0 0
340.98/341.17 c rootsoldiving : 0.00 0 0
340.98/341.17 c linesearchdiving : 0.00 0 0
340.98/341.17 c guideddiving : 0.00 0 0
340.98/341.17 c octane : 0.00 0 0
340.98/341.17 c rens : 0.00 0 0
340.98/341.17 c rins : 0.00 0 0
340.98/341.17 c localbranching : 0.00 0 0
340.98/341.17 c mutation : 0.00 0 0
340.98/341.17 c crossover : 0.00 0 0
340.98/341.17 c dins : 0.00 0 0
340.98/341.17 c undercover : 0.00 0 0
340.98/341.17 c nlp : 0.00 0 0
340.98/341.17 c trysol : 0.00 0 0
340.98/341.17 c LP : Time Calls Iterations Iter/call Iter/sec
340.98/341.17 c primal LP : 0.00 0 0 0.00 -
340.98/341.17 c dual LP : 0.00 0 0 0.00 -
340.98/341.17 c lex dual LP : 0.00 0 0 0.00 -
340.98/341.17 c barrier LP : 0.00 0 0 0.00 -
340.98/341.17 c diving/probing LP: 0.00 0 0 0.00 -
340.98/341.17 c strong branching : 0.00 0 0 0.00 -
340.98/341.17 c (at root node) : - 0 0 0.00 -
340.98/341.17 c conflict analysis: 0.00 0 0 0.00 -
340.98/341.17 c B&B Tree :
340.98/341.17 c number of runs : 1
340.98/341.17 c nodes : 157147
340.98/341.17 c nodes (total) : 157147
340.98/341.17 c nodes left : 0
340.98/341.17 c max depth : 76
340.98/341.17 c max depth (total): 76
340.98/341.17 c backtracks : 63375 (40.3%)
340.98/341.17 c delayed cutoffs : 39350
340.98/341.17 c repropagations : 206897 (754237 domain reductions, 26995 cutoffs)
340.98/341.17 c avg switch length: 20.66
340.98/341.17 c switching time : 93.58
340.98/341.17 c Solution :
340.98/341.17 c Solutions found : 0 (0 improvements)
340.98/341.17 c Primal Bound : infeasible
340.98/341.17 c Dual Bound : -
340.98/341.17 c Gap : 0.00 %
340.98/341.17 c Root Dual Bound : +0.00000000000000e+00
340.98/341.17 c Root Iterations : 0
341.08/341.24 c Time complete: 341.12.