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-2704147-1278549766.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.06 c presolving:
0.06/0.10 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.10/0.11 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.10/0.12 c (round 3) 0 del vars, 264 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.10/0.13 c presolving (4 rounds):
0.10/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.13 c 242 implications, 22 cliques
0.10/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.10/0.13 c 1 constraints of type <knapsack>
0.10/0.13 c 22 constraints of type <setppc>
0.10/0.13 c 2420 constraints of type <logicor>
0.10/0.13 c transformed objective value is always integral (scale: 1)
0.10/0.13 c Presolving Time: 0.07
0.10/0.13 c - non default parameters ----------------------------------------------------------------------
0.10/0.13 c # SCIP version 1.2.1.3
0.10/0.13 c
0.10/0.13 c # frequency for displaying node information lines
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.13 c display/freq = 10000
0.10/0.13 c
0.10/0.13 c # maximal time in seconds to run
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/time = 1789.96
0.10/0.13 c
0.10/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/memory = 1620
0.10/0.13 c
0.10/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c limits/solutions = 1
0.10/0.13 c
0.10/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.13 c separating/maxrounds = 1
0.10/0.13 c
0.10/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c separating/maxroundsroot = 5
0.10/0.13 c
0.10/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.10/0.13 c # [type: int, range: [1,2], default: 1]
0.10/0.13 c timing/clocktype = 2
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify inequalities
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/linear/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/indicator/addCouplingCons = TRUE
0.10/0.13 c
0.10/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.13 c constraints/knapsack/disaggregation = FALSE
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify knapsacks
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c presolving/probing/maxrounds = 0
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/coefdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.13 c heuristics/crossover/freq = -1
0.10/0.13 c
0.10/0.13 c # number of nodes added to the contingent of the total nodes
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.13 c heuristics/crossover/nodesofs = 750
0.10/0.13 c
0.10/0.13 c # number of nodes without incumbent change that heuristic should wait
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.13 c heuristics/crossover/nwaitingnodes = 100
0.10/0.13 c
0.10/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.13 c # [type: real, range: [0,1], default: 0.1]
0.10/0.13 c heuristics/crossover/nodesquot = 0.15
0.10/0.13 c
0.10/0.13 c # minimum percentage of integer variables that have to be fixed
0.10/0.13 c # [type: real, range: [0,1], default: 0.666]
0.10/0.13 c heuristics/crossover/minfixingrate = 0.5
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/feaspump/freq = -1
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/fracdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/guideddiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/intshifting/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/linesearchdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/nlp/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/objpscostdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.13 c # [type: real, range: [0,1], default: 0.01]
0.10/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/oneopt/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/pscostdiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c heuristics/rens/freq = -1
0.10/0.13 c
0.10/0.13 c # minimum percentage of integer variables that have to be fixable
0.10/0.13 c # [type: real, range: [0,1], default: 0.5]
0.10/0.13 c heuristics/rens/minfixingrate = 0.3
0.10/0.13 c
0.10/0.13 c # number of nodes added to the contingent of the total nodes
0.10/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.13 c heuristics/rens/nodesofs = 2000
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.13 c heuristics/rootsoldiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.13 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/rounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/shifting/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/simplerounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c heuristics/trivial/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/trysol/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.13 c heuristics/veclendiving/freq = -1
0.10/0.13 c
0.10/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.13 c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.13 c
0.10/0.13 c # additional number of allowed LP iterations
0.10/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.13 c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.13 c heuristics/zirounding/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c separating/cmir/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.13 c separating/flowcover/freq = -1
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c separating/rapidlearning/freq = 0
0.10/0.13 c
0.10/0.13 c -----------------------------------------------------------------------------------------------
0.10/0.13 c start solving
0.10/0.13 c
0.10/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.15 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.4s| 1 | 0 | 104 | - |3904k| 0 | 45 | 231 |2602 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 129 | - |4253k| 0 | 50 | 231 |2602 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.98 c 0.9s| 1 | 0 | 142 | - |4631k| 0 | 51 | 231 |2602 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 170 | - |5069k| 0 | 53 | 231 |2602 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 189 | - |5380k| 0 | 55 | 231 |2602 | 231 |2465 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
2.30/2.36 c 2.3s| 1 | 2 | 189 | - |5381k| 0 | 55 | 231 |2602 | 231 |2465 | 22 | 0 | 10 | 0.000000e+00 | -- | Inf
131.76/131.82 c 132s| 10000 | 63 |246717 | 24.7 |7543k| 43 | 32 | 231 |6832 | 231 |2453 | 22 |5989 |2291 | 0.000000e+00 | -- | Inf
226.63/226.76 c 227s| 20000 | 59 |502310 | 25.1 |8450k| 43 | - | 231 |8856 | 231 |2453 | 22 | 12k|2490 | 0.000000e+00 | -- | Inf
330.71/330.89 c 331s| 30000 | 43 |770029 | 25.7 |9295k| 46 | 39 | 231 | 10k| 231 |2453 | 22 | 19k|3034 | 0.000000e+00 | -- | Inf
437.18/437.34 c 437s| 40000 | 59 | 1044k| 26.1 |9806k| 46 | - | 231 | 11k| 231 |2453 | 22 | 25k|3559 | 0.000000e+00 | -- | Inf
545.16/545.34 c 545s| 50000 | 84 | 1324k| 26.5 | 10M| 46 | 26 | 231 | 11k| 231 |2453 | 22 | 32k|3998 | 0.000000e+00 | -- | Inf
652.13/652.33 c 652s| 60000 | 64 | 1603k| 26.7 | 10M| 46 | - | 231 | 10k| 231 |2453 | 22 | 38k|4475 | 0.000000e+00 | -- | Inf
762.40/762.63 c 763s| 70000 | 70 | 1897k| 27.1 | 10M| 51 | 36 | 231 | 11k| 231 |2453 | 22 | 45k|4871 | 0.000000e+00 | -- | Inf
870.77/871.00 c 871s| 80000 | 12 | 2183k| 27.3 |9945k| 53 | - | 231 | 10k| 231 |2453 | 22 | 51k|5268 | 0.000000e+00 | -- | Inf
893.77/894.08 c
893.77/894.08 c SCIP Status : problem is solved [infeasible]
893.77/894.08 c Solving Time (sec) : 894.03
893.77/894.08 c Solving Nodes : 82306
893.77/894.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
893.77/894.08 c Dual Bound : +1.00000000000000e+20
893.77/894.08 c Gap : 0.00 %
893.77/894.08 s UNSATISFIABLE
893.77/894.08 c SCIP Status : problem is solved [infeasible]
893.77/894.08 c Solving Time : 894.03
893.77/894.08 c Original Problem :
893.77/894.08 c Problem name : HOME/instance-2704147-1278549766.opb
893.77/894.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
893.77/894.08 c Constraints : 2707 initial, 2707 maximal
893.77/894.08 c Presolved Problem :
893.77/894.08 c Problem name : t_HOME/instance-2704147-1278549766.opb
893.77/894.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
893.77/894.08 c Constraints : 2443 initial, 13208 maximal
893.77/894.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
893.77/894.08 c trivial : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c implics : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c probing : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c knapsack : 0.00 0 0 0 0 0 0 0 0
893.77/894.08 c setppc : 0.00 0 0 0 0 0 121 0 0
893.77/894.08 c linear : 0.03 0 0 0 0 0 143 0 0
893.77/894.08 c logicor : 0.03 0 0 0 0 0 0 0 0
893.77/894.08 c root node : - 1 - - 1 - - - -
893.77/894.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
893.77/894.08 c integral : 0 0 0 42804 0 167 2135 0 0 82898
893.77/894.08 c knapsack : 1 5 314176 0 0 514 156362 0 0 0
893.77/894.08 c setppc : 22 5 313881 0 0 1836 430868 0 0 0
893.77/894.08 c linear : 0+ 5 261287 0 0 15 2969 1 0 0
893.77/894.08 c logicor : 2420+ 5 154420 0 0 551 527395 0 0 0
893.77/894.08 c countsols : 0 0 0 0 0 0 0 0 0 0
893.77/894.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
893.77/894.08 c integral : 87.58 0.00 0.00 87.58 0.00
893.77/894.08 c knapsack : 2.22 0.00 2.22 0.00 0.00
893.77/894.08 c setppc : 4.48 0.00 4.48 0.00 0.00
893.77/894.08 c linear : 1.25 0.00 1.25 0.00 0.00
893.77/894.08 c logicor : 27.34 0.00 27.34 0.00 0.00
893.77/894.08 c countsols : 0.00 0.00 0.00 0.00 0.00
893.77/894.08 c Propagators : Time Calls Cutoffs DomReds
893.77/894.08 c vbounds : 0.14 1 0 0
893.77/894.08 c rootredcost : 0.16 0 0 0
893.77/894.08 c pseudoobj : 0.10 0 0 0
893.77/894.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
893.77/894.08 c propagation : 0.23 2916 2897 15982 22.1 63 21.4 -
893.77/894.08 c infeasible LP : 15.14 38361 37360 238012 33.1 203 15.5 0
893.77/894.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
893.77/894.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
893.77/894.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
893.77/894.08 c applied globally : - - - 51438 19.2 - - -
893.77/894.08 c applied locally : - - - 2028 34.1 - - -
893.77/894.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
893.77/894.08 c cut pool : 0.00 4 - - 39 - (maximal pool size: 542)
893.77/894.08 c redcost : 0.36 41690 0 0 0 0
893.77/894.08 c impliedbounds : 0.00 5 0 0 0 0
893.77/894.08 c intobj : 0.00 0 0 0 0 0
893.77/894.08 c cgmip : 0.00 0 0 0 0 0
893.77/894.08 c gomory : 0.76 5 0 0 795 0
893.77/894.08 c strongcg : 0.47 5 0 0 2314 0
893.77/894.08 c cmir : 0.00 0 0 0 0 0
893.77/894.08 c flowcover : 0.00 0 0 0 0 0
893.77/894.08 c clique : 0.00 5 0 0 0 0
893.77/894.08 c zerohalf : 0.00 0 0 0 0 0
893.77/894.08 c mcf : 0.00 1 0 0 0 0
893.77/894.08 c rapidlearning : 0.21 1 0 0 0 159
893.77/894.08 c Pricers : Time Calls Vars
893.77/894.08 c problem variables: 0.00 0 0
893.77/894.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
893.77/894.08 c relpscost : 87.47 42804 167 2135 0 0 82898
893.77/894.08 c pscost : 0.00 0 0 0 0 0 0
893.77/894.08 c inference : 0.00 0 0 0 0 0 0
893.77/894.08 c mostinf : 0.00 0 0 0 0 0 0
893.77/894.08 c leastinf : 0.00 0 0 0 0 0 0
893.77/894.08 c fullstrong : 0.00 0 0 0 0 0 0
893.77/894.08 c allfullstrong : 0.00 0 0 0 0 0 0
893.77/894.08 c random : 0.00 0 0 0 0 0 0
893.77/894.08 c Primal Heuristics : Time Calls Found
893.77/894.08 c LP solutions : 0.00 - 0
893.77/894.08 c pseudo solutions : 0.00 - 0
893.77/894.08 c trivial : 0.00 1 0
893.77/894.08 c simplerounding : 0.00 0 0
893.77/894.08 c zirounding : 0.00 0 0
893.77/894.08 c rounding : 0.00 0 0
893.77/894.08 c shifting : 0.00 0 0
893.77/894.08 c intshifting : 0.00 0 0
893.77/894.08 c oneopt : 0.00 0 0
893.77/894.08 c twoopt : 0.00 0 0
893.77/894.08 c fixandinfer : 0.00 0 0
893.77/894.08 c feaspump : 0.00 0 0
893.77/894.08 c coefdiving : 0.00 0 0
893.77/894.08 c pscostdiving : 0.00 0 0
893.77/894.08 c fracdiving : 0.00 0 0
893.77/894.08 c veclendiving : 0.00 0 0
893.77/894.08 c intdiving : 0.00 0 0
893.77/894.08 c actconsdiving : 0.00 0 0
893.77/894.08 c objpscostdiving : 0.00 0 0
893.77/894.08 c rootsoldiving : 0.00 0 0
893.77/894.08 c linesearchdiving : 0.00 0 0
893.77/894.08 c guideddiving : 0.00 0 0
893.77/894.08 c octane : 0.00 0 0
893.77/894.08 c rens : 0.00 0 0
893.77/894.08 c rins : 0.00 0 0
893.77/894.08 c localbranching : 0.00 0 0
893.77/894.08 c mutation : 0.00 0 0
893.77/894.08 c crossover : 0.00 0 0
893.77/894.08 c dins : 0.00 0 0
893.77/894.08 c undercover : 0.00 0 0
893.77/894.08 c nlp : 0.00 0 0
893.77/894.08 c trysol : 0.00 0 0
893.77/894.08 c LP : Time Calls Iterations Iter/call Iter/sec
893.77/894.08 c primal LP : 0.00 0 0 0.00 -
893.77/894.08 c dual LP : 685.95 80969 2248118 27.77 3277.38
893.77/894.08 c lex dual LP : 0.00 0 0 0.00 -
893.77/894.08 c barrier LP : 0.00 0 0 0.00 -
893.77/894.08 c diving/probing LP: 0.00 0 0 0.00 -
893.77/894.08 c strong branching : 85.84 5284 273019 51.67 3180.66
893.77/894.08 c (at root node) : - 10 1948 194.80 -
893.77/894.08 c conflict analysis: 0.00 0 0 0.00 -
893.77/894.08 c B&B Tree :
893.77/894.08 c number of runs : 1
893.77/894.08 c nodes : 82306
893.77/894.08 c nodes (total) : 82306
893.77/894.08 c nodes left : 0
893.77/894.08 c max depth : 53
893.77/894.08 c max depth (total): 53
893.77/894.08 c backtracks : 10333 (12.6%)
893.77/894.08 c delayed cutoffs : 593
893.77/894.08 c repropagations : 126171 (170992 domain reductions, 587 cutoffs)
893.77/894.08 c avg switch length: 4.71
893.77/894.08 c switching time : 26.69
893.77/894.08 c Solution :
893.77/894.08 c Solutions found : 0 (0 improvements)
893.77/894.08 c Primal Bound : infeasible
893.77/894.08 c Dual Bound : -
893.77/894.08 c Gap : 0.00 %
893.77/894.08 c Root Dual Bound : +0.00000000000000e+00
893.77/894.08 c Root Iterations : 189
893.87/894.11 c Time complete: 893.88.