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-2685039-1278438908.opb>
2.49/2.54 c original problem has 37752 variables (37752 bin, 0 int, 0 impl, 0 cont) and 131628 constraints
2.49/2.54 c problem read
2.49/2.55 c No objective function, only one solution is needed.
2.49/2.55 c presolving settings loaded
3.19/3.23 c presolving:
9.29/9.31 c (round 1) 8460 del vars, 24741 del conss, 6689 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 7310010 impls, 0 clqs
13.19/13.22 c (round 2) 15745 del vars, 56925 del conss, 13491 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 7355180 impls, 0 clqs
13.79/13.82 c (round 3) 18444 del vars, 70134 del conss, 15082 chg bounds, 67 chg sides, 53 chg coeffs, 0 upgd conss, 7378752 impls, 0 clqs
14.19/14.25 c (round 4) 19858 del vars, 75616 del conss, 16132 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7395915 impls, 0 clqs
14.49/14.58 c (round 5) 21002 del vars, 79911 del conss, 16985 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7414865 impls, 0 clqs
14.88/14.92 c (round 6) 22147 del vars, 83887 del conss, 17869 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7426788 impls, 0 clqs
15.08/15.14 c (round 7) 23099 del vars, 87509 del conss, 18516 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7435195 impls, 0 clqs
15.18/15.27 c (round 8) 23469 del vars, 89039 del conss, 18732 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7439118 impls, 0 clqs
15.28/15.38 c (round 9) 23644 del vars, 89736 del conss, 18815 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7441011 impls, 0 clqs
15.40/15.47 c (round 10) 23755 del vars, 90151 del conss, 18875 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7442529 impls, 0 clqs
15.49/15.54 c (round 11) 23819 del vars, 90396 del conss, 18899 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7443301 impls, 0 clqs
15.59/15.61 c (round 12) 23847 del vars, 90523 del conss, 18909 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7443625 impls, 0 clqs
15.59/15.67 c (round 13) 23855 del vars, 90562 del conss, 18910 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7443743 impls, 0 clqs
15.68/15.74 c (round 14) 23856 del vars, 90571 del conss, 18910 chg bounds, 75 chg sides, 61 chg coeffs, 0 upgd conss, 7443761 impls, 0 clqs
16.08/16.18 c (round 15) 23856 del vars, 90572 del conss, 18910 chg bounds, 75 chg sides, 61 chg coeffs, 41056 upgd conss, 7443761 impls, 0 clqs
16.69/16.72 c (round 16) 23856 del vars, 90572 del conss, 18910 chg bounds, 100 chg sides, 270 chg coeffs, 41056 upgd conss, 7444147 impls, 161 clqs
16.99/17.08 c presolving (17 rounds):
16.99/17.08 c 23856 deleted vars, 90572 deleted constraints, 18910 tightened bounds, 0 added holes, 100 changed sides, 305 changed coefficients
16.99/17.08 c 7444147 implications, 164 cliques
16.99/17.08 c presolved problem has 13896 variables (13896 bin, 0 int, 0 impl, 0 cont) and 41056 constraints
16.99/17.08 c 573 constraints of type <knapsack>
16.99/17.08 c 40483 constraints of type <logicor>
16.99/17.08 c transformed objective value is always integral (scale: 1)
16.99/17.08 c Presolving Time: 13.26
16.99/17.08 c - non default parameters ----------------------------------------------------------------------
16.99/17.08 c # SCIP version 1.2.1.2
16.99/17.08 c
16.99/17.08 c # frequency for displaying node information lines
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 100]
16.99/17.08 c display/freq = 10000
16.99/17.08 c
16.99/17.08 c # maximal time in seconds to run
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
16.99/17.08 c limits/time = 1797.45
16.99/17.08 c
16.99/17.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
16.99/17.08 c limits/memory = 1620
16.99/17.08 c
16.99/17.08 c # solving stops, if the given number of solutions were found (-1: no limit)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: -1]
16.99/17.08 c limits/solutions = 1
16.99/17.08 c
16.99/17.08 c # maximal number of separation rounds per node (-1: unlimited)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 5]
16.99/17.08 c separating/maxrounds = 1
16.99/17.08 c
16.99/17.08 c # maximal number of separation rounds in the root node (-1: unlimited)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: -1]
16.99/17.08 c separating/maxroundsroot = 5
16.99/17.08 c
16.99/17.08 c # should presolving try to simplify inequalities
16.99/17.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.99/17.08 c constraints/linear/simplifyinequalities = TRUE
16.99/17.08 c
16.99/17.08 c # should disaggregation of knapsack constraints be allowed in preprocessing?
16.99/17.08 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
16.99/17.08 c constraints/knapsack/disaggregation = FALSE
16.99/17.08 c
16.99/17.08 c # should presolving try to simplify knapsacks
16.99/17.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.99/17.08 c constraints/knapsack/simplifyinequalities = TRUE
16.99/17.08 c
16.99/17.08 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: -1]
16.99/17.08 c presolving/probing/maxrounds = 0
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/coefdiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/coefdiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/coefdiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 30]
16.99/17.08 c heuristics/crossover/freq = -1
16.99/17.08 c
16.99/17.08 c # number of nodes added to the contingent of the total nodes
16.99/17.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
16.99/17.08 c heuristics/crossover/nodesofs = 750
16.99/17.08 c
16.99/17.08 c # number of nodes without incumbent change that heuristic should wait
16.99/17.08 c # [type: longint, range: [0,9223372036854775807], default: 200]
16.99/17.08 c heuristics/crossover/nwaitingnodes = 100
16.99/17.08 c
16.99/17.08 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
16.99/17.08 c # [type: real, range: [0,1], default: 0.1]
16.99/17.08 c heuristics/crossover/nodesquot = 0.15
16.99/17.08 c
16.99/17.08 c # minimum percentage of integer variables that have to be fixed
16.99/17.08 c # [type: real, range: [0,1], default: 0.666]
16.99/17.08 c heuristics/crossover/minfixingrate = 0.5
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 20]
16.99/17.08 c heuristics/feaspump/freq = -1
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/feaspump/maxlpiterofs = 2000
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/fracdiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/fracdiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/fracdiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/guideddiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/guideddiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/guideddiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/intdiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/intshifting/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/linesearchdiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/linesearchdiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/linesearchdiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/nlp/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 20]
16.99/17.08 c heuristics/objpscostdiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to total iteration number
16.99/17.08 c # [type: real, range: [0,1], default: 0.01]
16.99/17.08 c heuristics/objpscostdiving/maxlpiterquot = 0.015
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/objpscostdiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/oneopt/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/pscostdiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/pscostdiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/pscostdiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 0]
16.99/17.08 c heuristics/rens/freq = -1
16.99/17.08 c
16.99/17.08 c # minimum percentage of integer variables that have to be fixable
16.99/17.08 c # [type: real, range: [0,1], default: 0.5]
16.99/17.08 c heuristics/rens/minfixingrate = 0.3
16.99/17.08 c
16.99/17.08 c # number of nodes added to the contingent of the total nodes
16.99/17.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
16.99/17.08 c heuristics/rens/nodesofs = 2000
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 20]
16.99/17.08 c heuristics/rootsoldiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
16.99/17.08 c heuristics/rootsoldiving/maxlpiterquot = 0.015
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/rootsoldiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/rounding/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/shifting/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/simplerounding/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 0]
16.99/17.08 c heuristics/trivial/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/trysol/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 10]
16.99/17.08 c heuristics/veclendiving/freq = -1
16.99/17.08 c
16.99/17.08 c # maximal fraction of diving LP iterations compared to node LP iterations
16.99/17.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.99/17.08 c heuristics/veclendiving/maxlpiterquot = 0.075
16.99/17.08 c
16.99/17.08 c # additional number of allowed LP iterations
16.99/17.08 c # [type: int, range: [0,2147483647], default: 1000]
16.99/17.08 c heuristics/veclendiving/maxlpiterofs = 1500
16.99/17.08 c
16.99/17.08 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 1]
16.99/17.08 c heuristics/zirounding/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 0]
16.99/17.08 c separating/cmir/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: 0]
16.99/17.08 c separating/flowcover/freq = -1
16.99/17.08 c
16.99/17.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
16.99/17.08 c # [type: int, range: [-1,2147483647], default: -1]
16.99/17.08 c separating/rapidlearning/freq = 0
16.99/17.08 c
16.99/17.08 c -----------------------------------------------------------------------------------------------
16.99/17.08 c start solving
17.08/17.10 c
839.15/839.59 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
839.15/839.59 c 832s| 1 | 0 | 62965 | - | 226M| 0 | - | 13k| 41k| 13k| 41k| 0 | 0 | 0 | -- | -- | 0.00%
839.15/839.59 c 832s| 1 | 0 | 62965 | - | 226M| 0 | - | 13k| 41k| 13k| 41k| 0 | 0 | 0 | -- | -- | 0.00%
839.15/839.59 c
839.15/839.59 c SCIP Status : problem is solved [infeasible]
839.15/839.59 c Solving Time (sec) : 832.26
839.15/839.59 c Solving Nodes : 1
839.15/839.59 c Primal Bound : +1.00000000000000e+20 (0 solutions)
839.15/839.59 c Dual Bound : +1.00000000000000e+20
839.15/839.59 c Gap : 0.00 %
839.15/839.59 s UNSATISFIABLE
839.15/839.59 c SCIP Status : problem is solved [infeasible]
839.15/839.59 c Solving Time : 832.26
839.15/839.59 c Original Problem :
839.15/839.59 c Problem name : HOME/instance-2685039-1278438908.opb
839.15/839.59 c Variables : 37752 (37752 binary, 0 integer, 0 implicit integer, 0 continuous)
839.15/839.59 c Constraints : 131628 initial, 131628 maximal
839.15/839.59 c Presolved Problem :
839.15/839.59 c Problem name : t_HOME/instance-2685039-1278438908.opb
839.15/839.59 c Variables : 13896 (13896 binary, 0 integer, 0 implicit integer, 0 continuous)
839.15/839.59 c Constraints : 41056 initial, 41056 maximal
839.15/839.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
839.15/839.59 c trivial : 0.04 876 0 0 0 0 0 0 0
839.15/839.59 c dualfix : 0.15 112 0 0 0 0 0 0 0
839.15/839.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
839.15/839.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
839.15/839.59 c implics : 0.32 0 0 0 0 0 0 0 0
839.15/839.59 c probing : 0.00 0 0 0 0 0 0 0 0
839.15/839.59 c knapsack : 0.62 0 0 0 0 0 0 25 244
839.15/839.59 c linear : 11.52 18047 4821 0 18910 0 90572 75 61
839.15/839.59 c logicor : 0.18 0 0 0 0 0 0 0 0
839.15/839.59 c root node : - 0 - - 0 - - - -
839.15/839.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
839.15/839.59 c integral : 0 0 0 0 0 0 0 0 0 0
839.15/839.59 c knapsack : 573 0 1 0 0 0 0 0 0 0
839.15/839.59 c logicor : 40483 0 1 0 0 0 0 0 0 0
839.15/839.59 c countsols : 0 0 0 0 0 0 0 0 0 0
839.15/839.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
839.15/839.59 c integral : 0.00 0.00 0.00 0.00 0.00
839.15/839.59 c knapsack : 0.00 0.00 0.00 0.00 0.00
839.15/839.59 c logicor : 0.05 0.00 0.05 0.00 0.00
839.15/839.59 c countsols : 0.00 0.00 0.00 0.00 0.00
839.15/839.59 c Propagators : Time Calls Cutoffs DomReds
839.15/839.59 c vbounds : 0.00 1 0 0
839.15/839.59 c rootredcost : 0.00 0 0 0
839.15/839.59 c pseudoobj : 0.00 0 0 0
839.15/839.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
839.15/839.59 c propagation : 0.00 0 0 0 0.0 0 0.0 -
839.15/839.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
839.15/839.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
839.15/839.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
839.15/839.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
839.15/839.59 c applied globally : - - - 0 0.0 - - -
839.15/839.59 c applied locally : - - - 0 0.0 - - -
839.15/839.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
839.15/839.59 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
839.15/839.59 c redcost : 0.00 0 0 0 0 0
839.15/839.59 c impliedbounds : 0.00 0 0 0 0 0
839.15/839.59 c intobj : 0.00 0 0 0 0 0
839.15/839.59 c cgmip : 0.00 0 0 0 0 0
839.15/839.59 c gomory : 0.00 0 0 0 0 0
839.15/839.59 c strongcg : 0.00 0 0 0 0 0
839.15/839.59 c cmir : 0.00 0 0 0 0 0
839.15/839.59 c flowcover : 0.00 0 0 0 0 0
839.15/839.59 c clique : 0.00 0 0 0 0 0
839.15/839.59 c zerohalf : 0.00 0 0 0 0 0
839.15/839.59 c mcf : 0.00 0 0 0 0 0
839.15/839.59 c rapidlearning : 0.00 0 0 0 0 0
839.15/839.59 c Pricers : Time Calls Vars
839.15/839.59 c problem variables: 0.00 0 0
839.15/839.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
839.15/839.59 c pscost : 0.00 0 0 0 0 0 0
839.15/839.59 c inference : 0.00 0 0 0 0 0 0
839.15/839.59 c mostinf : 0.00 0 0 0 0 0 0
839.15/839.59 c leastinf : 0.00 0 0 0 0 0 0
839.15/839.59 c fullstrong : 0.00 0 0 0 0 0 0
839.15/839.59 c allfullstrong : 0.00 0 0 0 0 0 0
839.15/839.59 c random : 0.00 0 0 0 0 0 0
839.15/839.59 c relpscost : 0.00 0 0 0 0 0 0
839.15/839.59 c Primal Heuristics : Time Calls Found
839.15/839.59 c LP solutions : 0.00 - 0
839.15/839.59 c pseudo solutions : 0.00 - 0
839.15/839.59 c trivial : 0.07 1 0
839.15/839.59 c simplerounding : 0.00 0 0
839.15/839.59 c zirounding : 0.00 0 0
839.15/839.59 c rounding : 0.00 0 0
839.15/839.59 c shifting : 0.00 0 0
839.15/839.59 c intshifting : 0.00 0 0
839.15/839.59 c oneopt : 0.00 0 0
839.15/839.59 c twoopt : 0.00 0 0
839.15/839.59 c fixandinfer : 0.00 0 0
839.15/839.59 c feaspump : 0.00 0 0
839.15/839.59 c coefdiving : 0.00 0 0
839.15/839.59 c pscostdiving : 0.00 0 0
839.15/839.59 c fracdiving : 0.00 0 0
839.15/839.59 c veclendiving : 0.00 0 0
839.15/839.59 c intdiving : 0.00 0 0
839.15/839.59 c actconsdiving : 0.00 0 0
839.15/839.59 c objpscostdiving : 0.00 0 0
839.15/839.59 c rootsoldiving : 0.00 0 0
839.15/839.59 c linesearchdiving : 0.00 0 0
839.15/839.59 c guideddiving : 0.00 0 0
839.15/839.59 c octane : 0.00 0 0
839.15/839.59 c rens : 0.00 0 0
839.15/839.59 c rins : 0.00 0 0
839.15/839.59 c localbranching : 0.00 0 0
839.15/839.59 c mutation : 0.00 0 0
839.15/839.59 c crossover : 0.00 0 0
839.15/839.59 c dins : 0.00 0 0
839.15/839.59 c undercover : 0.00 0 0
839.15/839.59 c nlp : 0.00 0 0
839.15/839.59 c trysol : 0.00 0 0
839.15/839.59 c LP : Time Calls Iterations Iter/call Iter/sec
839.15/839.59 c primal LP : 0.00 0 0 0.00 -
839.15/839.59 c dual LP : 818.38 1 62965 62965.00 76.94
839.15/839.59 c lex dual LP : 0.00 0 0 0.00 -
839.15/839.59 c barrier LP : 0.00 0 0 0.00 -
839.15/839.59 c diving/probing LP: 0.00 0 0 0.00 -
839.15/839.59 c strong branching : 0.00 0 0 0.00 -
839.15/839.59 c (at root node) : - 0 0 0.00 -
839.15/839.59 c conflict analysis: 0.00 0 0 0.00 -
839.15/839.59 c B&B Tree :
839.15/839.59 c number of runs : 1
839.15/839.59 c nodes : 1
839.15/839.59 c nodes (total) : 1
839.15/839.59 c nodes left : 0
839.15/839.59 c max depth : 0
839.15/839.59 c max depth (total): 0
839.15/839.59 c backtracks : 0 (0.0%)
839.15/839.59 c delayed cutoffs : 0
839.15/839.59 c repropagations : 0 (0 domain reductions, 0 cutoffs)
839.15/839.59 c avg switch length: 2.00
839.15/839.59 c switching time : 0.00
839.15/839.59 c Solution :
839.15/839.59 c Solutions found : 0 (0 improvements)
839.15/839.59 c Primal Bound : infeasible
839.15/839.59 c Dual Bound : -
839.15/839.59 c Gap : 0.00 %
839.15/839.59 c Root Dual Bound : -
839.15/839.59 c Root Iterations : 62965
839.65/840.06 c Time complete: 839.72.