0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2684648-1278432570.opb>
0.29/0.30 c original problem has 4836 variables (4836 bin, 0 int, 0 impl, 0 cont) and 16649 constraints
0.29/0.30 c problem read
0.29/0.30 c No objective function, only one solution is needed.
0.29/0.30 c presolving settings loaded
0.29/0.39 c presolving:
0.99/1.07 c (round 1) 1166 del vars, 2991 del conss, 841 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 866384 impls, 0 clqs
1.29/1.37 c (round 2) 2220 del vars, 7511 del conss, 1773 chg bounds, 3 chg sides, 2 chg coeffs, 0 upgd conss, 874159 impls, 0 clqs
1.40/1.43 c (round 3) 2641 del vars, 9394 del conss, 2026 chg bounds, 45 chg sides, 57 chg coeffs, 0 upgd conss, 879164 impls, 7 clqs
1.40/1.45 c (round 4) 2778 del vars, 10051 del conss, 2109 chg bounds, 55 chg sides, 65 chg coeffs, 0 upgd conss, 880635 impls, 6 clqs
1.40/1.47 c (round 5) 2842 del vars, 10304 del conss, 2146 chg bounds, 55 chg sides, 65 chg coeffs, 0 upgd conss, 881145 impls, 5 clqs
1.40/1.49 c (round 6) 2858 del vars, 10420 del conss, 2150 chg bounds, 55 chg sides, 65 chg coeffs, 0 upgd conss, 881345 impls, 4 clqs
1.40/1.49 c (round 7) 2859 del vars, 10429 del conss, 2150 chg bounds, 55 chg sides, 65 chg coeffs, 0 upgd conss, 881353 impls, 4 clqs
1.50/1.50 c (round 8) 2859 del vars, 10430 del conss, 2150 chg bounds, 55 chg sides, 65 chg coeffs, 0 upgd conss, 881353 impls, 4 clqs
1.50/1.60 c (round 9) 2859 del vars, 10430 del conss, 2150 chg bounds, 55 chg sides, 65 chg coeffs, 6219 upgd conss, 881353 impls, 4 clqs
1.59/1.67 c (round 10) 2859 del vars, 10430 del conss, 2150 chg bounds, 65 chg sides, 268 chg coeffs, 6219 upgd conss, 881675 impls, 328 clqs
1.70/1.73 c (round 11) 2859 del vars, 10430 del conss, 2150 chg bounds, 77 chg sides, 490 chg coeffs, 6219 upgd conss, 881687 impls, 385 clqs
1.70/1.78 c (round 12) 2859 del vars, 10430 del conss, 2150 chg bounds, 78 chg sides, 625 chg coeffs, 6219 upgd conss, 881885 impls, 436 clqs
1.80/1.84 c (round 13) 2859 del vars, 10430 del conss, 2150 chg bounds, 78 chg sides, 711 chg coeffs, 6219 upgd conss, 881893 impls, 453 clqs
1.80/1.88 c (round 14) 2859 del vars, 10430 del conss, 2150 chg bounds, 78 chg sides, 751 chg coeffs, 6219 upgd conss, 882133 impls, 469 clqs
1.89/1.93 c (round 15) 2859 del vars, 10430 del conss, 2150 chg bounds, 78 chg sides, 772 chg coeffs, 6219 upgd conss, 882145 impls, 469 clqs
1.89/1.96 c presolving (16 rounds):
1.89/1.96 c 2859 deleted vars, 10430 deleted constraints, 2150 tightened bounds, 0 added holes, 78 changed sides, 781 changed coefficients
1.89/1.96 c 882145 implications, 478 cliques
1.89/1.96 c presolved problem has 1977 variables (1977 bin, 0 int, 0 impl, 0 cont) and 6219 constraints
1.89/1.96 c 244 constraints of type <knapsack>
1.89/1.96 c 4 constraints of type <setppc>
1.89/1.96 c 5971 constraints of type <logicor>
1.89/1.96 c transformed objective value is always integral (scale: 1)
1.89/1.96 c Presolving Time: 1.47
1.89/1.96 c - non default parameters ----------------------------------------------------------------------
1.89/1.96 c # SCIP version 1.2.1.2
1.89/1.96 c
1.89/1.96 c # frequency for displaying node information lines
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 100]
1.89/1.96 c display/freq = 10000
1.89/1.96 c
1.89/1.96 c # maximal time in seconds to run
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.96 c limits/time = 1799.7
1.89/1.96 c
1.89/1.96 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.96 c limits/memory = 1620
1.89/1.96 c
1.89/1.96 c # solving stops, if the given number of solutions were found (-1: no limit)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.96 c limits/solutions = 1
1.89/1.96 c
1.89/1.96 c # maximal number of separation rounds per node (-1: unlimited)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 5]
1.89/1.96 c separating/maxrounds = 1
1.89/1.96 c
1.89/1.96 c # maximal number of separation rounds in the root node (-1: unlimited)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.96 c separating/maxroundsroot = 5
1.89/1.96 c
1.89/1.96 c # should presolving try to simplify inequalities
1.89/1.96 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.96 c constraints/linear/simplifyinequalities = TRUE
1.89/1.96 c
1.89/1.96 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.89/1.96 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.89/1.96 c constraints/knapsack/disaggregation = FALSE
1.89/1.96 c
1.89/1.96 c # should presolving try to simplify knapsacks
1.89/1.96 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.96 c constraints/knapsack/simplifyinequalities = TRUE
1.89/1.96 c
1.89/1.96 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.96 c presolving/probing/maxrounds = 0
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/coefdiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/coefdiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/coefdiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 30]
1.89/1.96 c heuristics/crossover/freq = -1
1.89/1.96 c
1.89/1.96 c # number of nodes added to the contingent of the total nodes
1.89/1.96 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.96 c heuristics/crossover/nodesofs = 750
1.89/1.96 c
1.89/1.96 c # number of nodes without incumbent change that heuristic should wait
1.89/1.96 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.89/1.96 c heuristics/crossover/nwaitingnodes = 100
1.89/1.96 c
1.89/1.96 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.89/1.96 c # [type: real, range: [0,1], default: 0.1]
1.89/1.96 c heuristics/crossover/nodesquot = 0.15
1.89/1.96 c
1.89/1.96 c # minimum percentage of integer variables that have to be fixed
1.89/1.96 c # [type: real, range: [0,1], default: 0.666]
1.89/1.96 c heuristics/crossover/minfixingrate = 0.5
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.96 c heuristics/feaspump/freq = -1
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/feaspump/maxlpiterofs = 2000
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/fracdiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/fracdiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/fracdiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/guideddiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/guideddiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/guideddiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/intdiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/intshifting/freq = -1
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/linesearchdiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.96 c heuristics/nlp/freq = -1
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.96 c heuristics/objpscostdiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to total iteration number
1.89/1.96 c # [type: real, range: [0,1], default: 0.01]
1.89/1.96 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.96 c heuristics/oneopt/freq = -1
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.96 c heuristics/pscostdiving/freq = -1
1.89/1.96 c
1.89/1.96 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.96 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.89/1.96 c
1.89/1.96 c # additional number of allowed LP iterations
1.89/1.96 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.96 c heuristics/pscostdiving/maxlpiterofs = 1500
1.89/1.96 c
1.89/1.96 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.89/1.96 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.96 c heuristics/rens/freq = -1
1.89/1.96 c
1.89/1.96 c # minimum percentage of integer variables that have to be fixable
1.89/1.96 c # [type: real, range: [0,1], default: 0.5]
1.89/1.97 c heuristics/rens/minfixingrate = 0.3
1.89/1.97 c
1.89/1.97 c # number of nodes added to the contingent of the total nodes
1.89/1.97 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.97 c heuristics/rens/nodesofs = 2000
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.97 c heuristics/rootsoldiving/freq = -1
1.89/1.97 c
1.89/1.97 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.89/1.97 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.89/1.97 c
1.89/1.97 c # additional number of allowed LP iterations
1.89/1.97 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.97 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.97 c heuristics/rounding/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.97 c heuristics/shifting/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.97 c heuristics/simplerounding/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.97 c heuristics/trivial/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.97 c heuristics/trysol/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.97 c heuristics/veclendiving/freq = -1
1.89/1.97 c
1.89/1.97 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.97 c heuristics/veclendiving/maxlpiterquot = 0.075
1.89/1.97 c
1.89/1.97 c # additional number of allowed LP iterations
1.89/1.97 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.97 c heuristics/veclendiving/maxlpiterofs = 1500
1.89/1.97 c
1.89/1.97 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.97 c heuristics/zirounding/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.97 c separating/cmir/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.97 c separating/flowcover/freq = -1
1.89/1.97 c
1.89/1.97 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.89/1.97 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.97 c separating/rapidlearning/freq = 0
1.89/1.97 c
1.89/1.97 c -----------------------------------------------------------------------------------------------
1.89/1.97 c start solving
1.89/1.97 c
4.29/4.39 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.29/4.39 c 3.9s| 1 | 0 | 2949 | - | 29M| 0 |1345 |1977 |6219 |1977 |6219 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
13.49/13.58 c 12.8s| 1 | 0 | 3036 | - | 24M| 0 | - |1977 |6219 |1977 |6219 | 0 | 0 | 0 | -- | -- | 0.00%
13.49/13.58 c 12.8s| 1 | 0 | 3036 | - | 24M| 0 | - |1977 |6219 |1977 |6219 | 0 | 0 | 0 | -- | -- | 0.00%
13.49/13.58 c
13.49/13.58 c SCIP Status : problem is solved [infeasible]
13.49/13.58 c Solving Time (sec) : 12.85
13.49/13.58 c Solving Nodes : 1
13.49/13.58 c Primal Bound : +1.00000000000000e+20 (0 solutions)
13.49/13.58 c Dual Bound : +1.00000000000000e+20
13.49/13.58 c Gap : 0.00 %
13.49/13.58 s UNSATISFIABLE
13.49/13.58 c SCIP Status : problem is solved [infeasible]
13.49/13.58 c Solving Time : 12.85
13.49/13.58 c Original Problem :
13.49/13.58 c Problem name : HOME/instance-2684648-1278432570.opb
13.49/13.58 c Variables : 4836 (4836 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.58 c Constraints : 16649 initial, 16649 maximal
13.49/13.58 c Presolved Problem :
13.49/13.58 c Problem name : t_HOME/instance-2684648-1278432570.opb
13.49/13.58 c Variables : 1977 (1977 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.58 c Constraints : 6219 initial, 6219 maximal
13.49/13.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
13.49/13.58 c trivial : 0.01 97 0 0 0 0 0 0 0
13.49/13.58 c dualfix : 0.01 27 0 0 0 0 0 0 0
13.49/13.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
13.49/13.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
13.49/13.58 c implics : 0.02 0 0 0 0 0 0 0 0
13.49/13.58 c probing : 0.00 0 0 0 0 0 0 0 0
13.49/13.58 c knapsack : 0.20 0 0 0 0 0 0 23 716
13.49/13.58 c setppc : 0.00 0 0 0 0 0 0 0 0
13.49/13.58 c linear : 1.03 2053 682 0 2150 0 10430 55 65
13.49/13.58 c logicor : 0.14 0 0 0 0 0 0 0 0
13.49/13.58 c root node : - 971 - - 971 - - - -
13.49/13.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
13.49/13.58 c integral : 0 0 0 0 0 0 0 0 0 0
13.49/13.58 c knapsack : 244 1 1 0 0 0 0 123 0 0
13.49/13.58 c setppc : 4 1 1 0 0 0 0 0 0 0
13.49/13.58 c logicor : 5971 1 1 0 0 0 0 0 0 0
13.49/13.58 c countsols : 0 0 0 0 0 0 0 0 0 0
13.49/13.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
13.49/13.58 c integral : 0.00 0.00 0.00 0.00 0.00
13.49/13.58 c knapsack : 0.01 0.01 0.00 0.00 0.00
13.49/13.58 c setppc : 0.00 0.00 0.00 0.00 0.00
13.49/13.58 c logicor : 0.00 0.00 0.00 0.00 0.00
13.49/13.58 c countsols : 0.00 0.00 0.00 0.00 0.00
13.49/13.58 c Propagators : Time Calls Cutoffs DomReds
13.49/13.58 c vbounds : 0.00 1 0 0
13.49/13.58 c rootredcost : 0.00 0 0 0
13.49/13.58 c pseudoobj : 0.00 0 0 0
13.49/13.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.49/13.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
13.49/13.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.49/13.58 c applied globally : - - - 0 0.0 - - -
13.49/13.58 c applied locally : - - - 0 0.0 - - -
13.49/13.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.49/13.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 9)
13.49/13.58 c redcost : 0.00 1 0 0 0 0
13.49/13.58 c impliedbounds : 0.00 1 0 0 0 0
13.49/13.58 c intobj : 0.00 0 0 0 0 0
13.49/13.58 c cgmip : 0.00 0 0 0 0 0
13.49/13.58 c gomory : 3.09 1 0 0 0 0
13.49/13.58 c strongcg : 2.70 1 0 0 182 0
13.49/13.58 c cmir : 0.00 0 0 0 0 0
13.49/13.58 c flowcover : 0.00 0 0 0 0 0
13.49/13.58 c clique : 0.19 1 0 0 7 0
13.49/13.58 c zerohalf : 0.00 0 0 0 0 0
13.49/13.58 c mcf : 0.02 1 0 0 0 0
13.49/13.58 c rapidlearning : 2.77 1 0 971 0 0
13.49/13.58 c Pricers : Time Calls Vars
13.49/13.58 c problem variables: 0.00 0 0
13.49/13.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.49/13.58 c pscost : 0.00 0 0 0 0 0 0
13.49/13.58 c inference : 0.00 0 0 0 0 0 0
13.49/13.58 c mostinf : 0.00 0 0 0 0 0 0
13.49/13.58 c leastinf : 0.00 0 0 0 0 0 0
13.49/13.58 c fullstrong : 0.00 0 0 0 0 0 0
13.49/13.58 c allfullstrong : 0.00 0 0 0 0 0 0
13.49/13.58 c random : 0.00 0 0 0 0 0 0
13.49/13.58 c relpscost : 0.00 0 0 0 0 0 0
13.49/13.58 c Primal Heuristics : Time Calls Found
13.49/13.58 c LP solutions : 0.00 - 0
13.49/13.58 c pseudo solutions : 0.00 - 0
13.49/13.58 c trivial : 0.00 1 0
13.49/13.58 c simplerounding : 0.00 0 0
13.49/13.58 c zirounding : 0.00 0 0
13.49/13.58 c rounding : 0.00 0 0
13.49/13.58 c shifting : 0.00 0 0
13.49/13.58 c intshifting : 0.00 0 0
13.49/13.58 c oneopt : 0.00 0 0
13.49/13.58 c twoopt : 0.00 0 0
13.49/13.58 c fixandinfer : 0.00 0 0
13.49/13.58 c feaspump : 0.00 0 0
13.49/13.58 c coefdiving : 0.00 0 0
13.49/13.58 c pscostdiving : 0.00 0 0
13.49/13.58 c fracdiving : 0.00 0 0
13.49/13.58 c veclendiving : 0.00 0 0
13.49/13.58 c intdiving : 0.00 0 0
13.49/13.58 c actconsdiving : 0.00 0 0
13.49/13.58 c objpscostdiving : 0.00 0 0
13.49/13.58 c rootsoldiving : 0.00 0 0
13.49/13.58 c linesearchdiving : 0.00 0 0
13.49/13.58 c guideddiving : 0.00 0 0
13.49/13.58 c octane : 0.00 0 0
13.49/13.58 c rens : 0.00 0 0
13.49/13.58 c rins : 0.00 0 0
13.49/13.58 c localbranching : 0.00 0 0
13.49/13.58 c mutation : 0.00 0 0
13.49/13.58 c crossover : 0.00 0 0
13.49/13.58 c dins : 0.00 0 0
13.49/13.58 c undercover : 0.00 0 0
13.49/13.58 c nlp : 0.00 0 0
13.49/13.58 c trysol : 0.00 0 0
13.49/13.58 c LP : Time Calls Iterations Iter/call Iter/sec
13.49/13.58 c primal LP : 0.00 0 0 0.00 -
13.49/13.58 c dual LP : 2.52 2 3036 1518.00 1204.76
13.49/13.58 c lex dual LP : 0.00 0 0 0.00 -
13.49/13.58 c barrier LP : 0.00 0 0 0.00 -
13.49/13.58 c diving/probing LP: 0.00 0 0 0.00 -
13.49/13.58 c strong branching : 0.00 0 0 0.00 -
13.49/13.58 c (at root node) : - 0 0 0.00 -
13.49/13.58 c conflict analysis: 0.00 0 0 0.00 -
13.49/13.58 c B&B Tree :
13.49/13.58 c number of runs : 1
13.49/13.58 c nodes : 1
13.49/13.58 c nodes (total) : 1
13.49/13.58 c nodes left : 0
13.49/13.58 c max depth : 0
13.49/13.58 c max depth (total): 0
13.49/13.58 c backtracks : 0 (0.0%)
13.49/13.58 c delayed cutoffs : 0
13.49/13.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
13.49/13.58 c avg switch length: 2.00
13.49/13.58 c switching time : 0.00
13.49/13.58 c Solution :
13.49/13.58 c Solutions found : 0 (0 improvements)
13.49/13.58 c Primal Bound : infeasible
13.49/13.58 c Dual Bound : -
13.49/13.58 c Gap : 0.00 %
13.49/13.58 c Root Dual Bound : -
13.49/13.58 c Root Iterations : 3036
13.59/13.64 c Time complete: 13.63.