0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664573-1276338630.opb>
0.39/0.47 c original problem has 9051 variables (9051 bin, 0 int, 0 impl, 0 cont) and 25833 constraints
0.39/0.47 c problem read
0.39/0.47 c No objective function, only one solution is needed.
0.39/0.47 c presolving settings loaded
0.39/0.47 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.59/0.62 c presolving:
1.10/1.14 c (round 1) 1259 del vars, 1970 del conss, 553 chg bounds, 446 chg sides, 928 chg coeffs, 0 upgd conss, 514575 impls, 0 clqs
1.19/1.20 c (round 2) 1261 del vars, 3454 del conss, 555 chg bounds, 446 chg sides, 928 chg coeffs, 0 upgd conss, 514811 impls, 0 clqs
1.39/1.46 c (round 3) 1261 del vars, 3459 del conss, 555 chg bounds, 446 chg sides, 928 chg coeffs, 22374 upgd conss, 514811 impls, 0 clqs
1.49/1.53 c presolving (4 rounds):
1.49/1.53 c 1261 deleted vars, 3459 deleted constraints, 555 tightened bounds, 0 added holes, 446 changed sides, 928 changed coefficients
1.49/1.53 c 514811 implications, 0 cliques
1.49/1.53 c presolved problem has 7790 variables (7790 bin, 0 int, 0 impl, 0 cont) and 22374 constraints
1.49/1.53 c 892 constraints of type <knapsack>
1.49/1.53 c 21482 constraints of type <logicor>
1.49/1.53 c transformed objective value is always integral (scale: 1)
1.49/1.53 c Presolving Time: 0.85
1.49/1.54 c - non default parameters ----------------------------------------------------------------------
1.49/1.54 c # SCIP version 1.2.1.2
1.49/1.54 c
1.49/1.54 c # frequency for displaying node information lines
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 100]
1.49/1.54 c display/freq = 10000
1.49/1.54 c
1.49/1.54 c # maximal time in seconds to run
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.54 c limits/time = 1799.53
1.49/1.54 c
1.49/1.54 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.54 c limits/memory = 1620
1.49/1.54 c
1.49/1.54 c # solving stops, if the given number of solutions were found (-1: no limit)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.54 c limits/solutions = 1
1.49/1.54 c
1.49/1.54 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c lp/solvefreq = -1
1.49/1.54 c
1.49/1.54 c # maximal number of separation rounds per node (-1: unlimited)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 5]
1.49/1.54 c separating/maxrounds = 1
1.49/1.54 c
1.49/1.54 c # maximal number of separation rounds in the root node (-1: unlimited)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.54 c separating/maxroundsroot = 5
1.49/1.54 c
1.49/1.54 c # should presolving try to simplify inequalities
1.49/1.54 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.54 c constraints/linear/simplifyinequalities = TRUE
1.49/1.54 c
1.49/1.54 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.49/1.54 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.49/1.54 c constraints/knapsack/disaggregation = FALSE
1.49/1.54 c
1.49/1.54 c # should presolving try to simplify knapsacks
1.49/1.54 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.54 c constraints/knapsack/simplifyinequalities = TRUE
1.49/1.54 c
1.49/1.54 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.54 c presolving/probing/maxrounds = 0
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/coefdiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/coefdiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/coefdiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 30]
1.49/1.54 c heuristics/crossover/freq = -1
1.49/1.54 c
1.49/1.54 c # number of nodes added to the contingent of the total nodes
1.49/1.54 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.54 c heuristics/crossover/nodesofs = 750
1.49/1.54 c
1.49/1.54 c # number of nodes without incumbent change that heuristic should wait
1.49/1.54 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.49/1.54 c heuristics/crossover/nwaitingnodes = 100
1.49/1.54 c
1.49/1.54 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.49/1.54 c # [type: real, range: [0,1], default: 0.1]
1.49/1.54 c heuristics/crossover/nodesquot = 0.15
1.49/1.54 c
1.49/1.54 c # minimum percentage of integer variables that have to be fixed
1.49/1.54 c # [type: real, range: [0,1], default: 0.666]
1.49/1.54 c heuristics/crossover/minfixingrate = 0.5
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.54 c heuristics/feaspump/freq = -1
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/feaspump/maxlpiterofs = 2000
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/fracdiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/fracdiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/fracdiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/guideddiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/guideddiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/guideddiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/intdiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/intshifting/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/linesearchdiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/nlp/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.54 c heuristics/objpscostdiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to total iteration number
1.49/1.54 c # [type: real, range: [0,1], default: 0.01]
1.49/1.54 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/oneopt/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/pscostdiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/pscostdiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.54 c heuristics/rens/freq = -1
1.49/1.54 c
1.49/1.54 c # minimum percentage of integer variables that have to be fixable
1.49/1.54 c # [type: real, range: [0,1], default: 0.5]
1.49/1.54 c heuristics/rens/minfixingrate = 0.3
1.49/1.54 c
1.49/1.54 c # number of nodes added to the contingent of the total nodes
1.49/1.54 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.54 c heuristics/rens/nodesofs = 2000
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.54 c heuristics/rootsoldiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.49/1.54 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/rounding/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/shifting/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/simplerounding/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.54 c heuristics/trivial/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/trysol/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.54 c heuristics/veclendiving/freq = -1
1.49/1.54 c
1.49/1.54 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.54 c heuristics/veclendiving/maxlpiterquot = 0.075
1.49/1.54 c
1.49/1.54 c # additional number of allowed LP iterations
1.49/1.54 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.54 c heuristics/veclendiving/maxlpiterofs = 1500
1.49/1.54 c
1.49/1.54 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.54 c heuristics/zirounding/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.54 c separating/cmir/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.54 c separating/flowcover/freq = -1
1.49/1.54 c
1.49/1.54 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.49/1.54 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.54 c separating/rapidlearning/freq = 0
1.49/1.54 c
1.49/1.54 c -----------------------------------------------------------------------------------------------
1.49/1.54 c start solving
1.49/1.54 c
1.49/1.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.58 c 0.9s| 1 | 2 | 0 | - | 49M| 0 | - |7790 | 22k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
80.17/80.24 c 78.8s| 10000 | 5034 | 0 | 0.0 | 84M| 199 | - |7790 | 23k| 0 | 0 | 0 |2860 | 0 | 0.000000e+00 | -- | Inf
146.93/147.05 c
146.93/147.05 c SCIP Status : problem is solved [infeasible]
146.93/147.05 c Solving Time (sec) : 144.69
146.93/147.05 c Solving Nodes : 16800
146.93/147.05 c Primal Bound : +1.00000000000000e+20 (0 solutions)
146.93/147.05 c Dual Bound : +1.00000000000000e+20
146.93/147.05 c Gap : 0.00 %
146.93/147.05 s UNSATISFIABLE
146.93/147.05 c SCIP Status : problem is solved [infeasible]
146.93/147.05 c Solving Time : 144.69
146.93/147.05 c Original Problem :
146.93/147.05 c Problem name : HOME/instance-2664573-1276338630.opb
146.93/147.05 c Variables : 9051 (9051 binary, 0 integer, 0 implicit integer, 0 continuous)
146.93/147.05 c Constraints : 25833 initial, 25833 maximal
146.93/147.05 c Presolved Problem :
146.93/147.05 c Problem name : t_HOME/instance-2664573-1276338630.opb
146.93/147.05 c Variables : 7790 (7790 binary, 0 integer, 0 implicit integer, 0 continuous)
146.93/147.05 c Constraints : 22374 initial, 25143 maximal
146.93/147.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
146.93/147.05 c trivial : 0.00 0 0 0 0 0 0 0 0
146.93/147.05 c dualfix : 0.00 0 0 0 0 0 0 0 0
146.93/147.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
146.93/147.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
146.93/147.05 c implics : 0.10 0 702 0 0 0 0 0 0
146.93/147.05 c probing : 0.00 0 0 0 0 0 0 0 0
146.93/147.05 c knapsack : 0.01 0 0 0 0 0 0 0 0
146.93/147.05 c linear : 0.56 555 4 0 555 0 3459 446 928
146.93/147.05 c logicor : 0.09 0 0 0 0 0 0 0 0
146.93/147.05 c root node : - 0 - - 0 - - - -
146.93/147.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
146.93/147.05 c integral : 0 0 0 0 0 0 0 0 0 0
146.93/147.05 c knapsack : 892 0 232803 0 15114 168 15303 0 0 0
146.93/147.05 c logicor : 21482+ 0 228126 0 15114 2771 1854219 0 0 0
146.93/147.05 c countsols : 0 0 0 0 15114 0 0 0 0 0
146.93/147.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
146.93/147.06 c integral : 0.00 0.00 0.00 0.00 0.00
146.93/147.06 c knapsack : 7.15 0.00 6.96 0.00 0.19
146.93/147.06 c logicor : 88.94 0.00 16.16 0.00 72.78
146.93/147.06 c countsols : 0.02 0.00 0.00 0.00 0.02
146.93/147.06 c Propagators : Time Calls Cutoffs DomReds
146.93/147.06 c vbounds : 0.07 1 0 0
146.93/147.06 c rootredcost : 0.08 0 0 0
146.93/147.06 c pseudoobj : 0.07 0 0 0
146.93/147.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
146.93/147.06 c propagation : 1.38 2939 2907 18629 44.7 495 15.1 -
146.93/147.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
146.93/147.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
146.93/147.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
146.93/147.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
146.93/147.06 c applied globally : - - - 8169 28.9 - - -
146.93/147.06 c applied locally : - - - 0 0.0 - - -
146.93/147.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
146.93/147.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
146.93/147.06 c redcost : 0.00 0 0 0 0 0
146.93/147.06 c impliedbounds : 0.00 0 0 0 0 0
146.93/147.06 c intobj : 0.00 0 0 0 0 0
146.93/147.06 c cgmip : 0.00 0 0 0 0 0
146.93/147.06 c gomory : 0.00 0 0 0 0 0
146.93/147.06 c strongcg : 0.00 0 0 0 0 0
146.93/147.06 c cmir : 0.00 0 0 0 0 0
146.93/147.06 c flowcover : 0.00 0 0 0 0 0
146.93/147.06 c clique : 0.00 0 0 0 0 0
146.93/147.06 c zerohalf : 0.00 0 0 0 0 0
146.93/147.06 c mcf : 0.00 0 0 0 0 0
146.93/147.06 c rapidlearning : 0.00 0 0 0 0 0
146.93/147.06 c Pricers : Time Calls Vars
146.93/147.06 c problem variables: 0.00 0 0
146.93/147.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
146.93/147.06 c relpscost : 0.00 0 0 0 0 0 0
146.93/147.06 c pscost : 0.00 0 0 0 0 0 0
146.93/147.06 c inference : 23.45 15114 0 0 0 0 30228
146.93/147.06 c mostinf : 0.00 0 0 0 0 0 0
146.93/147.06 c leastinf : 0.00 0 0 0 0 0 0
146.93/147.06 c fullstrong : 0.00 0 0 0 0 0 0
146.93/147.06 c allfullstrong : 0.00 0 0 0 0 0 0
146.93/147.06 c random : 0.00 0 0 0 0 0 0
146.93/147.06 c Primal Heuristics : Time Calls Found
146.93/147.06 c LP solutions : 0.00 - 0
146.93/147.06 c pseudo solutions : 0.00 - 0
146.93/147.06 c trivial : 0.02 1 0
146.93/147.06 c simplerounding : 0.00 0 0
146.93/147.06 c zirounding : 0.00 0 0
146.93/147.06 c rounding : 0.00 0 0
146.93/147.06 c shifting : 0.00 0 0
146.93/147.06 c intshifting : 0.00 0 0
146.93/147.06 c oneopt : 0.00 0 0
146.93/147.06 c twoopt : 0.00 0 0
146.93/147.06 c fixandinfer : 0.00 0 0
146.93/147.06 c feaspump : 0.00 0 0
146.93/147.06 c coefdiving : 0.00 0 0
146.93/147.06 c pscostdiving : 0.00 0 0
146.93/147.06 c fracdiving : 0.00 0 0
146.93/147.06 c veclendiving : 0.00 0 0
146.93/147.06 c intdiving : 0.00 0 0
146.93/147.06 c actconsdiving : 0.00 0 0
146.93/147.06 c objpscostdiving : 0.00 0 0
146.93/147.06 c rootsoldiving : 0.00 0 0
146.93/147.06 c linesearchdiving : 0.00 0 0
146.93/147.06 c guideddiving : 0.00 0 0
146.93/147.06 c octane : 0.00 0 0
146.93/147.06 c rens : 0.00 0 0
146.93/147.06 c rins : 0.00 0 0
146.93/147.06 c localbranching : 0.00 0 0
146.93/147.06 c mutation : 0.00 0 0
146.93/147.06 c crossover : 0.00 0 0
146.93/147.06 c dins : 0.00 0 0
146.93/147.06 c undercover : 0.00 0 0
146.93/147.06 c nlp : 0.00 0 0
146.93/147.06 c trysol : 0.00 0 0
146.93/147.06 c LP : Time Calls Iterations Iter/call Iter/sec
146.93/147.06 c primal LP : 0.00 0 0 0.00 -
146.93/147.06 c dual LP : 0.00 0 0 0.00 -
146.93/147.06 c lex dual LP : 0.00 0 0 0.00 -
146.93/147.06 c barrier LP : 0.00 0 0 0.00 -
146.93/147.06 c diving/probing LP: 0.00 0 0 0.00 -
146.93/147.06 c strong branching : 0.00 0 0 0.00 -
146.93/147.06 c (at root node) : - 0 0 0.00 -
146.93/147.06 c conflict analysis: 0.00 0 0 0.00 -
146.93/147.06 c B&B Tree :
146.93/147.06 c number of runs : 1
146.93/147.06 c nodes : 16800
146.93/147.06 c nodes (total) : 16800
146.93/147.06 c nodes left : 0
146.93/147.06 c max depth : 199
146.93/147.06 c max depth (total): 199
146.93/147.06 c backtracks : 1673 (10.0%)
146.93/147.06 c delayed cutoffs : 13429
146.93/147.06 c repropagations : 8302 (436145 domain reductions, 1253 cutoffs)
146.93/147.06 c avg switch length: 3.74
146.93/147.06 c switching time : 19.26
146.93/147.06 c Solution :
146.93/147.06 c Solutions found : 0 (0 improvements)
146.93/147.06 c Primal Bound : infeasible
146.93/147.06 c Dual Bound : -
146.93/147.06 c Gap : 0.00 %
146.93/147.06 c Root Dual Bound : +0.00000000000000e+00
146.93/147.06 c Root Iterations : 0
147.03/147.19 c Time complete: 147.12.