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-2684969-1278437203.opb>
1.49/1.56 c original problem has 27588 variables (27588 bin, 0 int, 0 impl, 0 cont) and 91561 constraints
1.49/1.56 c problem read
1.49/1.57 c No objective function, only one solution is needed.
1.49/1.57 c presolving settings loaded
1.99/2.02 c presolving:
6.09/6.17 c (round 1) 6141 del vars, 17746 del conss, 4615 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5219916 impls, 0 clqs
7.99/8.04 c (round 2) 13070 del vars, 45342 del conss, 11138 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5257338 impls, 0 clqs
8.29/8.31 c (round 3) 15543 del vars, 56491 del conss, 12547 chg bounds, 63 chg sides, 57 chg coeffs, 0 upgd conss, 5277181 impls, 0 clqs
8.38/8.46 c (round 4) 16597 del vars, 60278 del conss, 13317 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5285769 impls, 0 clqs
8.48/8.59 c (round 5) 17662 del vars, 63443 del conss, 14012 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5299079 impls, 0 clqs
8.69/8.70 c (round 6) 18568 del vars, 66373 del conss, 14601 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5310271 impls, 0 clqs
8.69/8.78 c (round 7) 19170 del vars, 68460 del conss, 15007 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5316042 impls, 0 clqs
8.79/8.84 c (round 8) 19504 del vars, 69656 del conss, 15212 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5319678 impls, 0 clqs
8.79/8.89 c (round 9) 19718 del vars, 70430 del conss, 15333 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5322374 impls, 0 clqs
8.89/8.93 c (round 10) 19827 del vars, 70885 del conss, 15393 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5323568 impls, 0 clqs
8.89/8.96 c (round 11) 19911 del vars, 71201 del conss, 15451 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5324245 impls, 0 clqs
8.89/8.99 c (round 12) 19933 del vars, 71313 del conss, 15451 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5324685 impls, 0 clqs
8.99/9.02 c (round 13) 19933 del vars, 71332 del conss, 15451 chg bounds, 85 chg sides, 81 chg coeffs, 0 upgd conss, 5324685 impls, 0 clqs
9.18/9.28 c (round 14) 19933 del vars, 71332 del conss, 15451 chg bounds, 85 chg sides, 81 chg coeffs, 20229 upgd conss, 5324685 impls, 0 clqs
9.39/9.45 c (round 15) 19933 del vars, 71332 del conss, 15451 chg bounds, 96 chg sides, 138 chg coeffs, 20229 upgd conss, 5325493 impls, 338 clqs
9.49/9.57 c presolving (16 rounds):
9.49/9.57 c 19933 deleted vars, 71332 deleted constraints, 15451 tightened bounds, 0 added holes, 96 changed sides, 139 changed coefficients
9.49/9.57 c 5325493 implications, 341 cliques
9.49/9.57 c presolved problem has 7655 variables (7655 bin, 0 int, 0 impl, 0 cont) and 20229 constraints
9.49/9.57 c 393 constraints of type <knapsack>
9.49/9.57 c 19836 constraints of type <logicor>
9.49/9.57 c transformed objective value is always integral (scale: 1)
9.49/9.57 c Presolving Time: 7.23
9.49/9.57 c - non default parameters ----------------------------------------------------------------------
9.49/9.57 c # SCIP version 1.2.1.2
9.49/9.57 c
9.49/9.57 c # frequency for displaying node information lines
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 100]
9.49/9.57 c display/freq = 10000
9.49/9.57 c
9.49/9.57 c # maximal time in seconds to run
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
9.49/9.57 c limits/time = 1798.44
9.49/9.57 c
9.49/9.57 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
9.49/9.57 c limits/memory = 1620
9.49/9.57 c
9.49/9.57 c # solving stops, if the given number of solutions were found (-1: no limit)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: -1]
9.49/9.57 c limits/solutions = 1
9.49/9.57 c
9.49/9.57 c # maximal number of separation rounds per node (-1: unlimited)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 5]
9.49/9.57 c separating/maxrounds = 1
9.49/9.57 c
9.49/9.57 c # maximal number of separation rounds in the root node (-1: unlimited)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: -1]
9.49/9.57 c separating/maxroundsroot = 5
9.49/9.57 c
9.49/9.57 c # should presolving try to simplify inequalities
9.49/9.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
9.49/9.57 c constraints/linear/simplifyinequalities = TRUE
9.49/9.57 c
9.49/9.57 c # should disaggregation of knapsack constraints be allowed in preprocessing?
9.49/9.57 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
9.49/9.57 c constraints/knapsack/disaggregation = FALSE
9.49/9.57 c
9.49/9.57 c # should presolving try to simplify knapsacks
9.49/9.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
9.49/9.57 c constraints/knapsack/simplifyinequalities = TRUE
9.49/9.57 c
9.49/9.57 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: -1]
9.49/9.57 c presolving/probing/maxrounds = 0
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/coefdiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/coefdiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/coefdiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 30]
9.49/9.57 c heuristics/crossover/freq = -1
9.49/9.57 c
9.49/9.57 c # number of nodes added to the contingent of the total nodes
9.49/9.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
9.49/9.57 c heuristics/crossover/nodesofs = 750
9.49/9.57 c
9.49/9.57 c # number of nodes without incumbent change that heuristic should wait
9.49/9.57 c # [type: longint, range: [0,9223372036854775807], default: 200]
9.49/9.57 c heuristics/crossover/nwaitingnodes = 100
9.49/9.57 c
9.49/9.57 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
9.49/9.57 c # [type: real, range: [0,1], default: 0.1]
9.49/9.57 c heuristics/crossover/nodesquot = 0.15
9.49/9.57 c
9.49/9.57 c # minimum percentage of integer variables that have to be fixed
9.49/9.57 c # [type: real, range: [0,1], default: 0.666]
9.49/9.57 c heuristics/crossover/minfixingrate = 0.5
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 20]
9.49/9.57 c heuristics/feaspump/freq = -1
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/feaspump/maxlpiterofs = 2000
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/fracdiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/fracdiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/fracdiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/guideddiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/guideddiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/guideddiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/intdiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/intshifting/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/linesearchdiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/linesearchdiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/linesearchdiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/nlp/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 20]
9.49/9.57 c heuristics/objpscostdiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to total iteration number
9.49/9.57 c # [type: real, range: [0,1], default: 0.01]
9.49/9.57 c heuristics/objpscostdiving/maxlpiterquot = 0.015
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/objpscostdiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/oneopt/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/pscostdiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/pscostdiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/pscostdiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 0]
9.49/9.57 c heuristics/rens/freq = -1
9.49/9.57 c
9.49/9.57 c # minimum percentage of integer variables that have to be fixable
9.49/9.57 c # [type: real, range: [0,1], default: 0.5]
9.49/9.57 c heuristics/rens/minfixingrate = 0.3
9.49/9.57 c
9.49/9.57 c # number of nodes added to the contingent of the total nodes
9.49/9.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
9.49/9.57 c heuristics/rens/nodesofs = 2000
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 20]
9.49/9.57 c heuristics/rootsoldiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
9.49/9.57 c heuristics/rootsoldiving/maxlpiterquot = 0.015
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/rootsoldiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/rounding/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/shifting/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/simplerounding/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 0]
9.49/9.57 c heuristics/trivial/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/trysol/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 10]
9.49/9.57 c heuristics/veclendiving/freq = -1
9.49/9.57 c
9.49/9.57 c # maximal fraction of diving LP iterations compared to node LP iterations
9.49/9.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
9.49/9.57 c heuristics/veclendiving/maxlpiterquot = 0.075
9.49/9.57 c
9.49/9.57 c # additional number of allowed LP iterations
9.49/9.57 c # [type: int, range: [0,2147483647], default: 1000]
9.49/9.57 c heuristics/veclendiving/maxlpiterofs = 1500
9.49/9.57 c
9.49/9.57 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 1]
9.49/9.57 c heuristics/zirounding/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 0]
9.49/9.57 c separating/cmir/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: 0]
9.49/9.57 c separating/flowcover/freq = -1
9.49/9.57 c
9.49/9.57 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
9.49/9.57 c # [type: int, range: [-1,2147483647], default: -1]
9.49/9.57 c separating/rapidlearning/freq = 0
9.49/9.57 c
9.49/9.57 c -----------------------------------------------------------------------------------------------
9.49/9.58 c start solving
9.49/9.58 c
122.66/122.75 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
122.66/122.75 c 120s| 1 | 0 | 23180 | - | 137M| 0 | - |7655 | 20k|7655 | 20k| 0 | 0 | 0 | -- | -- | 0.00%
122.66/122.75 c 120s| 1 | 0 | 23180 | - | 137M| 0 | - |7655 | 20k|7655 | 20k| 0 | 0 | 0 | -- | -- | 0.00%
122.66/122.75 c
122.66/122.75 c SCIP Status : problem is solved [infeasible]
122.66/122.75 c Solving Time (sec) : 119.99
122.66/122.75 c Solving Nodes : 1
122.66/122.75 c Primal Bound : +1.00000000000000e+20 (0 solutions)
122.66/122.75 c Dual Bound : +1.00000000000000e+20
122.66/122.75 c Gap : 0.00 %
122.66/122.75 s UNSATISFIABLE
122.66/122.75 c SCIP Status : problem is solved [infeasible]
122.66/122.75 c Solving Time : 119.99
122.66/122.75 c Original Problem :
122.66/122.75 c Problem name : HOME/instance-2684969-1278437203.opb
122.66/122.75 c Variables : 27588 (27588 binary, 0 integer, 0 implicit integer, 0 continuous)
122.66/122.75 c Constraints : 91561 initial, 91561 maximal
122.66/122.75 c Presolved Problem :
122.66/122.75 c Problem name : t_HOME/instance-2684969-1278437203.opb
122.66/122.75 c Variables : 7655 (7655 binary, 0 integer, 0 implicit integer, 0 continuous)
122.66/122.75 c Constraints : 20229 initial, 20229 maximal
122.66/122.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
122.66/122.75 c trivial : 0.06 878 0 0 0 0 0 0 0
122.66/122.75 c dualfix : 0.06 105 0 0 0 0 0 0 0
122.66/122.75 c boundshift : 0.00 0 0 0 0 0 0 0 0
122.66/122.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0
122.66/122.75 c implics : 0.14 0 0 0 0 0 0 0 0
122.66/122.75 c probing : 0.00 0 0 0 0 0 0 0 0
122.66/122.75 c knapsack : 0.16 0 0 0 0 0 0 11 58
122.66/122.75 c linear : 6.38 14573 4377 0 15451 0 71332 85 81
122.66/122.75 c logicor : 0.14 0 0 0 0 0 0 0 0
122.66/122.75 c root node : - 0 - - 0 - - - -
122.66/122.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
122.66/122.75 c integral : 0 0 0 0 0 0 0 0 0 0
122.66/122.75 c knapsack : 393 0 1 0 0 0 0 0 0 0
122.66/122.75 c logicor : 19836 0 1 0 0 0 0 0 0 0
122.66/122.75 c countsols : 0 0 0 0 0 0 0 0 0 0
122.66/122.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
122.66/122.75 c integral : 0.00 0.00 0.00 0.00 0.00
122.66/122.75 c knapsack : 0.00 0.00 0.00 0.00 0.00
122.66/122.75 c logicor : 0.02 0.00 0.02 0.00 0.00
122.66/122.75 c countsols : 0.00 0.00 0.00 0.00 0.00
122.66/122.75 c Propagators : Time Calls Cutoffs DomReds
122.66/122.75 c vbounds : 0.00 1 0 0
122.66/122.75 c rootredcost : 0.00 0 0 0
122.66/122.75 c pseudoobj : 0.00 0 0 0
122.66/122.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
122.66/122.75 c propagation : 0.00 0 0 0 0.0 0 0.0 -
122.66/122.75 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
122.66/122.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
122.66/122.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
122.66/122.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
122.66/122.75 c applied globally : - - - 0 0.0 - - -
122.66/122.75 c applied locally : - - - 0 0.0 - - -
122.66/122.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
122.66/122.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
122.66/122.75 c redcost : 0.00 0 0 0 0 0
122.66/122.75 c impliedbounds : 0.00 0 0 0 0 0
122.66/122.75 c intobj : 0.00 0 0 0 0 0
122.66/122.75 c cgmip : 0.00 0 0 0 0 0
122.66/122.75 c gomory : 0.00 0 0 0 0 0
122.66/122.75 c strongcg : 0.00 0 0 0 0 0
122.66/122.75 c cmir : 0.00 0 0 0 0 0
122.66/122.75 c flowcover : 0.00 0 0 0 0 0
122.66/122.75 c clique : 0.00 0 0 0 0 0
122.66/122.75 c zerohalf : 0.00 0 0 0 0 0
122.66/122.75 c mcf : 0.00 0 0 0 0 0
122.66/122.75 c rapidlearning : 0.00 0 0 0 0 0
122.66/122.75 c Pricers : Time Calls Vars
122.66/122.75 c problem variables: 0.00 0 0
122.66/122.75 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
122.66/122.75 c pscost : 0.00 0 0 0 0 0 0
122.66/122.75 c inference : 0.00 0 0 0 0 0 0
122.66/122.75 c mostinf : 0.00 0 0 0 0 0 0
122.66/122.75 c leastinf : 0.00 0 0 0 0 0 0
122.66/122.75 c fullstrong : 0.00 0 0 0 0 0 0
122.66/122.75 c allfullstrong : 0.00 0 0 0 0 0 0
122.66/122.75 c random : 0.00 0 0 0 0 0 0
122.66/122.75 c relpscost : 0.00 0 0 0 0 0 0
122.66/122.75 c Primal Heuristics : Time Calls Found
122.66/122.75 c LP solutions : 0.00 - 0
122.66/122.75 c pseudo solutions : 0.00 - 0
122.66/122.75 c trivial : 0.05 1 0
122.66/122.75 c simplerounding : 0.00 0 0
122.66/122.75 c zirounding : 0.00 0 0
122.66/122.75 c rounding : 0.00 0 0
122.66/122.75 c shifting : 0.00 0 0
122.66/122.75 c intshifting : 0.00 0 0
122.66/122.75 c oneopt : 0.00 0 0
122.66/122.75 c twoopt : 0.00 0 0
122.66/122.75 c fixandinfer : 0.00 0 0
122.66/122.75 c feaspump : 0.00 0 0
122.66/122.75 c coefdiving : 0.00 0 0
122.66/122.75 c pscostdiving : 0.00 0 0
122.66/122.75 c fracdiving : 0.00 0 0
122.66/122.75 c veclendiving : 0.00 0 0
122.66/122.75 c intdiving : 0.00 0 0
122.66/122.75 c actconsdiving : 0.00 0 0
122.66/122.75 c objpscostdiving : 0.00 0 0
122.66/122.75 c rootsoldiving : 0.00 0 0
122.66/122.75 c linesearchdiving : 0.00 0 0
122.66/122.75 c guideddiving : 0.00 0 0
122.66/122.75 c octane : 0.00 0 0
122.66/122.75 c rens : 0.00 0 0
122.66/122.75 c rins : 0.00 0 0
122.66/122.75 c localbranching : 0.00 0 0
122.66/122.75 c mutation : 0.00 0 0
122.66/122.75 c crossover : 0.00 0 0
122.66/122.75 c dins : 0.00 0 0
122.66/122.75 c undercover : 0.00 0 0
122.66/122.75 c nlp : 0.00 0 0
122.66/122.75 c trysol : 0.00 0 0
122.66/122.75 c LP : Time Calls Iterations Iter/call Iter/sec
122.66/122.75 c primal LP : 0.00 0 0 0.00 -
122.66/122.75 c dual LP : 112.40 1 23180 23180.00 206.23
122.66/122.75 c lex dual LP : 0.00 0 0 0.00 -
122.66/122.75 c barrier LP : 0.00 0 0 0.00 -
122.66/122.75 c diving/probing LP: 0.00 0 0 0.00 -
122.66/122.75 c strong branching : 0.00 0 0 0.00 -
122.66/122.75 c (at root node) : - 0 0 0.00 -
122.66/122.75 c conflict analysis: 0.00 0 0 0.00 -
122.66/122.75 c B&B Tree :
122.66/122.75 c number of runs : 1
122.66/122.75 c nodes : 1
122.66/122.75 c nodes (total) : 1
122.66/122.75 c nodes left : 0
122.66/122.75 c max depth : 0
122.66/122.75 c max depth (total): 0
122.66/122.75 c backtracks : 0 (0.0%)
122.66/122.75 c delayed cutoffs : 0
122.66/122.75 c repropagations : 0 (0 domain reductions, 0 cutoffs)
122.66/122.75 c avg switch length: 2.00
122.66/122.75 c switching time : 0.00
122.66/122.75 c Solution :
122.66/122.75 c Solutions found : 0 (0 improvements)
122.66/122.75 c Primal Bound : infeasible
122.66/122.75 c Dual Bound : -
122.66/122.75 c Gap : 0.00 %
122.66/122.75 c Root Dual Bound : -
122.66/122.75 c Root Iterations : 23180
122.95/123.03 c Time complete: 122.99.