0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704753-1278580673.opb>
0.39/0.47 c original problem has 9638 variables (9638 bin, 0 int, 0 impl, 0 cont) and 30220 constraints
0.39/0.47 c problem read
0.39/0.47 c No objective function, only one solution is needed.
0.39/0.47 c presolving settings loaded
0.59/0.63 c presolving:
1.99/2.07 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.59/2.65 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.69/2.73 c (round 3) 5802 del vars, 19471 del conss, 4436 chg bounds, 24 chg sides, 7 chg coeffs, 0 upgd conss, 1686895 impls, 0 clqs
2.69/2.77 c (round 4) 6174 del vars, 20738 del conss, 4688 chg bounds, 36 chg sides, 18 chg coeffs, 0 upgd conss, 1690986 impls, 0 clqs
2.79/2.80 c (round 5) 6436 del vars, 21657 del conss, 4859 chg bounds, 42 chg sides, 24 chg coeffs, 0 upgd conss, 1692886 impls, 0 clqs
2.79/2.81 c (round 6) 6505 del vars, 21992 del conss, 4902 chg bounds, 45 chg sides, 27 chg coeffs, 0 upgd conss, 1693248 impls, 0 clqs
2.79/2.82 c (round 7) 6527 del vars, 22077 del conss, 4919 chg bounds, 48 chg sides, 30 chg coeffs, 0 upgd conss, 1693332 impls, 0 clqs
2.79/2.83 c (round 8) 6536 del vars, 22113 del conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
2.79/2.83 c (round 9) 6536 del vars, 22115 del conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
2.89/2.92 c (round 10) 6536 del vars, 22115 del conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 8105 upgd conss, 1693428 impls, 0 clqs
2.89/2.99 c (round 11) 6559 del vars, 22132 del conss, 4930 chg bounds, 55 chg sides, 82 chg coeffs, 8105 upgd conss, 1696014 impls, 112 clqs
2.99/3.03 c (round 12) 6578 del vars, 22206 del conss, 4932 chg bounds, 59 chg sides, 106 chg coeffs, 8105 upgd conss, 1697226 impls, 122 clqs
2.99/3.06 c (round 13) 6580 del vars, 22222 del conss, 4932 chg bounds, 59 chg sides, 114 chg coeffs, 8105 upgd conss, 1697226 impls, 121 clqs
3.09/3.10 c presolving (14 rounds):
3.09/3.10 c 6580 deleted vars, 22222 deleted constraints, 4932 tightened bounds, 0 added holes, 59 changed sides, 117 changed coefficients
3.09/3.10 c 1697226 implications, 128 cliques
3.09/3.10 c presolved problem has 3058 variables (3058 bin, 0 int, 0 impl, 0 cont) and 7998 constraints
3.09/3.10 c 261 constraints of type <knapsack>
3.09/3.10 c 6346 constraints of type <setppc>
3.09/3.10 c 1391 constraints of type <logicor>
3.09/3.10 c transformed objective value is always integral (scale: 1)
3.09/3.10 c Presolving Time: 2.53
3.09/3.10 c - non default parameters ----------------------------------------------------------------------
3.09/3.10 c # SCIP version 1.2.1.3
3.09/3.10 c
3.09/3.10 c # frequency for displaying node information lines
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 100]
3.09/3.10 c display/freq = 10000
3.09/3.10 c
3.09/3.10 c # maximal time in seconds to run
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.09/3.10 c limits/time = 1789.53
3.09/3.10 c
3.09/3.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.09/3.10 c limits/memory = 1620
3.09/3.10 c
3.09/3.10 c # solving stops, if the given number of solutions were found (-1: no limit)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.10 c limits/solutions = 1
3.09/3.10 c
3.09/3.10 c # maximal number of separation rounds per node (-1: unlimited)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 5]
3.09/3.10 c separating/maxrounds = 1
3.09/3.10 c
3.09/3.10 c # maximal number of separation rounds in the root node (-1: unlimited)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.10 c separating/maxroundsroot = 5
3.09/3.10 c
3.09/3.10 c # default clock type (1: CPU user seconds, 2: wall clock time)
3.09/3.10 c # [type: int, range: [1,2], default: 1]
3.09/3.10 c timing/clocktype = 2
3.09/3.10 c
3.09/3.10 c # should presolving try to simplify inequalities
3.09/3.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.09/3.10 c constraints/linear/simplifyinequalities = TRUE
3.09/3.10 c
3.09/3.10 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
3.09/3.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.09/3.10 c constraints/indicator/addCouplingCons = TRUE
3.09/3.10 c
3.09/3.10 c # should disaggregation of knapsack constraints be allowed in preprocessing?
3.09/3.10 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
3.09/3.10 c constraints/knapsack/disaggregation = FALSE
3.09/3.10 c
3.09/3.10 c # should presolving try to simplify knapsacks
3.09/3.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.09/3.10 c constraints/knapsack/simplifyinequalities = TRUE
3.09/3.10 c
3.09/3.10 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.10 c presolving/probing/maxrounds = 0
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/coefdiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/coefdiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/coefdiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 30]
3.09/3.10 c heuristics/crossover/freq = -1
3.09/3.10 c
3.09/3.10 c # number of nodes added to the contingent of the total nodes
3.09/3.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.09/3.10 c heuristics/crossover/nodesofs = 750
3.09/3.10 c
3.09/3.10 c # number of nodes without incumbent change that heuristic should wait
3.09/3.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
3.09/3.10 c heuristics/crossover/nwaitingnodes = 100
3.09/3.10 c
3.09/3.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
3.09/3.10 c # [type: real, range: [0,1], default: 0.1]
3.09/3.10 c heuristics/crossover/nodesquot = 0.15
3.09/3.10 c
3.09/3.10 c # minimum percentage of integer variables that have to be fixed
3.09/3.10 c # [type: real, range: [0,1], default: 0.666]
3.09/3.10 c heuristics/crossover/minfixingrate = 0.5
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 20]
3.09/3.10 c heuristics/feaspump/freq = -1
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/feaspump/maxlpiterofs = 2000
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/fracdiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/fracdiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/fracdiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/guideddiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/guideddiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/guideddiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/intdiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/intshifting/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/linesearchdiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/linesearchdiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/linesearchdiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/nlp/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 20]
3.09/3.10 c heuristics/objpscostdiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to total iteration number
3.09/3.10 c # [type: real, range: [0,1], default: 0.01]
3.09/3.10 c heuristics/objpscostdiving/maxlpiterquot = 0.015
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/objpscostdiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/oneopt/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/pscostdiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/pscostdiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/pscostdiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 0]
3.09/3.10 c heuristics/rens/freq = -1
3.09/3.10 c
3.09/3.10 c # minimum percentage of integer variables that have to be fixable
3.09/3.10 c # [type: real, range: [0,1], default: 0.5]
3.09/3.10 c heuristics/rens/minfixingrate = 0.3
3.09/3.10 c
3.09/3.10 c # number of nodes added to the contingent of the total nodes
3.09/3.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.09/3.10 c heuristics/rens/nodesofs = 2000
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 20]
3.09/3.10 c heuristics/rootsoldiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
3.09/3.10 c heuristics/rootsoldiving/maxlpiterquot = 0.015
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/rootsoldiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/rounding/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/shifting/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/simplerounding/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 0]
3.09/3.10 c heuristics/trivial/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/trysol/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 10]
3.09/3.10 c heuristics/veclendiving/freq = -1
3.09/3.10 c
3.09/3.10 c # maximal fraction of diving LP iterations compared to node LP iterations
3.09/3.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.09/3.10 c heuristics/veclendiving/maxlpiterquot = 0.075
3.09/3.10 c
3.09/3.10 c # additional number of allowed LP iterations
3.09/3.10 c # [type: int, range: [0,2147483647], default: 1000]
3.09/3.10 c heuristics/veclendiving/maxlpiterofs = 1500
3.09/3.10 c
3.09/3.10 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 1]
3.09/3.10 c heuristics/zirounding/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 0]
3.09/3.10 c separating/cmir/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: 0]
3.09/3.10 c separating/flowcover/freq = -1
3.09/3.10 c
3.09/3.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
3.09/3.10 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.10 c separating/rapidlearning/freq = 0
3.09/3.10 c
3.09/3.10 c -----------------------------------------------------------------------------------------------
3.09/3.10 c start solving
3.09/3.10 c
13.99/14.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
13.99/14.09 c 13.6s| 1 | 0 | 6693 | - | 48M| 0 |1641 |3058 |7998 |3058 |7977 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
58.27/58.38 c 57.9s| 1 | 0 | 19616 | - | 51M| 0 | - |3058 |8909 |3058 |8073 | 96 | 0 | 0 | -- | -- | 0.00%
58.27/58.38 c 57.9s| 1 | 0 | 19616 | - | 51M| 0 | - |3058 |8909 |3058 |8073 | 96 | 0 | 0 | -- | -- | 0.00%
58.27/58.38 c
58.27/58.38 c SCIP Status : problem is solved [infeasible]
58.27/58.38 c Solving Time (sec) : 57.91
58.27/58.38 c Solving Nodes : 1
58.27/58.38 c Primal Bound : +1.00000000000000e+20 (0 solutions)
58.27/58.38 c Dual Bound : +1.00000000000000e+20
58.27/58.38 c Gap : 0.00 %
58.27/58.38 s UNSATISFIABLE
58.27/58.38 c SCIP Status : problem is solved [infeasible]
58.27/58.38 c Solving Time : 57.91
58.27/58.38 c Original Problem :
58.27/58.38 c Problem name : HOME/instance-2704753-1278580673.opb
58.27/58.38 c Variables : 9638 (9638 binary, 0 integer, 0 implicit integer, 0 continuous)
58.27/58.38 c Constraints : 30220 initial, 30220 maximal
58.27/58.38 c Presolved Problem :
58.27/58.38 c Problem name : t_HOME/instance-2704753-1278580673.opb
58.27/58.38 c Variables : 3058 (3058 binary, 0 integer, 0 implicit integer, 0 continuous)
58.27/58.38 c Constraints : 7998 initial, 8909 maximal
58.27/58.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
58.27/58.38 c trivial : 0.01 329 0 0 0 0 0 0 0
58.27/58.38 c dualfix : 0.02 57 0 0 0 0 0 0 0
58.27/58.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
58.27/58.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
58.27/58.38 c implics : 0.04 0 21 0 0 0 0 0 0
58.27/58.38 c probing : 0.00 0 0 0 0 0 0 0 0
58.27/58.38 c knapsack : 0.09 0 0 0 2 0 0 8 84
58.27/58.38 c setppc : 0.03 10 0 0 4 0 106 0 0
58.27/58.38 c linear : 2.17 4603 1560 0 4920 0 22115 51 33
58.27/58.38 c logicor : 0.04 0 0 0 6 0 1 0 0
58.27/58.38 c root node : - 0 - - 0 - - - -
58.27/58.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
58.27/58.38 c integral : 0 0 0 0 0 0 0 0 0 0
58.27/58.38 c knapsack : 261 1 1 0 0 0 0 200 0 0
58.27/58.38 c setppc : 6346 1 1 0 0 0 0 0 0 0
58.27/58.38 c linear : 0+ 1 1 0 0 0 0 8 0 0
58.27/58.38 c logicor : 1391 1 1 0 0 0 0 0 0 0
58.27/58.38 c countsols : 0 0 0 0 0 0 0 0 0 0
58.27/58.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
58.27/58.38 c integral : 0.00 0.00 0.00 0.00 0.00
58.27/58.38 c knapsack : 0.01 0.01 0.00 0.00 0.00
58.27/58.38 c setppc : 0.00 0.00 0.00 0.00 0.00
58.27/58.38 c linear : 0.01 0.00 0.01 0.00 0.00
58.27/58.38 c logicor : 0.00 0.00 0.00 0.00 0.00
58.27/58.38 c countsols : 0.00 0.00 0.00 0.00 0.00
58.27/58.38 c Propagators : Time Calls Cutoffs DomReds
58.27/58.38 c vbounds : 0.00 1 0 0
58.27/58.38 c rootredcost : 0.00 0 0 0
58.27/58.38 c pseudoobj : 0.00 0 0 0
58.27/58.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
58.27/58.38 c propagation : 0.00 0 0 0 0.0 0 0.0 -
58.27/58.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
58.27/58.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
58.27/58.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
58.27/58.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
58.27/58.38 c applied globally : - - - 0 0.0 - - -
58.27/58.38 c applied locally : - - - 0 0.0 - - -
58.27/58.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
58.27/58.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 16)
58.27/58.38 c redcost : 0.00 1 0 0 0 0
58.27/58.38 c impliedbounds : 0.01 1 0 0 14 0
58.27/58.38 c intobj : 0.00 0 0 0 0 0
58.27/58.38 c cgmip : 0.00 0 0 0 0 0
58.27/58.38 c gomory : 1.19 1 0 0 207 0
58.27/58.38 c strongcg : 1.18 1 0 0 207 0
58.27/58.38 c cmir : 0.00 0 0 0 0 0
58.27/58.38 c flowcover : 0.00 0 0 0 0 0
58.27/58.38 c clique : 0.21 1 0 0 7 0
58.27/58.38 c zerohalf : 0.00 0 0 0 0 0
58.27/58.38 c mcf : 0.03 1 0 0 0 0
58.27/58.38 c rapidlearning : 8.59 1 0 0 0 911
58.27/58.38 c Pricers : Time Calls Vars
58.27/58.38 c problem variables: 0.00 0 0
58.27/58.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
58.27/58.38 c pscost : 0.00 0 0 0 0 0 0
58.27/58.38 c inference : 0.00 0 0 0 0 0 0
58.27/58.38 c mostinf : 0.00 0 0 0 0 0 0
58.27/58.38 c leastinf : 0.00 0 0 0 0 0 0
58.27/58.38 c fullstrong : 0.00 0 0 0 0 0 0
58.27/58.38 c allfullstrong : 0.00 0 0 0 0 0 0
58.27/58.38 c random : 0.00 0 0 0 0 0 0
58.27/58.38 c relpscost : 0.00 0 0 0 0 0 0
58.27/58.38 c Primal Heuristics : Time Calls Found
58.27/58.38 c LP solutions : 0.00 - 0
58.27/58.38 c pseudo solutions : 0.00 - 0
58.27/58.38 c trivial : 0.02 1 0
58.27/58.38 c simplerounding : 0.00 0 0
58.27/58.38 c zirounding : 0.00 0 0
58.27/58.38 c rounding : 0.00 0 0
58.27/58.38 c shifting : 0.00 0 0
58.27/58.38 c intshifting : 0.00 0 0
58.27/58.38 c oneopt : 0.00 0 0
58.27/58.38 c twoopt : 0.00 0 0
58.27/58.38 c fixandinfer : 0.00 0 0
58.27/58.38 c feaspump : 0.00 0 0
58.27/58.38 c coefdiving : 0.00 0 0
58.27/58.38 c pscostdiving : 0.00 0 0
58.27/58.38 c fracdiving : 0.00 0 0
58.27/58.38 c veclendiving : 0.00 0 0
58.27/58.38 c intdiving : 0.00 0 0
58.27/58.38 c actconsdiving : 0.00 0 0
58.27/58.38 c objpscostdiving : 0.00 0 0
58.27/58.38 c rootsoldiving : 0.00 0 0
58.27/58.38 c linesearchdiving : 0.00 0 0
58.27/58.38 c guideddiving : 0.00 0 0
58.27/58.38 c octane : 0.00 0 0
58.27/58.38 c rens : 0.00 0 0
58.27/58.38 c rins : 0.00 0 0
58.27/58.38 c localbranching : 0.00 0 0
58.27/58.38 c mutation : 0.00 0 0
58.27/58.38 c crossover : 0.00 0 0
58.27/58.38 c dins : 0.00 0 0
58.27/58.38 c undercover : 0.00 0 0
58.27/58.38 c nlp : 0.00 0 0
58.27/58.38 c trysol : 0.00 0 0
58.27/58.38 c LP : Time Calls Iterations Iter/call Iter/sec
58.27/58.38 c primal LP : 0.00 0 0 0.00 -
58.27/58.38 c dual LP : 44.01 2 19616 9808.00 445.70
58.27/58.38 c lex dual LP : 0.00 0 0 0.00 -
58.27/58.38 c barrier LP : 0.00 0 0 0.00 -
58.27/58.38 c diving/probing LP: 0.00 0 0 0.00 -
58.27/58.38 c strong branching : 0.00 0 0 0.00 -
58.27/58.38 c (at root node) : - 0 0 0.00 -
58.27/58.38 c conflict analysis: 0.00 0 0 0.00 -
58.27/58.38 c B&B Tree :
58.27/58.38 c number of runs : 1
58.27/58.38 c nodes : 1
58.27/58.38 c nodes (total) : 1
58.27/58.38 c nodes left : 0
58.27/58.38 c max depth : 0
58.27/58.38 c max depth (total): 0
58.27/58.38 c backtracks : 0 (0.0%)
58.27/58.38 c delayed cutoffs : 0
58.27/58.38 c repropagations : 0 (0 domain reductions, 0 cutoffs)
58.27/58.38 c avg switch length: 2.00
58.27/58.38 c switching time : 0.00
58.27/58.38 c Solution :
58.27/58.38 c Solutions found : 0 (0 improvements)
58.27/58.38 c Primal Bound : infeasible
58.27/58.38 c Dual Bound : -
58.27/58.38 c Gap : 0.00 %
58.27/58.38 c Root Dual Bound : -
58.27/58.38 c Root Iterations : 19616
58.46/58.51 c Time complete: 58.48.