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-2685417-1278441061.opb>
0.49/0.51 c original problem has 9638 variables (9638 bin, 0 int, 0 impl, 0 cont) and 30220 constraints
0.49/0.51 c problem read
0.49/0.51 c No objective function, only one solution is needed.
0.49/0.52 c presolving settings loaded
0.59/0.68 c presolving:
1.89/1.98 c (round 1) 1982 del vars, 5307 del conss, 1275 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1666520 impls, 0 clqs
2.49/2.54 c (round 2) 4964 del vars, 15526 del conss, 3995 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1681738 impls, 0 clqs
2.59/2.61 c (round 3) 5802 del vars, 19471 del conss, 4436 chg bounds, 17 chg sides, 7 chg coeffs, 0 upgd conss, 1686895 impls, 0 clqs
2.59/2.66 c (round 4) 6174 del vars, 20738 del conss, 4688 chg bounds, 25 chg sides, 18 chg coeffs, 0 upgd conss, 1690986 impls, 0 clqs
2.69/2.70 c (round 5) 6436 del vars, 21657 del conss, 4859 chg bounds, 31 chg sides, 24 chg coeffs, 0 upgd conss, 1692886 impls, 0 clqs
2.69/2.72 c (round 6) 6505 del vars, 21992 del conss, 4902 chg bounds, 34 chg sides, 27 chg coeffs, 0 upgd conss, 1693248 impls, 0 clqs
2.69/2.73 c (round 7) 6527 del vars, 22077 del conss, 4919 chg bounds, 37 chg sides, 30 chg coeffs, 0 upgd conss, 1693332 impls, 0 clqs
2.69/2.74 c (round 8) 6536 del vars, 22113 del conss, 4920 chg bounds, 40 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
2.69/2.75 c (round 9) 6536 del vars, 22115 del conss, 4920 chg bounds, 40 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
2.79/2.87 c (round 10) 6536 del vars, 22115 del conss, 4920 chg bounds, 40 chg sides, 33 chg coeffs, 8105 upgd conss, 1693428 impls, 0 clqs
2.89/2.93 c (round 11) 6544 del vars, 22137 del conss, 4930 chg bounds, 44 chg sides, 82 chg coeffs, 8105 upgd conss, 1695272 impls, 114 clqs
2.89/2.98 c (round 12) 6564 del vars, 22167 del conss, 4932 chg bounds, 48 chg sides, 106 chg coeffs, 8105 upgd conss, 1695958 impls, 122 clqs
2.99/3.02 c (round 13) 6578 del vars, 22195 del conss, 4934 chg bounds, 48 chg sides, 109 chg coeffs, 8105 upgd conss, 1697232 impls, 127 clqs
2.99/3.05 c (round 14) 6580 del vars, 22201 del conss, 4934 chg bounds, 48 chg sides, 116 chg coeffs, 8105 upgd conss, 1697232 impls, 128 clqs
2.99/3.09 c presolving (15 rounds):
2.99/3.09 c 6580 deleted vars, 22201 deleted constraints, 4934 tightened bounds, 0 added holes, 48 changed sides, 118 changed coefficients
2.99/3.09 c 1697232 implications, 134 cliques
2.99/3.09 c presolved problem has 3058 variables (3058 bin, 0 int, 0 impl, 0 cont) and 8019 constraints
2.99/3.09 c 261 constraints of type <knapsack>
2.99/3.09 c 7758 constraints of type <logicor>
2.99/3.09 c transformed objective value is always integral (scale: 1)
2.99/3.09 c Presolving Time: 2.29
2.99/3.09 c - non default parameters ----------------------------------------------------------------------
2.99/3.09 c # SCIP version 1.2.1.2
2.99/3.09 c
2.99/3.09 c # frequency for displaying node information lines
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 100]
2.99/3.09 c display/freq = 10000
2.99/3.09 c
2.99/3.09 c # maximal time in seconds to run
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.09 c limits/time = 1799.49
2.99/3.09 c
2.99/3.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.09 c limits/memory = 1620
2.99/3.09 c
2.99/3.09 c # solving stops, if the given number of solutions were found (-1: no limit)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c limits/solutions = 1
2.99/3.09 c
2.99/3.09 c # maximal number of separation rounds per node (-1: unlimited)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 5]
2.99/3.09 c separating/maxrounds = 1
2.99/3.09 c
2.99/3.09 c # maximal number of separation rounds in the root node (-1: unlimited)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c separating/maxroundsroot = 5
2.99/3.09 c
2.99/3.09 c # should presolving try to simplify inequalities
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.09 c constraints/linear/simplifyinequalities = TRUE
2.99/3.09 c
2.99/3.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.99/3.09 c constraints/knapsack/disaggregation = FALSE
2.99/3.09 c
2.99/3.09 c # should presolving try to simplify knapsacks
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.09 c constraints/knapsack/simplifyinequalities = TRUE
2.99/3.09 c
2.99/3.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c presolving/probing/maxrounds = 0
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/coefdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/coefdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/coefdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 30]
2.99/3.09 c heuristics/crossover/freq = -1
2.99/3.09 c
2.99/3.09 c # number of nodes added to the contingent of the total nodes
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.09 c heuristics/crossover/nodesofs = 750
2.99/3.09 c
2.99/3.09 c # number of nodes without incumbent change that heuristic should wait
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.99/3.09 c heuristics/crossover/nwaitingnodes = 100
2.99/3.09 c
2.99/3.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.99/3.09 c # [type: real, range: [0,1], default: 0.1]
2.99/3.09 c heuristics/crossover/nodesquot = 0.15
2.99/3.09 c
2.99/3.09 c # minimum percentage of integer variables that have to be fixed
2.99/3.09 c # [type: real, range: [0,1], default: 0.666]
2.99/3.09 c heuristics/crossover/minfixingrate = 0.5
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/feaspump/freq = -1
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/feaspump/maxlpiterofs = 2000
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/fracdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/fracdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/fracdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/guideddiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/guideddiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/guideddiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/intdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/intshifting/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/linesearchdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/nlp/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/objpscostdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to total iteration number
2.99/3.09 c # [type: real, range: [0,1], default: 0.01]
2.99/3.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/oneopt/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/pscostdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/pscostdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c heuristics/rens/freq = -1
2.99/3.09 c
2.99/3.09 c # minimum percentage of integer variables that have to be fixable
2.99/3.09 c # [type: real, range: [0,1], default: 0.5]
2.99/3.09 c heuristics/rens/minfixingrate = 0.3
2.99/3.09 c
2.99/3.09 c # number of nodes added to the contingent of the total nodes
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.09 c heuristics/rens/nodesofs = 2000
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/rootsoldiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.99/3.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/rounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/shifting/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/simplerounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c heuristics/trivial/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/trysol/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/veclendiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/veclendiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/veclendiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/zirounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c separating/cmir/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c separating/flowcover/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c separating/rapidlearning/freq = 0
2.99/3.09 c
2.99/3.09 c -----------------------------------------------------------------------------------------------
2.99/3.09 c start solving
2.99/3.09 c
8.19/8.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
8.19/8.20 c 7.4s| 1 | 0 | 4190 | - | 48M| 0 |1661 |3058 |8019 |3058 |7977 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
42.08/42.16 c 41.0s| 1 | 0 | 11318 | - | 54M| 0 |1751 |3058 |9491 |3058 |8088 | 115 | 0 | 0 | 0.000000e+00 | -- | Inf
63.57/63.63 c 62.4s| 1 | 0 | 18574 | - | 54M| 0 | - |3058 |9491 |3058 |8187 | 214 | 0 | 0 | -- | -- | 0.00%
63.57/63.63 c 62.4s| 1 | 0 | 18574 | - | 54M| 0 | - |3058 |9491 |3058 |8187 | 214 | 0 | 0 | -- | -- | 0.00%
63.57/63.63 c
63.57/63.63 c SCIP Status : problem is solved [infeasible]
63.57/63.63 c Solving Time (sec) : 62.42
63.57/63.63 c Solving Nodes : 1
63.57/63.63 c Primal Bound : +1.00000000000000e+20 (0 solutions)
63.57/63.63 c Dual Bound : +1.00000000000000e+20
63.57/63.63 c Gap : 0.00 %
63.57/63.63 s UNSATISFIABLE
63.57/63.63 c SCIP Status : problem is solved [infeasible]
63.57/63.63 c Solving Time : 62.42
63.57/63.63 c Original Problem :
63.57/63.63 c Problem name : HOME/instance-2685417-1278441061.opb
63.57/63.63 c Variables : 9638 (9638 binary, 0 integer, 0 implicit integer, 0 continuous)
63.57/63.63 c Constraints : 30220 initial, 30220 maximal
63.57/63.63 c Presolved Problem :
63.57/63.63 c Problem name : t_HOME/instance-2685417-1278441061.opb
63.57/63.63 c Variables : 3058 (3058 binary, 0 integer, 0 implicit integer, 0 continuous)
63.57/63.63 c Constraints : 8019 initial, 9491 maximal
63.57/63.63 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
63.57/63.63 c trivial : 0.00 331 0 0 0 0 0 0 0
63.57/63.63 c dualfix : 0.02 56 0 0 0 0 0 0 0
63.57/63.63 c boundshift : 0.00 0 0 0 0 0 0 0 0
63.57/63.63 c inttobinary : 0.00 0 0 0 0 0 0 0 0
63.57/63.63 c implics : 0.07 0 21 0 0 0 0 0 0
63.57/63.63 c probing : 0.00 0 0 0 0 0 0 0 0
63.57/63.63 c knapsack : 0.14 0 0 0 2 0 0 8 85
63.57/63.63 c linear : 1.91 4603 1560 0 4920 0 22115 40 33
63.57/63.63 c logicor : 0.05 9 0 0 12 0 86 0 0
63.57/63.63 c root node : - 1 - - 1 - - - -
63.57/63.63 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
63.57/63.63 c integral : 0 0 0 0 0 0 0 0 0 0
63.57/63.63 c knapsack : 261 3 2 0 0 0 0 539 0 0
63.57/63.63 c linear : 0+ 2 1 0 0 0 0 9 0 0
63.57/63.63 c logicor : 7758 3 1 0 0 0 0 0 0 0
63.57/63.63 c countsols : 0 0 0 0 0 0 0 0 0 0
63.57/63.63 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
63.57/63.63 c integral : 0.00 0.00 0.00 0.00 0.00
63.57/63.63 c knapsack : 0.01 0.01 0.00 0.00 0.00
63.57/63.63 c linear : 0.04 0.02 0.02 0.00 0.00
63.57/63.63 c logicor : 0.01 0.00 0.01 0.00 0.00
63.57/63.63 c countsols : 0.00 0.00 0.00 0.00 0.00
63.57/63.63 c Propagators : Time Calls Cutoffs DomReds
63.57/63.63 c vbounds : 0.00 1 0 0
63.57/63.63 c rootredcost : 0.00 0 0 0
63.57/63.63 c pseudoobj : 0.00 0 0 0
63.57/63.63 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
63.57/63.63 c propagation : 0.00 0 0 0 0.0 0 0.0 -
63.57/63.63 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
63.57/63.63 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
63.57/63.63 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
63.57/63.63 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
63.57/63.63 c applied globally : - - - 0 0.0 - - -
63.57/63.63 c applied locally : - - - 0 0.0 - - -
63.57/63.63 c Separators : Time Calls Cutoffs DomReds Cuts Conss
63.57/63.63 c cut pool : 0.00 1 - - 0 - (maximal pool size: 66)
63.57/63.63 c redcost : 0.00 2 0 0 0 0
63.57/63.63 c impliedbounds : 0.02 2 0 0 63 0
63.57/63.63 c intobj : 0.00 0 0 0 0 0
63.57/63.63 c cgmip : 0.00 0 0 0 0 0
63.57/63.63 c gomory : 6.07 2 0 0 229 0
63.57/63.63 c strongcg : 6.23 2 0 0 229 0
63.57/63.63 c cmir : 0.00 0 0 0 0 0
63.57/63.63 c flowcover : 0.00 0 0 0 0 0
63.57/63.63 c clique : 0.37 2 0 0 13 0
63.57/63.63 c zerohalf : 0.00 0 0 0 0 0
63.57/63.63 c mcf : 0.03 1 0 0 0 0
63.57/63.63 c rapidlearning : 6.53 1 0 1 0 1472
63.57/63.63 c Pricers : Time Calls Vars
63.57/63.63 c problem variables: 0.00 0 0
63.57/63.63 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
63.57/63.63 c pscost : 0.00 0 0 0 0 0 0
63.57/63.63 c inference : 0.00 0 0 0 0 0 0
63.57/63.63 c mostinf : 0.00 0 0 0 0 0 0
63.57/63.63 c leastinf : 0.00 0 0 0 0 0 0
63.57/63.63 c fullstrong : 0.00 0 0 0 0 0 0
63.57/63.63 c allfullstrong : 0.00 0 0 0 0 0 0
63.57/63.63 c random : 0.00 0 0 0 0 0 0
63.57/63.63 c relpscost : 0.00 0 0 0 0 0 0
63.57/63.63 c Primal Heuristics : Time Calls Found
63.57/63.63 c LP solutions : 0.00 - 0
63.57/63.63 c pseudo solutions : 0.00 - 0
63.57/63.63 c trivial : 0.02 1 0
63.57/63.63 c simplerounding : 0.00 0 0
63.57/63.63 c zirounding : 0.00 0 0
63.57/63.63 c rounding : 0.00 0 0
63.57/63.63 c shifting : 0.00 0 0
63.57/63.63 c intshifting : 0.00 0 0
63.57/63.63 c oneopt : 0.00 0 0
63.57/63.63 c twoopt : 0.00 0 0
63.57/63.63 c fixandinfer : 0.00 0 0
63.57/63.63 c feaspump : 0.00 0 0
63.57/63.63 c coefdiving : 0.00 0 0
63.57/63.63 c pscostdiving : 0.00 0 0
63.57/63.63 c fracdiving : 0.00 0 0
63.57/63.63 c veclendiving : 0.00 0 0
63.57/63.63 c intdiving : 0.00 0 0
63.57/63.63 c actconsdiving : 0.00 0 0
63.57/63.63 c objpscostdiving : 0.00 0 0
63.57/63.63 c rootsoldiving : 0.00 0 0
63.57/63.63 c linesearchdiving : 0.00 0 0
63.57/63.63 c guideddiving : 0.00 0 0
63.57/63.63 c octane : 0.00 0 0
63.57/63.63 c rens : 0.00 0 0
63.57/63.63 c rins : 0.00 0 0
63.57/63.63 c localbranching : 0.00 0 0
63.57/63.63 c mutation : 0.00 0 0
63.57/63.63 c crossover : 0.00 0 0
63.57/63.63 c dins : 0.00 0 0
63.57/63.63 c undercover : 0.00 0 0
63.57/63.63 c nlp : 0.00 0 0
63.57/63.63 c trysol : 0.00 0 0
63.57/63.63 c LP : Time Calls Iterations Iter/call Iter/sec
63.57/63.63 c primal LP : 0.00 0 0 0.00 -
63.57/63.63 c dual LP : 40.68 4 18574 4643.50 456.59
63.57/63.63 c lex dual LP : 0.00 0 0 0.00 -
63.57/63.63 c barrier LP : 0.00 0 0 0.00 -
63.57/63.63 c diving/probing LP: 0.00 0 0 0.00 -
63.57/63.63 c strong branching : 0.00 0 0 0.00 -
63.57/63.63 c (at root node) : - 0 0 0.00 -
63.57/63.63 c conflict analysis: 0.00 0 0 0.00 -
63.57/63.63 c B&B Tree :
63.57/63.63 c number of runs : 1
63.57/63.63 c nodes : 1
63.57/63.63 c nodes (total) : 1
63.57/63.63 c nodes left : 0
63.57/63.63 c max depth : 0
63.57/63.63 c max depth (total): 0
63.57/63.63 c backtracks : 0 (0.0%)
63.57/63.63 c delayed cutoffs : 0
63.57/63.63 c repropagations : 0 (0 domain reductions, 0 cutoffs)
63.57/63.63 c avg switch length: 2.00
63.57/63.63 c switching time : 0.00
63.57/63.63 c Solution :
63.57/63.63 c Solutions found : 0 (0 improvements)
63.57/63.63 c Primal Bound : infeasible
63.57/63.63 c Dual Bound : -
63.57/63.63 c Gap : 0.00 %
63.57/63.63 c Root Dual Bound : -
63.57/63.63 c Root Iterations : 18574
63.68/63.75 c Time complete: 63.74.