0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665834-1276292912.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.07 c presolving:
0.09/0.12 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.13 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.14 c presolving (3 rounds):
0.09/0.14 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 242 implications, 22 cliques
0.09/0.14 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.14 c 1 constraints of type <knapsack>
0.09/0.14 c 22 constraints of type <setppc>
0.09/0.14 c 2541 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.06
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.17 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.17 c 0.1s| 1 | 0 | 61 | - |3551k| 0 | 35 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.4s| 1 | 0 | 168 | - |4015k| 0 | 51 | 231 |2746 | 231 |2573 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.7s| 1 | 0 | 616 | - |4397k| 0 | 56 | 231 |2746 | 231 |2582 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.20 c 1.1s| 1 | 0 | 711 | - |4879k| 0 | 64 | 231 |2746 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 928 | - |4971k| 0 | 63 | 231 |2746 | 231 |2587 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.26 c 2.1s| 1 | 0 | 1282 | - |5517k| 0 | 60 | 231 |2746 | 231 |2591 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
3.89/3.93 c 3.8s| 1 | 2 | 1282 | - |5518k| 0 | 60 | 231 |2746 | 231 |2591 | 27 | 0 | 10 | 0.000000e+00 | -- | Inf
301.71/301.85 c 296s| 10000 | 8 |705670 | 70.4 |7118k| 36 | 41 | 231 |6122 | 231 |2569 | 27 |5917 |1823 | 0.000000e+00 | -- | Inf
484.36/484.55 c
484.36/484.55 c SCIP Status : problem is solved [infeasible]
484.36/484.55 c Solving Time (sec) : 475.18
484.36/484.55 c Solving Nodes : 16369
484.36/484.55 c Primal Bound : +1.00000000000000e+20 (0 solutions)
484.36/484.55 c Dual Bound : +1.00000000000000e+20
484.36/484.55 c Gap : 0.00 %
484.36/484.55 s UNSATISFIABLE
484.36/484.55 c SCIP Status : problem is solved [infeasible]
484.36/484.55 c Solving Time : 475.18
484.36/484.55 c Original Problem :
484.36/484.55 c Problem name : HOME/instance-2665834-1276292912.opb
484.36/484.55 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
484.36/484.55 c Constraints : 2707 initial, 2707 maximal
484.36/484.55 c Presolved Problem :
484.36/484.55 c Problem name : t_HOME/instance-2665834-1276292912.opb
484.36/484.55 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
484.36/484.55 c Constraints : 2564 initial, 8553 maximal
484.36/484.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
484.36/484.55 c trivial : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c implics : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c probing : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c knapsack : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c setppc : 0.00 0 0 0 0 0 0 0 0
484.36/484.55 c linear : 0.04 0 0 0 0 0 143 0 0
484.36/484.55 c logicor : 0.01 0 0 0 0 0 0 0 0
484.36/484.55 c root node : - 1 - - 1 - - - -
484.36/484.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
484.36/484.55 c integral : 0 0 0 8669 0 45 740 0 0 16472
484.36/484.55 c knapsack : 1 5 56776 0 0 93 36230 0 0 0
484.36/484.55 c setppc : 22 5 56727 0 0 366 99528 0 0 0
484.36/484.55 c linear : 0+ 5 56326 0 0 1 545 0 0 0
484.36/484.55 c logicor : 2541+ 5 29966 0 0 123 92527 0 0 0
484.36/484.55 c countsols : 0 0 0 0 0 0 0 0 0 0
484.36/484.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
484.36/484.55 c integral : 91.04 0.00 0.00 91.04 0.00
484.36/484.55 c knapsack : 0.42 0.00 0.42 0.00 0.00
484.36/484.55 c setppc : 1.24 0.00 1.24 0.00 0.00
484.36/484.55 c linear : 0.92 0.00 0.92 0.00 0.00
484.36/484.55 c logicor : 3.84 0.00 3.84 0.00 0.00
484.36/484.55 c countsols : 0.00 0.00 0.00 0.00 0.00
484.36/484.55 c Propagators : Time Calls Cutoffs DomReds
484.36/484.55 c vbounds : 0.04 1 0 0
484.36/484.55 c rootredcost : 0.04 0 0 0
484.36/484.55 c pseudoobj : 0.04 0 0 0
484.36/484.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
484.36/484.55 c propagation : 0.03 583 575 2508 17.1 7 15.3 -
484.36/484.55 c infeasible LP : 3.02 7608 6007 30208 29.3 18 14.0 0
484.36/484.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
484.36/484.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
484.36/484.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
484.36/484.55 c applied globally : - - - 10222 17.3 - - -
484.36/484.55 c applied locally : - - - 15 35.9 - - -
484.36/484.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
484.36/484.55 c cut pool : 0.00 4 - - 8 - (maximal pool size: 516)
484.36/484.55 c redcost : 0.12 8305 0 0 0 0
484.36/484.55 c impliedbounds : 0.00 5 0 0 0 0
484.36/484.55 c intobj : 0.00 0 0 0 0 0
484.36/484.55 c cgmip : 0.00 0 0 0 0 0
484.36/484.55 c gomory : 0.73 5 0 0 1004 0
484.36/484.55 c strongcg : 0.58 5 0 0 1877 0
484.36/484.55 c cmir : 0.00 0 0 0 0 0
484.36/484.55 c flowcover : 0.00 0 0 0 0 0
484.36/484.55 c clique : 0.00 5 0 0 0 0
484.36/484.55 c zerohalf : 0.00 0 0 0 0 0
484.36/484.55 c mcf : 0.00 1 0 0 0 0
484.36/484.55 c rapidlearning : 0.19 1 0 0 0 182
484.36/484.55 c Pricers : Time Calls Vars
484.36/484.55 c problem variables: 0.00 0 0
484.36/484.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
484.36/484.55 c relpscost : 91.03 8669 45 740 0 0 16472
484.36/484.55 c pscost : 0.00 0 0 0 0 0 0
484.36/484.55 c inference : 0.00 0 0 0 0 0 0
484.36/484.55 c mostinf : 0.00 0 0 0 0 0 0
484.36/484.55 c leastinf : 0.00 0 0 0 0 0 0
484.36/484.55 c fullstrong : 0.00 0 0 0 0 0 0
484.36/484.55 c allfullstrong : 0.00 0 0 0 0 0 0
484.36/484.55 c random : 0.00 0 0 0 0 0 0
484.36/484.55 c Primal Heuristics : Time Calls Found
484.36/484.55 c LP solutions : 0.00 - 0
484.36/484.55 c pseudo solutions : 0.00 - 0
484.36/484.55 c trivial : 0.00 1 0
484.36/484.55 c simplerounding : 0.00 0 0
484.36/484.55 c zirounding : 0.00 0 0
484.36/484.55 c rounding : 0.00 0 0
484.36/484.55 c shifting : 0.00 0 0
484.36/484.55 c intshifting : 0.00 0 0
484.36/484.55 c oneopt : 0.00 0 0
484.36/484.55 c twoopt : 0.00 0 0
484.36/484.55 c fixandinfer : 0.00 0 0
484.36/484.55 c feaspump : 0.00 0 0
484.36/484.55 c coefdiving : 0.00 0 0
484.36/484.55 c pscostdiving : 0.00 0 0
484.36/484.55 c fracdiving : 0.00 0 0
484.36/484.55 c veclendiving : 0.00 0 0
484.36/484.55 c intdiving : 0.00 0 0
484.36/484.55 c actconsdiving : 0.00 0 0
484.36/484.55 c objpscostdiving : 0.00 0 0
484.36/484.55 c rootsoldiving : 0.00 0 0
484.36/484.55 c linesearchdiving : 0.00 0 0
484.36/484.55 c guideddiving : 0.00 0 0
484.36/484.55 c octane : 0.00 0 0
484.36/484.55 c rens : 0.00 0 0
484.36/484.55 c rins : 0.00 0 0
484.36/484.55 c localbranching : 0.00 0 0
484.36/484.55 c mutation : 0.00 0 0
484.36/484.55 c crossover : 0.00 0 0
484.36/484.55 c dins : 0.00 0 0
484.36/484.55 c undercover : 0.00 0 0
484.36/484.55 c nlp : 0.00 0 0
484.36/484.55 c trysol : 0.00 0 0
484.36/484.55 c LP : Time Calls Iterations Iter/call Iter/sec
484.36/484.55 c primal LP : 0.00 0 0 0.00 -
484.36/484.55 c dual LP : 361.34 16270 1253906 77.07 3470.16
484.36/484.55 c lex dual LP : 0.00 0 0 0.00 -
484.36/484.55 c barrier LP : 0.00 0 0 0.00 -
484.36/484.55 c diving/probing LP: 0.00 0 0 0.00 -
484.36/484.55 c strong branching : 90.68 2198 313777 142.76 3460.27
484.36/484.55 c (at root node) : - 10 4716 471.60 -
484.36/484.55 c conflict analysis: 0.00 0 0 0.00 -
484.36/484.55 c B&B Tree :
484.36/484.55 c number of runs : 1
484.36/484.55 c nodes : 16369
484.36/484.55 c nodes (total) : 16369
484.36/484.55 c nodes left : 0
484.36/484.55 c max depth : 44
484.36/484.55 c max depth (total): 44
484.36/484.55 c backtracks : 1584 (9.7%)
484.36/484.55 c delayed cutoffs : 104
484.36/484.55 c repropagations : 20696 (30331 domain reductions, 103 cutoffs)
484.36/484.55 c avg switch length: 4.20
484.36/484.55 c switching time : 4.64
484.36/484.55 c Solution :
484.36/484.55 c Solutions found : 0 (0 improvements)
484.36/484.55 c Primal Bound : infeasible
484.36/484.55 c Dual Bound : -
484.36/484.55 c Gap : 0.00 %
484.36/484.55 c Root Dual Bound : +0.00000000000000e+00
484.36/484.55 c Root Iterations : 1282
484.36/484.57 c Time complete: 484.44.