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-2704138-1278549581.opb>
0.03/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.03/0.05 c problem read
0.03/0.05 c No objective function, only one solution is needed.
0.03/0.05 c presolving settings loaded
0.03/0.06 c presolving:
0.09/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.09/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.09/0.13 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.09/0.13 c presolving (4 rounds):
0.09/0.13 c 0 deleted vars, 264 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 242 implications, 22 cliques
0.09/0.13 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.09/0.13 c 1 constraints of type <knapsack>
0.09/0.13 c 22 constraints of type <setppc>
0.09/0.13 c 2420 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.07
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.3
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1789.96
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = 1
0.09/0.13 c
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = 5
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.13 c constraints/knapsack/disaggregation = FALSE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c presolving/probing/maxrounds = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/coefdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.13 c heuristics/crossover/freq = -1
0.09/0.13 c
0.09/0.13 c # number of nodes added to the contingent of the total nodes
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.13 c heuristics/crossover/nodesofs = 750
0.09/0.13 c
0.09/0.13 c # number of nodes without incumbent change that heuristic should wait
0.09/0.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.13 c heuristics/crossover/nwaitingnodes = 100
0.09/0.13 c
0.09/0.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.13 c # [type: real, range: [0,1], default: 0.1]
0.09/0.13 c heuristics/crossover/nodesquot = 0.15
0.09/0.13 c
0.09/0.13 c # minimum percentage of integer variables that have to be fixed
0.09/0.13 c # [type: real, range: [0,1], default: 0.666]
0.09/0.13 c heuristics/crossover/minfixingrate = 0.5
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/feaspump/freq = -1
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/fracdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/guideddiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/intshifting/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.13 c heuristics/linesearchdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.13 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c heuristics/nlp/freq = -1
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.13 c heuristics/objpscostdiving/freq = -1
0.09/0.13 c
0.09/0.13 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.13 c # [type: real, range: [0,1], default: 0.01]
0.09/0.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.13 c
0.09/0.13 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/oneopt/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/pscostdiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/rens/freq = -1
0.09/0.14 c
0.09/0.14 c # minimum percentage of integer variables that have to be fixable
0.09/0.14 c # [type: real, range: [0,1], default: 0.5]
0.09/0.14 c heuristics/rens/minfixingrate = 0.3
0.09/0.14 c
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = 2000
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/trivial/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/trysol/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = -1
0.09/0.14 c
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.14 c
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/zirounding/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = -1
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/rapidlearning/freq = 0
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.16 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.16 c 0.1s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 94 | - |3906k| 0 | 46 | 231 |2623 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 112 | - |4309k| 0 | 49 | 231 |2623 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 122 | - |4666k| 0 | 53 | 231 |2623 | 231 |2461 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 134 | - |4778k| 0 | 55 | 231 |2623 | 231 |2464 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 152 | - |4855k| 0 | 54 | 231 |2623 | 231 |2466 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.57 c 2.5s| 1 | 2 | 152 | - |4855k| 0 | 54 | 231 |2623 | 231 |2466 | 23 | 0 | 10 | 0.000000e+00 | -- | Inf
154.44/154.51 c 154s| 10000 | 23 |296377 | 29.6 |7061k| 36 | - | 231 |7466 | 231 |2455 | 23 |7095 |2393 | 0.000000e+00 | -- | Inf
272.21/272.37 c 272s| 20000 | 49 |599584 | 30.0 |8335k| 39 | 36 | 231 | 10k| 231 |2455 | 23 | 14k|2664 | 0.000000e+00 | -- | Inf
398.28/398.41 c 398s| 30000 | 77 |902538 | 30.1 |9845k| 55 | 35 | 231 | 13k| 231 |2455 | 23 | 20k|3401 | 0.000000e+00 | -- | Inf
520.06/520.24 c 520s| 40000 | 35 | 1194k| 29.9 |9745k| 55 | 38 | 231 | 12k| 231 |2455 | 23 | 27k|4050 | 0.000000e+00 | -- | Inf
563.24/563.47 c
563.24/563.47 c SCIP Status : problem is solved [infeasible]
563.24/563.47 c Solving Time (sec) : 563.42
563.24/563.47 c Solving Nodes : 43679
563.24/563.47 c Primal Bound : +1.00000000000000e+20 (0 solutions)
563.24/563.47 c Dual Bound : +1.00000000000000e+20
563.24/563.47 c Gap : 0.00 %
563.24/563.47 s UNSATISFIABLE
563.24/563.47 c SCIP Status : problem is solved [infeasible]
563.24/563.47 c Solving Time : 563.42
563.24/563.47 c Original Problem :
563.24/563.47 c Problem name : HOME/instance-2704138-1278549581.opb
563.24/563.47 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
563.24/563.47 c Constraints : 2707 initial, 2707 maximal
563.24/563.47 c Presolved Problem :
563.24/563.47 c Problem name : t_HOME/instance-2704138-1278549581.opb
563.24/563.47 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
563.24/563.47 c Constraints : 2443 initial, 14030 maximal
563.24/563.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
563.24/563.47 c trivial : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c implics : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c probing : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c knapsack : 0.00 0 0 0 0 0 0 0 0
563.24/563.47 c setppc : 0.00 0 0 0 0 0 121 0 0
563.24/563.47 c linear : 0.03 0 0 0 0 0 143 0 0
563.24/563.47 c logicor : 0.03 0 0 0 0 0 0 0 0
563.24/563.47 c root node : - 1 - - 1 - - - -
563.24/563.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
563.24/563.47 c integral : 0 0 0 23010 0 110 1650 0 0 43976
563.24/563.47 c knapsack : 1 5 169750 0 0 204 74121 2 0 0
563.24/563.47 c setppc : 22 5 169650 0 0 873 242568 0 0 0
563.24/563.47 c linear : 0+ 5 168454 0 0 12 1701 5 0 0
563.24/563.47 c logicor : 2420+ 5 81451 0 0 269 257921 0 0 0
563.24/563.47 c countsols : 0 0 0 0 0 0 0 0 0 0
563.24/563.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
563.24/563.47 c integral : 72.87 0.00 0.00 72.87 0.00
563.24/563.47 c knapsack : 1.06 0.00 1.06 0.00 0.00
563.24/563.47 c setppc : 2.55 0.00 2.55 0.00 0.00
563.24/563.47 c linear : 1.20 0.00 1.20 0.00 0.00
563.24/563.47 c logicor : 14.43 0.00 14.43 0.00 0.00
563.24/563.47 c countsols : 0.00 0.00 0.00 0.00 0.00
563.24/563.47 c Propagators : Time Calls Cutoffs DomReds
563.24/563.47 c vbounds : 0.07 1 0 0
563.24/563.47 c rootredcost : 0.10 0 0 0
563.24/563.47 c pseudoobj : 0.06 0 0 0
563.24/563.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
563.24/563.47 c propagation : 0.10 1358 1350 6964 20.5 25 23.0 -
563.24/563.47 c infeasible LP : 8.24 20515 20145 118010 31.8 114 18.2 0
563.24/563.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
563.24/563.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
563.24/563.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
563.24/563.47 c applied globally : - - - 28622 18.9 - - -
563.24/563.47 c applied locally : - - - 1134 33.4 - - -
563.24/563.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
563.24/563.47 c cut pool : 0.00 4 - - 73 - (maximal pool size: 392)
563.24/563.47 c redcost : 0.19 22154 0 0 0 0
563.24/563.47 c impliedbounds : 0.00 5 0 0 0 0
563.24/563.47 c intobj : 0.00 0 0 0 0 0
563.24/563.47 c cgmip : 0.00 0 0 0 0 0
563.24/563.47 c gomory : 0.85 5 0 0 977 0
563.24/563.47 c strongcg : 0.67 5 0 0 1545 0
563.24/563.47 c cmir : 0.00 0 0 0 0 0
563.24/563.47 c flowcover : 0.00 0 0 0 0 0
563.24/563.47 c clique : 0.00 5 0 0 0 0
563.24/563.47 c zerohalf : 0.00 0 0 0 0 0
563.24/563.47 c mcf : 0.00 1 0 0 0 0
563.24/563.47 c rapidlearning : 0.22 1 0 0 0 180
563.24/563.47 c Pricers : Time Calls Vars
563.24/563.47 c problem variables: 0.00 0 0
563.24/563.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
563.24/563.47 c relpscost : 72.81 23010 110 1650 0 0 43976
563.24/563.47 c pscost : 0.00 0 0 0 0 0 0
563.24/563.47 c inference : 0.00 0 0 0 0 0 0
563.24/563.47 c mostinf : 0.00 0 0 0 0 0 0
563.24/563.47 c leastinf : 0.00 0 0 0 0 0 0
563.24/563.47 c fullstrong : 0.00 0 0 0 0 0 0
563.24/563.47 c allfullstrong : 0.00 0 0 0 0 0 0
563.24/563.47 c random : 0.00 0 0 0 0 0 0
563.24/563.47 c Primal Heuristics : Time Calls Found
563.24/563.47 c LP solutions : 0.00 - 0
563.24/563.47 c pseudo solutions : 0.00 - 0
563.24/563.47 c trivial : 0.00 1 0
563.24/563.47 c simplerounding : 0.00 0 0
563.24/563.47 c zirounding : 0.00 0 0
563.24/563.47 c rounding : 0.00 0 0
563.24/563.47 c shifting : 0.00 0 0
563.24/563.47 c intshifting : 0.00 0 0
563.24/563.47 c oneopt : 0.00 0 0
563.24/563.47 c twoopt : 0.00 0 0
563.24/563.47 c fixandinfer : 0.00 0 0
563.24/563.47 c feaspump : 0.00 0 0
563.24/563.47 c coefdiving : 0.00 0 0
563.24/563.47 c pscostdiving : 0.00 0 0
563.24/563.47 c fracdiving : 0.00 0 0
563.24/563.47 c veclendiving : 0.00 0 0
563.24/563.47 c intdiving : 0.00 0 0
563.24/563.47 c actconsdiving : 0.00 0 0
563.24/563.47 c objpscostdiving : 0.00 0 0
563.24/563.47 c rootsoldiving : 0.00 0 0
563.24/563.47 c linesearchdiving : 0.00 0 0
563.24/563.47 c guideddiving : 0.00 0 0
563.24/563.47 c octane : 0.00 0 0
563.24/563.47 c rens : 0.00 0 0
563.24/563.47 c rins : 0.00 0 0
563.24/563.47 c localbranching : 0.00 0 0
563.24/563.47 c mutation : 0.00 0 0
563.24/563.47 c crossover : 0.00 0 0
563.24/563.47 c dins : 0.00 0 0
563.24/563.47 c undercover : 0.00 0 0
563.24/563.47 c nlp : 0.00 0 0
563.24/563.47 c trysol : 0.00 0 0
563.24/563.47 c LP : Time Calls Iterations Iter/call Iter/sec
563.24/563.47 c primal LP : 0.00 0 0 0.00 -
563.24/563.47 c dual LP : 423.99 43437 1299398 29.91 3064.70
563.24/563.47 c lex dual LP : 0.00 0 0 0.00 -
563.24/563.47 c barrier LP : 0.00 0 0 0.00 -
563.24/563.47 c diving/probing LP: 0.00 0 0 0.00 -
563.24/563.47 c strong branching : 71.84 4230 216531 51.19 3014.11
563.24/563.47 c (at root node) : - 10 1641 164.10 -
563.24/563.47 c conflict analysis: 0.00 0 0 0.00 -
563.24/563.47 c B&B Tree :
563.24/563.47 c number of runs : 1
563.24/563.47 c nodes : 43679
563.24/563.47 c nodes (total) : 43679
563.24/563.47 c nodes left : 0
563.24/563.47 c max depth : 55
563.24/563.47 c max depth (total): 55
563.24/563.47 c backtracks : 5071 (11.6%)
563.24/563.47 c delayed cutoffs : 298
563.24/563.47 c repropagations : 70240 (88462 domain reductions, 292 cutoffs)
563.24/563.47 c avg switch length: 4.75
563.24/563.47 c switching time : 14.33
563.24/563.47 c Solution :
563.24/563.47 c Solutions found : 0 (0 improvements)
563.24/563.47 c Primal Bound : infeasible
563.24/563.47 c Dual Bound : -
563.24/563.47 c Gap : 0.00 %
563.24/563.47 c Root Dual Bound : +0.00000000000000e+00
563.24/563.47 c Root Iterations : 152
563.34/563.50 c Time complete: 563.35.