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-2704740-1278580637.opb>
0.59/0.62 c original problem has 12322 variables (12322 bin, 0 int, 0 impl, 0 cont) and 38967 constraints
0.59/0.62 c problem read
0.59/0.63 c No objective function, only one solution is needed.
0.59/0.63 c presolving settings loaded
0.79/0.85 c presolving:
2.89/2.98 c (round 1) 1928 del vars, 5359 del conss, 1269 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2408864 impls, 0 clqs
3.89/3.99 c (round 2) 4896 del vars, 15276 del conss, 4027 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2423259 impls, 0 clqs
4.08/4.12 c (round 3) 5906 del vars, 20188 del conss, 4614 chg bounds, 13 chg sides, 17 chg coeffs, 0 upgd conss, 2427306 impls, 0 clqs
4.08/4.18 c (round 4) 6135 del vars, 21424 del conss, 4756 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2429143 impls, 0 clqs
4.18/4.21 c (round 5) 6238 del vars, 21835 del conss, 4809 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430144 impls, 0 clqs
4.18/4.24 c (round 6) 6315 del vars, 22114 del conss, 4858 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430630 impls, 0 clqs
4.18/4.26 c (round 7) 6346 del vars, 22238 del conss, 4872 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430921 impls, 0 clqs
4.18/4.27 c (round 8) 6353 del vars, 22278 del conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2431034 impls, 0 clqs
4.18/4.29 c (round 9) 6353 del vars, 22281 del conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2431034 impls, 0 clqs
4.40/4.45 c (round 10) 6353 del vars, 22283 del conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 16684 upgd conss, 2431034 impls, 0 clqs
4.69/4.70 c presolving (11 rounds):
4.69/4.70 c 6353 deleted vars, 22283 deleted constraints, 4874 tightened bounds, 0 added holes, 19 changed sides, 58 changed coefficients
4.69/4.70 c 2431120 implications, 105 cliques
4.69/4.70 c presolved problem has 5969 variables (5969 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
4.69/4.70 c 368 constraints of type <knapsack>
4.69/4.70 c 13486 constraints of type <setppc>
4.69/4.70 c 2830 constraints of type <logicor>
4.69/4.70 c transformed objective value is always integral (scale: 1)
4.69/4.70 c Presolving Time: 3.92
4.69/4.70 c - non default parameters ----------------------------------------------------------------------
4.69/4.70 c # SCIP version 1.2.1.3
4.69/4.70 c
4.69/4.70 c # frequency for displaying node information lines
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 100]
4.69/4.70 c display/freq = 10000
4.69/4.70 c
4.69/4.70 c # maximal time in seconds to run
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.69/4.70 c limits/time = 1789.38
4.69/4.70 c
4.69/4.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.69/4.70 c limits/memory = 1620
4.69/4.70 c
4.69/4.70 c # solving stops, if the given number of solutions were found (-1: no limit)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: -1]
4.69/4.70 c limits/solutions = 1
4.69/4.70 c
4.69/4.70 c # maximal number of separation rounds per node (-1: unlimited)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 5]
4.69/4.70 c separating/maxrounds = 1
4.69/4.70 c
4.69/4.70 c # maximal number of separation rounds in the root node (-1: unlimited)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: -1]
4.69/4.70 c separating/maxroundsroot = 5
4.69/4.70 c
4.69/4.70 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.69/4.70 c # [type: int, range: [1,2], default: 1]
4.69/4.70 c timing/clocktype = 2
4.69/4.70 c
4.69/4.70 c # should presolving try to simplify inequalities
4.69/4.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.69/4.70 c constraints/linear/simplifyinequalities = TRUE
4.69/4.70 c
4.69/4.70 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.69/4.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.69/4.70 c constraints/indicator/addCouplingCons = TRUE
4.69/4.70 c
4.69/4.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.69/4.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.69/4.70 c constraints/knapsack/disaggregation = FALSE
4.69/4.70 c
4.69/4.70 c # should presolving try to simplify knapsacks
4.69/4.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.69/4.70 c constraints/knapsack/simplifyinequalities = TRUE
4.69/4.70 c
4.69/4.70 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: -1]
4.69/4.70 c presolving/probing/maxrounds = 0
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/coefdiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/coefdiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/coefdiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 30]
4.69/4.70 c heuristics/crossover/freq = -1
4.69/4.70 c
4.69/4.70 c # number of nodes added to the contingent of the total nodes
4.69/4.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.69/4.70 c heuristics/crossover/nodesofs = 750
4.69/4.70 c
4.69/4.70 c # number of nodes without incumbent change that heuristic should wait
4.69/4.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.69/4.70 c heuristics/crossover/nwaitingnodes = 100
4.69/4.70 c
4.69/4.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.69/4.70 c # [type: real, range: [0,1], default: 0.1]
4.69/4.70 c heuristics/crossover/nodesquot = 0.15
4.69/4.70 c
4.69/4.70 c # minimum percentage of integer variables that have to be fixed
4.69/4.70 c # [type: real, range: [0,1], default: 0.666]
4.69/4.70 c heuristics/crossover/minfixingrate = 0.5
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 20]
4.69/4.70 c heuristics/feaspump/freq = -1
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/feaspump/maxlpiterofs = 2000
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/fracdiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/fracdiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/fracdiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/guideddiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/guideddiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/guideddiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/intdiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/intshifting/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/linesearchdiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/nlp/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 20]
4.69/4.70 c heuristics/objpscostdiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to total iteration number
4.69/4.70 c # [type: real, range: [0,1], default: 0.01]
4.69/4.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/oneopt/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/pscostdiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/pscostdiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 0]
4.69/4.70 c heuristics/rens/freq = -1
4.69/4.70 c
4.69/4.70 c # minimum percentage of integer variables that have to be fixable
4.69/4.70 c # [type: real, range: [0,1], default: 0.5]
4.69/4.70 c heuristics/rens/minfixingrate = 0.3
4.69/4.70 c
4.69/4.70 c # number of nodes added to the contingent of the total nodes
4.69/4.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.69/4.70 c heuristics/rens/nodesofs = 2000
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 20]
4.69/4.70 c heuristics/rootsoldiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.69/4.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/rounding/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/shifting/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/simplerounding/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 0]
4.69/4.70 c heuristics/trivial/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/trysol/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 10]
4.69/4.70 c heuristics/veclendiving/freq = -1
4.69/4.70 c
4.69/4.70 c # maximal fraction of diving LP iterations compared to node LP iterations
4.69/4.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.69/4.70 c heuristics/veclendiving/maxlpiterquot = 0.075
4.69/4.70 c
4.69/4.70 c # additional number of allowed LP iterations
4.69/4.70 c # [type: int, range: [0,2147483647], default: 1000]
4.69/4.70 c heuristics/veclendiving/maxlpiterofs = 1500
4.69/4.70 c
4.69/4.70 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 1]
4.69/4.70 c heuristics/zirounding/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 0]
4.69/4.70 c separating/cmir/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: 0]
4.69/4.70 c separating/flowcover/freq = -1
4.69/4.70 c
4.69/4.70 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.69/4.70 c # [type: int, range: [-1,2147483647], default: -1]
4.69/4.70 c separating/rapidlearning/freq = 0
4.69/4.70 c
4.69/4.70 c -----------------------------------------------------------------------------------------------
4.69/4.70 c start solving
4.69/4.71 c
77.66/77.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
77.66/77.71 c 77.1s| 1 | 0 | 15733 | - | 81M| 0 | - |5969 | 16k|5969 | 16k| 0 | 0 | 0 | -- | -- | 0.00%
77.66/77.71 c 77.1s| 1 | 0 | 15733 | - | 81M| 0 | - |5969 | 16k|5969 | 16k| 0 | 0 | 0 | -- | -- | 0.00%
77.66/77.71 c
77.66/77.71 c SCIP Status : problem is solved [infeasible]
77.66/77.71 c Solving Time (sec) : 77.08
77.66/77.71 c Solving Nodes : 1
77.66/77.71 c Primal Bound : +1.00000000000000e+20 (0 solutions)
77.66/77.71 c Dual Bound : +1.00000000000000e+20
77.66/77.71 c Gap : 0.00 %
77.66/77.71 s UNSATISFIABLE
77.66/77.71 c SCIP Status : problem is solved [infeasible]
77.66/77.71 c Solving Time : 77.08
77.66/77.71 c Original Problem :
77.66/77.71 c Problem name : HOME/instance-2704740-1278580637.opb
77.66/77.71 c Variables : 12322 (12322 binary, 0 integer, 0 implicit integer, 0 continuous)
77.66/77.71 c Constraints : 38967 initial, 38967 maximal
77.66/77.71 c Presolved Problem :
77.66/77.71 c Problem name : t_HOME/instance-2704740-1278580637.opb
77.66/77.71 c Variables : 5969 (5969 binary, 0 integer, 0 implicit integer, 0 continuous)
77.66/77.71 c Constraints : 16684 initial, 16684 maximal
77.66/77.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
77.66/77.71 c trivial : 0.02 324 0 0 0 0 0 0 0
77.66/77.71 c dualfix : 0.03 53 0 0 0 0 0 0 0
77.66/77.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
77.66/77.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
77.66/77.71 c implics : 0.06 0 0 0 0 0 0 0 0
77.66/77.71 c probing : 0.00 0 0 0 0 0 0 0 0
77.66/77.71 c knapsack : 0.18 0 0 0 0 0 0 0 35
77.66/77.71 c setppc : 0.05 0 0 0 0 0 0 0 0
77.66/77.71 c linear : 3.41 4550 1426 0 4874 0 22283 19 23
77.66/77.71 c logicor : 0.03 0 0 0 0 0 0 0 0
77.66/77.71 c root node : - 0 - - 0 - - - -
77.66/77.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
77.66/77.71 c integral : 0 0 0 0 0 0 0 0 0 0
77.66/77.71 c knapsack : 368 0 1 0 0 0 0 0 0 0
77.66/77.71 c setppc : 13486 0 1 0 0 0 0 0 0 0
77.66/77.71 c logicor : 2830 0 1 0 0 0 0 0 0 0
77.66/77.71 c countsols : 0 0 0 0 0 0 0 0 0 0
77.66/77.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
77.66/77.71 c integral : 0.00 0.00 0.00 0.00 0.00
77.66/77.71 c knapsack : 0.00 0.00 0.00 0.00 0.00
77.66/77.71 c setppc : 0.00 0.00 0.00 0.00 0.00
77.66/77.71 c logicor : 0.01 0.00 0.01 0.00 0.00
77.66/77.71 c countsols : 0.00 0.00 0.00 0.00 0.00
77.66/77.71 c Propagators : Time Calls Cutoffs DomReds
77.66/77.71 c vbounds : 0.00 1 0 0
77.66/77.71 c rootredcost : 0.00 0 0 0
77.66/77.71 c pseudoobj : 0.00 0 0 0
77.66/77.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
77.66/77.71 c propagation : 0.00 0 0 0 0.0 0 0.0 -
77.66/77.71 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
77.66/77.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
77.66/77.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
77.66/77.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
77.66/77.71 c applied globally : - - - 0 0.0 - - -
77.66/77.71 c applied locally : - - - 0 0.0 - - -
77.66/77.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
77.66/77.71 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
77.66/77.71 c redcost : 0.00 0 0 0 0 0
77.66/77.71 c impliedbounds : 0.00 0 0 0 0 0
77.66/77.71 c intobj : 0.00 0 0 0 0 0
77.66/77.71 c cgmip : 0.00 0 0 0 0 0
77.66/77.71 c gomory : 0.00 0 0 0 0 0
77.66/77.71 c strongcg : 0.00 0 0 0 0 0
77.66/77.71 c cmir : 0.00 0 0 0 0 0
77.66/77.71 c flowcover : 0.00 0 0 0 0 0
77.66/77.71 c clique : 0.00 0 0 0 0 0
77.66/77.71 c zerohalf : 0.00 0 0 0 0 0
77.66/77.71 c mcf : 0.00 0 0 0 0 0
77.66/77.71 c rapidlearning : 0.00 0 0 0 0 0
77.66/77.71 c Pricers : Time Calls Vars
77.66/77.71 c problem variables: 0.00 0 0
77.66/77.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
77.66/77.71 c pscost : 0.00 0 0 0 0 0 0
77.66/77.71 c inference : 0.00 0 0 0 0 0 0
77.66/77.71 c mostinf : 0.00 0 0 0 0 0 0
77.66/77.71 c leastinf : 0.00 0 0 0 0 0 0
77.66/77.71 c fullstrong : 0.00 0 0 0 0 0 0
77.66/77.71 c allfullstrong : 0.00 0 0 0 0 0 0
77.66/77.71 c random : 0.00 0 0 0 0 0 0
77.66/77.71 c relpscost : 0.00 0 0 0 0 0 0
77.66/77.71 c Primal Heuristics : Time Calls Found
77.66/77.71 c LP solutions : 0.00 - 0
77.66/77.71 c pseudo solutions : 0.00 - 0
77.66/77.71 c trivial : 0.02 1 0
77.66/77.71 c simplerounding : 0.00 0 0
77.66/77.71 c zirounding : 0.00 0 0
77.66/77.71 c rounding : 0.00 0 0
77.66/77.71 c shifting : 0.00 0 0
77.66/77.71 c intshifting : 0.00 0 0
77.66/77.71 c oneopt : 0.00 0 0
77.66/77.71 c twoopt : 0.00 0 0
77.66/77.71 c fixandinfer : 0.00 0 0
77.66/77.71 c feaspump : 0.00 0 0
77.66/77.71 c coefdiving : 0.00 0 0
77.66/77.71 c pscostdiving : 0.00 0 0
77.66/77.71 c fracdiving : 0.00 0 0
77.66/77.71 c veclendiving : 0.00 0 0
77.66/77.71 c intdiving : 0.00 0 0
77.66/77.71 c actconsdiving : 0.00 0 0
77.66/77.71 c objpscostdiving : 0.00 0 0
77.66/77.71 c rootsoldiving : 0.00 0 0
77.66/77.71 c linesearchdiving : 0.00 0 0
77.66/77.71 c guideddiving : 0.00 0 0
77.66/77.71 c octane : 0.00 0 0
77.66/77.71 c rens : 0.00 0 0
77.66/77.71 c rins : 0.00 0 0
77.66/77.71 c localbranching : 0.00 0 0
77.66/77.71 c mutation : 0.00 0 0
77.66/77.71 c crossover : 0.00 0 0
77.66/77.71 c dins : 0.00 0 0
77.66/77.71 c undercover : 0.00 0 0
77.66/77.71 c nlp : 0.00 0 0
77.66/77.71 c trysol : 0.00 0 0
77.66/77.71 c LP : Time Calls Iterations Iter/call Iter/sec
77.66/77.71 c primal LP : 0.00 0 0 0.00 -
77.66/77.71 c dual LP : 72.91 1 15733 15733.00 215.80
77.66/77.71 c lex dual LP : 0.00 0 0 0.00 -
77.66/77.71 c barrier LP : 0.00 0 0 0.00 -
77.66/77.71 c diving/probing LP: 0.00 0 0 0.00 -
77.66/77.71 c strong branching : 0.00 0 0 0.00 -
77.66/77.71 c (at root node) : - 0 0 0.00 -
77.66/77.71 c conflict analysis: 0.00 0 0 0.00 -
77.66/77.71 c B&B Tree :
77.66/77.71 c number of runs : 1
77.66/77.71 c nodes : 1
77.66/77.71 c nodes (total) : 1
77.66/77.71 c nodes left : 0
77.66/77.71 c max depth : 0
77.66/77.71 c max depth (total): 0
77.66/77.71 c backtracks : 0 (0.0%)
77.66/77.71 c delayed cutoffs : 0
77.66/77.71 c repropagations : 0 (0 domain reductions, 0 cutoffs)
77.66/77.71 c avg switch length: 2.00
77.66/77.71 c switching time : 0.00
77.66/77.71 c Solution :
77.66/77.71 c Solutions found : 0 (0 improvements)
77.66/77.71 c Primal Bound : infeasible
77.66/77.71 c Dual Bound : -
77.66/77.71 c Gap : 0.00 %
77.66/77.71 c Root Dual Bound : -
77.66/77.71 c Root Iterations : 15733
77.77/77.89 c Time complete: 77.85.