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-2664559-1276335506.opb>
0.19/0.20 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.19/0.20 c problem read
0.19/0.20 c No objective function, only one solution is needed.
0.19/0.20 c presolving settings loaded
0.19/0.20 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.19/0.26 c presolving:
0.39/0.45 c (round 1) 520 del vars, 652 del conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.47 c (round 2) 522 del vars, 1334 del conss, 223 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.49 c (round 3) 542 del vars, 1384 del conss, 243 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.49/0.50 c (round 4) 546 del vars, 1390 del conss, 247 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.49/0.51 c (round 5) 552 del vars, 1401 del conss, 253 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.49/0.52 c (round 6) 556 del vars, 1415 del conss, 257 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.49/0.54 c (round 7) 560 del vars, 1425 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.49/0.55 c (round 8) 560 del vars, 1433 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.59/0.67 c (round 9) 560 del vars, 1439 del conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8973 upgd conss, 171264 impls, 0 clqs
0.69/0.71 c presolving (10 rounds):
0.69/0.71 c 560 deleted vars, 1439 deleted constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.69/0.71 c 171264 implications, 0 cliques
0.69/0.71 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.69/0.71 c 672 constraints of type <knapsack>
0.69/0.71 c 8301 constraints of type <logicor>
0.69/0.71 c transformed objective value is always integral (scale: 1)
0.69/0.71 c Presolving Time: 0.38
0.69/0.71 c - non default parameters ----------------------------------------------------------------------
0.69/0.71 c # SCIP version 1.2.1.2
0.69/0.71 c
0.69/0.71 c # frequency for displaying node information lines
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.71 c display/freq = 10000
0.69/0.71 c
0.69/0.71 c # maximal time in seconds to run
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.71 c limits/time = 1799.81
0.69/0.71 c
0.69/0.71 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.71 c limits/memory = 1620
0.69/0.71 c
0.69/0.71 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c limits/solutions = 1
0.69/0.71 c
0.69/0.71 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c lp/solvefreq = -1
0.69/0.71 c
0.69/0.71 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.71 c separating/maxrounds = 1
0.69/0.71 c
0.69/0.71 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c separating/maxroundsroot = 5
0.69/0.71 c
0.69/0.71 c # should presolving try to simplify inequalities
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.71 c constraints/linear/simplifyinequalities = TRUE
0.69/0.71 c
0.69/0.71 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.71 c constraints/knapsack/disaggregation = FALSE
0.69/0.71 c
0.69/0.71 c # should presolving try to simplify knapsacks
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.71 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.71 c
0.69/0.71 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c presolving/probing/maxrounds = 0
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/coefdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.71 c heuristics/crossover/freq = -1
0.69/0.71 c
0.69/0.71 c # number of nodes added to the contingent of the total nodes
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.71 c heuristics/crossover/nodesofs = 750
0.69/0.71 c
0.69/0.71 c # number of nodes without incumbent change that heuristic should wait
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.71 c heuristics/crossover/nwaitingnodes = 100
0.69/0.71 c
0.69/0.71 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.71 c # [type: real, range: [0,1], default: 0.1]
0.69/0.71 c heuristics/crossover/nodesquot = 0.15
0.69/0.71 c
0.69/0.71 c # minimum percentage of integer variables that have to be fixed
0.69/0.71 c # [type: real, range: [0,1], default: 0.666]
0.69/0.71 c heuristics/crossover/minfixingrate = 0.5
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/feaspump/freq = -1
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/fracdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/guideddiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/intshifting/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/linesearchdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/nlp/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/objpscostdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.71 c # [type: real, range: [0,1], default: 0.01]
0.69/0.71 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/oneopt/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/pscostdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c heuristics/rens/freq = -1
0.69/0.71 c
0.69/0.71 c # minimum percentage of integer variables that have to be fixable
0.69/0.71 c # [type: real, range: [0,1], default: 0.5]
0.69/0.71 c heuristics/rens/minfixingrate = 0.3
0.69/0.71 c
0.69/0.71 c # number of nodes added to the contingent of the total nodes
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.71 c heuristics/rens/nodesofs = 2000
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/rootsoldiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.71 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/rounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/shifting/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/simplerounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c heuristics/trivial/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/trysol/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/veclendiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/zirounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c separating/cmir/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c separating/flowcover/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c separating/rapidlearning/freq = 0
0.69/0.71 c
0.69/0.71 c -----------------------------------------------------------------------------------------------
0.69/0.71 c start solving
0.69/0.71 c
0.69/0.72 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.72 c 0.4s| 1 | 2 | 0 | - | 19M| 0 | - |3379 |8973 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
34.68/34.77 c 33.8s| 10000 | 5562 | 0 | 0.0 | 33M| 146 | - |3379 |7768 | 0 | 0 | 0 |3979 | 0 | 0.000000e+00 | -- | Inf
66.17/66.24 c 64.6s| 20000 | 10943 | 0 | 0.0 | 45M| 146 | - |3379 |8624 | 0 | 0 | 0 |8692 | 0 | 0.000000e+00 | -- | Inf
110.76/110.87 c 108s| 30000 | 2893 | 0 | 0.0 | 37M| 146 | - |3379 |9813 | 0 | 0 | 0 | 17k| 0 | 0.000000e+00 | -- | Inf
131.16/131.21 c
131.16/131.21 c SCIP Status : problem is solved [infeasible]
131.16/131.21 c Solving Time (sec) : 127.93
131.16/131.21 c Solving Nodes : 34046
131.16/131.21 c Primal Bound : +1.00000000000000e+20 (0 solutions)
131.16/131.21 c Dual Bound : +1.00000000000000e+20
131.16/131.21 c Gap : 0.00 %
131.16/131.21 s UNSATISFIABLE
131.16/131.21 c SCIP Status : problem is solved [infeasible]
131.16/131.21 c Solving Time : 127.93
131.16/131.21 c Original Problem :
131.16/131.21 c Problem name : HOME/instance-2664559-1276335506.opb
131.16/131.21 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
131.16/131.21 c Constraints : 10412 initial, 10412 maximal
131.16/131.21 c Presolved Problem :
131.16/131.21 c Problem name : t_HOME/instance-2664559-1276335506.opb
131.16/131.21 c Variables : 3379 (3379 binary, 0 integer, 0 implicit integer, 0 continuous)
131.16/131.21 c Constraints : 8973 initial, 10574 maximal
131.16/131.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
131.16/131.21 c trivial : 0.01 0 0 0 0 0 0 0 0
131.16/131.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
131.16/131.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
131.16/131.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
131.16/131.21 c implics : 0.04 0 294 0 0 0 0 0 0
131.16/131.21 c probing : 0.00 0 0 0 0 0 0 0 0
131.16/131.21 c knapsack : 0.01 0 0 0 0 0 0 0 0
131.16/131.21 c linear : 0.24 261 5 0 261 0 1439 336 724
131.16/131.21 c logicor : 0.05 0 0 0 0 0 0 0 0
131.16/131.21 c root node : - 1113 - - 1113 - - - -
131.16/131.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
131.16/131.21 c integral : 0 0 0 0 0 0 0 0 0 0
131.16/131.21 c knapsack : 672 0 409267 0 28924 950 229436 0 0 0
131.16/131.21 c logicor : 8301+ 0 393564 0 28924 8025 2050199 0 0 0
131.16/131.21 c countsols : 0 0 0 0 28924 0 0 0 0 0
131.16/131.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
131.16/131.21 c integral : 0.00 0.00 0.00 0.00 0.00
131.16/131.21 c knapsack : 16.49 0.00 16.27 0.00 0.22
131.16/131.21 c logicor : 63.90 0.00 19.81 0.00 44.09
131.16/131.21 c countsols : 0.02 0.00 0.00 0.00 0.02
131.16/131.21 c Propagators : Time Calls Cutoffs DomReds
131.16/131.21 c vbounds : 0.12 1 0 0
131.16/131.21 c rootredcost : 0.15 0 0 0
131.16/131.21 c pseudoobj : 0.26 0 0 0
131.16/131.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
131.16/131.21 c propagation : 1.49 8975 8940 47376 20.3 1014 11.9 -
131.16/131.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
131.16/131.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
131.16/131.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
131.16/131.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
131.16/131.21 c applied globally : - - - 21330 17.1 - - -
131.16/131.21 c applied locally : - - - 0 0.0 - - -
131.16/131.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
131.16/131.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
131.16/131.21 c redcost : 0.00 0 0 0 0 0
131.16/131.21 c impliedbounds : 0.00 0 0 0 0 0
131.16/131.21 c intobj : 0.00 0 0 0 0 0
131.16/131.21 c cgmip : 0.00 0 0 0 0 0
131.16/131.21 c gomory : 0.00 0 0 0 0 0
131.16/131.21 c strongcg : 0.00 0 0 0 0 0
131.16/131.21 c cmir : 0.00 0 0 0 0 0
131.16/131.21 c flowcover : 0.00 0 0 0 0 0
131.16/131.21 c clique : 0.00 0 0 0 0 0
131.16/131.21 c zerohalf : 0.00 0 0 0 0 0
131.16/131.21 c mcf : 0.00 0 0 0 0 0
131.16/131.21 c rapidlearning : 0.00 0 0 0 0 0
131.16/131.21 c Pricers : Time Calls Vars
131.16/131.21 c problem variables: 0.00 0 0
131.16/131.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
131.16/131.21 c relpscost : 0.00 0 0 0 0 0 0
131.16/131.21 c pscost : 0.00 0 0 0 0 0 0
131.16/131.21 c inference : 23.61 28924 0 0 0 0 57848
131.16/131.21 c mostinf : 0.00 0 0 0 0 0 0
131.16/131.21 c leastinf : 0.00 0 0 0 0 0 0
131.16/131.21 c fullstrong : 0.00 0 0 0 0 0 0
131.16/131.21 c allfullstrong : 0.00 0 0 0 0 0 0
131.16/131.21 c random : 0.00 0 0 0 0 0 0
131.16/131.21 c Primal Heuristics : Time Calls Found
131.16/131.21 c LP solutions : 0.00 - 0
131.16/131.21 c pseudo solutions : 0.00 - 0
131.16/131.21 c trivial : 0.00 1 0
131.16/131.21 c simplerounding : 0.00 0 0
131.16/131.21 c zirounding : 0.00 0 0
131.16/131.21 c rounding : 0.00 0 0
131.16/131.21 c shifting : 0.00 0 0
131.16/131.21 c intshifting : 0.00 0 0
131.16/131.21 c oneopt : 0.00 0 0
131.16/131.21 c twoopt : 0.00 0 0
131.16/131.21 c fixandinfer : 0.00 0 0
131.16/131.21 c feaspump : 0.00 0 0
131.16/131.21 c coefdiving : 0.00 0 0
131.16/131.21 c pscostdiving : 0.00 0 0
131.16/131.21 c fracdiving : 0.00 0 0
131.16/131.21 c veclendiving : 0.00 0 0
131.16/131.21 c intdiving : 0.00 0 0
131.16/131.21 c actconsdiving : 0.00 0 0
131.16/131.21 c objpscostdiving : 0.00 0 0
131.16/131.21 c rootsoldiving : 0.00 0 0
131.16/131.21 c linesearchdiving : 0.00 0 0
131.16/131.21 c guideddiving : 0.00 0 0
131.16/131.21 c octane : 0.00 0 0
131.16/131.21 c rens : 0.00 0 0
131.16/131.21 c rins : 0.00 0 0
131.16/131.21 c localbranching : 0.00 0 0
131.16/131.21 c mutation : 0.00 0 0
131.16/131.21 c crossover : 0.00 0 0
131.16/131.21 c dins : 0.00 0 0
131.16/131.21 c undercover : 0.00 0 0
131.16/131.21 c nlp : 0.00 0 0
131.16/131.21 c trysol : 0.00 0 0
131.16/131.21 c LP : Time Calls Iterations Iter/call Iter/sec
131.16/131.21 c primal LP : 0.00 0 0 0.00 -
131.16/131.21 c dual LP : 0.00 0 0 0.00 -
131.16/131.21 c lex dual LP : 0.00 0 0 0.00 -
131.16/131.21 c barrier LP : 0.00 0 0 0.00 -
131.16/131.21 c diving/probing LP: 0.00 0 0 0.00 -
131.16/131.21 c strong branching : 0.00 0 0 0.00 -
131.16/131.21 c (at root node) : - 0 0 0.00 -
131.16/131.21 c conflict analysis: 0.00 0 0 0.00 -
131.16/131.21 c B&B Tree :
131.16/131.21 c number of runs : 1
131.16/131.21 c nodes : 34046
131.16/131.21 c nodes (total) : 34046
131.16/131.21 c nodes left : 0
131.16/131.21 c max depth : 146
131.16/131.21 c max depth (total): 146
131.16/131.21 c backtracks : 5012 (14.7%)
131.16/131.21 c delayed cutoffs : 23803
131.16/131.21 c repropagations : 17426 (716834 domain reductions, 3853 cutoffs)
131.16/131.21 c avg switch length: 5.09
131.16/131.21 c switching time : 16.12
131.16/131.21 c Solution :
131.16/131.21 c Solutions found : 0 (0 improvements)
131.16/131.21 c Primal Bound : infeasible
131.16/131.21 c Dual Bound : -
131.16/131.21 c Gap : 0.00 %
131.16/131.21 c Root Dual Bound : +0.00000000000000e+00
131.16/131.21 c Root Iterations : 0
131.16/131.28 c Time complete: 131.24.