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-2664307-1276274056.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.10 c 1.9s| 10000 | 7567 | 0 | 0.0 |5609k| 67 | - | 169 |2174 | 0 | 0 | 0 |2170 | 0 | 0.000000e+00 | -- | Inf
6.09/6.19 c 5.7s| 20000 | 13181 | 0 | 0.0 | 10M| 68 | - | 169 |3238 | 0 | 0 | 0 |5914 | 0 | 0.000000e+00 | -- | Inf
10.69/10.74 c 10.1s| 30000 | 18469 | 0 | 0.0 | 14M| 68 | - | 169 |4445 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
16.78/16.81 c 15.9s| 40000 | 22854 | 0 | 0.0 | 18M| 68 | - | 169 |5465 | 0 | 0 | 0 | 14k| 0 | 0.000000e+00 | -- | Inf
24.78/24.80 c 23.6s| 50000 | 26017 | 0 | 0.0 | 22M| 68 | - | 169 |6232 | 0 | 0 | 0 | 20k| 0 | 0.000000e+00 | -- | Inf
35.38/35.44 c 34.0s| 60000 | 27223 | 0 | 0.0 | 26M| 71 | - | 169 |6738 | 0 | 0 | 0 | 28k| 0 | 0.000000e+00 | -- | Inf
46.28/46.32 c 44.6s| 70000 | 29489 | 0 | 0.0 | 29M| 71 | - | 169 |7435 | 0 | 0 | 0 | 35k| 0 | 0.000000e+00 | -- | Inf
59.67/59.74 c 57.7s| 80000 | 30713 | 0 | 0.0 | 33M| 71 | - | 169 |9358 | 0 | 0 | 0 | 42k| 0 | 0.000000e+00 | -- | Inf
75.57/75.67 c 73.3s| 90000 | 31334 | 0 | 0.0 | 36M| 71 | - | 169 | 10k| 0 | 0 | 0 | 51k| 0 | 0.000000e+00 | -- | Inf
93.37/93.43 c 90.8s|100000 | 31220 | 0 | 0.0 | 39M| 71 | - | 169 | 11k| 0 | 0 | 0 | 59k| 0 | 0.000000e+00 | -- | Inf
112.36/112.45 c 109s|110000 | 30933 | 0 | 0.0 | 41M| 71 | - | 169 | 12k| 0 | 0 | 0 | 69k| 0 | 0.000000e+00 | -- | Inf
133.56/133.65 c 130s|120000 | 30176 | 0 | 0.0 | 43M| 71 | - | 169 | 13k| 0 | 0 | 0 | 78k| 0 | 0.000000e+00 | -- | Inf
162.76/162.90 c 159s|130000 | 26985 | 0 | 0.0 | 41M| 71 | - | 169 | 13k| 0 | 0 | 0 | 89k| 0 | 0.000000e+00 | -- | Inf
195.35/195.46 c 191s|140000 | 23084 | 0 | 0.0 | 41M| 71 | - | 169 | 16k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
234.73/234.85 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
234.73/234.85 c 230s|150000 | 17954 | 0 | 0.0 | 38M| 71 | - | 169 | 20k| 0 | 0 | 0 | 114k| 0 | 0.000000e+00 | -- | Inf
280.73/280.88 c 276s|160000 | 11864 | 0 | 0.0 | 32M| 71 | - | 169 | 24k| 0 | 0 | 0 | 128k| 0 | 0.000000e+00 | -- | Inf
350.00/350.19 c
350.00/350.19 c SCIP Status : problem is solved [infeasible]
350.00/350.19 c Solving Time (sec) : 344.83
350.00/350.19 c Solving Nodes : 169999
350.00/350.19 c Primal Bound : +1.00000000000000e+20 (0 solutions)
350.00/350.19 c Dual Bound : +1.00000000000000e+20
350.00/350.19 c Gap : 0.00 %
350.00/350.19 s UNSATISFIABLE
350.00/350.19 c SCIP Status : problem is solved [infeasible]
350.00/350.19 c Solving Time : 344.83
350.00/350.19 c Original Problem :
350.00/350.19 c Problem name : HOME/instance-2664307-1276274056.opb
350.00/350.19 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
350.00/350.19 c Constraints : 101 initial, 101 maximal
350.00/350.19 c Presolved Problem :
350.00/350.19 c Problem name : t_HOME/instance-2664307-1276274056.opb
350.00/350.19 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
350.00/350.19 c Constraints : 73 initial, 28821 maximal
350.00/350.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
350.00/350.19 c trivial : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c implics : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c probing : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c knapsack : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c setppc : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c linear : 0.00 0 0 0 0 0 28 0 0
350.00/350.19 c logicor : 0.00 0 0 0 0 0 0 0 0
350.00/350.19 c root node : - 0 - - 0 - - - -
350.00/350.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
350.00/350.19 c integral : 0 0 0 0 0 0 0 0 0 0
350.00/350.19 c knapsack : 1 0 583697 0 105616 13909 1664745 0 0 0
350.00/350.19 c setppc : 68 0 569788 0 105616 79828 1380957 0 0 0
350.00/350.19 c logicor : 4+ 0 263149 0 60342 1418 105896 0 0 0
350.00/350.19 c countsols : 0 0 0 0 105616 0 0 0 0 0
350.00/350.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
350.00/350.19 c integral : 0.00 0.00 0.00 0.00 0.00
350.00/350.19 c knapsack : 39.20 0.00 38.36 0.00 0.84
350.00/350.19 c setppc : 13.04 0.00 11.63 0.00 1.41
350.00/350.19 c logicor : 150.58 0.00 150.55 0.00 0.03
350.00/350.19 c countsols : 0.07 0.00 0.00 0.00 0.07
350.00/350.19 c Propagators : Time Calls Cutoffs DomReds
350.00/350.19 c vbounds : 0.29 1 0 0
350.00/350.19 c rootredcost : 0.25 0 0 0
350.00/350.19 c pseudoobj : 0.21 0 0 0
350.00/350.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
350.00/350.19 c propagation : 5.89 95155 95142 470598 20.2 2577 22.3 -
350.00/350.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
350.00/350.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
350.00/350.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
350.00/350.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
350.00/350.19 c applied globally : - - - 143649 14.8 - - -
350.00/350.19 c applied locally : - - - 1881 34.5 - - -
350.00/350.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
350.00/350.19 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
350.00/350.19 c redcost : 0.00 0 0 0 0 0
350.00/350.19 c impliedbounds : 0.00 0 0 0 0 0
350.00/350.20 c intobj : 0.00 0 0 0 0 0
350.00/350.20 c cgmip : 0.00 0 0 0 0 0
350.00/350.20 c gomory : 0.00 0 0 0 0 0
350.00/350.20 c strongcg : 0.00 0 0 0 0 0
350.00/350.20 c cmir : 0.00 0 0 0 0 0
350.00/350.20 c flowcover : 0.00 0 0 0 0 0
350.00/350.20 c clique : 0.00 0 0 0 0 0
350.00/350.20 c zerohalf : 0.00 0 0 0 0 0
350.00/350.20 c mcf : 0.00 0 0 0 0 0
350.00/350.20 c rapidlearning : 0.00 0 0 0 0 0
350.00/350.20 c Pricers : Time Calls Vars
350.00/350.20 c problem variables: 0.00 0 0
350.00/350.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
350.00/350.20 c relpscost : 0.00 0 0 0 0 0 0
350.00/350.20 c pscost : 0.00 0 0 0 0 0 0
350.00/350.20 c inference : 1.46 105616 0 0 0 0 211232
350.00/350.20 c mostinf : 0.00 0 0 0 0 0 0
350.00/350.20 c leastinf : 0.00 0 0 0 0 0 0
350.00/350.20 c fullstrong : 0.00 0 0 0 0 0 0
350.00/350.20 c allfullstrong : 0.00 0 0 0 0 0 0
350.00/350.20 c random : 0.00 0 0 0 0 0 0
350.00/350.20 c Primal Heuristics : Time Calls Found
350.00/350.20 c LP solutions : 0.00 - 0
350.00/350.20 c pseudo solutions : 0.00 - 0
350.00/350.20 c trivial : 0.00 1 0
350.00/350.20 c simplerounding : 0.00 0 0
350.00/350.20 c zirounding : 0.00 0 0
350.00/350.20 c rounding : 0.00 0 0
350.00/350.20 c shifting : 0.00 0 0
350.00/350.20 c intshifting : 0.00 0 0
350.00/350.20 c oneopt : 0.00 0 0
350.00/350.20 c twoopt : 0.00 0 0
350.00/350.20 c fixandinfer : 0.00 0 0
350.00/350.20 c feaspump : 0.00 0 0
350.00/350.20 c coefdiving : 0.00 0 0
350.00/350.20 c pscostdiving : 0.00 0 0
350.00/350.20 c fracdiving : 0.00 0 0
350.00/350.20 c veclendiving : 0.00 0 0
350.00/350.20 c intdiving : 0.00 0 0
350.00/350.20 c actconsdiving : 0.00 0 0
350.00/350.20 c objpscostdiving : 0.00 0 0
350.00/350.20 c rootsoldiving : 0.00 0 0
350.00/350.20 c linesearchdiving : 0.00 0 0
350.00/350.20 c guideddiving : 0.00 0 0
350.00/350.20 c octane : 0.00 0 0
350.00/350.20 c rens : 0.00 0 0
350.00/350.20 c rins : 0.00 0 0
350.00/350.20 c localbranching : 0.00 0 0
350.00/350.20 c mutation : 0.00 0 0
350.00/350.20 c crossover : 0.00 0 0
350.00/350.20 c dins : 0.00 0 0
350.00/350.20 c undercover : 0.00 0 0
350.00/350.20 c nlp : 0.00 0 0
350.00/350.20 c trysol : 0.00 0 0
350.00/350.20 c LP : Time Calls Iterations Iter/call Iter/sec
350.00/350.20 c primal LP : 0.00 0 0 0.00 -
350.00/350.20 c dual LP : 0.00 0 0 0.00 -
350.00/350.20 c lex dual LP : 0.00 0 0 0.00 -
350.00/350.20 c barrier LP : 0.00 0 0 0.00 -
350.00/350.20 c diving/probing LP: 0.00 0 0 0.00 -
350.00/350.20 c strong branching : 0.00 0 0 0.00 -
350.00/350.20 c (at root node) : - 0 0 0.00 -
350.00/350.20 c conflict analysis: 0.00 0 0 0.00 -
350.00/350.20 c B&B Tree :
350.00/350.20 c number of runs : 1
350.00/350.20 c nodes : 169999
350.00/350.20 c nodes (total) : 169999
350.00/350.20 c nodes left : 0
350.00/350.20 c max depth : 71
350.00/350.20 c max depth (total): 71
350.00/350.20 c backtracks : 68277 (40.2%)
350.00/350.20 c delayed cutoffs : 41234
350.00/350.20 c repropagations : 203825 (879194 domain reductions, 30772 cutoffs)
350.00/350.20 c avg switch length: 20.32
350.00/350.20 c switching time : 96.00
350.00/350.20 c Solution :
350.00/350.20 c Solutions found : 0 (0 improvements)
350.00/350.20 c Primal Bound : infeasible
350.00/350.20 c Dual Bound : -
350.00/350.20 c Gap : 0.00 %
350.00/350.20 c Root Dual Bound : +0.00000000000000e+00
350.00/350.20 c Root Iterations : 0
350.11/350.27 c Time complete: 350.18.