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-2664565-1276336516.opb>
0.29/0.38 c original problem has 7578 variables (7578 bin, 0 int, 0 impl, 0 cont) and 21401 constraints
0.29/0.38 c problem read
0.29/0.38 c No objective function, only one solution is needed.
0.29/0.39 c presolving settings loaded
0.29/0.39 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.49/0.51 c presolving:
0.89/0.94 c (round 1) 1250 del vars, 1917 del conss, 530 chg bounds, 450 chg sides, 932 chg coeffs, 0 upgd conss, 420742 impls, 0 clqs
1.00/1.00 c (round 2) 1252 del vars, 3420 del conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 0 upgd conss, 420894 impls, 0 clqs
1.19/1.22 c (round 3) 1252 del vars, 3426 del conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 17975 upgd conss, 420894 impls, 0 clqs
1.19/1.28 c presolving (4 rounds):
1.19/1.28 c 1252 deleted vars, 3426 deleted constraints, 532 tightened bounds, 0 added holes, 450 changed sides, 932 changed coefficients
1.19/1.28 c 420894 implications, 0 cliques
1.19/1.28 c presolved problem has 6326 variables (6326 bin, 0 int, 0 impl, 0 cont) and 17975 constraints
1.19/1.28 c 900 constraints of type <knapsack>
1.19/1.28 c 17075 constraints of type <logicor>
1.19/1.28 c transformed objective value is always integral (scale: 1)
1.19/1.28 c Presolving Time: 0.71
1.19/1.28 c - non default parameters ----------------------------------------------------------------------
1.19/1.28 c # SCIP version 1.2.1.2
1.19/1.28 c
1.19/1.28 c # frequency for displaying node information lines
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 100]
1.19/1.28 c display/freq = 10000
1.19/1.28 c
1.19/1.28 c # maximal time in seconds to run
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.19/1.28 c limits/time = 1799.62
1.19/1.28 c
1.19/1.28 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.19/1.28 c limits/memory = 1620
1.19/1.28 c
1.19/1.28 c # solving stops, if the given number of solutions were found (-1: no limit)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.28 c limits/solutions = 1
1.19/1.28 c
1.19/1.28 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c lp/solvefreq = -1
1.19/1.28 c
1.19/1.28 c # maximal number of separation rounds per node (-1: unlimited)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 5]
1.19/1.28 c separating/maxrounds = 1
1.19/1.28 c
1.19/1.28 c # maximal number of separation rounds in the root node (-1: unlimited)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.28 c separating/maxroundsroot = 5
1.19/1.28 c
1.19/1.28 c # should presolving try to simplify inequalities
1.19/1.28 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.19/1.28 c constraints/linear/simplifyinequalities = TRUE
1.19/1.28 c
1.19/1.28 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.19/1.28 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.19/1.28 c constraints/knapsack/disaggregation = FALSE
1.19/1.28 c
1.19/1.28 c # should presolving try to simplify knapsacks
1.19/1.28 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.19/1.28 c constraints/knapsack/simplifyinequalities = TRUE
1.19/1.28 c
1.19/1.28 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.28 c presolving/probing/maxrounds = 0
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/coefdiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/coefdiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/coefdiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 30]
1.19/1.28 c heuristics/crossover/freq = -1
1.19/1.28 c
1.19/1.28 c # number of nodes added to the contingent of the total nodes
1.19/1.28 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.19/1.28 c heuristics/crossover/nodesofs = 750
1.19/1.28 c
1.19/1.28 c # number of nodes without incumbent change that heuristic should wait
1.19/1.28 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.19/1.28 c heuristics/crossover/nwaitingnodes = 100
1.19/1.28 c
1.19/1.28 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.19/1.28 c # [type: real, range: [0,1], default: 0.1]
1.19/1.28 c heuristics/crossover/nodesquot = 0.15
1.19/1.28 c
1.19/1.28 c # minimum percentage of integer variables that have to be fixed
1.19/1.28 c # [type: real, range: [0,1], default: 0.666]
1.19/1.28 c heuristics/crossover/minfixingrate = 0.5
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.28 c heuristics/feaspump/freq = -1
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/feaspump/maxlpiterofs = 2000
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/fracdiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/fracdiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/fracdiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/guideddiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/guideddiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/guideddiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/intdiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/intshifting/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/linesearchdiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/nlp/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.28 c heuristics/objpscostdiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to total iteration number
1.19/1.28 c # [type: real, range: [0,1], default: 0.01]
1.19/1.28 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/oneopt/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/pscostdiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/pscostdiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.28 c heuristics/rens/freq = -1
1.19/1.28 c
1.19/1.28 c # minimum percentage of integer variables that have to be fixable
1.19/1.28 c # [type: real, range: [0,1], default: 0.5]
1.19/1.28 c heuristics/rens/minfixingrate = 0.3
1.19/1.28 c
1.19/1.28 c # number of nodes added to the contingent of the total nodes
1.19/1.28 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.19/1.28 c heuristics/rens/nodesofs = 2000
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.28 c heuristics/rootsoldiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.19/1.28 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/rounding/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/shifting/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/simplerounding/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.28 c heuristics/trivial/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/trysol/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.28 c heuristics/veclendiving/freq = -1
1.19/1.28 c
1.19/1.28 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.28 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.28 c heuristics/veclendiving/maxlpiterquot = 0.075
1.19/1.28 c
1.19/1.28 c # additional number of allowed LP iterations
1.19/1.28 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.28 c heuristics/veclendiving/maxlpiterofs = 1500
1.19/1.28 c
1.19/1.28 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.28 c heuristics/zirounding/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.28 c separating/cmir/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.28 c separating/flowcover/freq = -1
1.19/1.28 c
1.19/1.28 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.19/1.28 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.28 c separating/rapidlearning/freq = 0
1.19/1.28 c
1.19/1.28 c -----------------------------------------------------------------------------------------------
1.19/1.28 c start solving
1.19/1.28 c
1.29/1.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.31 c 0.8s| 1 | 2 | 0 | - | 40M| 0 | - |6326 | 17k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
76.57/76.65 c 75.2s| 10000 | 4544 | 0 | 0.0 | 69M| 201 | - |6326 | 19k| 0 | 0 | 0 |3324 | 0 | 0.000000e+00 | -- | Inf
128.16/128.26 c
128.16/128.26 c SCIP Status : problem is solved [infeasible]
128.16/128.26 c Solving Time (sec) : 126.18
128.16/128.26 c Solving Nodes : 15884
128.16/128.26 c Primal Bound : +1.00000000000000e+20 (0 solutions)
128.16/128.26 c Dual Bound : +1.00000000000000e+20
128.16/128.26 c Gap : 0.00 %
128.16/128.26 s UNSATISFIABLE
128.16/128.26 c SCIP Status : problem is solved [infeasible]
128.16/128.26 c Solving Time : 126.18
128.16/128.26 c Original Problem :
128.16/128.26 c Problem name : HOME/instance-2664565-1276336516.opb
128.16/128.26 c Variables : 7578 (7578 binary, 0 integer, 0 implicit integer, 0 continuous)
128.16/128.26 c Constraints : 21401 initial, 21401 maximal
128.16/128.26 c Presolved Problem :
128.16/128.26 c Problem name : t_HOME/instance-2664565-1276336516.opb
128.16/128.26 c Variables : 6326 (6326 binary, 0 integer, 0 implicit integer, 0 continuous)
128.16/128.26 c Constraints : 17975 initial, 20473 maximal
128.16/128.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
128.16/128.26 c trivial : 0.00 0 0 0 0 0 0 0 0
128.16/128.26 c dualfix : 0.01 0 0 0 0 0 0 0 0
128.16/128.26 c boundshift : 0.00 0 0 0 0 0 0 0 0
128.16/128.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0
128.16/128.26 c implics : 0.09 0 716 0 0 0 0 0 0
128.16/128.26 c probing : 0.00 0 0 0 0 0 0 0 0
128.16/128.26 c knapsack : 0.01 0 0 0 0 0 0 0 0
128.16/128.26 c linear : 0.45 532 4 0 532 0 3426 450 932
128.16/128.26 c logicor : 0.08 0 0 0 0 0 0 0 0
128.16/128.26 c root node : - 0 - - 0 - - - -
128.16/128.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
128.16/128.26 c integral : 0 0 0 0 0 0 0 0 0 0
128.16/128.26 c knapsack : 900 0 221428 0 14310 95 14431 0 0 0
128.16/128.26 c logicor : 17075+ 0 217021 0 14310 2730 1598286 0 0 0
128.16/128.26 c countsols : 0 0 0 0 14310 0 0 0 0 0
128.16/128.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
128.16/128.26 c integral : 0.00 0.00 0.00 0.00 0.00
128.16/128.26 c knapsack : 6.75 0.00 6.69 0.00 0.06
128.16/128.26 c logicor : 77.33 0.00 13.95 0.00 63.38
128.16/128.26 c countsols : 0.01 0.00 0.00 0.00 0.01
128.16/128.26 c Propagators : Time Calls Cutoffs DomReds
128.16/128.26 c vbounds : 0.11 1 0 0
128.16/128.26 c rootredcost : 0.14 0 0 0
128.16/128.26 c pseudoobj : 0.10 0 0 0
128.16/128.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
128.16/128.26 c propagation : 1.16 2825 2797 17903 41.9 348 16.2 -
128.16/128.26 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
128.16/128.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
128.16/128.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
128.16/128.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
128.16/128.26 c applied globally : - - - 7274 27.2 - - -
128.16/128.26 c applied locally : - - - 0 0.0 - - -
128.16/128.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
128.16/128.26 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
128.16/128.26 c redcost : 0.00 0 0 0 0 0
128.16/128.26 c impliedbounds : 0.00 0 0 0 0 0
128.16/128.26 c intobj : 0.00 0 0 0 0 0
128.16/128.26 c cgmip : 0.00 0 0 0 0 0
128.16/128.26 c gomory : 0.00 0 0 0 0 0
128.16/128.26 c strongcg : 0.00 0 0 0 0 0
128.16/128.26 c cmir : 0.00 0 0 0 0 0
128.16/128.26 c flowcover : 0.00 0 0 0 0 0
128.16/128.26 c clique : 0.00 0 0 0 0 0
128.16/128.26 c zerohalf : 0.00 0 0 0 0 0
128.16/128.26 c mcf : 0.00 0 0 0 0 0
128.16/128.26 c rapidlearning : 0.00 0 0 0 0 0
128.16/128.26 c Pricers : Time Calls Vars
128.16/128.26 c problem variables: 0.00 0 0
128.16/128.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
128.16/128.26 c relpscost : 0.00 0 0 0 0 0 0
128.16/128.26 c pscost : 0.00 0 0 0 0 0 0
128.16/128.26 c inference : 21.48 14310 0 0 0 0 28620
128.16/128.26 c mostinf : 0.00 0 0 0 0 0 0
128.16/128.26 c leastinf : 0.00 0 0 0 0 0 0
128.16/128.26 c fullstrong : 0.00 0 0 0 0 0 0
128.16/128.26 c allfullstrong : 0.00 0 0 0 0 0 0
128.16/128.26 c random : 0.00 0 0 0 0 0 0
128.16/128.26 c Primal Heuristics : Time Calls Found
128.16/128.26 c LP solutions : 0.00 - 0
128.16/128.26 c pseudo solutions : 0.00 - 0
128.16/128.26 c trivial : 0.02 1 0
128.16/128.26 c simplerounding : 0.00 0 0
128.16/128.26 c zirounding : 0.00 0 0
128.16/128.26 c rounding : 0.00 0 0
128.16/128.26 c shifting : 0.00 0 0
128.16/128.26 c intshifting : 0.00 0 0
128.16/128.26 c oneopt : 0.00 0 0
128.16/128.26 c twoopt : 0.00 0 0
128.16/128.26 c fixandinfer : 0.00 0 0
128.16/128.26 c feaspump : 0.00 0 0
128.16/128.26 c coefdiving : 0.00 0 0
128.16/128.26 c pscostdiving : 0.00 0 0
128.16/128.26 c fracdiving : 0.00 0 0
128.16/128.26 c veclendiving : 0.00 0 0
128.16/128.26 c intdiving : 0.00 0 0
128.16/128.26 c actconsdiving : 0.00 0 0
128.16/128.26 c objpscostdiving : 0.00 0 0
128.16/128.26 c rootsoldiving : 0.00 0 0
128.16/128.26 c linesearchdiving : 0.00 0 0
128.16/128.26 c guideddiving : 0.00 0 0
128.16/128.26 c octane : 0.00 0 0
128.16/128.26 c rens : 0.00 0 0
128.16/128.26 c rins : 0.00 0 0
128.16/128.26 c localbranching : 0.00 0 0
128.16/128.26 c mutation : 0.00 0 0
128.16/128.26 c crossover : 0.00 0 0
128.16/128.26 c dins : 0.00 0 0
128.16/128.26 c undercover : 0.00 0 0
128.16/128.26 c nlp : 0.00 0 0
128.16/128.26 c trysol : 0.00 0 0
128.16/128.26 c LP : Time Calls Iterations Iter/call Iter/sec
128.16/128.26 c primal LP : 0.00 0 0 0.00 -
128.16/128.26 c dual LP : 0.00 0 0 0.00 -
128.16/128.26 c lex dual LP : 0.00 0 0 0.00 -
128.16/128.26 c barrier LP : 0.00 0 0 0.00 -
128.16/128.26 c diving/probing LP: 0.00 0 0 0.00 -
128.16/128.26 c strong branching : 0.00 0 0 0.00 -
128.16/128.26 c (at root node) : - 0 0 0.00 -
128.16/128.26 c conflict analysis: 0.00 0 0 0.00 -
128.16/128.26 c B&B Tree :
128.16/128.26 c number of runs : 1
128.16/128.26 c nodes : 15884
128.16/128.26 c nodes (total) : 15884
128.16/128.26 c nodes left : 0
128.16/128.26 c max depth : 201
128.16/128.26 c max depth (total): 201
128.16/128.26 c backtracks : 1637 (10.3%)
128.16/128.26 c delayed cutoffs : 12737
128.16/128.26 c repropagations : 7167 (405838 domain reductions, 1251 cutoffs)
128.16/128.26 c avg switch length: 3.78
128.16/128.26 c switching time : 15.05
128.16/128.26 c Solution :
128.16/128.26 c Solutions found : 0 (0 improvements)
128.16/128.26 c Primal Bound : infeasible
128.16/128.26 c Dual Bound : -
128.16/128.26 c Gap : 0.00 %
128.16/128.26 c Root Dual Bound : +0.00000000000000e+00
128.16/128.26 c Root Iterations : 0
128.25/128.37 c Time complete: 128.34.