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-2704144-1278549670.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.08/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.10/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.10/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.10/0.13 c presolving (4 rounds):
0.10/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.13 c 242 implications, 22 cliques
0.10/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.10/0.13 c 1 constraints of type <knapsack>
0.10/0.13 c 22 constraints of type <setppc>
0.10/0.13 c 2420 constraints of type <logicor>
0.10/0.13 c transformed objective value is always integral (scale: 1)
0.10/0.13 c Presolving Time: 0.07
0.10/0.13 c - non default parameters ----------------------------------------------------------------------
0.10/0.13 c # SCIP version 1.2.1.3
0.10/0.13 c
0.10/0.13 c # frequency for displaying node information lines
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.13 c display/freq = 10000
0.10/0.13 c
0.10/0.13 c # maximal time in seconds to run
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/time = 1789.96
0.10/0.13 c
0.10/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/memory = 1620
0.10/0.13 c
0.10/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c limits/solutions = 1
0.10/0.13 c
0.10/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.13 c separating/maxrounds = 1
0.10/0.13 c
0.10/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c separating/maxroundsroot = 5
0.10/0.13 c
0.10/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.10/0.13 c # [type: int, range: [1,2], default: 1]
0.10/0.13 c timing/clocktype = 2
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify inequalities
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/linear/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/indicator/addCouplingCons = TRUE
0.10/0.13 c
0.10/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.13 c constraints/knapsack/disaggregation = FALSE
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify knapsacks
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c presolving/probing/maxrounds = 0
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/coefdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.13 c heuristics/crossover/freq = -1
0.10/0.13 c
0.10/0.13 c # number of nodes added to the contingent of the total nodes
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.13 c heuristics/crossover/nodesofs = 750
0.10/0.13 c
0.10/0.13 c # number of nodes without incumbent change that heuristic should wait
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.13 c heuristics/crossover/nwaitingnodes = 100
0.10/0.13 c
0.10/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.13 c # [type: real, range: [0,1], default: 0.1]
0.10/0.13 c heuristics/crossover/nodesquot = 0.15
0.10/0.13 c
0.10/0.13 c # minimum percentage of integer variables that have to be fixed
0.10/0.13 c # [type: real, range: [0,1], default: 0.666]
0.10/0.13 c heuristics/crossover/minfixingrate = 0.5
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/feaspump/freq = -1
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/fracdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/guideddiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/intshifting/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/linesearchdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/nlp/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/objpscostdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.13 c # [type: real, range: [0,1], default: 0.01]
0.10/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/oneopt/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/pscostdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c heuristics/rens/freq = -1
0.10/0.13 c
0.10/0.13 c # minimum percentage of integer variables that have to be fixable
0.10/0.13 c # [type: real, range: [0,1], default: 0.5]
0.10/0.13 c heuristics/rens/minfixingrate = 0.3
0.10/0.13 c
0.10/0.13 c # number of nodes added to the contingent of the total nodes
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.13 c heuristics/rens/nodesofs = 2000
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/rootsoldiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.13 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/rounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/shifting/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/simplerounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c heuristics/trivial/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/trysol/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/veclendiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/zirounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c separating/cmir/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c separating/flowcover/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c separating/rapidlearning/freq = 0
0.10/0.13 c
0.10/0.13 c -----------------------------------------------------------------------------------------------
0.10/0.13 c start solving
0.10/0.13 c
0.10/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.10/0.15 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 104 | - |3920k| 0 | 45 | 231 |2623 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 130 | - |4269k| 0 | 50 | 231 |2623 | 231 |2457 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.00 c 1.0s| 1 | 0 | 160 | - |4645k| 0 | 49 | 231 |2623 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 184 | - |4654k| 0 | 55 | 231 |2623 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 205 | - |4672k| 0 | 57 | 231 |2623 | 231 |2464 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.4s| 1 | 2 | 205 | - |4673k| 0 | 57 | 231 |2623 | 231 |2464 | 21 | 0 | 10 | 0.000000e+00 | -- | Inf
136.45/136.57 c 137s| 10000 | 60 |268955 | 26.9 |6654k| 39 | - | 231 |6444 | 231 |2454 | 21 |6416 |2255 | 0.000000e+00 | -- | Inf
242.92/243.04 c 243s| 20000 | 22 |558818 | 27.9 |6887k| 40 | 46 | 231 |6911 | 231 |2454 | 21 | 12k|2483 | 0.000000e+00 | -- | Inf
350.47/350.62 c 351s| 30000 | 53 |831646 | 27.7 |8329k| 40 | - | 231 | 10k| 231 |2454 | 21 | 20k|3131 | 0.000000e+00 | -- | Inf
463.43/463.65 c 464s| 40000 | 51 | 1123k| 28.1 |9137k| 41 | 33 | 231 | 12k| 231 |2454 | 21 | 26k|3681 | 0.000000e+00 | -- | Inf
575.01/575.22 c 575s| 50000 | 15 | 1410k| 28.2 |9965k| 47 | - | 231 | 14k| 231 |2454 | 21 | 34k|4182 | 0.000000e+00 | -- | Inf
695.85/696.16 c 696s| 60000 | 19 | 1723k| 28.7 | 11M| 48 | 30 | 231 | 18k| 231 |2454 | 21 | 41k|4727 | 0.000000e+00 | -- | Inf
733.04/733.36 c
733.04/733.36 c SCIP Status : problem is solved [infeasible]
733.04/733.36 c Solving Time (sec) : 733.31
733.04/733.36 c Solving Nodes : 62858
733.04/733.36 c Primal Bound : +1.00000000000000e+20 (0 solutions)
733.04/733.36 c Dual Bound : +1.00000000000000e+20
733.04/733.36 c Gap : 0.00 %
733.04/733.36 s UNSATISFIABLE
733.04/733.36 c SCIP Status : problem is solved [infeasible]
733.04/733.36 c Solving Time : 733.31
733.04/733.36 c Original Problem :
733.04/733.36 c Problem name : HOME/instance-2704144-1278549670.opb
733.04/733.36 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
733.04/733.36 c Constraints : 2707 initial, 2707 maximal
733.04/733.36 c Presolved Problem :
733.04/733.36 c Problem name : t_HOME/instance-2704144-1278549670.opb
733.04/733.36 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
733.04/733.36 c Constraints : 2443 initial, 19658 maximal
733.04/733.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
733.04/733.36 c trivial : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c implics : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c probing : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c knapsack : 0.00 0 0 0 0 0 0 0 0
733.04/733.36 c setppc : 0.00 0 0 0 0 0 121 0 0
733.04/733.36 c linear : 0.03 0 0 0 0 0 143 0 0
733.04/733.36 c logicor : 0.03 0 0 0 0 0 0 0 0
733.04/733.36 c root node : - 3 - - 3 - - - -
733.04/733.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
733.04/733.36 c integral : 0 0 0 32818 0 116 1949 0 0 63274
733.04/733.36 c knapsack : 1 5 244924 0 0 302 111385 0 0 0
733.04/733.36 c setppc : 22 5 244777 0 0 1423 345171 0 0 0
733.04/733.36 c linear : 0+ 5 154269 0 0 3 4682 1 0 0
733.04/733.36 c logicor : 2420+ 5 119603 0 0 442 396997 0 0 0
733.04/733.36 c countsols : 0 0 0 0 0 0 0 0 0 0
733.04/733.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
733.04/733.36 c integral : 80.78 0.00 0.00 80.78 0.00
733.04/733.36 c knapsack : 1.48 0.00 1.48 0.00 0.00
733.04/733.36 c setppc : 2.90 0.00 2.90 0.00 0.00
733.04/733.36 c linear : 0.88 0.00 0.88 0.00 0.00
733.04/733.36 c logicor : 21.97 0.00 21.97 0.00 0.00
733.04/733.36 c countsols : 0.00 0.00 0.00 0.00 0.00
733.04/733.36 c Propagators : Time Calls Cutoffs DomReds
733.04/733.36 c vbounds : 0.11 1 0 0
733.04/733.36 c rootredcost : 0.12 0 0 0
733.04/733.36 c pseudoobj : 0.08 0 0 0
733.04/733.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
733.04/733.36 c propagation : 0.16 2170 2167 11472 20.3 26 17.5 -
733.04/733.36 c infeasible LP : 11.22 29333 28908 173864 31.3 142 16.4 0
733.04/733.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
733.04/733.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
733.04/733.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
733.04/733.36 c applied globally : - - - 43562 19.0 - - -
733.04/733.36 c applied locally : - - - 354 32.1 - - -
733.04/733.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
733.04/733.36 c cut pool : 0.00 4 - - 10 - (maximal pool size: 348)
733.04/733.36 c redcost : 0.27 31821 0 0 0 0
733.04/733.36 c impliedbounds : 0.00 5 0 0 0 0
733.04/733.36 c intobj : 0.00 0 0 0 0 0
733.04/733.36 c cgmip : 0.00 0 0 0 0 0
733.04/733.36 c gomory : 0.77 5 0 0 797 0
733.04/733.36 c strongcg : 0.53 5 0 0 1504 0
733.04/733.36 c cmir : 0.00 0 0 0 0 0
733.04/733.36 c flowcover : 0.00 0 0 0 0 0
733.04/733.36 c clique : 0.00 5 0 0 0 0
733.04/733.36 c zerohalf : 0.00 0 0 0 0 0
733.04/733.36 c mcf : 0.00 1 0 0 0 0
733.04/733.36 c rapidlearning : 0.22 1 0 0 0 180
733.04/733.36 c Pricers : Time Calls Vars
733.04/733.36 c problem variables: 0.00 0 0
733.04/733.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
733.04/733.36 c relpscost : 80.70 32818 116 1949 0 0 63274
733.04/733.36 c pscost : 0.00 0 0 0 0 0 0
733.04/733.36 c inference : 0.00 0 0 0 0 0 0
733.04/733.36 c mostinf : 0.00 0 0 0 0 0 0
733.04/733.36 c leastinf : 0.00 0 0 0 0 0 0
733.04/733.36 c fullstrong : 0.00 0 0 0 0 0 0
733.04/733.36 c allfullstrong : 0.00 0 0 0 0 0 0
733.04/733.36 c random : 0.00 0 0 0 0 0 0
733.04/733.36 c Primal Heuristics : Time Calls Found
733.04/733.36 c LP solutions : 0.00 - 0
733.04/733.36 c pseudo solutions : 0.00 - 0
733.04/733.36 c trivial : 0.00 1 0
733.04/733.36 c simplerounding : 0.00 0 0
733.04/733.36 c zirounding : 0.00 0 0
733.04/733.36 c rounding : 0.00 0 0
733.04/733.36 c shifting : 0.00 0 0
733.04/733.36 c intshifting : 0.00 0 0
733.04/733.36 c oneopt : 0.00 0 0
733.04/733.36 c twoopt : 0.00 0 0
733.04/733.36 c fixandinfer : 0.00 0 0
733.04/733.36 c feaspump : 0.00 0 0
733.04/733.36 c coefdiving : 0.00 0 0
733.04/733.36 c pscostdiving : 0.00 0 0
733.04/733.36 c fracdiving : 0.00 0 0
733.04/733.36 c veclendiving : 0.00 0 0
733.04/733.36 c intdiving : 0.00 0 0
733.04/733.36 c actconsdiving : 0.00 0 0
733.04/733.36 c objpscostdiving : 0.00 0 0
733.04/733.36 c rootsoldiving : 0.00 0 0
733.04/733.36 c linesearchdiving : 0.00 0 0
733.04/733.36 c guideddiving : 0.00 0 0
733.04/733.36 c octane : 0.00 0 0
733.04/733.36 c rens : 0.00 0 0
733.04/733.36 c rins : 0.00 0 0
733.04/733.36 c localbranching : 0.00 0 0
733.04/733.36 c mutation : 0.00 0 0
733.04/733.36 c crossover : 0.00 0 0
733.04/733.36 c dins : 0.00 0 0
733.04/733.36 c undercover : 0.00 0 0
733.04/733.36 c nlp : 0.00 0 0
733.04/733.36 c trysol : 0.00 0 0
733.04/733.36 c LP : Time Calls Iterations Iter/call Iter/sec
733.04/733.36 c primal LP : 0.00 0 0 0.00 -
733.04/733.36 c dual LP : 560.62 62024 1825170 29.43 3255.65
733.04/733.36 c lex dual LP : 0.00 0 0 0.00 -
733.04/733.36 c barrier LP : 0.00 0 0 0.00 -
733.04/733.36 c diving/probing LP: 0.00 0 0 0.00 -
733.04/733.36 c strong branching : 79.41 4824 255709 53.01 3220.12
733.04/733.36 c (at root node) : - 10 2083 208.30 -
733.04/733.36 c conflict analysis: 0.00 0 0 0.00 -
733.04/733.36 c B&B Tree :
733.04/733.36 c number of runs : 1
733.04/733.36 c nodes : 62858
733.04/733.36 c nodes (total) : 62858
733.04/733.36 c nodes left : 0
733.04/733.36 c max depth : 50
733.04/733.36 c max depth (total): 50
733.04/733.36 c backtracks : 7565 (12.0%)
733.04/733.36 c delayed cutoffs : 417
733.04/733.36 c repropagations : 100786 (129842 domain reductions, 398 cutoffs)
733.04/733.36 c avg switch length: 4.85
733.04/733.36 c switching time : 19.80
733.04/733.36 c Solution :
733.04/733.36 c Solutions found : 0 (0 improvements)
733.04/733.36 c Primal Bound : infeasible
733.04/733.36 c Dual Bound : -
733.04/733.36 c Gap : 0.00 %
733.04/733.36 c Root Dual Bound : +0.00000000000000e+00
733.04/733.36 c Root Iterations : 205
733.14/733.40 c Time complete: 733.14.