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-2704076-1278548351.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.13 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.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/intshifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/linesearchdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/nlp/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/objpscostdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.14 c # [type: real, range: [0,1], default: 0.01]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/oneopt/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/pscostdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/rens/freq = -1
0.09/0.14 c
0.09/0.14 c # minimum percentage of integer variables that have to be fixable
0.09/0.14 c # [type: real, range: [0,1], default: 0.5]
0.09/0.14 c heuristics/rens/minfixingrate = 0.3
0.09/0.14 c
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = 2000
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/trivial/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/trysol/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/zirounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/rapidlearning/freq = 0
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.16 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.16 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.4s| 1 | 0 | 104 | - |3885k| 0 | 45 | 231 |2607 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 129 | - |4235k| 0 | 50 | 231 |2607 | 231 |2457 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.17 c 1.1s| 1 | 0 | 149 | - |4558k| 0 | 53 | 231 |2607 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 178 | - |4614k| 0 | 55 | 231 |2607 | 231 |2461 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 192 | - |4615k| 0 | 56 | 231 |2607 | 231 |2462 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
2.99/3.04 c 3.0s| 1 | 2 | 192 | - |4615k| 0 | 56 | 231 |2607 | 231 |2462 | 19 | 0 | 10 | 0.000000e+00 | -- | Inf
164.84/164.97 c 165s| 10000 | 51 |294720 | 29.5 |6778k| 42 | 34 | 231 |6677 | 231 |2454 | 19 |7879 |1990 | 0.000000e+00 | -- | Inf
285.41/285.59 c 286s| 20000 | 39 |591511 | 29.6 |7980k| 48 | 34 | 231 |9667 | 231 |2454 | 19 | 15k|2534 | 0.000000e+00 | -- | Inf
402.49/402.64 c 403s| 30000 | 111 |880158 | 29.3 |9324k| 48 | 39 | 231 | 12k| 231 |2454 | 19 | 22k|2996 | 0.000000e+00 | -- | Inf
524.46/524.66 c 525s| 40000 | 42 | 1172k| 29.3 |9618k| 50 | 38 | 231 | 13k| 231 |2454 | 19 | 29k|3560 | 0.000000e+00 | -- | Inf
603.74/603.98 c
603.74/603.98 c SCIP Status : problem is solved [infeasible]
603.74/603.98 c Solving Time (sec) : 603.93
603.74/603.98 c Solving Nodes : 46496
603.74/603.98 c Primal Bound : +1.00000000000000e+20 (0 solutions)
603.74/603.98 c Dual Bound : +1.00000000000000e+20
603.74/603.98 c Gap : 0.00 %
603.74/603.98 s UNSATISFIABLE
603.74/603.98 c SCIP Status : problem is solved [infeasible]
603.74/603.98 c Solving Time : 603.93
603.74/603.98 c Original Problem :
603.74/603.98 c Problem name : HOME/instance-2704076-1278548351.opb
603.74/603.98 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
603.74/603.98 c Constraints : 2707 initial, 2707 maximal
603.74/603.98 c Presolved Problem :
603.74/603.98 c Problem name : t_HOME/instance-2704076-1278548351.opb
603.74/603.98 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
603.74/603.98 c Constraints : 2443 initial, 13688 maximal
603.74/603.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
603.74/603.98 c trivial : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c implics : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c probing : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
603.74/603.98 c setppc : 0.00 0 0 0 0 0 121 0 0
603.74/603.98 c linear : 0.03 0 0 0 0 0 143 0 0
603.74/603.98 c logicor : 0.03 0 0 0 0 0 0 0 0
603.74/603.98 c root node : - 0 - - 0 - - - -
603.74/603.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
603.74/603.98 c integral : 0 0 0 24565 0 116 1668 0 0 46954
603.74/603.98 c knapsack : 1 5 185392 0 0 481 145098 0 0 0
603.74/603.98 c setppc : 22 5 185192 0 0 1594 278635 0 0 0
603.74/603.98 c linear : 0+ 5 153688 0 0 8 323 2 0 0
603.74/603.98 c logicor : 2420+ 5 91662 0 0 559 318614 0 0 0
603.74/603.98 c countsols : 0 0 0 0 0 0 0 0 0 0
603.74/603.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
603.74/603.98 c integral : 85.93 0.00 0.00 85.93 0.00
603.74/603.98 c knapsack : 1.58 0.00 1.58 0.00 0.00
603.74/603.98 c setppc : 3.02 0.00 3.02 0.00 0.00
603.74/603.98 c linear : 1.00 0.00 1.00 0.00 0.00
603.74/603.98 c logicor : 16.99 0.00 16.99 0.00 0.00
603.74/603.98 c countsols : 0.00 0.00 0.00 0.00 0.00
603.74/603.98 c Propagators : Time Calls Cutoffs DomReds
603.74/603.98 c vbounds : 0.08 1 0 0
603.74/603.98 c rootredcost : 0.10 0 0 0
603.74/603.98 c pseudoobj : 0.07 0 0 0
603.74/603.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
603.74/603.98 c propagation : 0.20 2642 2636 13380 20.9 61 17.3 -
603.74/603.98 c infeasible LP : 8.36 20708 20385 124590 31.7 167 17.8 0
603.74/603.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
603.74/603.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
603.74/603.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
603.74/603.98 c applied globally : - - - 34044 19.1 - - -
603.74/603.98 c applied locally : - - - 1080 34.3 - - -
603.74/603.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
603.74/603.98 c cut pool : 0.00 4 - - 10 - (maximal pool size: 309)
603.74/603.98 c redcost : 0.23 23630 0 0 0 0
603.74/603.98 c impliedbounds : 0.00 5 0 0 0 0
603.74/603.98 c intobj : 0.00 0 0 0 0 0
603.74/603.98 c cgmip : 0.00 0 0 0 0 0
603.74/603.98 c gomory : 0.89 5 0 0 610 0
603.74/603.98 c strongcg : 0.73 5 0 0 1311 0
603.74/603.98 c cmir : 0.00 0 0 0 0 0
603.74/603.98 c flowcover : 0.00 0 0 0 0 0
603.74/603.98 c clique : 0.00 5 0 0 0 0
603.74/603.98 c zerohalf : 0.00 0 0 0 0 0
603.74/603.98 c mcf : 0.00 1 0 0 0 0
603.74/603.98 c rapidlearning : 0.21 1 0 0 0 164
603.74/603.98 c Pricers : Time Calls Vars
603.74/603.98 c problem variables: 0.00 0 0
603.74/603.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
603.74/603.98 c relpscost : 85.86 24565 116 1668 0 0 46954
603.74/603.98 c pscost : 0.00 0 0 0 0 0 0
603.74/603.98 c inference : 0.00 0 0 0 0 0 0
603.74/603.98 c mostinf : 0.00 0 0 0 0 0 0
603.74/603.98 c leastinf : 0.00 0 0 0 0 0 0
603.74/603.98 c fullstrong : 0.00 0 0 0 0 0 0
603.74/603.98 c allfullstrong : 0.00 0 0 0 0 0 0
603.74/603.98 c random : 0.00 0 0 0 0 0 0
603.74/603.98 c Primal Heuristics : Time Calls Found
603.74/603.98 c LP solutions : 0.00 - 0
603.74/603.98 c pseudo solutions : 0.00 - 0
603.74/603.98 c trivial : 0.00 1 0
603.74/603.98 c simplerounding : 0.00 0 0
603.74/603.98 c zirounding : 0.00 0 0
603.74/603.98 c rounding : 0.00 0 0
603.74/603.98 c shifting : 0.00 0 0
603.74/603.98 c intshifting : 0.00 0 0
603.74/603.98 c oneopt : 0.00 0 0
603.74/603.98 c twoopt : 0.00 0 0
603.74/603.98 c fixandinfer : 0.00 0 0
603.74/603.98 c feaspump : 0.00 0 0
603.74/603.98 c coefdiving : 0.00 0 0
603.74/603.98 c pscostdiving : 0.00 0 0
603.74/603.98 c fracdiving : 0.00 0 0
603.74/603.98 c veclendiving : 0.00 0 0
603.74/603.98 c intdiving : 0.00 0 0
603.74/603.98 c actconsdiving : 0.00 0 0
603.74/603.98 c objpscostdiving : 0.00 0 0
603.74/603.98 c rootsoldiving : 0.00 0 0
603.74/603.98 c linesearchdiving : 0.00 0 0
603.74/603.98 c guideddiving : 0.00 0 0
603.74/603.98 c octane : 0.00 0 0
603.74/603.98 c rens : 0.00 0 0
603.74/603.98 c rins : 0.00 0 0
603.74/603.98 c localbranching : 0.00 0 0
603.74/603.98 c mutation : 0.00 0 0
603.74/603.98 c crossover : 0.00 0 0
603.74/603.98 c dins : 0.00 0 0
603.74/603.98 c undercover : 0.00 0 0
603.74/603.98 c nlp : 0.00 0 0
603.74/603.98 c trysol : 0.00 0 0
603.74/603.98 c LP : Time Calls Iterations Iter/call Iter/sec
603.74/603.98 c primal LP : 0.00 0 0 0.00 -
603.74/603.98 c dual LP : 443.55 45179 1361301 30.13 3069.09
603.74/603.98 c lex dual LP : 0.00 0 0 0.00 -
603.74/603.98 c barrier LP : 0.00 0 0 0.00 -
603.74/603.98 c diving/probing LP: 0.00 0 0 0.00 -
603.74/603.98 c strong branching : 84.85 3937 247420 62.84 2915.98
603.74/603.98 c (at root node) : - 10 2452 245.20 -
603.74/603.98 c conflict analysis: 0.00 0 0 0.00 -
603.74/603.98 c B&B Tree :
603.74/603.98 c number of runs : 1
603.74/603.98 c nodes : 46496
603.74/603.98 c nodes (total) : 46496
603.74/603.98 c nodes left : 0
603.74/603.98 c max depth : 51
603.74/603.98 c max depth (total): 51
603.74/603.98 c backtracks : 5481 (11.8%)
603.74/603.98 c delayed cutoffs : 459
603.74/603.98 c repropagations : 74359 (114103 domain reductions, 447 cutoffs)
603.74/603.98 c avg switch length: 4.86
603.74/603.98 c switching time : 16.62
603.74/603.98 c Solution :
603.74/603.98 c Solutions found : 0 (0 improvements)
603.74/603.98 c Primal Bound : infeasible
603.74/603.98 c Dual Bound : -
603.74/603.98 c Gap : 0.00 %
603.74/603.98 c Root Dual Bound : +0.00000000000000e+00
603.74/603.98 c Root Iterations : 192
603.83/604.01 c Time complete: 603.85.