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-2664932-1276684512.opb>
0.00/0.02 c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.23 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.41 c presolving (2 rounds):
0.39/0.41 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.41 c 12084 implications, 100 cliques
0.39/0.41 c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.39/0.41 c 1 constraints of type <knapsack>
0.39/0.41 c 100 constraints of type <setppc>
0.39/0.41 c 1498 constraints of type <and>
0.39/0.41 c 1 constraints of type <linear>
0.39/0.41 c 50 constraints of type <logicor>
0.39/0.41 c transformed objective value is always integral (scale: 1)
0.39/0.41 c Presolving Time: 0.19
0.39/0.41 c - non default parameters ----------------------------------------------------------------------
0.39/0.41 c # SCIP version 1.2.1.2
0.39/0.41 c
0.39/0.41 c # frequency for displaying node information lines
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.41 c display/freq = 10000
0.39/0.41 c
0.39/0.41 c # maximal time in seconds to run
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/time = 1799.98
0.39/0.41 c
0.39/0.41 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/memory = 1620
0.39/0.41 c
0.39/0.41 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c limits/solutions = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.41 c separating/maxrounds = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c separating/maxroundsroot = 5
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify inequalities
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/linear/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.41 c constraints/knapsack/disaggregation = FALSE
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify knapsacks
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c presolving/probing/maxrounds = 0
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/coefdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.41 c heuristics/crossover/freq = -1
0.39/0.41 c
0.39/0.41 c # number of nodes added to the contingent of the total nodes
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41 c heuristics/crossover/nodesofs = 750
0.39/0.41 c
0.39/0.41 c # number of nodes without incumbent change that heuristic should wait
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.41 c heuristics/crossover/nwaitingnodes = 100
0.39/0.41 c
0.39/0.41 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.41 c # [type: real, range: [0,1], default: 0.1]
0.39/0.41 c heuristics/crossover/nodesquot = 0.15
0.39/0.41 c
0.39/0.41 c # minimum percentage of integer variables that have to be fixed
0.39/0.41 c # [type: real, range: [0,1], default: 0.666]
0.39/0.41 c heuristics/crossover/minfixingrate = 0.5
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/feaspump/freq = -1
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/fracdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/guideddiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/intshifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/linesearchdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/nlp/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/objpscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.41 c # [type: real, range: [0,1], default: 0.01]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/oneopt/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/pscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/rens/freq = -1
0.39/0.41 c
0.39/0.41 c # minimum percentage of integer variables that have to be fixable
0.39/0.41 c # [type: real, range: [0,1], default: 0.5]
0.39/0.41 c heuristics/rens/minfixingrate = 0.3
0.39/0.41 c
0.39/0.41 c # number of nodes added to the contingent of the total nodes
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41 c heuristics/rens/nodesofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/rootsoldiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/rounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/shifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/simplerounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/trivial/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/trysol/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/veclendiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 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.59/0.62 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.62 c 0.4s| 1 | 0 | 457 | - |7315k| 0 | 370 |1598 |1650 |1598 |3148 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.53 c 2.1s| 1 | 0 | 701 | - |8541k| 0 | 424 |1598 |1837 |1598 |3155 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
3.79/3.86 c 3.4s| 1 | 0 | 873 | - |9003k| 0 | 458 |1598 |1837 |1598 |3166 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
5.68/5.73 c 5.3s| 1 | 0 | 978 | - |9468k| 0 | 450 |1598 |1837 |1598 |3176 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
7.69/7.79 c 7.3s| 1 | 0 | 1055 | - | 10M| 0 | 468 |1598 |1837 |1598 |3182 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
9.88/9.92 c 9.4s| 1 | 0 | 1143 | - | 10M| 0 | 445 |1598 |1837 |1598 |3193 | 45 | 0 | 0 | 0.000000e+00 | -- | Inf
16.18/16.23 c 15.7s| 1 | 2 | 1143 | - | 10M| 0 | 445 |1598 |1837 |1598 |3193 | 45 | 0 | 9 | 0.000000e+00 | -- | Inf
139.73/139.85 c
139.73/139.85 c SCIP Status : problem is solved [infeasible]
139.73/139.85 c Solving Time (sec) : 137.93
139.73/139.85 c Solving Nodes : 503
139.73/139.85 c Primal Bound : +1.00000000000000e+20 (0 solutions)
139.73/139.85 c Dual Bound : +1.00000000000000e+20
139.73/139.85 c Gap : 0.00 %
139.73/139.85 s UNSATISFIABLE
139.73/139.85 c SCIP Status : problem is solved [infeasible]
139.73/139.85 c Solving Time : 137.93
139.73/139.85 c Original Problem :
139.73/139.85 c Problem name : HOME/instance-2664932-1276684512.opb
139.73/139.85 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
139.73/139.85 c Constraints : 1650 initial, 1650 maximal
139.73/139.85 c Presolved Problem :
139.73/139.85 c Problem name : t_HOME/instance-2664932-1276684512.opb
139.73/139.85 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
139.73/139.85 c Constraints : 1650 initial, 1874 maximal
139.73/139.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
139.73/139.85 c trivial : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c dualfix : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c boundshift : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c implics : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c probing : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c knapsack : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c setppc : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c and : 0.18 0 0 0 0 0 0 0 0
139.73/139.85 c linear : 0.01 0 0 0 0 0 0 0 0
139.73/139.85 c logicor : 0.00 0 0 0 0 0 0 0 0
139.73/139.85 c root node : - 27 - - 27 - - - -
139.73/139.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
139.73/139.85 c integral : 0 0 0 286 0 1 81 0 0 502
139.73/139.85 c knapsack : 1 5 1384 0 0 0 0 0 0 0
139.73/139.85 c setppc : 100 5 1384 0 0 1 1386 0 0 0
139.73/139.85 c and : 1498 451 1383 0 0 0 39505 66843 0 0
139.73/139.85 c linear : 1+ 6 1383 0 0 0 77 0 0 0
139.73/139.85 c logicor : 50+ 5 432 0 0 0 218 0 0 0
139.73/139.85 c countsols : 0 0 0 0 0 0 0 0 0 0
139.73/139.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
139.73/139.85 c integral : 54.22 0.00 0.00 54.22 0.00
139.73/139.85 c knapsack : 0.02 0.01 0.01 0.00 0.00
139.73/139.85 c setppc : 0.00 0.00 0.00 0.00 0.00
139.73/139.85 c and : 0.85 0.57 0.28 0.00 0.00
139.73/139.85 c linear : 0.10 0.01 0.09 0.00 0.00
139.73/139.85 c logicor : 0.02 0.00 0.02 0.00 0.00
139.73/139.85 c countsols : 0.00 0.00 0.00 0.00 0.00
139.73/139.85 c Propagators : Time Calls Cutoffs DomReds
139.73/139.85 c vbounds : 0.00 1 0 0
139.73/139.85 c rootredcost : 0.01 0 0 0
139.73/139.85 c pseudoobj : 0.00 0 0 0
139.73/139.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
139.73/139.85 c propagation : 0.00 1 1 1 3.0 0 0.0 -
139.73/139.85 c infeasible LP : 0.11 250 40 112 19.2 0 0.0 0
139.73/139.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
139.73/139.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
139.73/139.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
139.73/139.85 c applied globally : - - - 68 24.2 - - -
139.73/139.85 c applied locally : - - - 0 0.0 - - -
139.73/139.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
139.73/139.85 c cut pool : 0.00 4 - - 8 - (maximal pool size: 528)
139.73/139.85 c redcost : 0.03 451 0 0 0 0
139.73/139.85 c impliedbounds : 0.00 5 0 0 11 0
139.73/139.85 c intobj : 0.00 0 0 0 0 0
139.73/139.85 c cgmip : 0.00 0 0 0 0 0
139.73/139.85 c gomory : 4.42 5 0 0 0 0
139.73/139.85 c strongcg : 3.69 5 0 0 1783 0
139.73/139.85 c cmir : 0.00 0 0 0 0 0
139.73/139.85 c flowcover : 0.00 0 0 0 0 0
139.73/139.85 c clique : 0.06 5 0 0 31 0
139.73/139.85 c zerohalf : 0.00 0 0 0 0 0
139.73/139.85 c mcf : 0.03 2 0 0 0 0
139.73/139.85 c rapidlearning : 0.34 1 0 0 0 187
139.73/139.85 c Pricers : Time Calls Vars
139.73/139.85 c problem variables: 0.00 0 0
139.73/139.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
139.73/139.85 c relpscost : 54.22 286 1 81 0 0 502
139.73/139.85 c pscost : 0.00 0 0 0 0 0 0
139.73/139.85 c inference : 0.00 0 0 0 0 0 0
139.73/139.85 c mostinf : 0.00 0 0 0 0 0 0
139.73/139.85 c leastinf : 0.00 0 0 0 0 0 0
139.73/139.85 c fullstrong : 0.00 0 0 0 0 0 0
139.73/139.85 c allfullstrong : 0.00 0 0 0 0 0 0
139.73/139.85 c random : 0.00 0 0 0 0 0 0
139.73/139.85 c Primal Heuristics : Time Calls Found
139.73/139.85 c LP solutions : 0.00 - 0
139.73/139.85 c pseudo solutions : 0.00 - 0
139.73/139.85 c trivial : 0.00 1 0
139.73/139.85 c simplerounding : 0.00 0 0
139.73/139.85 c zirounding : 0.00 0 0
139.73/139.85 c rounding : 0.00 0 0
139.73/139.85 c shifting : 0.00 0 0
139.73/139.85 c intshifting : 0.00 0 0
139.73/139.85 c oneopt : 0.00 0 0
139.73/139.85 c twoopt : 0.00 0 0
139.73/139.85 c fixandinfer : 0.00 0 0
139.73/139.85 c feaspump : 0.00 0 0
139.73/139.85 c coefdiving : 0.00 0 0
139.73/139.85 c pscostdiving : 0.00 0 0
139.73/139.85 c fracdiving : 0.00 0 0
139.73/139.85 c veclendiving : 0.00 0 0
139.73/139.85 c intdiving : 0.00 0 0
139.73/139.85 c actconsdiving : 0.00 0 0
139.73/139.85 c objpscostdiving : 0.00 0 0
139.73/139.85 c rootsoldiving : 0.00 0 0
139.73/139.85 c linesearchdiving : 0.00 0 0
139.73/139.85 c guideddiving : 0.00 0 0
139.73/139.85 c octane : 0.00 0 0
139.73/139.85 c rens : 0.00 0 0
139.73/139.85 c rins : 0.00 0 0
139.73/139.85 c localbranching : 0.00 0 0
139.73/139.85 c mutation : 0.00 0 0
139.73/139.85 c crossover : 0.00 0 0
139.73/139.85 c dins : 0.00 0 0
139.73/139.85 c undercover : 0.00 0 0
139.73/139.85 c nlp : 0.00 0 0
139.73/139.85 c trysol : 0.00 0 0
139.73/139.85 c LP : Time Calls Iterations Iter/call Iter/sec
139.73/139.85 c primal LP : 6.57 0 0 0.00 0.00
139.73/139.85 c dual LP : 65.62 981 148642 151.52 2265.19
139.73/139.85 c lex dual LP : 0.00 0 0 0.00 -
139.73/139.85 c barrier LP : 0.00 0 0 0.00 -
139.73/139.85 c diving/probing LP: 0.00 0 0 0.00 -
139.73/139.85 c strong branching : 54.16 812 182049 224.20 3361.32
139.73/139.85 c (at root node) : - 9 8013 890.33 -
139.73/139.85 c conflict analysis: 0.00 0 0 0.00 -
139.73/139.85 c B&B Tree :
139.73/139.85 c number of runs : 1
139.73/139.85 c nodes : 503
139.73/139.85 c nodes (total) : 503
139.73/139.85 c nodes left : 0
139.73/139.85 c max depth : 41
139.73/139.85 c max depth (total): 41
139.73/139.85 c backtracks : 94 (18.7%)
139.73/139.85 c delayed cutoffs : 0
139.73/139.85 c repropagations : 117 (972 domain reductions, 0 cutoffs)
139.73/139.85 c avg switch length: 2.66
139.73/139.85 c switching time : 6.83
139.73/139.85 c Solution :
139.73/139.85 c Solutions found : 0 (0 improvements)
139.73/139.85 c Primal Bound : infeasible
139.73/139.85 c Dual Bound : -
139.73/139.85 c Gap : 0.00 %
139.73/139.85 c Root Dual Bound : +0.00000000000000e+00
139.73/139.85 c Root Iterations : 1143
139.73/139.88 c Time complete: 139.81.