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-2684913-1278436410.opb>
1.69/1.70 c original problem has 30492 variables (30492 bin, 0 int, 0 impl, 0 cont) and 105829 constraints
1.69/1.70 c problem read
1.69/1.70 c No objective function, only one solution is needed.
1.69/1.70 c presolving settings loaded
2.20/2.22 c presolving:
6.79/6.87 c (round 1) 7419 del vars, 21344 del conss, 5855 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5855558 impls, 0 clqs
9.29/9.34 c (round 2) 13940 del vars, 50899 del conss, 11845 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5904630 impls, 0 clqs
9.80/9.82 c (round 3) 17171 del vars, 64625 del conss, 14113 chg bounds, 44 chg sides, 20 chg coeffs, 0 upgd conss, 5923632 impls, 0 clqs
9.99/10.04 c (round 4) 18596 del vars, 70085 del conss, 15190 chg bounds, 59 chg sides, 35 chg coeffs, 0 upgd conss, 5938283 impls, 0 clqs
10.09/10.18 c (round 5) 19605 del vars, 73640 del conss, 15863 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5947940 impls, 0 clqs
10.19/10.27 c (round 6) 20118 del vars, 75565 del conss, 16185 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5953442 impls, 0 clqs
10.29/10.34 c (round 7) 20446 del vars, 76783 del conss, 16387 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5956441 impls, 0 clqs
10.39/10.40 c (round 8) 20638 del vars, 77543 del conss, 16484 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958002 impls, 0 clqs
10.39/10.45 c (round 9) 20710 del vars, 77866 del conss, 16525 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958292 impls, 0 clqs
10.39/10.49 c (round 10) 20740 del vars, 77986 del conss, 16541 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958500 impls, 0 clqs
10.48/10.53 c (round 11) 20752 del vars, 78039 del conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958552 impls, 0 clqs
10.48/10.57 c (round 12) 20752 del vars, 78047 del conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958552 impls, 0 clqs
10.90/10.91 c (round 13) 20752 del vars, 78047 del conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 27782 upgd conss, 5958552 impls, 0 clqs
11.09/11.13 c (round 14) 20752 del vars, 78047 del conss, 16546 chg bounds, 78 chg sides, 123 chg coeffs, 27782 upgd conss, 5959426 impls, 372 clqs
11.29/11.31 c (round 15) 20752 del vars, 78047 del conss, 16546 chg bounds, 81 chg sides, 138 chg coeffs, 27782 upgd conss, 5959426 impls, 442 clqs
11.39/11.40 c presolving (16 rounds):
11.39/11.40 c 20752 deleted vars, 78047 deleted constraints, 16546 tightened bounds, 0 added holes, 81 changed sides, 138 changed coefficients
11.39/11.40 c 5959426 implications, 443 cliques
11.39/11.40 c presolved problem has 9740 variables (9740 bin, 0 int, 0 impl, 0 cont) and 27782 constraints
11.39/11.40 c 448 constraints of type <knapsack>
11.39/11.40 c 27334 constraints of type <logicor>
11.39/11.40 c transformed objective value is always integral (scale: 1)
11.39/11.40 c Presolving Time: 8.83
11.39/11.40 c - non default parameters ----------------------------------------------------------------------
11.39/11.40 c # SCIP version 1.2.1.2
11.39/11.40 c
11.39/11.40 c # frequency for displaying node information lines
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 100]
11.39/11.40 c display/freq = 10000
11.39/11.40 c
11.39/11.40 c # maximal time in seconds to run
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.39/11.40 c limits/time = 1798.3
11.39/11.40 c
11.39/11.40 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.39/11.40 c limits/memory = 1620
11.39/11.40 c
11.39/11.40 c # solving stops, if the given number of solutions were found (-1: no limit)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: -1]
11.39/11.40 c limits/solutions = 1
11.39/11.40 c
11.39/11.40 c # maximal number of separation rounds per node (-1: unlimited)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 5]
11.39/11.40 c separating/maxrounds = 1
11.39/11.40 c
11.39/11.40 c # maximal number of separation rounds in the root node (-1: unlimited)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: -1]
11.39/11.40 c separating/maxroundsroot = 5
11.39/11.40 c
11.39/11.40 c # should presolving try to simplify inequalities
11.39/11.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.39/11.40 c constraints/linear/simplifyinequalities = TRUE
11.39/11.40 c
11.39/11.40 c # should disaggregation of knapsack constraints be allowed in preprocessing?
11.39/11.40 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
11.39/11.40 c constraints/knapsack/disaggregation = FALSE
11.39/11.40 c
11.39/11.40 c # should presolving try to simplify knapsacks
11.39/11.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.39/11.40 c constraints/knapsack/simplifyinequalities = TRUE
11.39/11.40 c
11.39/11.40 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: -1]
11.39/11.40 c presolving/probing/maxrounds = 0
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/coefdiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/coefdiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/coefdiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 30]
11.39/11.40 c heuristics/crossover/freq = -1
11.39/11.40 c
11.39/11.40 c # number of nodes added to the contingent of the total nodes
11.39/11.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.39/11.40 c heuristics/crossover/nodesofs = 750
11.39/11.40 c
11.39/11.40 c # number of nodes without incumbent change that heuristic should wait
11.39/11.40 c # [type: longint, range: [0,9223372036854775807], default: 200]
11.39/11.40 c heuristics/crossover/nwaitingnodes = 100
11.39/11.40 c
11.39/11.40 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
11.39/11.40 c # [type: real, range: [0,1], default: 0.1]
11.39/11.40 c heuristics/crossover/nodesquot = 0.15
11.39/11.40 c
11.39/11.40 c # minimum percentage of integer variables that have to be fixed
11.39/11.40 c # [type: real, range: [0,1], default: 0.666]
11.39/11.40 c heuristics/crossover/minfixingrate = 0.5
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 20]
11.39/11.40 c heuristics/feaspump/freq = -1
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/feaspump/maxlpiterofs = 2000
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/fracdiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/fracdiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/fracdiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/guideddiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/guideddiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/guideddiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/intdiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/intshifting/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/linesearchdiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/linesearchdiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/linesearchdiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/nlp/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 20]
11.39/11.40 c heuristics/objpscostdiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to total iteration number
11.39/11.40 c # [type: real, range: [0,1], default: 0.01]
11.39/11.40 c heuristics/objpscostdiving/maxlpiterquot = 0.015
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/objpscostdiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/oneopt/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/pscostdiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/pscostdiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/pscostdiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 0]
11.39/11.40 c heuristics/rens/freq = -1
11.39/11.40 c
11.39/11.40 c # minimum percentage of integer variables that have to be fixable
11.39/11.40 c # [type: real, range: [0,1], default: 0.5]
11.39/11.40 c heuristics/rens/minfixingrate = 0.3
11.39/11.40 c
11.39/11.40 c # number of nodes added to the contingent of the total nodes
11.39/11.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.39/11.40 c heuristics/rens/nodesofs = 2000
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 20]
11.39/11.40 c heuristics/rootsoldiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
11.39/11.40 c heuristics/rootsoldiving/maxlpiterquot = 0.015
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/rootsoldiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/rounding/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/shifting/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/simplerounding/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 0]
11.39/11.40 c heuristics/trivial/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/trysol/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 10]
11.39/11.40 c heuristics/veclendiving/freq = -1
11.39/11.40 c
11.39/11.40 c # maximal fraction of diving LP iterations compared to node LP iterations
11.39/11.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.39/11.40 c heuristics/veclendiving/maxlpiterquot = 0.075
11.39/11.40 c
11.39/11.40 c # additional number of allowed LP iterations
11.39/11.40 c # [type: int, range: [0,2147483647], default: 1000]
11.39/11.40 c heuristics/veclendiving/maxlpiterofs = 1500
11.39/11.40 c
11.39/11.40 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 1]
11.39/11.40 c heuristics/zirounding/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 0]
11.39/11.40 c separating/cmir/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: 0]
11.39/11.40 c separating/flowcover/freq = -1
11.39/11.40 c
11.39/11.40 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
11.39/11.40 c # [type: int, range: [-1,2147483647], default: -1]
11.39/11.40 c separating/rapidlearning/freq = 0
11.39/11.40 c
11.39/11.40 c -----------------------------------------------------------------------------------------------
11.39/11.40 c start solving
11.39/11.41 c
231.24/231.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
231.24/231.34 c 228s| 1 | 0 | 30427 | - | 166M| 0 | - |9740 | 27k|9740 | 27k| 0 | 0 | 0 | -- | -- | 0.00%
231.24/231.34 c 228s| 1 | 0 | 30427 | - | 166M| 0 | - |9740 | 27k|9740 | 27k| 0 | 0 | 0 | -- | -- | 0.00%
231.24/231.34 c
231.24/231.34 c SCIP Status : problem is solved [infeasible]
231.24/231.34 c Solving Time (sec) : 227.83
231.24/231.34 c Solving Nodes : 1
231.24/231.34 c Primal Bound : +1.00000000000000e+20 (0 solutions)
231.24/231.34 c Dual Bound : +1.00000000000000e+20
231.24/231.34 c Gap : 0.00 %
231.24/231.34 s UNSATISFIABLE
231.24/231.34 c SCIP Status : problem is solved [infeasible]
231.24/231.34 c Solving Time : 227.83
231.24/231.34 c Original Problem :
231.24/231.34 c Problem name : HOME/instance-2684913-1278436410.opb
231.24/231.34 c Variables : 30492 (30492 binary, 0 integer, 0 implicit integer, 0 continuous)
231.24/231.34 c Constraints : 105829 initial, 105829 maximal
231.24/231.34 c Presolved Problem :
231.24/231.34 c Problem name : t_HOME/instance-2684913-1278436410.opb
231.24/231.34 c Variables : 9740 (9740 binary, 0 integer, 0 implicit integer, 0 continuous)
231.24/231.34 c Constraints : 27782 initial, 27782 maximal
231.24/231.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
231.24/231.34 c trivial : 0.04 879 0 0 0 0 0 0 0
231.24/231.34 c dualfix : 0.07 111 0 0 0 0 0 0 0
231.24/231.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
231.24/231.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
231.24/231.34 c implics : 0.20 0 0 0 0 0 0 0 0
231.24/231.34 c probing : 0.00 0 0 0 0 0 0 0 0
231.24/231.34 c knapsack : 0.25 0 0 0 0 0 0 20 101
231.24/231.34 c linear : 7.73 15667 4095 0 16546 0 78047 61 37
231.24/231.34 c logicor : 0.22 0 0 0 0 0 0 0 0
231.24/231.34 c root node : - 0 - - 0 - - - -
231.24/231.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
231.24/231.34 c integral : 0 0 0 0 0 0 0 0 0 0
231.24/231.34 c knapsack : 448 0 1 0 0 0 0 0 0 0
231.24/231.34 c logicor : 27334 0 1 0 0 0 0 0 0 0
231.24/231.34 c countsols : 0 0 0 0 0 0 0 0 0 0
231.24/231.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
231.24/231.34 c integral : 0.00 0.00 0.00 0.00 0.00
231.24/231.34 c knapsack : 0.00 0.00 0.00 0.00 0.00
231.24/231.34 c logicor : 0.03 0.00 0.03 0.00 0.00
231.24/231.34 c countsols : 0.00 0.00 0.00 0.00 0.00
231.24/231.34 c Propagators : Time Calls Cutoffs DomReds
231.24/231.34 c vbounds : 0.00 1 0 0
231.24/231.34 c rootredcost : 0.00 0 0 0
231.24/231.34 c pseudoobj : 0.00 0 0 0
231.24/231.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
231.24/231.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
231.24/231.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
231.24/231.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
231.24/231.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
231.24/231.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
231.24/231.34 c applied globally : - - - 0 0.0 - - -
231.24/231.34 c applied locally : - - - 0 0.0 - - -
231.24/231.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
231.24/231.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
231.24/231.34 c redcost : 0.00 0 0 0 0 0
231.24/231.34 c impliedbounds : 0.00 0 0 0 0 0
231.24/231.34 c intobj : 0.00 0 0 0 0 0
231.24/231.34 c cgmip : 0.00 0 0 0 0 0
231.24/231.34 c gomory : 0.00 0 0 0 0 0
231.24/231.34 c strongcg : 0.00 0 0 0 0 0
231.24/231.34 c cmir : 0.00 0 0 0 0 0
231.24/231.34 c flowcover : 0.00 0 0 0 0 0
231.24/231.34 c clique : 0.00 0 0 0 0 0
231.24/231.34 c zerohalf : 0.00 0 0 0 0 0
231.24/231.34 c mcf : 0.00 0 0 0 0 0
231.24/231.34 c rapidlearning : 0.00 0 0 0 0 0
231.24/231.34 c Pricers : Time Calls Vars
231.24/231.34 c problem variables: 0.00 0 0
231.24/231.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
231.24/231.34 c pscost : 0.00 0 0 0 0 0 0
231.24/231.34 c inference : 0.00 0 0 0 0 0 0
231.24/231.34 c mostinf : 0.00 0 0 0 0 0 0
231.24/231.34 c leastinf : 0.00 0 0 0 0 0 0
231.24/231.34 c fullstrong : 0.00 0 0 0 0 0 0
231.24/231.34 c allfullstrong : 0.00 0 0 0 0 0 0
231.24/231.34 c random : 0.00 0 0 0 0 0 0
231.24/231.34 c relpscost : 0.00 0 0 0 0 0 0
231.24/231.34 c Primal Heuristics : Time Calls Found
231.24/231.34 c LP solutions : 0.00 - 0
231.24/231.34 c pseudo solutions : 0.00 - 0
231.24/231.34 c trivial : 0.05 1 0
231.24/231.34 c simplerounding : 0.00 0 0
231.24/231.34 c zirounding : 0.00 0 0
231.24/231.34 c rounding : 0.00 0 0
231.24/231.34 c shifting : 0.00 0 0
231.24/231.34 c intshifting : 0.00 0 0
231.24/231.34 c oneopt : 0.00 0 0
231.24/231.34 c twoopt : 0.00 0 0
231.24/231.34 c fixandinfer : 0.00 0 0
231.24/231.34 c feaspump : 0.00 0 0
231.24/231.34 c coefdiving : 0.00 0 0
231.24/231.34 c pscostdiving : 0.00 0 0
231.24/231.34 c fracdiving : 0.00 0 0
231.24/231.34 c veclendiving : 0.00 0 0
231.24/231.34 c intdiving : 0.00 0 0
231.24/231.34 c actconsdiving : 0.00 0 0
231.24/231.34 c objpscostdiving : 0.00 0 0
231.24/231.34 c rootsoldiving : 0.00 0 0
231.24/231.34 c linesearchdiving : 0.00 0 0
231.24/231.34 c guideddiving : 0.00 0 0
231.24/231.34 c octane : 0.00 0 0
231.24/231.34 c rens : 0.00 0 0
231.24/231.34 c rins : 0.00 0 0
231.24/231.34 c localbranching : 0.00 0 0
231.24/231.34 c mutation : 0.00 0 0
231.24/231.34 c crossover : 0.00 0 0
231.24/231.34 c dins : 0.00 0 0
231.24/231.34 c undercover : 0.00 0 0
231.24/231.34 c nlp : 0.00 0 0
231.24/231.34 c trysol : 0.00 0 0
231.24/231.34 c LP : Time Calls Iterations Iter/call Iter/sec
231.24/231.34 c primal LP : 0.00 0 0 0.00 -
231.24/231.34 c dual LP : 218.58 1 30427 30427.00 139.20
231.24/231.34 c lex dual LP : 0.00 0 0 0.00 -
231.24/231.34 c barrier LP : 0.00 0 0 0.00 -
231.24/231.34 c diving/probing LP: 0.00 0 0 0.00 -
231.24/231.34 c strong branching : 0.00 0 0 0.00 -
231.24/231.34 c (at root node) : - 0 0 0.00 -
231.24/231.34 c conflict analysis: 0.00 0 0 0.00 -
231.24/231.34 c B&B Tree :
231.24/231.34 c number of runs : 1
231.24/231.34 c nodes : 1
231.24/231.34 c nodes (total) : 1
231.24/231.34 c nodes left : 0
231.24/231.34 c max depth : 0
231.24/231.34 c max depth (total): 0
231.24/231.34 c backtracks : 0 (0.0%)
231.24/231.34 c delayed cutoffs : 0
231.24/231.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
231.24/231.34 c avg switch length: 2.00
231.24/231.34 c switching time : 0.00
231.24/231.34 c Solution :
231.24/231.34 c Solutions found : 0 (0 improvements)
231.24/231.34 c Primal Bound : infeasible
231.24/231.34 c Dual Bound : -
231.24/231.34 c Gap : 0.00 %
231.24/231.34 c Root Dual Bound : -
231.24/231.34 c Root Iterations : 30427
231.53/231.67 c Time complete: 231.61.