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-2704267-1278550465.opb>
0.09/0.15 c original problem has 3249 variables (3249 bin, 0 int, 0 impl, 0 cont) and 8983 constraints
0.09/0.15 c problem read
0.09/0.15 c No objective function, only one solution is needed.
0.09/0.15 c presolving settings loaded
0.19/0.20 c presolving:
0.29/0.36 c (round 1) 253 del vars, 139 del conss, 48 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.29/0.37 c (round 2) 255 del vars, 559 del conss, 50 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.29/0.38 c (round 3) 257 del vars, 564 del conss, 52 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156872 impls, 0 clqs
0.29/0.38 c (round 4) 259 del vars, 569 del conss, 55 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156911 impls, 0 clqs
0.29/0.39 c (round 5) 261 del vars, 576 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156986 impls, 0 clqs
0.29/0.39 c (round 6) 263 del vars, 581 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.39/0.40 c (round 7) 263 del vars, 583 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.39/0.48 c (round 8) 263 del vars, 583 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 8400 upgd conss, 157052 impls, 0 clqs
0.49/0.52 c presolving (9 rounds):
0.49/0.52 c 263 deleted vars, 583 deleted constraints, 56 tightened bounds, 0 added holes, 192 changed sides, 402 changed coefficients
0.49/0.52 c 157052 implications, 0 cliques
0.49/0.52 c presolved problem has 2986 variables (2986 bin, 0 int, 0 impl, 0 cont) and 8400 constraints
0.49/0.52 c 384 constraints of type <knapsack>
0.49/0.52 c 5349 constraints of type <setppc>
0.49/0.52 c 2667 constraints of type <logicor>
0.49/0.52 c transformed objective value is always integral (scale: 1)
0.49/0.52 c Presolving Time: 0.34
0.49/0.52 c - non default parameters ----------------------------------------------------------------------
0.49/0.52 c # SCIP version 1.2.1.3
0.49/0.52 c
0.49/0.52 c # frequency for displaying node information lines
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.52 c display/freq = 10000
0.49/0.52 c
0.49/0.52 c # maximal time in seconds to run
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.52 c limits/time = 1789.86
0.49/0.52 c
0.49/0.52 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.52 c limits/memory = 1620
0.49/0.52 c
0.49/0.52 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.52 c limits/solutions = 1
0.49/0.52 c
0.49/0.52 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.52 c separating/maxrounds = 1
0.49/0.52 c
0.49/0.52 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.52 c separating/maxroundsroot = 5
0.49/0.52 c
0.49/0.52 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.49/0.52 c # [type: int, range: [1,2], default: 1]
0.49/0.52 c timing/clocktype = 2
0.49/0.52 c
0.49/0.52 c # should presolving try to simplify inequalities
0.49/0.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.52 c constraints/linear/simplifyinequalities = TRUE
0.49/0.52 c
0.49/0.52 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.49/0.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.52 c constraints/indicator/addCouplingCons = TRUE
0.49/0.52 c
0.49/0.52 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.52 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.52 c constraints/knapsack/disaggregation = FALSE
0.49/0.52 c
0.49/0.52 c # should presolving try to simplify knapsacks
0.49/0.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.52 c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.52 c
0.49/0.52 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.52 c presolving/probing/maxrounds = 0
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/coefdiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.52 c heuristics/crossover/freq = -1
0.49/0.52 c
0.49/0.52 c # number of nodes added to the contingent of the total nodes
0.49/0.52 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.52 c heuristics/crossover/nodesofs = 750
0.49/0.52 c
0.49/0.52 c # number of nodes without incumbent change that heuristic should wait
0.49/0.52 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.52 c heuristics/crossover/nwaitingnodes = 100
0.49/0.52 c
0.49/0.52 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.52 c # [type: real, range: [0,1], default: 0.1]
0.49/0.52 c heuristics/crossover/nodesquot = 0.15
0.49/0.52 c
0.49/0.52 c # minimum percentage of integer variables that have to be fixed
0.49/0.52 c # [type: real, range: [0,1], default: 0.666]
0.49/0.52 c heuristics/crossover/minfixingrate = 0.5
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.52 c heuristics/feaspump/freq = -1
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/fracdiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/guideddiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/intshifting/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/linesearchdiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/nlp/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.52 c heuristics/objpscostdiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.52 c # [type: real, range: [0,1], default: 0.01]
0.49/0.52 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/oneopt/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/pscostdiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.52 c heuristics/rens/freq = -1
0.49/0.52 c
0.49/0.52 c # minimum percentage of integer variables that have to be fixable
0.49/0.52 c # [type: real, range: [0,1], default: 0.5]
0.49/0.52 c heuristics/rens/minfixingrate = 0.3
0.49/0.52 c
0.49/0.52 c # number of nodes added to the contingent of the total nodes
0.49/0.52 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.52 c heuristics/rens/nodesofs = 2000
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.52 c heuristics/rootsoldiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.52 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/rounding/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/shifting/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/simplerounding/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.52 c heuristics/trivial/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/trysol/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.52 c heuristics/veclendiving/freq = -1
0.49/0.52 c
0.49/0.52 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.52 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.52 c
0.49/0.52 c # additional number of allowed LP iterations
0.49/0.52 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.52 c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.52 c
0.49/0.52 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.52 c heuristics/zirounding/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.52 c separating/cmir/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.52 c separating/flowcover/freq = -1
0.49/0.52 c
0.49/0.52 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.52 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.52 c separating/rapidlearning/freq = 0
0.49/0.52 c
0.49/0.52 c -----------------------------------------------------------------------------------------------
0.49/0.52 c start solving
0.49/0.52 c
1.19/1.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.29 c 1.1s| 1 | 0 | 2036 | - | 20M| 0 |1221 |2986 |8400 |2986 |8400 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
5.39/5.44 c 5.3s| 1 | 0 | 3191 | - | 22M| 0 |1303 |2986 |8902 |2986 |8486 | 86 | 0 | 0 | 0.000000e+00 | -- | Inf
8.80/8.81 c 8.7s| 1 | 0 | 5524 | - | 22M| 0 |1262 |2986 |8902 |2986 |8581 | 181 | 0 | 0 | 0.000000e+00 | -- | Inf
13.88/13.90 c 13.8s| 1 | 0 | 8381 | - | 22M| 0 |1313 |2986 |8902 |2986 |8671 | 271 | 0 | 0 | 0.000000e+00 | -- | Inf
17.38/17.44 c 17.3s| 1 | 0 | 9794 | - | 23M| 0 |1399 |2986 |8902 |2986 |8756 | 356 | 0 | 0 | 0.000000e+00 | -- | Inf
24.29/24.30 c 24.2s| 1 | 0 | 13141 | - | 23M| 0 |1323 |2986 |8902 |2986 |8847 | 447 | 0 | 0 | 0.000000e+00 | -- | Inf
39.18/39.22 c 39.1s| 1 | 2 | 13141 | - | 23M| 0 |1323 |2986 |8902 |2986 |8847 | 447 | 0 | 11 | 0.000000e+00 | -- | Inf
186.34/186.45 c
186.34/186.45 c SCIP Status : problem is solved [infeasible]
186.34/186.45 c Solving Time (sec) : 186.31
186.34/186.45 c Solving Nodes : 81
186.34/186.45 c Primal Bound : +1.00000000000000e+20 (0 solutions)
186.34/186.45 c Dual Bound : +1.00000000000000e+20
186.34/186.45 c Gap : 0.00 %
186.34/186.45 s UNSATISFIABLE
186.34/186.45 c SCIP Status : problem is solved [infeasible]
186.34/186.45 c Solving Time : 186.31
186.34/186.45 c Original Problem :
186.34/186.45 c Problem name : HOME/instance-2704267-1278550465.opb
186.34/186.45 c Variables : 3249 (3249 binary, 0 integer, 0 implicit integer, 0 continuous)
186.34/186.45 c Constraints : 8983 initial, 8983 maximal
186.34/186.45 c Presolved Problem :
186.34/186.45 c Problem name : t_HOME/instance-2704267-1278550465.opb
186.34/186.45 c Variables : 2986 (2986 binary, 0 integer, 0 implicit integer, 0 continuous)
186.34/186.45 c Constraints : 8400 initial, 8936 maximal
186.34/186.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
186.34/186.45 c trivial : 0.00 2 0 0 0 0 0 0 0
186.34/186.45 c dualfix : 0.00 0 0 0 0 0 0 0 0
186.34/186.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
186.34/186.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
186.34/186.45 c implics : 0.03 0 203 0 0 0 0 0 0
186.34/186.45 c probing : 0.00 0 0 0 0 0 0 0 0
186.34/186.45 c knapsack : 0.01 0 0 0 0 0 0 0 0
186.34/186.45 c setppc : 0.02 0 0 0 0 0 0 0 0
186.34/186.45 c linear : 0.21 54 4 0 56 0 583 192 402
186.34/186.45 c logicor : 0.03 0 0 0 0 0 0 0 0
186.34/186.45 c root node : - 974 - - 974 - - - -
186.34/186.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
186.34/186.45 c integral : 0 0 0 55 0 0 10 0 0 96
186.34/186.45 c knapsack : 384 5 1266 0 0 9 197 1001 0 0
186.34/186.45 c setppc : 5349 5 1257 0 0 13 12079 0 0 0
186.34/186.45 c linear : 0+ 5 1243 0 0 12 193 44 0 0
186.34/186.46 c logicor : 2667+ 5 1114 0 0 15 6857 0 0 0
186.34/186.46 c countsols : 0 0 0 0 0 0 0 0 0 0
186.34/186.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
186.34/186.46 c integral : 146.11 0.00 0.00 146.11 0.00
186.34/186.46 c knapsack : 0.05 0.03 0.02 0.00 0.00
186.34/186.46 c setppc : 0.17 0.01 0.16 0.00 0.00
186.34/186.46 c linear : 0.06 0.01 0.05 0.00 0.00
186.34/186.46 c logicor : 0.05 0.00 0.05 0.00 0.00
186.34/186.46 c countsols : 0.00 0.00 0.00 0.00 0.00
186.34/186.46 c Propagators : Time Calls Cutoffs DomReds
186.34/186.46 c vbounds : 0.00 1 0 0
186.34/186.46 c rootredcost : 0.00 0 0 0
186.34/186.46 c pseudoobj : 0.00 0 0 0
186.34/186.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
186.34/186.46 c propagation : 0.01 49 37 116 16.7 5 11.0 -
186.34/186.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
186.34/186.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
186.34/186.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
186.34/186.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
186.34/186.46 c applied globally : - - - 92 13.8 - - -
186.34/186.46 c applied locally : - - - 0 0.0 - - -
186.34/186.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
186.34/186.46 c cut pool : 0.00 4 - - 147 - (maximal pool size: 1351)
186.34/186.46 c redcost : 0.01 52 0 0 0 0
186.34/186.46 c impliedbounds : 0.02 5 0 0 0 0
186.34/186.46 c intobj : 0.00 0 0 0 0 0
186.34/186.46 c cgmip : 0.00 0 0 0 0 0
186.34/186.46 c gomory : 4.60 5 0 0 2252 0
186.34/186.46 c strongcg : 3.05 5 0 0 2500 0
186.34/186.46 c cmir : 0.00 0 0 0 0 0
186.34/186.46 c flowcover : 0.00 0 0 0 0 0
186.34/186.46 c clique : 0.23 5 0 0 44 0
186.34/186.46 c zerohalf : 0.00 0 0 0 0 0
186.34/186.46 c mcf : 0.04 1 0 0 0 0
186.34/186.46 c rapidlearning : 1.88 1 0 0 0 502
186.34/186.46 c Pricers : Time Calls Vars
186.34/186.46 c problem variables: 0.00 0 0
186.34/186.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
186.34/186.46 c relpscost : 146.10 55 0 10 0 0 96
186.34/186.46 c pscost : 0.00 0 0 0 0 0 0
186.34/186.46 c inference : 0.00 0 0 0 0 0 0
186.34/186.46 c mostinf : 0.00 0 0 0 0 0 0
186.34/186.46 c leastinf : 0.00 0 0 0 0 0 0
186.34/186.46 c fullstrong : 0.00 0 0 0 0 0 0
186.34/186.46 c allfullstrong : 0.00 0 0 0 0 0 0
186.34/186.46 c random : 0.00 0 0 0 0 0 0
186.34/186.46 c Primal Heuristics : Time Calls Found
186.34/186.46 c LP solutions : 0.00 - 0
186.34/186.46 c pseudo solutions : 0.00 - 0
186.34/186.46 c trivial : 0.01 1 0
186.34/186.46 c simplerounding : 0.00 0 0
186.34/186.46 c zirounding : 0.00 0 0
186.34/186.46 c rounding : 0.00 0 0
186.34/186.46 c shifting : 0.00 0 0
186.34/186.46 c intshifting : 0.00 0 0
186.34/186.46 c oneopt : 0.00 0 0
186.34/186.46 c twoopt : 0.00 0 0
186.34/186.46 c fixandinfer : 0.00 0 0
186.34/186.46 c feaspump : 0.00 0 0
186.34/186.46 c coefdiving : 0.00 0 0
186.34/186.46 c pscostdiving : 0.00 0 0
186.34/186.46 c fracdiving : 0.00 0 0
186.34/186.46 c veclendiving : 0.00 0 0
186.34/186.46 c intdiving : 0.00 0 0
186.34/186.46 c actconsdiving : 0.00 0 0
186.34/186.46 c objpscostdiving : 0.00 0 0
186.34/186.46 c rootsoldiving : 0.00 0 0
186.34/186.46 c linesearchdiving : 0.00 0 0
186.34/186.46 c guideddiving : 0.00 0 0
186.34/186.46 c octane : 0.00 0 0
186.34/186.46 c rens : 0.00 0 0
186.34/186.46 c rins : 0.00 0 0
186.34/186.46 c localbranching : 0.00 0 0
186.34/186.46 c mutation : 0.00 0 0
186.34/186.46 c crossover : 0.00 0 0
186.34/186.46 c dins : 0.00 0 0
186.34/186.46 c undercover : 0.00 0 0
186.34/186.46 c nlp : 0.00 0 0
186.34/186.46 c trysol : 0.00 0 0
186.34/186.46 c LP : Time Calls Iterations Iter/call Iter/sec
186.34/186.46 c primal LP : 0.01 0 0 0.00 -
186.34/186.46 c dual LP : 29.06 60 27659 460.98 951.65
186.34/186.46 c lex dual LP : 0.00 0 0 0.00 -
186.34/186.46 c barrier LP : 0.00 0 0 0.00 -
186.34/186.46 c diving/probing LP: 0.00 0 0 0.00 -
186.34/186.46 c strong branching : 146.08 241 123883 514.04 848.06
186.34/186.46 c (at root node) : - 11 9794 890.36 -
186.34/186.46 c conflict analysis: 0.00 0 0 0.00 -
186.34/186.46 c B&B Tree :
186.34/186.46 c number of runs : 1
186.34/186.46 c nodes : 81
186.34/186.46 c nodes (total) : 81
186.34/186.46 c nodes left : 0
186.34/186.46 c max depth : 9
186.34/186.46 c max depth (total): 9
186.34/186.46 c backtracks : 21 (25.9%)
186.34/186.46 c delayed cutoffs : 16
186.34/186.46 c repropagations : 62 (5236 domain reductions, 16 cutoffs)
186.34/186.46 c avg switch length: 2.94
186.34/186.46 c switching time : 0.18
186.34/186.46 c Solution :
186.34/186.46 c Solutions found : 0 (0 improvements)
186.34/186.46 c Primal Bound : infeasible
186.34/186.46 c Dual Bound : -
186.34/186.46 c Gap : 0.00 %
186.34/186.46 c Root Dual Bound : +0.00000000000000e+00
186.34/186.46 c Root Iterations : 13141
186.44/186.52 c Time complete: 186.47.