0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2685388-1278440671.opb>
0.49/0.51 c original problem has 9272 variables (9272 bin, 0 int, 0 impl, 0 cont) and 29174 constraints
0.49/0.51 c problem read
0.49/0.51 c No objective function, only one solution is needed.
0.49/0.51 c presolving settings loaded
0.49/0.51 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.59/0.67 c presolving:
1.79/1.90 c (round 1) 1943 del vars, 5207 del conss, 1295 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1562106 impls, 0 clqs
2.39/2.44 c (round 2) 4349 del vars, 14013 del conss, 3544 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1573949 impls, 0 clqs
2.49/2.52 c (round 3) 5238 del vars, 17845 del conss, 4038 chg bounds, 56 chg sides, 46 chg coeffs, 0 upgd conss, 1578050 impls, 0 clqs
2.49/2.57 c (round 4) 5619 del vars, 19146 del conss, 4252 chg bounds, 76 chg sides, 68 chg coeffs, 0 upgd conss, 1581016 impls, 0 clqs
2.59/2.60 c (round 5) 5782 del vars, 19770 del conss, 4322 chg bounds, 76 chg sides, 68 chg coeffs, 0 upgd conss, 1582358 impls, 0 clqs
2.59/2.62 c (round 6) 5839 del vars, 20005 del conss, 4359 chg bounds, 76 chg sides, 68 chg coeffs, 0 upgd conss, 1582560 impls, 0 clqs
2.59/2.63 c (round 7) 5839 del vars, 20038 del conss, 4359 chg bounds, 76 chg sides, 68 chg coeffs, 0 upgd conss, 1582560 impls, 0 clqs
2.69/2.76 c (round 8) 5839 del vars, 20038 del conss, 4359 chg bounds, 76 chg sides, 68 chg coeffs, 9136 upgd conss, 1582560 impls, 0 clqs
2.79/2.85 c (round 9) 5839 del vars, 20038 del conss, 4359 chg bounds, 84 chg sides, 148 chg coeffs, 9136 upgd conss, 1586066 impls, 231 clqs
2.89/2.92 c (round 10) 5839 del vars, 20038 del conss, 4359 chg bounds, 86 chg sides, 188 chg coeffs, 9136 upgd conss, 1586066 impls, 252 clqs
2.89/2.96 c (round 11) 5839 del vars, 20038 del conss, 4359 chg bounds, 89 chg sides, 211 chg coeffs, 9136 upgd conss, 1586066 impls, 252 clqs
2.99/3.00 c presolving (12 rounds):
2.99/3.00 c 5839 deleted vars, 20038 deleted constraints, 4359 tightened bounds, 0 added holes, 89 changed sides, 220 changed coefficients
2.99/3.00 c 1586066 implications, 254 cliques
2.99/3.00 c presolved problem has 3433 variables (3433 bin, 0 int, 0 impl, 0 cont) and 9136 constraints
2.99/3.00 c 245 constraints of type <knapsack>
2.99/3.00 c 8891 constraints of type <logicor>
2.99/3.00 c transformed objective value is always integral (scale: 1)
2.99/3.00 c Presolving Time: 2.22
2.99/3.00 c - non default parameters ----------------------------------------------------------------------
2.99/3.00 c # SCIP version 1.2.1.2
2.99/3.00 c
2.99/3.00 c # frequency for displaying node information lines
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 100]
2.99/3.00 c display/freq = 10000
2.99/3.00 c
2.99/3.00 c # maximal time in seconds to run
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.00 c limits/time = 1799.49
2.99/3.00 c
2.99/3.00 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.00 c limits/memory = 1620
2.99/3.00 c
2.99/3.00 c # solving stops, if the given number of solutions were found (-1: no limit)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.00 c limits/solutions = 1
2.99/3.00 c
2.99/3.00 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c lp/solvefreq = -1
2.99/3.00 c
2.99/3.00 c # maximal number of separation rounds per node (-1: unlimited)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 5]
2.99/3.00 c separating/maxrounds = 1
2.99/3.00 c
2.99/3.00 c # maximal number of separation rounds in the root node (-1: unlimited)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.00 c separating/maxroundsroot = 5
2.99/3.00 c
2.99/3.00 c # should presolving try to simplify inequalities
2.99/3.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.00 c constraints/linear/simplifyinequalities = TRUE
2.99/3.00 c
2.99/3.00 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.99/3.00 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.99/3.00 c constraints/knapsack/disaggregation = FALSE
2.99/3.00 c
2.99/3.00 c # should presolving try to simplify knapsacks
2.99/3.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.00 c constraints/knapsack/simplifyinequalities = TRUE
2.99/3.00 c
2.99/3.00 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.00 c presolving/probing/maxrounds = 0
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/coefdiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/coefdiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/coefdiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 30]
2.99/3.00 c heuristics/crossover/freq = -1
2.99/3.00 c
2.99/3.00 c # number of nodes added to the contingent of the total nodes
2.99/3.00 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.00 c heuristics/crossover/nodesofs = 750
2.99/3.00 c
2.99/3.00 c # number of nodes without incumbent change that heuristic should wait
2.99/3.00 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.99/3.00 c heuristics/crossover/nwaitingnodes = 100
2.99/3.00 c
2.99/3.00 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.99/3.00 c # [type: real, range: [0,1], default: 0.1]
2.99/3.00 c heuristics/crossover/nodesquot = 0.15
2.99/3.00 c
2.99/3.00 c # minimum percentage of integer variables that have to be fixed
2.99/3.00 c # [type: real, range: [0,1], default: 0.666]
2.99/3.00 c heuristics/crossover/minfixingrate = 0.5
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.00 c heuristics/feaspump/freq = -1
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/feaspump/maxlpiterofs = 2000
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/fracdiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/fracdiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/fracdiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/guideddiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/guideddiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/guideddiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/intdiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/intshifting/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/linesearchdiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/nlp/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.00 c heuristics/objpscostdiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to total iteration number
2.99/3.00 c # [type: real, range: [0,1], default: 0.01]
2.99/3.00 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/oneopt/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/pscostdiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/pscostdiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.00 c heuristics/rens/freq = -1
2.99/3.00 c
2.99/3.00 c # minimum percentage of integer variables that have to be fixable
2.99/3.00 c # [type: real, range: [0,1], default: 0.5]
2.99/3.00 c heuristics/rens/minfixingrate = 0.3
2.99/3.00 c
2.99/3.00 c # number of nodes added to the contingent of the total nodes
2.99/3.00 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.00 c heuristics/rens/nodesofs = 2000
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.00 c heuristics/rootsoldiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.99/3.00 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/rounding/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/shifting/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/simplerounding/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.00 c heuristics/trivial/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/trysol/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.00 c heuristics/veclendiving/freq = -1
2.99/3.00 c
2.99/3.00 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.00 c heuristics/veclendiving/maxlpiterquot = 0.075
2.99/3.00 c
2.99/3.00 c # additional number of allowed LP iterations
2.99/3.00 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.00 c heuristics/veclendiving/maxlpiterofs = 1500
2.99/3.00 c
2.99/3.00 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.00 c heuristics/zirounding/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.00 c separating/cmir/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.00 c separating/flowcover/freq = -1
2.99/3.00 c
2.99/3.00 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.99/3.00 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.00 c separating/rapidlearning/freq = 0
2.99/3.00 c
2.99/3.00 c -----------------------------------------------------------------------------------------------
2.99/3.00 c start solving
2.99/3.00 c
2.99/3.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.99/3.02 c 2.3s| 1 | 2 | 0 | - | 45M| 0 | - |3433 |9136 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
73.47/73.60 c 71.8s| 10000 | 2432 | 0 | 0.0 | 81M| 114 | - |3433 | 13k| 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
157.35/157.40 c 154s| 20000 | 3335 | 0 | 0.0 | 103M| 114 | - |3433 | 14k| 0 | 0 | 0 | 34k| 0 | 0.000000e+00 | -- | Inf
250.22/250.33 c 246s| 30000 | 2987 | 0 | 0.0 | 107M| 114 | - |3433 | 15k| 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
361.70/361.89 c
361.70/361.89 c SCIP Status : problem is solved [infeasible]
361.70/361.89 c Solving Time (sec) : 356.43
361.70/361.89 c Solving Nodes : 39894
361.70/361.89 c Primal Bound : +1.00000000000000e+20 (0 solutions)
361.70/361.89 c Dual Bound : +1.00000000000000e+20
361.70/361.89 c Gap : 0.00 %
361.70/361.89 s UNSATISFIABLE
361.70/361.89 c SCIP Status : problem is solved [infeasible]
361.70/361.89 c Solving Time : 356.43
361.70/361.89 c Original Problem :
361.70/361.89 c Problem name : HOME/instance-2685388-1278440671.opb
361.70/361.89 c Variables : 9272 (9272 binary, 0 integer, 0 implicit integer, 0 continuous)
361.70/361.89 c Constraints : 29174 initial, 29174 maximal
361.70/361.89 c Presolved Problem :
361.70/361.89 c Problem name : t_HOME/instance-2685388-1278440671.opb
361.70/361.89 c Variables : 3433 (3433 binary, 0 integer, 0 implicit integer, 0 continuous)
361.70/361.89 c Constraints : 9136 initial, 17629 maximal
361.70/361.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
361.70/361.89 c trivial : 0.01 387 0 0 0 0 0 0 0
361.70/361.89 c dualfix : 0.03 56 0 0 0 0 0 0 0
361.70/361.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
361.70/361.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
361.70/361.89 c implics : 0.03 0 0 0 0 0 0 0 0
361.70/361.89 c probing : 0.00 0 0 0 0 0 0 0 0
361.70/361.89 c knapsack : 0.11 0 0 0 0 0 0 13 152
361.70/361.89 c linear : 1.83 3972 1424 0 4359 0 20038 76 68
361.70/361.89 c logicor : 0.12 0 0 0 0 0 0 0 0
361.70/361.89 c root node : - 7 - - 7 - - - -
361.70/361.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
361.70/361.89 c integral : 0 0 0 0 0 0 0 0 0 0
361.70/361.89 c knapsack : 245 0 649037 0 26399 2569 3326938 0 0 0
361.70/361.89 c logicor : 8891+ 0 622785 0 26399 18898 7470971 0 0 0
361.70/361.89 c countsols : 0 0 0 0 26399 0 0 0 0 0
361.70/361.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
361.70/361.89 c integral : 0.00 0.00 0.00 0.00 0.00
361.70/361.89 c knapsack : 38.91 0.00 35.43 0.00 3.48
361.70/361.89 c logicor : 167.81 0.00 96.64 0.00 71.17
361.70/361.89 c countsols : 0.02 0.00 0.00 0.00 0.02
361.70/361.89 c Propagators : Time Calls Cutoffs DomReds
361.70/361.89 c vbounds : 0.39 1 0 0
361.70/361.89 c rootredcost : 0.33 0 0 0
361.70/361.89 c pseudoobj : 0.24 0 0 0
361.70/361.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
361.70/361.89 c propagation : 9.71 21467 21357 207636 45.3 2100 18.6 -
361.70/361.89 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
361.70/361.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
361.70/361.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
361.70/361.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
361.70/361.89 c applied globally : - - - 73991 35.2 - - -
361.70/361.89 c applied locally : - - - 0 0.0 - - -
361.70/361.89 c Separators : Time Calls Cutoffs DomReds Cuts Conss
361.70/361.89 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
361.70/361.89 c redcost : 0.00 0 0 0 0 0
361.70/361.89 c impliedbounds : 0.00 0 0 0 0 0
361.70/361.89 c intobj : 0.00 0 0 0 0 0
361.70/361.89 c cgmip : 0.00 0 0 0 0 0
361.70/361.89 c gomory : 0.00 0 0 0 0 0
361.70/361.89 c strongcg : 0.00 0 0 0 0 0
361.70/361.89 c cmir : 0.00 0 0 0 0 0
361.70/361.89 c flowcover : 0.00 0 0 0 0 0
361.70/361.89 c clique : 0.00 0 0 0 0 0
361.70/361.89 c zerohalf : 0.00 0 0 0 0 0
361.70/361.89 c mcf : 0.00 0 0 0 0 0
361.70/361.89 c rapidlearning : 0.00 0 0 0 0 0
361.70/361.89 c Pricers : Time Calls Vars
361.70/361.89 c problem variables: 0.00 0 0
361.70/361.89 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
361.70/361.89 c relpscost : 0.00 0 0 0 0 0 0
361.70/361.89 c pscost : 0.00 0 0 0 0 0 0
361.70/361.89 c inference : 27.15 26399 0 0 0 0 52798
361.70/361.89 c mostinf : 0.00 0 0 0 0 0 0
361.70/361.89 c leastinf : 0.00 0 0 0 0 0 0
361.70/361.89 c fullstrong : 0.00 0 0 0 0 0 0
361.70/361.89 c allfullstrong : 0.00 0 0 0 0 0 0
361.70/361.89 c random : 0.00 0 0 0 0 0 0
361.70/361.89 c Primal Heuristics : Time Calls Found
361.70/361.89 c LP solutions : 0.00 - 0
361.70/361.89 c pseudo solutions : 0.00 - 0
361.70/361.89 c trivial : 0.02 1 0
361.70/361.89 c simplerounding : 0.00 0 0
361.70/361.89 c zirounding : 0.00 0 0
361.70/361.89 c rounding : 0.00 0 0
361.70/361.89 c shifting : 0.00 0 0
361.70/361.89 c intshifting : 0.00 0 0
361.70/361.89 c oneopt : 0.00 0 0
361.70/361.89 c twoopt : 0.00 0 0
361.70/361.89 c fixandinfer : 0.00 0 0
361.70/361.89 c feaspump : 0.00 0 0
361.70/361.89 c coefdiving : 0.00 0 0
361.70/361.89 c pscostdiving : 0.00 0 0
361.70/361.89 c fracdiving : 0.00 0 0
361.70/361.89 c veclendiving : 0.00 0 0
361.70/361.89 c intdiving : 0.00 0 0
361.70/361.89 c actconsdiving : 0.00 0 0
361.70/361.89 c objpscostdiving : 0.00 0 0
361.70/361.89 c rootsoldiving : 0.00 0 0
361.70/361.89 c linesearchdiving : 0.00 0 0
361.70/361.89 c guideddiving : 0.00 0 0
361.70/361.89 c octane : 0.00 0 0
361.70/361.89 c rens : 0.00 0 0
361.70/361.89 c rins : 0.00 0 0
361.70/361.89 c localbranching : 0.00 0 0
361.70/361.89 c mutation : 0.00 0 0
361.70/361.89 c crossover : 0.00 0 0
361.70/361.89 c dins : 0.00 0 0
361.70/361.89 c undercover : 0.00 0 0
361.70/361.89 c nlp : 0.00 0 0
361.70/361.89 c trysol : 0.00 0 0
361.70/361.89 c LP : Time Calls Iterations Iter/call Iter/sec
361.70/361.89 c primal LP : 0.00 0 0 0.00 -
361.70/361.89 c dual LP : 0.00 0 0 0.00 -
361.70/361.89 c lex dual LP : 0.00 0 0 0.00 -
361.70/361.89 c barrier LP : 0.00 0 0 0.00 -
361.70/361.89 c diving/probing LP: 0.00 0 0 0.00 -
361.70/361.89 c strong branching : 0.00 0 0 0.00 -
361.70/361.89 c (at root node) : - 0 0 0.00 -
361.70/361.89 c conflict analysis: 0.00 0 0 0.00 -
361.70/361.89 c B&B Tree :
361.70/361.89 c number of runs : 1
361.70/361.89 c nodes : 39894
361.70/361.89 c nodes (total) : 39894
361.70/361.89 c nodes left : 0
361.70/361.89 c max depth : 114
361.70/361.89 c max depth (total): 114
361.70/361.89 c backtracks : 10777 (27.0%)
361.70/361.89 c delayed cutoffs : 12905
361.70/361.89 c repropagations : 41376 (3745635 domain reductions, 7972 cutoffs)
361.70/361.89 c avg switch length: 8.58
361.70/361.89 c switching time : 96.82
361.70/361.89 c Solution :
361.70/361.89 c Solutions found : 0 (0 improvements)
361.70/361.89 c Primal Bound : infeasible
361.70/361.89 c Dual Bound : -
361.70/361.89 c Gap : 0.00 %
361.70/361.89 c Root Dual Bound : +0.00000000000000e+00
361.70/361.89 c Root Iterations : 0
361.89/362.03 c Time complete: 361.93.