0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2684801-1278434381.opb>
1.69/1.71 c original problem has 29040 variables (29040 bin, 0 int, 0 impl, 0 cont) and 96434 constraints
1.69/1.71 c problem read
1.69/1.71 c No objective function, only one solution is needed.
1.69/1.72 c presolving settings loaded
2.20/2.24 c presolving:
6.59/6.69 c (round 1) 6687 del vars, 19660 del conss, 4985 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5359024 impls, 0 clqs
8.99/9.00 c (round 2) 14159 del vars, 48261 del conss, 11986 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5402729 impls, 0 clqs
9.28/9.34 c (round 3) 16664 del vars, 60179 del conss, 13462 chg bounds, 16 chg sides, 25 chg coeffs, 0 upgd conss, 5416545 impls, 0 clqs
9.49/9.52 c (round 4) 17592 del vars, 63891 del conss, 14105 chg bounds, 40 chg sides, 60 chg coeffs, 0 upgd conss, 5426135 impls, 0 clqs
9.58/9.65 c (round 5) 18275 del vars, 66177 del conss, 14529 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5434363 impls, 0 clqs
9.68/9.74 c (round 6) 18664 del vars, 67612 del conss, 14750 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5438491 impls, 0 clqs
9.79/9.82 c (round 7) 18912 del vars, 68445 del conss, 14901 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5441206 impls, 0 clqs
9.79/9.88 c (round 8) 19066 del vars, 69049 del conss, 14975 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5443218 impls, 0 clqs
9.89/9.94 c (round 9) 19184 del vars, 69434 del conss, 15033 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5445104 impls, 0 clqs
9.89/9.99 c (round 10) 19266 del vars, 69712 del conss, 15078 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5446164 impls, 0 clqs
9.99/10.04 c (round 11) 19309 del vars, 69889 del conss, 15101 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5446546 impls, 0 clqs
9.99/10.08 c (round 12) 19341 del vars, 70026 del conss, 15110 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5447066 impls, 0 clqs
10.08/10.12 c (round 13) 19346 del vars, 70056 del conss, 15111 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5447170 impls, 0 clqs
10.38/10.42 c (round 14) 19346 del vars, 70058 del conss, 15111 chg bounds, 42 chg sides, 67 chg coeffs, 26376 upgd conss, 5447170 impls, 0 clqs
10.89/10.90 c (round 15) 19346 del vars, 70058 del conss, 15111 chg bounds, 105 chg sides, 251 chg coeffs, 26376 upgd conss, 5447170 impls, 0 clqs
10.89/11.00 c (round 16) 19346 del vars, 70058 del conss, 15111 chg bounds, 109 chg sides, 323 chg coeffs, 26376 upgd conss, 5447170 impls, 2 clqs
11.00/11.09 c presolving (17 rounds):
11.00/11.09 c 19346 deleted vars, 70058 deleted constraints, 15111 tightened bounds, 0 added holes, 109 changed sides, 346 changed coefficients
11.00/11.09 c 5447170 implications, 4 cliques
11.00/11.09 c presolved problem has 9694 variables (9694 bin, 0 int, 0 impl, 0 cont) and 26376 constraints
11.00/11.09 c 444 constraints of type <knapsack>
11.00/11.09 c 25932 constraints of type <logicor>
11.00/11.09 c transformed objective value is always integral (scale: 1)
11.00/11.09 c Presolving Time: 8.46
11.00/11.09 c - non default parameters ----------------------------------------------------------------------
11.00/11.09 c # SCIP version 1.2.1.2
11.00/11.09 c
11.00/11.09 c # frequency for displaying node information lines
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 100]
11.00/11.09 c display/freq = 10000
11.00/11.09 c
11.00/11.09 c # maximal time in seconds to run
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.00/11.09 c limits/time = 1798.29
11.00/11.09 c
11.00/11.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.00/11.09 c limits/memory = 1620
11.00/11.09 c
11.00/11.09 c # solving stops, if the given number of solutions were found (-1: no limit)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: -1]
11.00/11.09 c limits/solutions = 1
11.00/11.09 c
11.00/11.09 c # maximal number of separation rounds per node (-1: unlimited)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 5]
11.00/11.09 c separating/maxrounds = 1
11.00/11.09 c
11.00/11.09 c # maximal number of separation rounds in the root node (-1: unlimited)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: -1]
11.00/11.09 c separating/maxroundsroot = 5
11.00/11.09 c
11.00/11.09 c # should presolving try to simplify inequalities
11.00/11.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.00/11.09 c constraints/linear/simplifyinequalities = TRUE
11.00/11.09 c
11.00/11.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
11.00/11.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
11.00/11.09 c constraints/knapsack/disaggregation = FALSE
11.00/11.09 c
11.00/11.09 c # should presolving try to simplify knapsacks
11.00/11.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.00/11.09 c constraints/knapsack/simplifyinequalities = TRUE
11.00/11.09 c
11.00/11.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: -1]
11.00/11.09 c presolving/probing/maxrounds = 0
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/coefdiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/coefdiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/coefdiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 30]
11.00/11.09 c heuristics/crossover/freq = -1
11.00/11.09 c
11.00/11.09 c # number of nodes added to the contingent of the total nodes
11.00/11.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.00/11.09 c heuristics/crossover/nodesofs = 750
11.00/11.09 c
11.00/11.09 c # number of nodes without incumbent change that heuristic should wait
11.00/11.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
11.00/11.09 c heuristics/crossover/nwaitingnodes = 100
11.00/11.09 c
11.00/11.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
11.00/11.09 c # [type: real, range: [0,1], default: 0.1]
11.00/11.09 c heuristics/crossover/nodesquot = 0.15
11.00/11.09 c
11.00/11.09 c # minimum percentage of integer variables that have to be fixed
11.00/11.09 c # [type: real, range: [0,1], default: 0.666]
11.00/11.09 c heuristics/crossover/minfixingrate = 0.5
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 20]
11.00/11.09 c heuristics/feaspump/freq = -1
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/feaspump/maxlpiterofs = 2000
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/fracdiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/fracdiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/fracdiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/guideddiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/guideddiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/guideddiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/intdiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/intshifting/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/linesearchdiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/nlp/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 20]
11.00/11.09 c heuristics/objpscostdiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to total iteration number
11.00/11.09 c # [type: real, range: [0,1], default: 0.01]
11.00/11.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/oneopt/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/pscostdiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/pscostdiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 0]
11.00/11.09 c heuristics/rens/freq = -1
11.00/11.09 c
11.00/11.09 c # minimum percentage of integer variables that have to be fixable
11.00/11.09 c # [type: real, range: [0,1], default: 0.5]
11.00/11.09 c heuristics/rens/minfixingrate = 0.3
11.00/11.09 c
11.00/11.09 c # number of nodes added to the contingent of the total nodes
11.00/11.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.00/11.09 c heuristics/rens/nodesofs = 2000
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 20]
11.00/11.09 c heuristics/rootsoldiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
11.00/11.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/rounding/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/shifting/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/simplerounding/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 0]
11.00/11.09 c heuristics/trivial/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/trysol/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 10]
11.00/11.09 c heuristics/veclendiving/freq = -1
11.00/11.09 c
11.00/11.09 c # maximal fraction of diving LP iterations compared to node LP iterations
11.00/11.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.00/11.09 c heuristics/veclendiving/maxlpiterquot = 0.075
11.00/11.09 c
11.00/11.09 c # additional number of allowed LP iterations
11.00/11.09 c # [type: int, range: [0,2147483647], default: 1000]
11.00/11.09 c heuristics/veclendiving/maxlpiterofs = 1500
11.00/11.09 c
11.00/11.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 1]
11.00/11.09 c heuristics/zirounding/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 0]
11.00/11.09 c separating/cmir/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: 0]
11.00/11.09 c separating/flowcover/freq = -1
11.00/11.09 c
11.00/11.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
11.00/11.09 c # [type: int, range: [-1,2147483647], default: -1]
11.00/11.09 c separating/rapidlearning/freq = 0
11.00/11.09 c
11.00/11.09 c -----------------------------------------------------------------------------------------------
11.00/11.09 c start solving
11.08/11.10 c
311.47/311.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
311.47/311.61 c 308s| 1 | 0 | 39021 | - | 160M| 0 | - |9694 | 26k|9694 | 26k| 0 | 0 | 0 | -- | -- | 0.00%
311.47/311.61 c 308s| 1 | 0 | 39021 | - | 160M| 0 | - |9694 | 26k|9694 | 26k| 0 | 0 | 0 | -- | -- | 0.00%
311.47/311.61 c
311.47/311.61 c SCIP Status : problem is solved [infeasible]
311.47/311.61 c Solving Time (sec) : 307.64
311.47/311.61 c Solving Nodes : 1
311.47/311.61 c Primal Bound : +1.00000000000000e+20 (0 solutions)
311.47/311.61 c Dual Bound : +1.00000000000000e+20
311.47/311.61 c Gap : 0.00 %
311.47/311.61 s UNSATISFIABLE
311.47/311.61 c SCIP Status : problem is solved [infeasible]
311.47/311.61 c Solving Time : 307.64
311.47/311.61 c Original Problem :
311.47/311.61 c Problem name : HOME/instance-2684801-1278434381.opb
311.47/311.61 c Variables : 29040 (29040 binary, 0 integer, 0 implicit integer, 0 continuous)
311.47/311.61 c Constraints : 96434 initial, 96434 maximal
311.47/311.61 c Presolved Problem :
311.47/311.61 c Problem name : t_HOME/instance-2684801-1278434381.opb
311.47/311.61 c Variables : 9694 (9694 binary, 0 integer, 0 implicit integer, 0 continuous)
311.47/311.61 c Constraints : 26376 initial, 26376 maximal
311.47/311.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
311.47/311.61 c trivial : 0.07 864 0 0 0 0 0 0 0
311.47/311.61 c dualfix : 0.02 111 0 0 0 0 0 0 0
311.47/311.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
311.47/311.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
311.47/311.61 c implics : 0.20 0 0 0 0 0 0 0 0
311.47/311.61 c probing : 0.00 0 0 0 0 0 0 0 0
311.47/311.61 c knapsack : 0.41 0 0 0 0 0 0 67 279
311.47/311.61 c linear : 7.28 14253 4118 0 15111 0 70058 42 67
311.47/311.61 c logicor : 0.17 0 0 0 0 0 0 0 0
311.47/311.61 c root node : - 0 - - 0 - - - -
311.47/311.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
311.47/311.61 c integral : 0 0 0 0 0 0 0 0 0 0
311.47/311.61 c knapsack : 444 0 1 0 0 0 0 0 0 0
311.47/311.61 c logicor : 25932 0 1 0 0 0 0 0 0 0
311.47/311.61 c countsols : 0 0 0 0 0 0 0 0 0 0
311.47/311.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
311.47/311.61 c integral : 0.00 0.00 0.00 0.00 0.00
311.47/311.61 c knapsack : 0.00 0.00 0.00 0.00 0.00
311.47/311.61 c logicor : 0.03 0.00 0.03 0.00 0.00
311.47/311.61 c countsols : 0.00 0.00 0.00 0.00 0.00
311.47/311.61 c Propagators : Time Calls Cutoffs DomReds
311.47/311.61 c vbounds : 0.00 1 0 0
311.47/311.61 c rootredcost : 0.00 0 0 0
311.47/311.61 c pseudoobj : 0.00 0 0 0
311.47/311.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
311.47/311.61 c propagation : 0.00 0 0 0 0.0 0 0.0 -
311.47/311.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
311.47/311.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
311.47/311.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
311.47/311.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
311.47/311.61 c applied globally : - - - 0 0.0 - - -
311.47/311.61 c applied locally : - - - 0 0.0 - - -
311.47/311.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
311.47/311.61 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
311.47/311.61 c redcost : 0.00 0 0 0 0 0
311.47/311.61 c impliedbounds : 0.00 0 0 0 0 0
311.47/311.61 c intobj : 0.00 0 0 0 0 0
311.47/311.61 c cgmip : 0.00 0 0 0 0 0
311.47/311.61 c gomory : 0.00 0 0 0 0 0
311.47/311.61 c strongcg : 0.00 0 0 0 0 0
311.47/311.61 c cmir : 0.00 0 0 0 0 0
311.47/311.61 c flowcover : 0.00 0 0 0 0 0
311.47/311.61 c clique : 0.00 0 0 0 0 0
311.47/311.61 c zerohalf : 0.00 0 0 0 0 0
311.47/311.61 c mcf : 0.00 0 0 0 0 0
311.47/311.61 c rapidlearning : 0.00 0 0 0 0 0
311.47/311.61 c Pricers : Time Calls Vars
311.47/311.61 c problem variables: 0.00 0 0
311.47/311.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
311.47/311.61 c pscost : 0.00 0 0 0 0 0 0
311.47/311.61 c inference : 0.00 0 0 0 0 0 0
311.47/311.61 c mostinf : 0.00 0 0 0 0 0 0
311.47/311.61 c leastinf : 0.00 0 0 0 0 0 0
311.47/311.61 c fullstrong : 0.00 0 0 0 0 0 0
311.47/311.61 c allfullstrong : 0.00 0 0 0 0 0 0
311.47/311.61 c random : 0.00 0 0 0 0 0 0
311.47/311.61 c relpscost : 0.00 0 0 0 0 0 0
311.47/311.61 c Primal Heuristics : Time Calls Found
311.47/311.61 c LP solutions : 0.00 - 0
311.47/311.61 c pseudo solutions : 0.00 - 0
311.47/311.61 c trivial : 0.05 1 0
311.47/311.61 c simplerounding : 0.00 0 0
311.47/311.61 c zirounding : 0.00 0 0
311.47/311.61 c rounding : 0.00 0 0
311.47/311.61 c shifting : 0.00 0 0
311.47/311.61 c intshifting : 0.00 0 0
311.47/311.61 c oneopt : 0.00 0 0
311.47/311.61 c twoopt : 0.00 0 0
311.47/311.61 c fixandinfer : 0.00 0 0
311.47/311.61 c feaspump : 0.00 0 0
311.47/311.61 c coefdiving : 0.00 0 0
311.47/311.61 c pscostdiving : 0.00 0 0
311.47/311.61 c fracdiving : 0.00 0 0
311.47/311.61 c veclendiving : 0.00 0 0
311.47/311.61 c intdiving : 0.00 0 0
311.47/311.61 c actconsdiving : 0.00 0 0
311.47/311.61 c objpscostdiving : 0.00 0 0
311.47/311.61 c rootsoldiving : 0.00 0 0
311.47/311.61 c linesearchdiving : 0.00 0 0
311.47/311.61 c guideddiving : 0.00 0 0
311.47/311.61 c octane : 0.00 0 0
311.47/311.61 c rens : 0.00 0 0
311.47/311.61 c rins : 0.00 0 0
311.47/311.61 c localbranching : 0.00 0 0
311.47/311.61 c mutation : 0.00 0 0
311.47/311.61 c crossover : 0.00 0 0
311.47/311.61 c dins : 0.00 0 0
311.47/311.61 c undercover : 0.00 0 0
311.47/311.61 c nlp : 0.00 0 0
311.47/311.61 c trysol : 0.00 0 0
311.47/311.61 c LP : Time Calls Iterations Iter/call Iter/sec
311.47/311.61 c primal LP : 0.00 0 0 0.00 -
311.47/311.61 c dual LP : 298.71 1 39021 39021.00 130.63
311.47/311.61 c lex dual LP : 0.00 0 0 0.00 -
311.47/311.61 c barrier LP : 0.00 0 0 0.00 -
311.47/311.61 c diving/probing LP: 0.00 0 0 0.00 -
311.47/311.61 c strong branching : 0.00 0 0 0.00 -
311.47/311.61 c (at root node) : - 0 0 0.00 -
311.47/311.61 c conflict analysis: 0.00 0 0 0.00 -
311.47/311.61 c B&B Tree :
311.47/311.61 c number of runs : 1
311.47/311.61 c nodes : 1
311.47/311.61 c nodes (total) : 1
311.47/311.61 c nodes left : 0
311.47/311.61 c max depth : 0
311.47/311.61 c max depth (total): 0
311.47/311.61 c backtracks : 0 (0.0%)
311.47/311.61 c delayed cutoffs : 0
311.47/311.61 c repropagations : 0 (0 domain reductions, 0 cutoffs)
311.47/311.61 c avg switch length: 2.00
311.47/311.61 c switching time : 0.00
311.47/311.61 c Solution :
311.47/311.61 c Solutions found : 0 (0 improvements)
311.47/311.61 c Primal Bound : infeasible
311.47/311.61 c Dual Bound : -
311.47/311.61 c Gap : 0.00 %
311.47/311.61 c Root Dual Bound : -
311.47/311.61 c Root Iterations : 39021
311.77/311.96 c Time complete: 311.84.