0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667307-1276308399.opb>
0.02/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.05 c problem read
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c presolving settings loaded
0.02/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.07
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.96
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.4s| 1 | 0 | 108 | - |3964k| 0 | 47 | 231 |2739 | 231 |2578 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 155 | - |4737k| 0 | 50 | 231 |2739 | 231 |2584 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.00 c 0.9s| 1 | 0 | 211 | - |5468k| 0 | 55 | 231 |2739 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.3s| 1 | 0 | 244 | - |5881k| 0 | 59 | 231 |2739 | 231 |2588 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.92 c 1.8s| 1 | 0 | 254 | - |5892k| 0 | 59 | 231 |2739 | 231 |2591 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.85 c 2.7s| 1 | 2 | 254 | - |5892k| 0 | 59 | 231 |2739 | 231 |2591 | 27 | 0 | 10 | 0.000000e+00 | -- | Inf
176.84/176.99 c 173s| 10000 | 18 |303810 | 30.4 |8318k| 44 | 32 | 231 |8221 | 231 |2579 | 27 |7551 |2363 | 0.000000e+00 | -- | Inf
318.50/318.66 c 312s| 20000 | 17 |642005 | 32.1 | 10M| 44 | - | 231 | 12k| 231 |2579 | 27 | 15k|2689 | 0.000000e+00 | -- | Inf
351.80/351.93 c
351.80/351.93 c SCIP Status : problem is solved [infeasible]
351.80/351.93 c Solving Time (sec) : 344.61
351.80/351.93 c Solving Nodes : 22133
351.80/351.93 c Primal Bound : +1.00000000000000e+20 (0 solutions)
351.80/351.93 c Dual Bound : +1.00000000000000e+20
351.80/351.93 c Gap : 0.00 %
351.80/351.93 s UNSATISFIABLE
351.80/351.93 c SCIP Status : problem is solved [infeasible]
351.80/351.93 c Solving Time : 344.61
351.80/351.93 c Original Problem :
351.80/351.93 c Problem name : HOME/instance-2667307-1276308399.opb
351.80/351.93 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
351.80/351.93 c Constraints : 2707 initial, 2707 maximal
351.80/351.93 c Presolved Problem :
351.80/351.93 c Problem name : t_HOME/instance-2667307-1276308399.opb
351.80/351.93 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
351.80/351.93 c Constraints : 2564 initial, 12776 maximal
351.80/351.93 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
351.80/351.93 c trivial : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c dualfix : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c boundshift : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c inttobinary : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c implics : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c probing : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c knapsack : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c setppc : 0.00 0 0 0 0 0 0 0 0
351.80/351.93 c linear : 0.03 0 0 0 0 0 143 0 0
351.80/351.93 c logicor : 0.02 0 0 0 0 0 0 0 0
351.80/351.93 c root node : - 1 - - 1 - - - -
351.80/351.93 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
351.80/351.93 c integral : 0 0 0 11755 0 63 1190 0 0 22274
351.80/351.93 c knapsack : 1 5 88973 0 0 71 38571 0 0 0
351.80/351.93 c setppc : 22 5 88963 0 0 439 126308 0 0 0
351.80/351.93 c linear : 0+ 5 88393 0 0 8 1214 4 0 0
351.80/351.93 c logicor : 2541+ 5 41875 0 0 188 127469 0 0 0
351.80/351.93 c countsols : 0 0 0 0 0 0 0 0 0 0
351.80/351.93 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
351.80/351.93 c integral : 60.95 0.00 0.00 60.95 0.00
351.80/351.93 c knapsack : 0.52 0.00 0.52 0.00 0.00
351.80/351.93 c setppc : 1.39 0.00 1.39 0.00 0.00
351.80/351.93 c linear : 0.90 0.00 0.90 0.00 0.00
351.80/351.93 c logicor : 7.07 0.00 7.07 0.00 0.00
351.80/351.93 c countsols : 0.00 0.00 0.00 0.00 0.00
351.80/351.93 c Propagators : Time Calls Cutoffs DomReds
351.80/351.93 c vbounds : 0.08 1 0 0
351.80/351.93 c rootredcost : 0.06 0 0 0
351.80/351.93 c pseudoobj : 0.04 0 0 0
351.80/351.93 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
351.80/351.93 c propagation : 0.05 706 700 3474 17.8 8 17.1 -
351.80/351.93 c infeasible LP : 4.49 10364 10313 59843 27.2 39 16.4 0
351.80/351.93 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
351.80/351.93 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
351.80/351.93 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
351.80/351.93 c applied globally : - - - 17522 17.5 - - -
351.80/351.93 c applied locally : - - - 1 32.0 - - -
351.80/351.93 c Separators : Time Calls Cutoffs DomReds Cuts Conss
351.80/351.93 c cut pool : 0.00 4 - - 48 - (maximal pool size: 588)
351.80/351.93 c redcost : 0.14 11230 0 0 0 0
351.80/351.93 c impliedbounds : 0.00 5 0 0 0 0
351.80/351.93 c intobj : 0.00 0 0 0 0 0
351.80/351.93 c cgmip : 0.00 0 0 0 0 0
351.80/351.93 c gomory : 0.77 5 0 0 1233 0
351.80/351.93 c strongcg : 0.63 5 0 0 1855 0
351.80/351.93 c cmir : 0.00 0 0 0 0 0
351.80/351.93 c flowcover : 0.00 0 0 0 0 0
351.80/351.93 c clique : 0.00 5 0 0 0 0
351.80/351.93 c zerohalf : 0.00 0 0 0 0 0
351.80/351.93 c mcf : 0.00 1 0 0 0 0
351.80/351.93 c rapidlearning : 0.19 1 0 0 0 175
351.80/351.93 c Pricers : Time Calls Vars
351.80/351.93 c problem variables: 0.00 0 0
351.80/351.93 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
351.80/351.93 c relpscost : 60.93 11755 63 1190 0 0 22274
351.80/351.93 c pscost : 0.00 0 0 0 0 0 0
351.80/351.93 c inference : 0.00 0 0 0 0 0 0
351.80/351.93 c mostinf : 0.00 0 0 0 0 0 0
351.80/351.93 c leastinf : 0.00 0 0 0 0 0 0
351.80/351.93 c fullstrong : 0.00 0 0 0 0 0 0
351.80/351.93 c allfullstrong : 0.00 0 0 0 0 0 0
351.80/351.93 c random : 0.00 0 0 0 0 0 0
351.80/351.93 c Primal Heuristics : Time Calls Found
351.80/351.93 c LP solutions : 0.00 - 0
351.80/351.93 c pseudo solutions : 0.00 - 0
351.80/351.93 c trivial : 0.01 1 0
351.80/351.93 c simplerounding : 0.00 0 0
351.80/351.93 c zirounding : 0.00 0 0
351.80/351.93 c rounding : 0.00 0 0
351.80/351.93 c shifting : 0.00 0 0
351.80/351.93 c intshifting : 0.00 0 0
351.80/351.93 c oneopt : 0.00 0 0
351.80/351.93 c twoopt : 0.00 0 0
351.80/351.93 c fixandinfer : 0.00 0 0
351.80/351.93 c feaspump : 0.00 0 0
351.80/351.93 c coefdiving : 0.00 0 0
351.80/351.93 c pscostdiving : 0.00 0 0
351.80/351.93 c fracdiving : 0.00 0 0
351.80/351.93 c veclendiving : 0.00 0 0
351.80/351.93 c intdiving : 0.00 0 0
351.80/351.93 c actconsdiving : 0.00 0 0
351.80/351.93 c objpscostdiving : 0.00 0 0
351.80/351.93 c rootsoldiving : 0.00 0 0
351.80/351.93 c linesearchdiving : 0.00 0 0
351.80/351.93 c guideddiving : 0.00 0 0
351.80/351.93 c octane : 0.00 0 0
351.80/351.93 c rens : 0.00 0 0
351.80/351.93 c rins : 0.00 0 0
351.80/351.93 c localbranching : 0.00 0 0
351.80/351.93 c mutation : 0.00 0 0
351.80/351.93 c crossover : 0.00 0 0
351.80/351.93 c dins : 0.00 0 0
351.80/351.93 c undercover : 0.00 0 0
351.80/351.93 c nlp : 0.00 0 0
351.80/351.93 c trysol : 0.00 0 0
351.80/351.93 c LP : Time Calls Iterations Iter/call Iter/sec
351.80/351.93 c primal LP : 0.00 0 0 0.00 -
351.80/351.93 c dual LP : 247.72 22080 716780 32.46 2893.51
351.80/351.93 c lex dual LP : 0.00 0 0 0.00 -
351.80/351.93 c barrier LP : 0.00 0 0 0.00 -
351.80/351.93 c diving/probing LP: 0.00 0 0 0.00 -
351.80/351.93 c strong branching : 60.37 2833 167895 59.26 2781.10
351.80/351.93 c (at root node) : - 10 2074 207.40 -
351.80/351.93 c conflict analysis: 0.00 0 0 0.00 -
351.80/351.93 c B&B Tree :
351.80/351.93 c number of runs : 1
351.80/351.93 c nodes : 22133
351.80/351.93 c nodes (total) : 22133
351.80/351.93 c nodes left : 0
351.80/351.93 c max depth : 44
351.80/351.93 c max depth (total): 44
351.80/351.93 c backtracks : 2535 (11.5%)
351.80/351.93 c delayed cutoffs : 142
351.80/351.93 c repropagations : 37997 (47968 domain reductions, 137 cutoffs)
351.80/351.93 c avg switch length: 4.88
351.80/351.93 c switching time : 7.16
351.80/351.93 c Solution :
351.80/351.93 c Solutions found : 0 (0 improvements)
351.80/351.93 c Primal Bound : infeasible
351.80/351.93 c Dual Bound : -
351.80/351.93 c Gap : 0.00 %
351.80/351.93 c Root Dual Bound : +0.00000000000000e+00
351.80/351.93 c Root Iterations : 254
351.80/351.96 c Time complete: 351.85.