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-2702866-1278575039.opb>
0.00/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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.09/0.11 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.09/0.18 c presolving (2 rounds):
0.09/0.18 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.18 c 11828 implications, 100 cliques
0.09/0.18 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.09/0.18 c 1 constraints of type <knapsack>
0.09/0.18 c 150 constraints of type <setppc>
0.09/0.18 c 1466 constraints of type <and>
0.09/0.18 c 1 constraints of type <linear>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.14
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.3
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1789.98
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c limits/solutions = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.18 c separating/maxrounds = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/maxroundsroot = 5
0.09/0.18 c
0.09/0.18 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.18 c # [type: int, range: [1,2], default: 1]
0.09/0.18 c timing/clocktype = 2
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/indicator/addCouplingCons = TRUE
0.09/0.18 c
0.09/0.18 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.18 c constraints/knapsack/disaggregation = FALSE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c presolving/probing/maxrounds = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/coefdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.18 c heuristics/crossover/freq = -1
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/crossover/nodesofs = 750
0.09/0.18 c
0.09/0.18 c # number of nodes without incumbent change that heuristic should wait
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.18 c heuristics/crossover/nwaitingnodes = 100
0.09/0.18 c
0.09/0.18 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.18 c # [type: real, range: [0,1], default: 0.1]
0.09/0.18 c heuristics/crossover/nodesquot = 0.15
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixed
0.09/0.18 c # [type: real, range: [0,1], default: 0.666]
0.09/0.18 c heuristics/crossover/minfixingrate = 0.5
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/feaspump/freq = -1
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/fracdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/guideddiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/intshifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/linesearchdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/nlp/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/objpscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.18 c # [type: real, range: [0,1], default: 0.01]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/oneopt/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/pscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/rens/freq = -1
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixable
0.09/0.18 c # [type: real, range: [0,1], default: 0.5]
0.09/0.18 c heuristics/rens/minfixingrate = 0.3
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/rens/nodesofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/rootsoldiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/rounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/shifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/simplerounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/trivial/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/trysol/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/veclendiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/zirounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/cmir/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/flowcover/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.39/0.43 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.43 c 0.4s| 1 | 0 | 542 | - |7134k| 0 | 365 |1566 |1618 |1566 |3084 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.64 c 2.6s| 1 | 0 | 648 | - |8897k| 0 | 389 |1566 |1839 |1566 |3099 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
4.19/4.29 c 4.3s| 1 | 0 | 723 | - |9323k| 0 | 387 |1566 |1839 |1566 |3110 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
5.79/5.86 c 5.8s| 1 | 0 | 791 | - |9621k| 0 | 370 |1566 |1839 |1566 |3118 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
7.39/7.40 c 7.4s| 1 | 0 | 918 | - | 10M| 0 | 364 |1566 |1839 |1566 |3124 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
8.89/8.95 c 8.9s| 1 | 0 | 1091 | - | 10M| 0 | 371 |1566 |1839 |1566 |3128 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
14.48/14.50 c 14.5s| 1 | 2 | 1091 | - | 10M| 0 | 371 |1566 |1839 |1566 |3128 | 44 | 0 | 9 | 0.000000e+00 | -- | Inf
121.45/121.58 c
121.45/121.58 c SCIP Status : problem is solved [infeasible]
121.45/121.58 c Solving Time (sec) : 121.56
121.45/121.58 c Solving Nodes : 341
121.45/121.58 c Primal Bound : +1.00000000000000e+20 (0 solutions)
121.45/121.58 c Dual Bound : +1.00000000000000e+20
121.45/121.58 c Gap : 0.00 %
121.45/121.58 s UNSATISFIABLE
121.45/121.58 c SCIP Status : problem is solved [infeasible]
121.45/121.58 c Solving Time : 121.56
121.45/121.58 c Original Problem :
121.45/121.58 c Problem name : HOME/instance-2702866-1278575039.opb
121.45/121.58 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
121.45/121.58 c Constraints : 1618 initial, 1618 maximal
121.45/121.58 c Presolved Problem :
121.45/121.58 c Problem name : t_HOME/instance-2702866-1278575039.opb
121.45/121.58 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
121.45/121.58 c Constraints : 1618 initial, 1932 maximal
121.45/121.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
121.45/121.58 c trivial : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c implics : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c probing : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c knapsack : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c setppc : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c and : 0.12 0 0 0 0 0 0 0 0
121.45/121.58 c linear : 0.01 0 0 0 0 0 0 0 0
121.45/121.58 c logicor : 0.00 0 0 0 0 0 0 0 0
121.45/121.58 c root node : - 55 - - 55 - - - -
121.45/121.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
121.45/121.58 c integral : 0 0 0 208 0 0 97 0 0 350
121.45/121.58 c knapsack : 1 5 1775 0 0 0 0 0 0 0
121.45/121.58 c setppc : 150 5 1775 0 0 0 350 0 0 0
121.45/121.58 c and : 1466 293 1775 0 0 0 16464 30968 0 0
121.45/121.58 c linear : 1+ 6 1775 0 0 0 10 0 0 0
121.45/121.58 c logicor : 0+ 0 364 0 0 3 239 0 0 0
121.45/121.58 c countsols : 0 0 0 0 0 0 0 0 0 0
121.45/121.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
121.45/121.58 c integral : 60.63 0.00 0.00 60.63 0.00
121.45/121.58 c knapsack : 0.00 0.00 0.00 0.00 0.00
121.45/121.58 c setppc : 0.01 0.00 0.01 0.00 0.00
121.45/121.58 c and : 0.45 0.32 0.13 0.00 0.00
121.45/121.58 c linear : 0.06 0.00 0.06 0.00 0.00
121.45/121.58 c logicor : 0.01 0.00 0.01 0.00 0.00
121.45/121.58 c countsols : 0.00 0.00 0.00 0.00 0.00
121.45/121.58 c Propagators : Time Calls Cutoffs DomReds
121.45/121.58 c vbounds : 0.00 1 0 0
121.45/121.58 c rootredcost : 0.00 0 0 0
121.45/121.58 c pseudoobj : 0.00 0 0 0
121.45/121.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
121.45/121.58 c propagation : 0.00 3 0 0 0.0 0 0.0 -
121.45/121.58 c infeasible LP : 0.16 166 163 551 12.0 3 5.7 0
121.45/121.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
121.45/121.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
121.45/121.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
121.45/121.58 c applied globally : - - - 245 9.4 - - -
121.45/121.58 c applied locally : - - - 0 0.0 - - -
121.45/121.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
121.45/121.58 c cut pool : 0.00 4 - - 15 - (maximal pool size: 524)
121.45/121.58 c redcost : 0.02 293 0 0 0 0
121.45/121.58 c impliedbounds : 0.00 5 0 0 27 0
121.45/121.58 c intobj : 0.00 0 0 0 0 0
121.45/121.58 c cgmip : 0.00 0 0 0 0 0
121.45/121.58 c gomory : 4.59 5 0 0 0 0
121.45/121.58 c strongcg : 2.83 5 0 0 2478 0
121.45/121.58 c cmir : 0.00 0 0 0 0 0
121.45/121.58 c flowcover : 0.00 0 0 0 0 0
121.45/121.58 c clique : 0.04 5 0 0 32 0
121.45/121.58 c zerohalf : 0.00 0 0 0 0 0
121.45/121.58 c mcf : 0.09 5 0 0 33 0
121.45/121.58 c rapidlearning : 0.57 1 0 0 0 221
121.45/121.58 c Pricers : Time Calls Vars
121.45/121.58 c problem variables: 0.00 0 0
121.45/121.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
121.45/121.58 c relpscost : 60.63 208 0 97 0 0 350
121.45/121.58 c pscost : 0.00 0 0 0 0 0 0
121.45/121.58 c inference : 0.00 0 0 0 0 0 0
121.45/121.58 c mostinf : 0.00 0 0 0 0 0 0
121.45/121.58 c leastinf : 0.00 0 0 0 0 0 0
121.45/121.58 c fullstrong : 0.00 0 0 0 0 0 0
121.45/121.58 c allfullstrong : 0.00 0 0 0 0 0 0
121.45/121.58 c random : 0.00 0 0 0 0 0 0
121.45/121.58 c Primal Heuristics : Time Calls Found
121.45/121.58 c LP solutions : 0.00 - 0
121.45/121.58 c pseudo solutions : 0.00 - 0
121.45/121.58 c trivial : 0.00 1 0
121.45/121.58 c simplerounding : 0.00 0 0
121.45/121.58 c zirounding : 0.00 0 0
121.45/121.58 c rounding : 0.00 0 0
121.45/121.58 c shifting : 0.00 0 0
121.45/121.58 c intshifting : 0.00 0 0
121.45/121.58 c oneopt : 0.00 0 0
121.45/121.58 c twoopt : 0.00 0 0
121.45/121.58 c fixandinfer : 0.00 0 0
121.45/121.58 c feaspump : 0.00 0 0
121.45/121.58 c coefdiving : 0.00 0 0
121.45/121.58 c pscostdiving : 0.00 0 0
121.45/121.58 c fracdiving : 0.00 0 0
121.45/121.58 c veclendiving : 0.00 0 0
121.45/121.58 c intdiving : 0.00 0 0
121.45/121.58 c actconsdiving : 0.00 0 0
121.45/121.58 c objpscostdiving : 0.00 0 0
121.45/121.58 c rootsoldiving : 0.00 0 0
121.45/121.58 c linesearchdiving : 0.00 0 0
121.45/121.58 c guideddiving : 0.00 0 0
121.45/121.58 c octane : 0.00 0 0
121.45/121.58 c rens : 0.00 0 0
121.45/121.58 c rins : 0.00 0 0
121.45/121.58 c localbranching : 0.00 0 0
121.45/121.58 c mutation : 0.00 0 0
121.45/121.58 c crossover : 0.00 0 0
121.45/121.58 c dins : 0.00 0 0
121.45/121.58 c undercover : 0.00 0 0
121.45/121.58 c nlp : 0.00 0 0
121.45/121.58 c trysol : 0.00 0 0
121.45/121.58 c LP : Time Calls Iterations Iter/call Iter/sec
121.45/121.58 c primal LP : 0.29 0 0 0.00 0.00
121.45/121.58 c dual LP : 50.58 657 137852 209.82 2725.47
121.45/121.58 c lex dual LP : 0.00 0 0 0.00 -
121.45/121.58 c barrier LP : 0.00 0 0 0.00 -
121.45/121.58 c diving/probing LP: 0.00 0 0 0.00 -
121.45/121.58 c strong branching : 60.57 809 175311 216.70 2894.23
121.45/121.58 c (at root node) : - 9 6798 755.33 -
121.45/121.58 c conflict analysis: 0.00 0 0 0.00 -
121.45/121.58 c B&B Tree :
121.45/121.58 c number of runs : 1
121.45/121.58 c nodes : 341
121.45/121.58 c nodes (total) : 341
121.45/121.58 c nodes left : 0
121.45/121.58 c max depth : 41
121.45/121.58 c max depth (total): 41
121.45/121.58 c backtracks : 95 (27.9%)
121.45/121.58 c delayed cutoffs : 10
121.45/121.58 c repropagations : 820 (5521 domain reductions, 3 cutoffs)
121.45/121.58 c avg switch length: 6.36
121.45/121.58 c switching time : 0.44
121.45/121.58 c Solution :
121.45/121.58 c Solutions found : 0 (0 improvements)
121.45/121.58 c Primal Bound : infeasible
121.45/121.58 c Dual Bound : -
121.45/121.58 c Gap : 0.00 %
121.45/121.58 c Root Dual Bound : +0.00000000000000e+00
121.45/121.58 c Root Iterations : 1091
121.55/121.61 c Time complete: 121.57.