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-2685052-1278438998.opb>
1.69/1.71 c original problem has 28072 variables (28072 bin, 0 int, 0 impl, 0 cont) and 97590 constraints
1.69/1.71 c problem read
1.69/1.71 c No objective function, only one solution is needed.
1.69/1.71 c presolving settings loaded
1.69/1.72 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
2.10/2.20 c presolving:
6.59/6.69 c (round 1) 7375 del vars, 21415 del conss, 5895 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5305170 impls, 0 clqs
8.79/8.87 c (round 2) 13387 del vars, 47444 del conss, 11499 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5342869 impls, 0 clqs
9.19/9.21 c (round 3) 15411 del vars, 58072 del conss, 12707 chg bounds, 54 chg sides, 29 chg coeffs, 0 upgd conss, 5357682 impls, 0 clqs
9.39/9.41 c (round 4) 16490 del vars, 62278 del conss, 13459 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5371058 impls, 0 clqs
9.48/9.54 c (round 5) 17208 del vars, 64967 del conss, 13898 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5378974 impls, 0 clqs
9.59/9.64 c (round 6) 17723 del vars, 66823 del conss, 14207 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5384740 impls, 0 clqs
9.69/9.72 c (round 7) 18067 del vars, 68143 del conss, 14400 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5388483 impls, 0 clqs
9.69/9.78 c (round 8) 18263 del vars, 68917 del conss, 14503 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5390932 impls, 0 clqs
9.80/9.84 c (round 9) 18411 del vars, 69457 del conss, 14579 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5392674 impls, 0 clqs
9.80/9.89 c (round 10) 18522 del vars, 69879 del conss, 14636 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5393596 impls, 0 clqs
9.90/9.93 c (round 11) 18572 del vars, 70088 del conss, 14660 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5394174 impls, 0 clqs
9.90/9.98 c (round 12) 18604 del vars, 70219 del conss, 14675 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5394422 impls, 0 clqs
9.99/10.02 c (round 13) 18612 del vars, 70262 del conss, 14679 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5394460 impls, 0 clqs
9.99/10.06 c (round 14) 18616 del vars, 70281 del conss, 14679 chg bounds, 65 chg sides, 44 chg coeffs, 0 upgd conss, 5394480 impls, 0 clqs
10.38/10.41 c (round 15) 18616 del vars, 70281 del conss, 14679 chg bounds, 65 chg sides, 44 chg coeffs, 27309 upgd conss, 5394480 impls, 0 clqs
10.48/10.56 c (round 16) 18616 del vars, 70281 del conss, 14679 chg bounds, 72 chg sides, 174 chg coeffs, 27309 upgd conss, 5397164 impls, 662 clqs
10.59/10.69 c (round 17) 18616 del vars, 70281 del conss, 14679 chg bounds, 77 chg sides, 216 chg coeffs, 27309 upgd conss, 5397164 impls, 695 clqs
10.69/10.78 c presolving (18 rounds):
10.69/10.78 c 18616 deleted vars, 70281 deleted constraints, 14679 tightened bounds, 0 added holes, 77 changed sides, 228 changed coefficients
10.69/10.78 c 5397164 implications, 700 cliques
10.69/10.78 c presolved problem has 9456 variables (9456 bin, 0 int, 0 impl, 0 cont) and 27309 constraints
10.69/10.78 c 388 constraints of type <knapsack>
10.69/10.78 c 26921 constraints of type <logicor>
10.69/10.78 c transformed objective value is always integral (scale: 1)
10.69/10.78 c Presolving Time: 8.15
10.69/10.78 c - non default parameters ----------------------------------------------------------------------
10.69/10.78 c # SCIP version 1.2.1.2
10.69/10.78 c
10.69/10.78 c # frequency for displaying node information lines
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 100]
10.69/10.78 c display/freq = 10000
10.69/10.78 c
10.69/10.78 c # maximal time in seconds to run
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
10.69/10.78 c limits/time = 1798.3
10.69/10.78 c
10.69/10.78 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
10.69/10.78 c limits/memory = 1620
10.69/10.78 c
10.69/10.78 c # solving stops, if the given number of solutions were found (-1: no limit)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: -1]
10.69/10.78 c limits/solutions = 1
10.69/10.78 c
10.69/10.78 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c lp/solvefreq = -1
10.69/10.78 c
10.69/10.78 c # maximal number of separation rounds per node (-1: unlimited)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 5]
10.69/10.78 c separating/maxrounds = 1
10.69/10.78 c
10.69/10.78 c # maximal number of separation rounds in the root node (-1: unlimited)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: -1]
10.69/10.78 c separating/maxroundsroot = 5
10.69/10.78 c
10.69/10.78 c # should presolving try to simplify inequalities
10.69/10.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
10.69/10.78 c constraints/linear/simplifyinequalities = TRUE
10.69/10.78 c
10.69/10.78 c # should disaggregation of knapsack constraints be allowed in preprocessing?
10.69/10.78 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
10.69/10.78 c constraints/knapsack/disaggregation = FALSE
10.69/10.78 c
10.69/10.78 c # should presolving try to simplify knapsacks
10.69/10.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
10.69/10.78 c constraints/knapsack/simplifyinequalities = TRUE
10.69/10.78 c
10.69/10.78 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: -1]
10.69/10.78 c presolving/probing/maxrounds = 0
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/coefdiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/coefdiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/coefdiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 30]
10.69/10.78 c heuristics/crossover/freq = -1
10.69/10.78 c
10.69/10.78 c # number of nodes added to the contingent of the total nodes
10.69/10.78 c # [type: longint, range: [0,9223372036854775807], default: 500]
10.69/10.78 c heuristics/crossover/nodesofs = 750
10.69/10.78 c
10.69/10.78 c # number of nodes without incumbent change that heuristic should wait
10.69/10.78 c # [type: longint, range: [0,9223372036854775807], default: 200]
10.69/10.78 c heuristics/crossover/nwaitingnodes = 100
10.69/10.78 c
10.69/10.78 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
10.69/10.78 c # [type: real, range: [0,1], default: 0.1]
10.69/10.78 c heuristics/crossover/nodesquot = 0.15
10.69/10.78 c
10.69/10.78 c # minimum percentage of integer variables that have to be fixed
10.69/10.78 c # [type: real, range: [0,1], default: 0.666]
10.69/10.78 c heuristics/crossover/minfixingrate = 0.5
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 20]
10.69/10.78 c heuristics/feaspump/freq = -1
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/feaspump/maxlpiterofs = 2000
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/fracdiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/fracdiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/fracdiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/guideddiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/guideddiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/guideddiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/intdiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/intshifting/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/linesearchdiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/linesearchdiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/linesearchdiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/nlp/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 20]
10.69/10.78 c heuristics/objpscostdiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to total iteration number
10.69/10.78 c # [type: real, range: [0,1], default: 0.01]
10.69/10.78 c heuristics/objpscostdiving/maxlpiterquot = 0.015
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/objpscostdiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/oneopt/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/pscostdiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/pscostdiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/pscostdiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 0]
10.69/10.78 c heuristics/rens/freq = -1
10.69/10.78 c
10.69/10.78 c # minimum percentage of integer variables that have to be fixable
10.69/10.78 c # [type: real, range: [0,1], default: 0.5]
10.69/10.78 c heuristics/rens/minfixingrate = 0.3
10.69/10.78 c
10.69/10.78 c # number of nodes added to the contingent of the total nodes
10.69/10.78 c # [type: longint, range: [0,9223372036854775807], default: 500]
10.69/10.78 c heuristics/rens/nodesofs = 2000
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 20]
10.69/10.78 c heuristics/rootsoldiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
10.69/10.78 c heuristics/rootsoldiving/maxlpiterquot = 0.015
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/rootsoldiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/rounding/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/shifting/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/simplerounding/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 0]
10.69/10.78 c heuristics/trivial/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/trysol/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 10]
10.69/10.78 c heuristics/veclendiving/freq = -1
10.69/10.78 c
10.69/10.78 c # maximal fraction of diving LP iterations compared to node LP iterations
10.69/10.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
10.69/10.78 c heuristics/veclendiving/maxlpiterquot = 0.075
10.69/10.78 c
10.69/10.78 c # additional number of allowed LP iterations
10.69/10.78 c # [type: int, range: [0,2147483647], default: 1000]
10.69/10.78 c heuristics/veclendiving/maxlpiterofs = 1500
10.69/10.78 c
10.69/10.78 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 1]
10.69/10.78 c heuristics/zirounding/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 0]
10.69/10.78 c separating/cmir/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: 0]
10.69/10.78 c separating/flowcover/freq = -1
10.69/10.78 c
10.69/10.78 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
10.69/10.78 c # [type: int, range: [-1,2147483647], default: -1]
10.69/10.78 c separating/rapidlearning/freq = 0
10.69/10.78 c
10.69/10.78 c -----------------------------------------------------------------------------------------------
10.69/10.78 c start solving
10.69/10.79 c
10.79/10.84 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
10.79/10.84 c 8.4s| 1 | 2 | 0 | - | 140M| 0 | - |9456 | 27k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
243.30/243.44 c
243.30/243.44 c SCIP Status : problem is solved [infeasible]
243.30/243.44 c Solving Time (sec) : 239.36
243.30/243.44 c Solving Nodes : 9500
243.30/243.44 c Primal Bound : +1.00000000000000e+20 (0 solutions)
243.30/243.44 c Dual Bound : +1.00000000000000e+20
243.30/243.44 c Gap : 0.00 %
243.30/243.44 s UNSATISFIABLE
243.30/243.44 c SCIP Status : problem is solved [infeasible]
243.30/243.44 c Solving Time : 239.36
243.30/243.44 c Original Problem :
243.30/243.44 c Problem name : HOME/instance-2685052-1278438998.opb
243.30/243.44 c Variables : 28072 (28072 binary, 0 integer, 0 implicit integer, 0 continuous)
243.30/243.44 c Constraints : 97590 initial, 97590 maximal
243.30/243.44 c Presolved Problem :
243.30/243.44 c Problem name : t_HOME/instance-2685052-1278438998.opb
243.30/243.44 c Variables : 9456 (9456 binary, 0 integer, 0 implicit integer, 0 continuous)
243.30/243.44 c Constraints : 27309 initial, 29341 maximal
243.30/243.44 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
243.30/243.44 c trivial : 0.05 625 0 0 0 0 0 0 0
243.30/243.44 c dualfix : 0.08 103 0 0 0 0 0 0 0
243.30/243.44 c boundshift : 0.00 0 0 0 0 0 0 0 0
243.30/243.44 c inttobinary : 0.00 0 0 0 0 0 0 0 0
243.30/243.44 c implics : 0.18 0 0 0 0 0 0 0 0
243.30/243.44 c probing : 0.00 0 0 0 0 0 0 0 0
243.30/243.44 c knapsack : 0.13 0 0 0 0 0 0 12 184
243.30/243.44 c linear : 7.18 14054 3834 0 14679 0 70281 65 44
243.30/243.44 c logicor : 0.21 0 0 0 0 0 0 0 0
243.30/243.44 c root node : - 47 - - 47 - - - -
243.30/243.44 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
243.30/243.44 c integral : 0 0 0 0 0 0 0 0 0 0
243.30/243.44 c knapsack : 388 0 191379 0 6772 467 1023360 0 0 0
243.30/243.44 c logicor : 26921+ 0 185078 0 6772 4048 5211633 0 0 0
243.30/243.44 c countsols : 0 0 0 0 6772 0 0 0 0 0
243.30/243.44 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
243.30/243.44 c integral : 0.00 0.00 0.00 0.00 0.00
243.30/243.44 c knapsack : 12.79 0.00 10.48 0.00 2.31
243.30/243.44 c logicor : 132.15 0.00 45.97 0.00 86.18
243.30/243.44 c countsols : 0.00 0.00 0.00 0.00 0.00
243.30/243.44 c Propagators : Time Calls Cutoffs DomReds
243.30/243.44 c vbounds : 0.14 1 0 0
243.30/243.44 c rootredcost : 0.12 0 0 0
243.30/243.44 c pseudoobj : 0.06 0 0 0
243.30/243.44 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
243.30/243.44 c propagation : 1.68 4515 4514 29769 24.8 480 13.7 -
243.30/243.44 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
243.30/243.44 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
243.30/243.44 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
243.30/243.44 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
243.30/243.44 c applied globally : - - - 12720 21.5 - - -
243.30/243.44 c applied locally : - - - 0 0.0 - - -
243.30/243.44 c Separators : Time Calls Cutoffs DomReds Cuts Conss
243.30/243.44 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
243.30/243.44 c redcost : 0.00 0 0 0 0 0
243.30/243.44 c impliedbounds : 0.00 0 0 0 0 0
243.30/243.44 c intobj : 0.00 0 0 0 0 0
243.30/243.44 c cgmip : 0.00 0 0 0 0 0
243.30/243.44 c gomory : 0.00 0 0 0 0 0
243.30/243.44 c strongcg : 0.00 0 0 0 0 0
243.30/243.44 c cmir : 0.00 0 0 0 0 0
243.30/243.44 c flowcover : 0.00 0 0 0 0 0
243.30/243.44 c clique : 0.00 0 0 0 0 0
243.30/243.44 c zerohalf : 0.00 0 0 0 0 0
243.30/243.44 c mcf : 0.00 0 0 0 0 0
243.30/243.44 c rapidlearning : 0.00 0 0 0 0 0
243.30/243.44 c Pricers : Time Calls Vars
243.30/243.44 c problem variables: 0.00 0 0
243.30/243.44 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
243.30/243.44 c relpscost : 0.00 0 0 0 0 0 0
243.30/243.44 c pscost : 0.00 0 0 0 0 0 0
243.30/243.44 c inference : 25.16 6772 0 0 0 0 13544
243.30/243.44 c mostinf : 0.00 0 0 0 0 0 0
243.30/243.44 c leastinf : 0.00 0 0 0 0 0 0
243.30/243.44 c fullstrong : 0.00 0 0 0 0 0 0
243.30/243.44 c allfullstrong : 0.00 0 0 0 0 0 0
243.30/243.44 c random : 0.00 0 0 0 0 0 0
243.30/243.44 c Primal Heuristics : Time Calls Found
243.30/243.44 c LP solutions : 0.00 - 0
243.30/243.44 c pseudo solutions : 0.00 - 0
243.30/243.44 c trivial : 0.05 1 0
243.30/243.44 c simplerounding : 0.00 0 0
243.30/243.44 c zirounding : 0.00 0 0
243.30/243.44 c rounding : 0.00 0 0
243.30/243.44 c shifting : 0.00 0 0
243.30/243.44 c intshifting : 0.00 0 0
243.30/243.44 c oneopt : 0.00 0 0
243.30/243.44 c twoopt : 0.00 0 0
243.30/243.44 c fixandinfer : 0.00 0 0
243.30/243.44 c feaspump : 0.00 0 0
243.30/243.44 c coefdiving : 0.00 0 0
243.30/243.44 c pscostdiving : 0.00 0 0
243.30/243.44 c fracdiving : 0.00 0 0
243.30/243.44 c veclendiving : 0.00 0 0
243.30/243.44 c intdiving : 0.00 0 0
243.30/243.44 c actconsdiving : 0.00 0 0
243.30/243.44 c objpscostdiving : 0.00 0 0
243.30/243.44 c rootsoldiving : 0.00 0 0
243.30/243.44 c linesearchdiving : 0.00 0 0
243.30/243.44 c guideddiving : 0.00 0 0
243.30/243.44 c octane : 0.00 0 0
243.30/243.44 c rens : 0.00 0 0
243.30/243.44 c rins : 0.00 0 0
243.30/243.44 c localbranching : 0.00 0 0
243.30/243.44 c mutation : 0.00 0 0
243.30/243.44 c crossover : 0.00 0 0
243.30/243.44 c dins : 0.00 0 0
243.30/243.44 c undercover : 0.00 0 0
243.30/243.44 c nlp : 0.00 0 0
243.30/243.44 c trysol : 0.00 0 0
243.30/243.44 c LP : Time Calls Iterations Iter/call Iter/sec
243.30/243.44 c primal LP : 0.00 0 0 0.00 -
243.30/243.44 c dual LP : 0.00 0 0 0.00 -
243.30/243.44 c lex dual LP : 0.00 0 0 0.00 -
243.30/243.44 c barrier LP : 0.00 0 0 0.00 -
243.30/243.44 c diving/probing LP: 0.00 0 0 0.00 -
243.30/243.44 c strong branching : 0.00 0 0 0.00 -
243.30/243.44 c (at root node) : - 0 0 0.00 -
243.30/243.44 c conflict analysis: 0.00 0 0 0.00 -
243.30/243.44 c B&B Tree :
243.30/243.44 c number of runs : 1
243.30/243.44 c nodes : 9500
243.30/243.44 c nodes (total) : 9500
243.30/243.44 c nodes left : 0
243.30/243.44 c max depth : 163
243.30/243.44 c max depth (total): 163
243.30/243.44 c backtracks : 2395 (25.2%)
243.30/243.44 c delayed cutoffs : 4045
243.30/243.44 c repropagations : 10687 (2176113 domain reductions, 1787 cutoffs)
243.30/243.44 c avg switch length: 6.29
243.30/243.44 c switching time : 49.82
243.30/243.44 c Solution :
243.30/243.44 c Solutions found : 0 (0 improvements)
243.30/243.44 c Primal Bound : infeasible
243.30/243.44 c Dual Bound : -
243.30/243.44 c Gap : 0.00 %
243.30/243.44 c Root Dual Bound : +0.00000000000000e+00
243.30/243.44 c Root Iterations : 0
243.60/243.74 c Time complete: 243.65.