0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666362-1276684519.opb>
0.00/0.03 c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 100 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 12084 implications, 100 cliques
0.39/0.42 c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 100 constraints of type <setppc>
0.39/0.42 c 1498 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 50 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.20
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.69/0.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.71 c 0.5s| 1 | 0 | 630 | - |7315k| 0 | 350 |1598 |1650 |1598 |3148 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.99/3.09 c 2.6s| 1 | 0 | 823 | - |8679k| 0 | 348 |1598 |1888 |1598 |3170 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
4.30/4.37 c 3.9s| 1 | 0 | 910 | - |9073k| 0 | 367 |1598 |1888 |1598 |3181 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
5.89/5.92 c 5.4s| 1 | 0 | 994 | - |9623k| 0 | 335 |1598 |1888 |1598 |3188 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
7.19/7.28 c 6.8s| 1 | 0 | 1080 | - | 10M| 0 | 331 |1598 |1888 |1598 |3197 | 49 | 0 | 0 | 0.000000e+00 | -- | Inf
8.69/8.70 c 8.2s| 1 | 0 | 1186 | - | 10M| 0 | 347 |1598 |1888 |1598 |3203 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
13.10/13.20 c 12.7s| 1 | 2 | 1186 | - | 10M| 0 | 347 |1598 |1888 |1598 |3203 | 55 | 0 | 9 | 0.000000e+00 | -- | Inf
95.35/95.47 c
95.35/95.47 c SCIP Status : problem is solved [infeasible]
95.35/95.47 c Solving Time (sec) : 94.06
95.35/95.47 c Solving Nodes : 268
95.35/95.47 c Primal Bound : +1.00000000000000e+20 (0 solutions)
95.35/95.47 c Dual Bound : +1.00000000000000e+20
95.35/95.47 c Gap : 0.00 %
95.35/95.47 s UNSATISFIABLE
95.35/95.47 c SCIP Status : problem is solved [infeasible]
95.35/95.47 c Solving Time : 94.06
95.35/95.47 c Original Problem :
95.35/95.47 c Problem name : HOME/instance-2666362-1276684519.opb
95.35/95.47 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
95.35/95.47 c Constraints : 1650 initial, 1650 maximal
95.35/95.47 c Presolved Problem :
95.35/95.47 c Problem name : t_HOME/instance-2666362-1276684519.opb
95.35/95.47 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
95.35/95.47 c Constraints : 1650 initial, 1984 maximal
95.35/95.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
95.35/95.47 c trivial : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c implics : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c probing : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c knapsack : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c setppc : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c and : 0.19 0 0 0 0 0 0 0 0
95.35/95.47 c linear : 0.01 0 0 0 0 0 0 0 0
95.35/95.47 c logicor : 0.00 0 0 0 0 0 0 0 0
95.35/95.47 c root node : - 28 - - 28 - - - -
95.35/95.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
95.35/95.47 c integral : 0 0 0 169 0 3 91 0 0 268
95.35/95.47 c knapsack : 1 5 1626 0 0 0 0 0 0 0
95.35/95.47 c setppc : 100 5 1626 0 0 0 964 0 0 0
95.35/95.47 c and : 1498 233 1626 0 0 0 27969 30910 0 0
95.35/95.47 c linear : 1+ 6 1626 0 0 0 138 0 0 0
95.35/95.47 c logicor : 50+ 5 275 0 0 0 249 0 0 0
95.35/95.47 c countsols : 0 0 0 0 0 0 0 0 0 0
95.35/95.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
95.35/95.47 c integral : 49.92 0.00 0.00 49.92 0.00
95.35/95.47 c knapsack : 0.00 0.00 0.00 0.00 0.00
95.35/95.47 c setppc : 0.01 0.00 0.01 0.00 0.00
95.35/95.47 c and : 0.37 0.28 0.09 0.00 0.00
95.35/95.47 c linear : 0.06 0.00 0.06 0.00 0.00
95.35/95.47 c logicor : 0.03 0.00 0.03 0.00 0.00
95.35/95.47 c countsols : 0.00 0.00 0.00 0.00 0.00
95.35/95.47 c Propagators : Time Calls Cutoffs DomReds
95.35/95.47 c vbounds : 0.00 1 0 0
95.35/95.47 c rootredcost : 0.00 0 0 0
95.35/95.47 c pseudoobj : 0.00 0 0 0
95.35/95.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
95.35/95.47 c propagation : 0.00 0 0 0 0.0 0 0.0 -
95.35/95.47 c infeasible LP : 0.14 131 121 321 11.8 1 4.0 0
95.35/95.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
95.35/95.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
95.35/95.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
95.35/95.47 c applied globally : - - - 193 11.7 - - -
95.35/95.47 c applied locally : - - - 0 0.0 - - -
95.35/95.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
95.35/95.47 c cut pool : 0.00 4 - - 7 - (maximal pool size: 499)
95.35/95.47 c redcost : 0.01 233 0 0 0 0
95.35/95.47 c impliedbounds : 0.00 5 0 0 45 0
95.35/95.47 c intobj : 0.00 0 0 0 0 0
95.35/95.47 c cgmip : 0.00 0 0 0 0 0
95.35/95.47 c gomory : 4.26 5 0 0 2 0
95.35/95.47 c strongcg : 2.49 5 0 0 2500 0
95.35/95.47 c cmir : 0.00 0 0 0 0 0
95.35/95.47 c flowcover : 0.00 0 0 0 0 0
95.35/95.47 c clique : 0.03 5 0 0 32 0
95.35/95.47 c zerohalf : 0.00 0 0 0 0 0
95.35/95.47 c mcf : 0.08 5 0 0 66 0
95.35/95.47 c rapidlearning : 0.40 1 0 0 0 238
95.35/95.47 c Pricers : Time Calls Vars
95.35/95.47 c problem variables: 0.00 0 0
95.35/95.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
95.35/95.47 c relpscost : 49.92 169 3 91 0 0 268
95.35/95.47 c pscost : 0.00 0 0 0 0 0 0
95.35/95.47 c inference : 0.00 0 0 0 0 0 0
95.35/95.47 c mostinf : 0.00 0 0 0 0 0 0
95.35/95.47 c leastinf : 0.00 0 0 0 0 0 0
95.35/95.47 c fullstrong : 0.00 0 0 0 0 0 0
95.35/95.47 c allfullstrong : 0.00 0 0 0 0 0 0
95.35/95.47 c random : 0.00 0 0 0 0 0 0
95.35/95.47 c Primal Heuristics : Time Calls Found
95.35/95.47 c LP solutions : 0.00 - 0
95.35/95.47 c pseudo solutions : 0.00 - 0
95.35/95.47 c trivial : 0.00 1 0
95.35/95.47 c simplerounding : 0.00 0 0
95.35/95.47 c zirounding : 0.00 0 0
95.35/95.47 c rounding : 0.00 0 0
95.35/95.47 c shifting : 0.00 0 0
95.35/95.47 c intshifting : 0.00 0 0
95.35/95.47 c oneopt : 0.00 0 0
95.35/95.47 c twoopt : 0.00 0 0
95.35/95.47 c fixandinfer : 0.00 0 0
95.35/95.47 c feaspump : 0.00 0 0
95.35/95.47 c coefdiving : 0.00 0 0
95.35/95.47 c pscostdiving : 0.00 0 0
95.35/95.47 c fracdiving : 0.00 0 0
95.35/95.47 c veclendiving : 0.00 0 0
95.35/95.47 c intdiving : 0.00 0 0
95.35/95.47 c actconsdiving : 0.00 0 0
95.35/95.47 c objpscostdiving : 0.00 0 0
95.35/95.47 c rootsoldiving : 0.00 0 0
95.35/95.47 c linesearchdiving : 0.00 0 0
95.35/95.47 c guideddiving : 0.00 0 0
95.35/95.47 c octane : 0.00 0 0
95.35/95.47 c rens : 0.00 0 0
95.35/95.47 c rins : 0.00 0 0
95.35/95.47 c localbranching : 0.00 0 0
95.35/95.47 c mutation : 0.00 0 0
95.35/95.47 c crossover : 0.00 0 0
95.35/95.47 c dins : 0.00 0 0
95.35/95.47 c undercover : 0.00 0 0
95.35/95.47 c nlp : 0.00 0 0
95.35/95.47 c trysol : 0.00 0 0
95.35/95.47 c LP : Time Calls Iterations Iter/call Iter/sec
95.35/95.47 c primal LP : 0.13 0 0 0.00 0.00
95.35/95.47 c dual LP : 34.95 520 102074 196.30 2920.57
95.35/95.47 c lex dual LP : 0.00 0 0 0.00 -
95.35/95.47 c barrier LP : 0.00 0 0 0.00 -
95.35/95.47 c diving/probing LP: 0.00 0 0 0.00 -
95.35/95.47 c strong branching : 49.88 828 155849 188.22 3124.48
95.35/95.47 c (at root node) : - 9 5614 623.78 -
95.35/95.47 c conflict analysis: 0.00 0 0 0.00 -
95.35/95.47 c B&B Tree :
95.35/95.47 c number of runs : 1
95.35/95.47 c nodes : 268
95.35/95.47 c nodes (total) : 268
95.35/95.47 c nodes left : 0
95.35/95.47 c max depth : 41
95.35/95.47 c max depth (total): 41
95.35/95.47 c backtracks : 49 (18.3%)
95.35/95.47 c delayed cutoffs : 1
95.35/95.47 c repropagations : 801 (2855 domain reductions, 0 cutoffs)
95.35/95.47 c avg switch length: 7.24
95.35/95.47 c switching time : 0.26
95.35/95.47 c Solution :
95.35/95.47 c Solutions found : 0 (0 improvements)
95.35/95.47 c Primal Bound : infeasible
95.35/95.47 c Dual Bound : -
95.35/95.47 c Gap : 0.00 %
95.35/95.47 c Root Dual Bound : +0.00000000000000e+00
95.35/95.47 c Root Iterations : 1186
95.45/95.50 c Time complete: 95.46.