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-2664294-1276272665.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 = 1799.99
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.04 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.04 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.10/2.15 c 1.9s| 10000 | 7514 | 0 | 0.0 |5691k| 70 | - | 169 |2267 | 0 | 0 | 0 |2254 | 0 | 0.000000e+00 | -- | Inf
6.29/6.37 c 5.9s| 20000 | 13095 | 0 | 0.0 | 10M| 72 | - | 169 |3070 | 0 | 0 | 0 |6039 | 0 | 0.000000e+00 | -- | Inf
10.78/10.84 c 10.2s| 30000 | 18427 | 0 | 0.0 | 14M| 72 | - | 169 |4755 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
17.98/18.02 c 17.1s| 40000 | 22194 | 0 | 0.0 | 19M| 72 | - | 169 |7012 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
28.38/28.47 c 27.3s| 50000 | 24399 | 0 | 0.0 | 23M| 72 | - | 169 |8411 | 0 | 0 | 0 | 22k| 0 | 0.000000e+00 | -- | Inf
40.58/40.70 c 39.2s| 60000 | 25836 | 0 | 0.0 | 25M| 72 | - | 169 |6653 | 0 | 0 | 0 | 30k| 0 | 0.000000e+00 | -- | Inf
51.17/51.22 c 49.5s| 70000 | 28192 | 0 | 0.0 | 29M| 72 | - | 169 |8278 | 0 | 0 | 0 | 36k| 0 | 0.000000e+00 | -- | Inf
64.07/64.11 c 62.1s| 80000 | 30060 | 0 | 0.0 | 32M| 72 | - | 169 | 10k| 0 | 0 | 0 | 43k| 0 | 0.000000e+00 | -- | Inf
80.96/81.04 c 78.8s| 90000 | 30819 | 0 | 0.0 | 36M| 72 | - | 169 | 13k| 0 | 0 | 0 | 51k| 0 | 0.000000e+00 | -- | Inf
103.36/103.42 c 101s|100000 | 30603 | 0 | 0.0 | 39M| 72 | - | 169 | 17k| 0 | 0 | 0 | 60k| 0 | 0.000000e+00 | -- | Inf
131.24/131.31 c 128s|110000 | 29471 | 0 | 0.0 | 41M| 72 | - | 169 | 19k| 0 | 0 | 0 | 70k| 0 | 0.000000e+00 | -- | Inf
166.54/166.65 c 163s|120000 | 26866 | 0 | 0.0 | 39M| 72 | - | 169 | 17k| 0 | 0 | 0 | 80k| 0 | 0.000000e+00 | -- | Inf
203.71/203.88 c 200s|130000 | 23600 | 0 | 0.0 | 39M| 72 | - | 169 | 19k| 0 | 0 | 0 | 91k| 0 | 0.000000e+00 | -- | Inf
243.20/243.33 c 239s|140000 | 19744 | 0 | 0.0 | 39M| 72 | - | 169 | 23k| 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
295.69/295.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
295.69/295.81 c 291s|150000 | 13447 | 0 | 0.0 | 34M| 72 | - | 169 | 29k| 0 | 0 | 0 | 116k| 0 | 0.000000e+00 | -- | Inf
375.25/375.42 c 370s|160000 | 1676 | 0 | 0.0 | 18M| 72 | - | 169 | 32k| 0 | 0 | 0 | 133k| 0 | 0.000000e+00 | -- | Inf
383.75/383.99 c
383.75/383.99 c SCIP Status : problem is solved [infeasible]
383.75/383.99 c Solving Time (sec) : 378.80
383.75/383.99 c Solving Nodes : 160680
383.75/383.99 c Primal Bound : +1.00000000000000e+20 (0 solutions)
383.75/383.99 c Dual Bound : +1.00000000000000e+20
383.75/383.99 c Gap : 0.00 %
383.75/383.99 s UNSATISFIABLE
383.75/383.99 c SCIP Status : problem is solved [infeasible]
383.75/383.99 c Solving Time : 378.80
383.75/383.99 c Original Problem :
383.75/383.99 c Problem name : HOME/instance-2664294-1276272665.opb
383.75/383.99 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
383.75/383.99 c Constraints : 101 initial, 101 maximal
383.75/383.99 c Presolved Problem :
383.75/383.99 c Problem name : t_HOME/instance-2664294-1276272665.opb
383.75/383.99 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
383.75/383.99 c Constraints : 73 initial, 33488 maximal
383.75/383.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
383.75/383.99 c trivial : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c implics : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c probing : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c knapsack : 0.01 0 0 0 0 0 0 0 0
383.75/383.99 c setppc : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c linear : 0.00 0 0 0 0 0 28 0 0
383.75/383.99 c logicor : 0.00 0 0 0 0 0 0 0 0
383.75/383.99 c root node : - 0 - - 0 - - - -
383.75/383.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
383.75/383.99 c integral : 0 0 0 0 0 0 0 0 0 0
383.75/383.99 c knapsack : 1 0 555352 0 101022 12057 1603399 0 0 0
383.75/383.99 c setppc : 68 0 543295 0 101022 75448 1197529 0 0 0
383.75/383.99 c logicor : 4+ 0 230585 0 57115 1344 96643 0 0 0
383.75/383.99 c countsols : 0 0 0 0 101022 0 0 0 0 0
383.75/383.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
383.75/383.99 c integral : 0.00 0.00 0.00 0.00 0.00
383.75/383.99 c knapsack : 36.93 0.00 36.18 0.00 0.75
383.75/383.99 c setppc : 12.71 0.00 11.03 0.00 1.68
383.75/383.99 c logicor : 169.47 0.00 169.43 0.00 0.04
383.75/383.99 c countsols : 0.02 0.00 0.00 0.00 0.02
383.75/383.99 c Propagators : Time Calls Cutoffs DomReds
383.75/383.99 c vbounds : 0.33 1 0 0
383.75/383.99 c rootredcost : 0.33 0 0 0
383.75/383.99 c pseudoobj : 0.28 0 0 0
383.75/383.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
383.75/383.99 c propagation : 5.32 88849 88828 443744 18.9 2612 21.8 -
383.75/383.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
383.75/383.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
383.75/383.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
383.75/383.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
383.75/384.00 c applied globally : - - - 134523 14.0 - - -
383.75/384.00 c applied locally : - - - 1001 35.2 - - -
383.75/384.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
383.75/384.00 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
383.75/384.00 c redcost : 0.00 0 0 0 0 0
383.75/384.00 c impliedbounds : 0.00 0 0 0 0 0
383.75/384.00 c intobj : 0.00 0 0 0 0 0
383.75/384.00 c cgmip : 0.00 0 0 0 0 0
383.75/384.00 c gomory : 0.00 0 0 0 0 0
383.75/384.00 c strongcg : 0.00 0 0 0 0 0
383.75/384.00 c cmir : 0.00 0 0 0 0 0
383.75/384.00 c flowcover : 0.00 0 0 0 0 0
383.75/384.00 c clique : 0.00 0 0 0 0 0
383.75/384.00 c zerohalf : 0.00 0 0 0 0 0
383.75/384.00 c mcf : 0.00 0 0 0 0 0
383.75/384.00 c rapidlearning : 0.00 0 0 0 0 0
383.75/384.00 c Pricers : Time Calls Vars
383.75/384.00 c problem variables: 0.00 0 0
383.75/384.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
383.75/384.00 c relpscost : 0.00 0 0 0 0 0 0
383.75/384.00 c pscost : 0.00 0 0 0 0 0 0
383.75/384.00 c inference : 1.38 101022 0 0 0 0 202044
383.75/384.00 c mostinf : 0.00 0 0 0 0 0 0
383.75/384.00 c leastinf : 0.00 0 0 0 0 0 0
383.75/384.00 c fullstrong : 0.00 0 0 0 0 0 0
383.75/384.00 c allfullstrong : 0.00 0 0 0 0 0 0
383.75/384.00 c random : 0.00 0 0 0 0 0 0
383.75/384.00 c Primal Heuristics : Time Calls Found
383.75/384.00 c LP solutions : 0.00 - 0
383.75/384.00 c pseudo solutions : 0.00 - 0
383.75/384.00 c trivial : 0.00 1 0
383.75/384.00 c simplerounding : 0.00 0 0
383.75/384.00 c zirounding : 0.00 0 0
383.75/384.00 c rounding : 0.00 0 0
383.75/384.00 c shifting : 0.00 0 0
383.75/384.00 c intshifting : 0.00 0 0
383.75/384.00 c oneopt : 0.00 0 0
383.75/384.00 c twoopt : 0.00 0 0
383.75/384.00 c fixandinfer : 0.00 0 0
383.75/384.00 c feaspump : 0.00 0 0
383.75/384.00 c coefdiving : 0.00 0 0
383.75/384.00 c pscostdiving : 0.00 0 0
383.75/384.00 c fracdiving : 0.00 0 0
383.75/384.00 c veclendiving : 0.00 0 0
383.75/384.00 c intdiving : 0.00 0 0
383.75/384.00 c actconsdiving : 0.00 0 0
383.75/384.00 c objpscostdiving : 0.00 0 0
383.75/384.00 c rootsoldiving : 0.00 0 0
383.75/384.00 c linesearchdiving : 0.00 0 0
383.75/384.00 c guideddiving : 0.00 0 0
383.75/384.00 c octane : 0.00 0 0
383.75/384.00 c rens : 0.00 0 0
383.75/384.00 c rins : 0.00 0 0
383.75/384.00 c localbranching : 0.00 0 0
383.75/384.00 c mutation : 0.00 0 0
383.75/384.00 c crossover : 0.00 0 0
383.75/384.00 c dins : 0.00 0 0
383.75/384.00 c undercover : 0.00 0 0
383.75/384.00 c nlp : 0.00 0 0
383.75/384.00 c trysol : 0.00 0 0
383.75/384.00 c LP : Time Calls Iterations Iter/call Iter/sec
383.75/384.00 c primal LP : 0.00 0 0 0.00 -
383.75/384.00 c dual LP : 0.00 0 0 0.00 -
383.75/384.00 c lex dual LP : 0.00 0 0 0.00 -
383.75/384.00 c barrier LP : 0.00 0 0 0.00 -
383.75/384.00 c diving/probing LP: 0.00 0 0 0.00 -
383.75/384.00 c strong branching : 0.00 0 0 0.00 -
383.75/384.00 c (at root node) : - 0 0 0.00 -
383.75/384.00 c conflict analysis: 0.00 0 0 0.00 -
383.75/384.00 c B&B Tree :
383.75/384.00 c number of runs : 1
383.75/384.00 c nodes : 160680
383.75/384.00 c nodes (total) : 160680
383.75/384.00 c nodes left : 0
383.75/384.00 c max depth : 72
383.75/384.00 c max depth (total): 72
383.75/384.00 c backtracks : 64837 (40.4%)
383.75/384.00 c delayed cutoffs : 41365
383.75/384.00 c repropagations : 207334 (830358 domain reductions, 29191 cutoffs)
383.75/384.00 c avg switch length: 20.64
383.75/384.00 c switching time : 107.02
383.75/384.00 c Solution :
383.75/384.00 c Solutions found : 0 (0 improvements)
383.75/384.00 c Primal Bound : infeasible
383.75/384.00 c Dual Bound : -
383.75/384.00 c Gap : 0.00 %
383.75/384.00 c Root Dual Bound : +0.00000000000000e+00
383.75/384.00 c Root Iterations : 0
383.85/384.08 c Time complete: 383.93.