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-2664285-1276272163.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.10/2.11 c 1.9s| 10000 | 7449 | 0 | 0.0 |5568k| 78 | - | 169 |2338 | 0 | 0 | 0 |2317 | 0 | 0.000000e+00 | -- | Inf
6.29/6.32 c 5.9s| 20000 | 13052 | 0 | 0.0 |9907k| 78 | - | 169 |3323 | 0 | 0 | 0 |6047 | 0 | 0.000000e+00 | -- | Inf
11.09/11.18 c 10.5s| 30000 | 17938 | 0 | 0.0 | 14M| 78 | - | 169 |4446 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
17.49/17.50 c 16.6s| 40000 | 21892 | 0 | 0.0 | 18M| 78 | - | 169 |5514 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
26.98/27.09 c 25.9s| 50000 | 23272 | 0 | 0.0 | 22M| 78 | - | 169 |6163 | 0 | 0 | 0 | 23k| 0 | 0.000000e+00 | -- | Inf
37.08/37.19 c 35.8s| 60000 | 25226 | 0 | 0.0 | 25M| 78 | - | 169 |6234 | 0 | 0 | 0 | 30k| 0 | 0.000000e+00 | -- | Inf
48.48/48.59 c 46.9s| 70000 | 26645 | 0 | 0.0 | 28M| 78 | - | 169 |8114 | 0 | 0 | 0 | 38k| 0 | 0.000000e+00 | -- | Inf
62.88/62.94 c 61.0s| 80000 | 27363 | 0 | 0.0 | 31M| 78 | - | 169 | 10k| 0 | 0 | 0 | 46k| 0 | 0.000000e+00 | -- | Inf
80.07/80.18 c 77.9s| 90000 | 27542 | 0 | 0.0 | 34M| 78 | - | 169 | 12k| 0 | 0 | 0 | 54k| 0 | 0.000000e+00 | -- | Inf
101.36/101.41 c 98.8s|100000 | 26612 | 0 | 0.0 | 36M| 78 | - | 169 | 13k| 0 | 0 | 0 | 64k| 0 | 0.000000e+00 | -- | Inf
131.96/132.04 c 129s|110000 | 22469 | 0 | 0.0 | 34M| 78 | - | 169 | 12k| 0 | 0 | 0 | 76k| 0 | 0.000000e+00 | -- | Inf
163.76/163.84 c 160s|120000 | 18206 | 0 | 0.0 | 33M| 78 | - | 169 | 16k| 0 | 0 | 0 | 88k| 0 | 0.000000e+00 | -- | Inf
201.04/201.11 c 197s|130000 | 13023 | 0 | 0.0 | 30M| 78 | - | 169 | 20k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
257.43/257.53 c 253s|140000 | 2621 | 0 | 0.0 | 16M| 78 | - | 169 | 22k| 0 | 0 | 0 | 117k| 0 | 0.000000e+00 | -- | Inf
267.82/267.90 c
267.82/267.90 c SCIP Status : problem is solved [infeasible]
267.82/267.90 c Solving Time (sec) : 263.52
267.82/267.90 c Solving Nodes : 141431
267.82/267.90 c Primal Bound : +1.00000000000000e+20 (0 solutions)
267.82/267.90 c Dual Bound : +1.00000000000000e+20
267.82/267.90 c Gap : 0.00 %
267.82/267.90 s UNSATISFIABLE
267.82/267.90 c SCIP Status : problem is solved [infeasible]
267.82/267.90 c Solving Time : 263.52
267.82/267.90 c Original Problem :
267.82/267.90 c Problem name : HOME/instance-2664285-1276272163.opb
267.82/267.90 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
267.82/267.90 c Constraints : 101 initial, 101 maximal
267.82/267.90 c Presolved Problem :
267.82/267.90 c Problem name : t_HOME/instance-2664285-1276272163.opb
267.82/267.90 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
267.82/267.90 c Constraints : 73 initial, 24209 maximal
267.82/267.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
267.82/267.90 c trivial : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c dualfix : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c inttobinary : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c implics : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c probing : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c knapsack : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c setppc : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c linear : 0.01 0 0 0 0 0 28 0 0
267.82/267.90 c logicor : 0.00 0 0 0 0 0 0 0 0
267.82/267.90 c root node : - 1 - - 1 - - - -
267.82/267.90 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
267.82/267.90 c integral : 0 0 0 0 0 0 0 0 0 0
267.82/267.90 c knapsack : 1 0 484782 0 88322 10203 1467104 0 0 0
267.82/267.90 c setppc : 68 0 474579 0 88322 66481 1065111 0 0 0
267.82/267.90 c logicor : 4+ 0 201458 0 43563 957 80653 0 0 0
267.82/267.90 c countsols : 0 0 0 0 88322 0 0 0 0 0
267.82/267.90 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
267.82/267.90 c integral : 0.00 0.00 0.00 0.00 0.00
267.82/267.90 c knapsack : 29.78 0.00 29.19 0.00 0.59
267.82/267.90 c setppc : 9.98 0.00 8.79 0.00 1.19
267.82/267.90 c logicor : 114.80 0.00 114.78 0.00 0.02
267.82/267.90 c countsols : 0.01 0.00 0.00 0.00 0.01
267.82/267.90 c Propagators : Time Calls Cutoffs DomReds
267.82/267.90 c vbounds : 0.28 1 0 0
267.82/267.90 c rootredcost : 0.23 0 0 0
267.82/267.90 c pseudoobj : 0.21 0 0 0
267.82/267.90 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
267.82/267.90 c propagation : 4.52 77641 77623 379162 18.5 1979 21.7 -
267.82/267.90 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
267.82/267.90 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
267.82/267.90 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
267.82/267.90 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
267.82/267.90 c applied globally : - - - 119926 14.0 - - -
267.82/267.90 c applied locally : - - - 633 34.2 - - -
267.82/267.90 c Separators : Time Calls Cutoffs DomReds Cuts Conss
267.82/267.90 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
267.82/267.90 c redcost : 0.00 0 0 0 0 0
267.82/267.90 c impliedbounds : 0.00 0 0 0 0 0
267.82/267.90 c intobj : 0.00 0 0 0 0 0
267.82/267.90 c cgmip : 0.00 0 0 0 0 0
267.82/267.90 c gomory : 0.00 0 0 0 0 0
267.82/267.90 c strongcg : 0.00 0 0 0 0 0
267.82/267.90 c cmir : 0.00 0 0 0 0 0
267.82/267.90 c flowcover : 0.00 0 0 0 0 0
267.82/267.90 c clique : 0.00 0 0 0 0 0
267.82/267.90 c zerohalf : 0.00 0 0 0 0 0
267.82/267.90 c mcf : 0.00 0 0 0 0 0
267.82/267.90 c rapidlearning : 0.00 0 0 0 0 0
267.82/267.90 c Pricers : Time Calls Vars
267.82/267.90 c problem variables: 0.00 0 0
267.82/267.90 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
267.82/267.90 c relpscost : 0.00 0 0 0 0 0 0
267.82/267.90 c pscost : 0.00 0 0 0 0 0 0
267.82/267.90 c inference : 1.13 88322 0 0 0 0 176644
267.82/267.90 c mostinf : 0.00 0 0 0 0 0 0
267.82/267.90 c leastinf : 0.00 0 0 0 0 0 0
267.82/267.90 c fullstrong : 0.00 0 0 0 0 0 0
267.82/267.90 c allfullstrong : 0.00 0 0 0 0 0 0
267.82/267.90 c random : 0.00 0 0 0 0 0 0
267.82/267.90 c Primal Heuristics : Time Calls Found
267.82/267.90 c LP solutions : 0.00 - 0
267.82/267.90 c pseudo solutions : 0.00 - 0
267.82/267.90 c trivial : 0.00 1 0
267.82/267.90 c simplerounding : 0.00 0 0
267.82/267.90 c zirounding : 0.00 0 0
267.82/267.90 c rounding : 0.00 0 0
267.82/267.90 c shifting : 0.00 0 0
267.82/267.90 c intshifting : 0.00 0 0
267.82/267.90 c oneopt : 0.00 0 0
267.82/267.90 c twoopt : 0.00 0 0
267.82/267.90 c fixandinfer : 0.00 0 0
267.82/267.90 c feaspump : 0.00 0 0
267.82/267.90 c coefdiving : 0.00 0 0
267.82/267.90 c pscostdiving : 0.00 0 0
267.82/267.90 c fracdiving : 0.00 0 0
267.82/267.90 c veclendiving : 0.00 0 0
267.82/267.90 c intdiving : 0.00 0 0
267.82/267.90 c actconsdiving : 0.00 0 0
267.82/267.90 c objpscostdiving : 0.00 0 0
267.82/267.90 c rootsoldiving : 0.00 0 0
267.82/267.90 c linesearchdiving : 0.00 0 0
267.82/267.90 c guideddiving : 0.00 0 0
267.82/267.90 c octane : 0.00 0 0
267.82/267.90 c rens : 0.00 0 0
267.82/267.90 c rins : 0.00 0 0
267.82/267.90 c localbranching : 0.00 0 0
267.82/267.90 c mutation : 0.00 0 0
267.82/267.90 c crossover : 0.00 0 0
267.82/267.90 c dins : 0.00 0 0
267.82/267.90 c undercover : 0.00 0 0
267.82/267.90 c nlp : 0.00 0 0
267.82/267.90 c trysol : 0.00 0 0
267.82/267.90 c LP : Time Calls Iterations Iter/call Iter/sec
267.82/267.90 c primal LP : 0.00 0 0 0.00 -
267.82/267.90 c dual LP : 0.00 0 0 0.00 -
267.82/267.90 c lex dual LP : 0.00 0 0 0.00 -
267.82/267.90 c barrier LP : 0.00 0 0 0.00 -
267.82/267.90 c diving/probing LP: 0.00 0 0 0.00 -
267.82/267.90 c strong branching : 0.00 0 0 0.00 -
267.82/267.90 c (at root node) : - 0 0 0.00 -
267.82/267.90 c conflict analysis: 0.00 0 0 0.00 -
267.82/267.90 c B&B Tree :
267.82/267.90 c number of runs : 1
267.82/267.90 c nodes : 141431
267.82/267.90 c nodes (total) : 141431
267.82/267.90 c nodes left : 0
267.82/267.90 c max depth : 78
267.82/267.90 c max depth (total): 78
267.82/267.90 c backtracks : 57380 (40.6%)
267.82/267.90 c delayed cutoffs : 35214
267.82/267.90 c repropagations : 184447 (720778 domain reductions, 24532 cutoffs)
267.82/267.90 c avg switch length: 20.45
267.82/267.90 c switching time : 74.24
267.82/267.90 c Solution :
267.82/267.90 c Solutions found : 0 (0 improvements)
267.82/267.90 c Primal Bound : infeasible
267.82/267.90 c Dual Bound : -
267.82/267.90 c Gap : 0.00 %
267.82/267.90 c Root Dual Bound : +0.00000000000000e+00
267.82/267.90 c Root Iterations : 0
267.82/267.96 c Time complete: 267.89.