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-2666297-1276678229.opb>
0.00/0.03 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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.20/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11828 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 11828 implications, 100 cliques
0.39/0.42 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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 1466 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.18
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.70 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.70 c 0.5s| 1 | 0 | 615 | - |7174k| 0 | 379 |1566 |1618 |1566 |3084 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.10 c 2.6s| 1 | 0 | 774 | - |8634k| 0 | 358 |1566 |1846 |1566 |3114 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.95 c 4.4s| 1 | 0 | 982 | - |9127k| 0 | 332 |1566 |1846 |1566 |3123 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
7.08/7.11 c 6.6s| 1 | 0 | 1187 | - | 10M| 0 | 335 |1566 |1846 |1566 |3130 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
8.39/8.49 c 8.0s| 1 | 0 | 1311 | - | 10M| 0 | 330 |1566 |1846 |1566 |3140 | 56 | 0 | 0 | 0.000000e+00 | -- | Inf
10.08/10.19 c 9.7s| 1 | 0 | 1626 | - | 10M| 0 | 331 |1566 |1846 |1566 |3147 | 63 | 0 | 0 | 0.000000e+00 | -- | Inf
10.18/10.23 c 9.7s| 1 | 0 | 1662 | - | 10M| 0 | 349 |1566 |1846 |1566 |3149 | 65 | 0 | 0 | 0.000000e+00 | -- | Inf
16.40/16.47 c 15.9s| 1 | 2 | 1662 | - | 10M| 0 | 349 |1566 |1846 |1566 |3149 | 65 | 0 | 9 | 0.000000e+00 | -- | Inf
117.24/117.37 c
117.24/117.37 c SCIP Status : problem is solved [infeasible]
117.24/117.37 c Solving Time (sec) : 115.75
117.24/117.37 c Solving Nodes : 330
117.24/117.37 c Primal Bound : +1.00000000000000e+20 (0 solutions)
117.24/117.37 c Dual Bound : +1.00000000000000e+20
117.24/117.37 c Gap : 0.00 %
117.24/117.37 s UNSATISFIABLE
117.24/117.37 c SCIP Status : problem is solved [infeasible]
117.24/117.37 c Solving Time : 115.75
117.24/117.37 c Original Problem :
117.24/117.37 c Problem name : HOME/instance-2666297-1276678229.opb
117.24/117.37 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
117.24/117.37 c Constraints : 1618 initial, 1618 maximal
117.24/117.37 c Presolved Problem :
117.24/117.37 c Problem name : t_HOME/instance-2666297-1276678229.opb
117.24/117.37 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
117.24/117.37 c Constraints : 1618 initial, 2036 maximal
117.24/117.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
117.24/117.37 c trivial : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c implics : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c probing : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c knapsack : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c setppc : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c and : 0.16 0 0 0 0 0 0 0 0
117.24/117.37 c linear : 0.01 0 0 0 0 0 0 0 0
117.24/117.37 c logicor : 0.00 0 0 0 0 0 0 0 0
117.24/117.37 c root node : - 26 - - 26 - - - -
117.24/117.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
117.24/117.37 c integral : 0 0 0 215 0 9 118 0 0 342
117.24/117.37 c knapsack : 1 5 1713 0 0 3 0 0 0 0
117.24/117.37 c setppc : 100 5 1710 0 0 0 560 0 0 0
117.24/117.37 c and : 1466 290 1710 0 0 0 20747 32655 0 0
117.24/117.37 c linear : 1+ 6 1710 0 0 0 109 0 0 0
117.24/117.37 c logicor : 50+ 5 342 0 0 0 281 0 0 0
117.24/117.37 c countsols : 0 0 0 0 0 0 0 0 0 0
117.24/117.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
117.24/117.37 c integral : 58.98 0.00 0.00 58.98 0.00
117.24/117.37 c knapsack : 0.01 0.00 0.01 0.00 0.00
117.24/117.37 c setppc : 0.01 0.00 0.01 0.00 0.00
117.24/117.37 c and : 0.53 0.31 0.22 0.00 0.00
117.24/117.37 c linear : 0.07 0.00 0.07 0.00 0.00
117.24/117.37 c logicor : 0.01 0.00 0.01 0.00 0.00
117.24/117.37 c countsols : 0.00 0.00 0.00 0.00 0.00
117.24/117.37 c Propagators : Time Calls Cutoffs DomReds
117.24/117.37 c vbounds : 0.01 1 0 0
117.24/117.37 c rootredcost : 0.00 0 0 0
117.24/117.37 c pseudoobj : 0.00 0 0 0
117.24/117.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
117.24/117.37 c propagation : 0.00 3 3 10 14.1 0 0.0 -
117.24/117.37 c infeasible LP : 0.16 150 146 473 11.8 1 7.0 0
117.24/117.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
117.24/117.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
117.24/117.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
117.24/117.37 c applied globally : - - - 233 11.0 - - -
117.24/117.37 c applied locally : - - - 0 0.0 - - -
117.24/117.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
117.24/117.37 c cut pool : 0.00 4 - - 0 - (maximal pool size: 551)
117.24/117.37 c redcost : 0.01 290 0 0 0 0
117.24/117.37 c impliedbounds : 0.00 5 0 0 52 0
117.24/117.37 c intobj : 0.00 0 0 0 0 0
117.24/117.37 c cgmip : 0.00 0 0 0 0 0
117.24/117.37 c gomory : 4.57 5 0 0 0 0
117.24/117.37 c strongcg : 3.32 5 0 0 2342 0
117.24/117.37 c cmir : 0.00 0 0 0 0 0
117.24/117.37 c flowcover : 0.00 0 0 0 0 0
117.24/117.37 c clique : 0.04 5 0 0 31 0
117.24/117.37 c zerohalf : 0.00 0 0 0 0 0
117.24/117.37 c mcf : 0.08 4 0 0 66 0
117.24/117.37 c rapidlearning : 0.38 1 0 0 0 228
117.24/117.37 c Pricers : Time Calls Vars
117.24/117.37 c problem variables: 0.00 0 0
117.24/117.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
117.24/117.37 c relpscost : 58.98 215 9 118 0 0 342
117.24/117.37 c pscost : 0.00 0 0 0 0 0 0
117.24/117.37 c inference : 0.00 0 0 0 0 0 0
117.24/117.37 c mostinf : 0.00 0 0 0 0 0 0
117.24/117.37 c leastinf : 0.00 0 0 0 0 0 0
117.24/117.37 c fullstrong : 0.00 0 0 0 0 0 0
117.24/117.37 c allfullstrong : 0.00 0 0 0 0 0 0
117.24/117.37 c random : 0.00 0 0 0 0 0 0
117.24/117.37 c Primal Heuristics : Time Calls Found
117.24/117.37 c LP solutions : 0.00 - 0
117.24/117.37 c pseudo solutions : 0.00 - 0
117.24/117.37 c trivial : 0.00 1 0
117.24/117.37 c simplerounding : 0.00 0 0
117.24/117.37 c zirounding : 0.00 0 0
117.24/117.37 c rounding : 0.00 0 0
117.24/117.37 c shifting : 0.00 0 0
117.24/117.37 c intshifting : 0.00 0 0
117.24/117.37 c oneopt : 0.00 0 0
117.24/117.37 c twoopt : 0.00 0 0
117.24/117.37 c fixandinfer : 0.00 0 0
117.24/117.37 c feaspump : 0.00 0 0
117.24/117.37 c coefdiving : 0.00 0 0
117.24/117.37 c pscostdiving : 0.00 0 0
117.24/117.37 c fracdiving : 0.00 0 0
117.24/117.37 c veclendiving : 0.00 0 0
117.24/117.37 c intdiving : 0.00 0 0
117.24/117.37 c actconsdiving : 0.00 0 0
117.24/117.37 c objpscostdiving : 0.00 0 0
117.24/117.37 c rootsoldiving : 0.00 0 0
117.24/117.37 c linesearchdiving : 0.00 0 0
117.24/117.37 c guideddiving : 0.00 0 0
117.24/117.37 c octane : 0.00 0 0
117.24/117.37 c rens : 0.00 0 0
117.24/117.37 c rins : 0.00 0 0
117.24/117.37 c localbranching : 0.00 0 0
117.24/117.37 c mutation : 0.00 0 0
117.24/117.37 c crossover : 0.00 0 0
117.24/117.37 c dins : 0.00 0 0
117.24/117.37 c undercover : 0.00 0 0
117.24/117.37 c nlp : 0.00 0 0
117.24/117.37 c trysol : 0.00 0 0
117.24/117.37 c LP : Time Calls Iterations Iter/call Iter/sec
117.24/117.37 c primal LP : 0.28 0 0 0.00 0.00
117.24/117.37 c dual LP : 46.06 646 131020 202.82 2844.55
117.24/117.37 c lex dual LP : 0.00 0 0 0.00 -
117.24/117.37 c barrier LP : 0.00 0 0 0.00 -
117.24/117.37 c diving/probing LP: 0.00 0 0 0.00 -
117.24/117.37 c strong branching : 58.90 703 173360 246.60 2943.29
117.24/117.37 c (at root node) : - 9 7739 859.89 -
117.24/117.37 c conflict analysis: 0.00 0 0 0.00 -
117.24/117.37 c B&B Tree :
117.24/117.37 c number of runs : 1
117.24/117.37 c nodes : 330
117.24/117.37 c nodes (total) : 330
117.24/117.37 c nodes left : 0
117.24/117.37 c max depth : 41
117.24/117.37 c max depth (total): 41
117.24/117.37 c backtracks : 71 (21.5%)
117.24/117.37 c delayed cutoffs : 13
117.24/117.37 c repropagations : 732 (5975 domain reductions, 3 cutoffs)
117.24/117.37 c avg switch length: 6.08
117.24/117.37 c switching time : 0.40
117.24/117.37 c Solution :
117.24/117.37 c Solutions found : 0 (0 improvements)
117.24/117.37 c Primal Bound : infeasible
117.24/117.37 c Dual Bound : -
117.24/117.37 c Gap : 0.00 %
117.24/117.37 c Root Dual Bound : +0.00000000000000e+00
117.24/117.37 c Root Iterations : 1662
117.34/117.40 c Time complete: 117.34.