0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704121-1278549367.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.06 c presolving:
0.09/0.10 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.11 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.12 c (round 3) 0 del vars, 264 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.13 c presolving (4 rounds):
0.09/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 242 implications, 22 cliques
0.09/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.09/0.13 c 1 constraints of type <knapsack>
0.09/0.13 c 22 constraints of type <setppc>
0.09/0.13 c 2420 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.07
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.3
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1789.96
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = 5
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.13 c constraints/knapsack/disaggregation = FALSE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c presolving/probing/maxrounds = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/coefdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.13 c heuristics/crossover/freq = -1
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/crossover/nodesofs = 750
0.09/0.13 c
0.09/0.13 c # number of nodes without incumbent change that heuristic should wait
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.13 c heuristics/crossover/nwaitingnodes = 100
0.09/0.13 c
0.09/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.13 c # [type: real, range: [0,1], default: 0.1]
0.09/0.13 c heuristics/crossover/nodesquot = 0.15
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixed
0.09/0.13 c # [type: real, range: [0,1], default: 0.666]
0.09/0.13 c heuristics/crossover/minfixingrate = 0.5
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/feaspump/freq = -1
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/fracdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/guideddiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/intshifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/linesearchdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/nlp/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/objpscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.13 c # [type: real, range: [0,1], default: 0.01]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/oneopt/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/pscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/rens/freq = -1
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixable
0.09/0.13 c # [type: real, range: [0,1], default: 0.5]
0.09/0.13 c heuristics/rens/minfixingrate = 0.3
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/rens/nodesofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/rootsoldiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.13 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/rounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/shifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/simplerounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c heuristics/trivial/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/trysol/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/veclendiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/zirounding/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/cmir/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c separating/flowcover/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/rapidlearning/freq = 0
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 104 | - |4078k| 0 | 45 | 231 |2721 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 129 | - |4426k| 0 | 50 | 231 |2721 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 162 | - |4803k| 0 | 48 | 231 |2721 | 231 |2459 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 200 | - |4925k| 0 | 57 | 231 |2721 | 231 |2462 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.75 c 1.7s| 1 | 0 | 214 | - |4962k| 0 | 55 | 231 |2721 | 231 |2464 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.5s| 1 | 2 | 214 | - |4963k| 0 | 55 | 231 |2721 | 231 |2464 | 21 | 0 | 10 | 0.000000e+00 | -- | Inf
162.65/162.75 c 163s| 10000 | 49 |334240 | 33.4 |7857k| 40 | 39 | 231 |8989 | 231 |2453 | 21 |8348 |2348 | 0.000000e+00 | -- | Inf
264.93/265.01 c
264.93/265.01 c SCIP Status : problem is solved [infeasible]
264.93/265.01 c Solving Time (sec) : 264.96
264.93/265.01 c Solving Nodes : 18067
264.93/265.01 c Primal Bound : +1.00000000000000e+20 (0 solutions)
264.93/265.01 c Dual Bound : +1.00000000000000e+20
264.93/265.01 c Gap : 0.00 %
264.93/265.01 s UNSATISFIABLE
264.93/265.01 c SCIP Status : problem is solved [infeasible]
264.93/265.01 c Solving Time : 264.96
264.93/265.01 c Original Problem :
264.93/265.01 c Problem name : HOME/instance-2704121-1278549367.opb
264.93/265.01 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
264.93/265.01 c Constraints : 2707 initial, 2707 maximal
264.93/265.01 c Presolved Problem :
264.93/265.01 c Problem name : t_HOME/instance-2704121-1278549367.opb
264.93/265.01 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
264.93/265.01 c Constraints : 2443 initial, 10507 maximal
264.93/265.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
264.93/265.01 c trivial : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c implics : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c probing : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c knapsack : 0.00 0 0 0 0 0 0 0 0
264.93/265.01 c setppc : 0.00 0 0 0 0 0 121 0 0
264.93/265.01 c linear : 0.03 0 0 0 0 0 143 0 0
264.93/265.01 c logicor : 0.03 0 0 0 0 0 0 0 0
264.93/265.01 c root node : - 21 - - 21 - - - -
264.93/265.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
264.93/265.01 c integral : 0 0 0 9614 0 46 1031 0 0 18172
264.93/265.01 c knapsack : 1 5 72242 0 0 67 36482 0 0 0
264.93/265.01 c setppc : 22 5 72226 0 0 286 108794 0 0 0
264.93/265.01 c linear : 0+ 5 71673 0 0 0 635 0 0 0
264.93/265.01 c logicor : 2420+ 5 35139 0 0 92 104401 0 0 0
264.93/265.01 c countsols : 0 0 0 0 0 0 0 0 0 0
264.93/265.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
264.93/265.01 c integral : 48.78 0.00 0.00 48.78 0.00
264.93/265.01 c knapsack : 0.43 0.00 0.43 0.00 0.00
264.93/265.01 c setppc : 1.54 0.00 1.54 0.00 0.00
264.93/265.01 c linear : 1.34 0.00 1.34 0.00 0.00
264.93/265.01 c logicor : 5.48 0.00 5.48 0.00 0.00
264.93/265.01 c countsols : 0.00 0.00 0.00 0.00 0.00
264.93/265.01 c Propagators : Time Calls Cutoffs DomReds
264.93/265.01 c vbounds : 0.03 1 0 0
264.93/265.01 c rootredcost : 0.03 0 0 0
264.93/265.01 c pseudoobj : 0.02 0 0 0
264.93/265.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
264.93/265.01 c propagation : 0.03 445 437 1926 17.3 4 6.5 -
264.93/265.01 c infeasible LP : 3.22 8591 8581 45276 26.2 60 13.2 0
264.93/265.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
264.93/265.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
264.93/265.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
264.93/265.01 c applied globally : - - - 15195 18.6 - - -
264.93/265.01 c applied locally : - - - 126 32.6 - - -
264.93/265.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
264.93/265.01 c cut pool : 0.00 4 - - 11 - (maximal pool size: 383)
264.93/265.01 c redcost : 0.08 9158 0 0 0 0
264.93/265.01 c impliedbounds : 0.00 5 0 0 0 0
264.93/265.01 c intobj : 0.00 0 0 0 0 0
264.93/265.01 c cgmip : 0.00 0 0 0 0 0
264.93/265.01 c gomory : 0.76 5 0 0 884 0
264.93/265.01 c strongcg : 0.54 5 0 0 1792 0
264.93/265.01 c cmir : 0.00 0 0 0 0 0
264.93/265.01 c flowcover : 0.00 0 0 0 0 0
264.93/265.01 c clique : 0.00 5 0 0 0 0
264.93/265.01 c zerohalf : 0.00 0 0 0 0 0
264.93/265.01 c mcf : 0.00 1 0 0 0 0
264.93/265.01 c rapidlearning : 0.23 1 0 0 0 278
264.93/265.01 c Pricers : Time Calls Vars
264.93/265.01 c problem variables: 0.00 0 0
264.93/265.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
264.93/265.01 c relpscost : 48.75 9614 46 1031 0 0 18172
264.93/265.01 c pscost : 0.00 0 0 0 0 0 0
264.93/265.01 c inference : 0.00 0 0 0 0 0 0
264.93/265.01 c mostinf : 0.00 0 0 0 0 0 0
264.93/265.01 c leastinf : 0.00 0 0 0 0 0 0
264.93/265.01 c fullstrong : 0.00 0 0 0 0 0 0
264.93/265.01 c allfullstrong : 0.00 0 0 0 0 0 0
264.93/265.01 c random : 0.00 0 0 0 0 0 0
264.93/265.01 c Primal Heuristics : Time Calls Found
264.93/265.01 c LP solutions : 0.00 - 0
264.93/265.01 c pseudo solutions : 0.00 - 0
264.93/265.01 c trivial : 0.00 1 0
264.93/265.01 c simplerounding : 0.00 0 0
264.93/265.01 c zirounding : 0.00 0 0
264.93/265.01 c rounding : 0.00 0 0
264.93/265.01 c shifting : 0.00 0 0
264.93/265.01 c intshifting : 0.00 0 0
264.93/265.01 c oneopt : 0.00 0 0
264.93/265.01 c twoopt : 0.00 0 0
264.93/265.01 c fixandinfer : 0.00 0 0
264.93/265.01 c feaspump : 0.00 0 0
264.93/265.01 c coefdiving : 0.00 0 0
264.93/265.01 c pscostdiving : 0.00 0 0
264.93/265.01 c fracdiving : 0.00 0 0
264.93/265.01 c veclendiving : 0.00 0 0
264.93/265.01 c intdiving : 0.00 0 0
264.93/265.01 c actconsdiving : 0.00 0 0
264.93/265.01 c objpscostdiving : 0.00 0 0
264.93/265.01 c rootsoldiving : 0.00 0 0
264.93/265.01 c linesearchdiving : 0.00 0 0
264.93/265.01 c guideddiving : 0.00 0 0
264.93/265.01 c octane : 0.00 0 0
264.93/265.01 c rens : 0.00 0 0
264.93/265.01 c rins : 0.00 0 0
264.93/265.01 c localbranching : 0.00 0 0
264.93/265.01 c mutation : 0.00 0 0
264.93/265.01 c crossover : 0.00 0 0
264.93/265.01 c dins : 0.00 0 0
264.93/265.01 c undercover : 0.00 0 0
264.93/265.01 c nlp : 0.00 0 0
264.93/265.01 c trysol : 0.00 0 0
264.93/265.01 c LP : Time Calls Iterations Iter/call Iter/sec
264.93/265.01 c primal LP : 0.00 0 0 0.00 -
264.93/265.01 c dual LP : 187.00 18176 618535 34.03 3307.61
264.93/265.01 c lex dual LP : 0.00 0 0 0.00 -
264.93/265.01 c barrier LP : 0.00 0 0 0.00 -
264.93/265.01 c diving/probing LP: 0.00 0 0 0.00 -
264.93/265.01 c strong branching : 48.34 2533 154874 61.14 3203.88
264.93/265.01 c (at root node) : - 10 2027 202.70 -
264.93/265.01 c conflict analysis: 0.00 0 0 0.00 -
264.93/265.01 c B&B Tree :
264.93/265.01 c number of runs : 1
264.93/265.01 c nodes : 18067
264.93/265.01 c nodes (total) : 18067
264.93/265.01 c nodes left : 0
264.93/265.01 c max depth : 44
264.93/265.01 c max depth (total): 44
264.93/265.01 c backtracks : 2262 (12.5%)
264.93/265.01 c delayed cutoffs : 106
264.93/265.01 c repropagations : 29637 (49286 domain reductions, 101 cutoffs)
264.93/265.01 c avg switch length: 4.87
264.93/265.01 c switching time : 6.37
264.93/265.01 c Solution :
264.93/265.01 c Solutions found : 0 (0 improvements)
264.93/265.01 c Primal Bound : infeasible
264.93/265.01 c Dual Bound : -
264.93/265.01 c Gap : 0.00 %
264.93/265.01 c Root Dual Bound : +0.00000000000000e+00
264.93/265.01 c Root Iterations : 214
264.93/265.04 c Time complete: 264.97.