0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3489337-1307759362.opb>
0.00/0.05 c original problem has 3249 variables (3249 bin, 0 int, 0 impl, 0 cont) and 8983 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.07 c presolving:
0.09/0.14 c (round 1) 253 del vars, 139 del conss, 0 add conss, 48 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.09/0.14 c (round 2) 255 del vars, 559 del conss, 0 add conss, 50 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.09/0.14 c (round 3) 257 del vars, 564 del conss, 0 add conss, 52 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156872 impls, 0 clqs
0.09/0.14 c (round 4) 259 del vars, 569 del conss, 0 add conss, 55 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156911 impls, 0 clqs
0.09/0.14 c (round 5) 261 del vars, 576 del conss, 0 add conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156986 impls, 0 clqs
0.09/0.15 c (round 6) 263 del vars, 581 del conss, 0 add conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.09/0.15 c (round 7) 263 del vars, 583 del conss, 0 add conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.09/0.18 c (round 8) 263 del vars, 583 del conss, 0 add conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 8400 upgd conss, 157052 impls, 0 clqs
0.18/0.20 c presolving (9 rounds):
0.18/0.20 c 263 deleted vars, 583 deleted constraints, 0 added constraints, 56 tightened bounds, 0 added holes, 192 changed sides, 402 changed coefficients
0.18/0.20 c 157052 implications, 0 cliques
0.18/0.20 c presolved problem has 2986 variables (2986 bin, 0 int, 0 impl, 0 cont) and 8400 constraints
0.18/0.20 c 384 constraints of type <knapsack>
0.18/0.20 c 5349 constraints of type <setppc>
0.18/0.20 c 2667 constraints of type <logicor>
0.18/0.20 c transformed objective value is always integral (scale: 1)
0.18/0.20 c Presolving Time: 0.13
0.18/0.20 c - non default parameters ----------------------------------------------------------------------
0.18/0.20 c # SCIP version 2.0.1.5
0.18/0.20 c
0.18/0.20 c # frequency for displaying node information lines
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 100]
0.18/0.20 c display/freq = 10000
0.18/0.20 c
0.18/0.20 c # maximal time in seconds to run
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.18/0.20 c limits/time = 1797
0.18/0.20 c
0.18/0.20 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.18/0.20 c limits/memory = 13950
0.18/0.20 c
0.18/0.20 c # solving stops, if the given number of solutions were found (-1: no limit)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.18/0.20 c limits/solutions = 1
0.18/0.20 c
0.18/0.20 c # maximal number of separation rounds per node (-1: unlimited)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 5]
0.18/0.20 c separating/maxrounds = 1
0.18/0.20 c
0.18/0.20 c # maximal number of separation rounds in the root node (-1: unlimited)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.18/0.20 c separating/maxroundsroot = 5
0.18/0.20 c
0.18/0.20 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.18/0.20 c # [type: int, range: [1,2], default: 1]
0.18/0.20 c timing/clocktype = 2
0.18/0.20 c
0.18/0.20 c # belongs reading time to solving time?
0.18/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.18/0.20 c timing/reading = TRUE
0.18/0.20 c
0.18/0.20 c # should presolving try to simplify inequalities
0.18/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.18/0.20 c constraints/linear/simplifyinequalities = TRUE
0.18/0.20 c
0.18/0.20 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.18/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.18/0.20 c constraints/indicator/addCouplingCons = TRUE
0.18/0.20 c
0.18/0.20 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.18/0.20 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.18/0.20 c constraints/knapsack/disaggregation = FALSE
0.18/0.20 c
0.18/0.20 c # should presolving try to simplify knapsacks
0.18/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.18/0.20 c constraints/knapsack/simplifyinequalities = TRUE
0.18/0.20 c
0.18/0.20 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.18/0.20 c presolving/probing/maxrounds = 0
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/coefdiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/coefdiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/coefdiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 30]
0.18/0.20 c heuristics/crossover/freq = -1
0.18/0.20 c
0.18/0.20 c # number of nodes added to the contingent of the total nodes
0.18/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.18/0.20 c heuristics/crossover/nodesofs = 750
0.18/0.20 c
0.18/0.20 c # number of nodes without incumbent change that heuristic should wait
0.18/0.20 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.18/0.20 c heuristics/crossover/nwaitingnodes = 100
0.18/0.20 c
0.18/0.20 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.18/0.20 c # [type: real, range: [0,1], default: 0.1]
0.18/0.20 c heuristics/crossover/nodesquot = 0.15
0.18/0.20 c
0.18/0.20 c # minimum percentage of integer variables that have to be fixed
0.18/0.20 c # [type: real, range: [0,1], default: 0.666]
0.18/0.20 c heuristics/crossover/minfixingrate = 0.5
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.18/0.20 c heuristics/feaspump/freq = -1
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/feaspump/maxlpiterofs = 2000
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/fracdiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/fracdiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/fracdiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/guideddiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/guideddiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/guideddiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/intdiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/intshifting/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/linesearchdiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.18/0.20 c heuristics/objpscostdiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to total iteration number
0.18/0.20 c # [type: real, range: [0,1], default: 0.01]
0.18/0.20 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/oneopt/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/pscostdiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/pscostdiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c heuristics/rens/freq = -1
0.18/0.20 c
0.18/0.20 c # minimum percentage of integer variables that have to be fixable
0.18/0.20 c # [type: real, range: [0,1], default: 0.5]
0.18/0.20 c heuristics/rens/minfixingrate = 0.3
0.18/0.20 c
0.18/0.20 c # number of nodes added to the contingent of the total nodes
0.18/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.18/0.20 c heuristics/rens/nodesofs = 2000
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.18/0.20 c heuristics/rootsoldiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.18/0.20 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/rounding/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c heuristics/shiftandpropagate/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/shifting/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/simplerounding/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/subnlp/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c heuristics/trivial/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/trysol/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c heuristics/undercover/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.18/0.20 c heuristics/veclendiving/freq = -1
0.18/0.20 c
0.18/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.18/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.18/0.20 c heuristics/veclendiving/maxlpiterquot = 0.075
0.18/0.20 c
0.18/0.20 c # additional number of allowed LP iterations
0.18/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.18/0.20 c heuristics/veclendiving/maxlpiterofs = 1500
0.18/0.20 c
0.18/0.20 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.18/0.20 c heuristics/zirounding/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c separating/cmir/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.18/0.20 c separating/flowcover/freq = -1
0.18/0.20 c
0.18/0.20 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.18/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.18/0.20 c separating/rapidlearning/freq = 0
0.18/0.20 c
0.18/0.20 c -----------------------------------------------------------------------------------------------
0.18/0.20 c start solving
0.18/0.20 c
0.18/0.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.18/0.27 c 0.3s| 1 | 0 | 1075 | - | 21M| 0 | 735 |2986 |8400 |2986 |8400 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.61/0.62 c 0.6s| 1 | 0 | 1415 | - | 22M| 0 | 871 |2986 |8455 |2986 |8475 | 75 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.79 c 0.8s| 1 | 0 | 1895 | - | 22M| 0 |1021 |2986 |8455 |2986 |8566 | 166 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.28 c 2.3s| 1 | 0 | 3634 | - | 22M| 0 |1003 |2986 |8455 |2986 |8696 | 296 | 0 | 0 | 0.000000e+00 | -- | Inf
3.88/3.96 c 4.0s| 1 | 0 | 5058 | - | 23M| 0 |1070 |2986 |8455 |2986 |8747 | 347 | 0 | 0 | 0.000000e+00 | -- | Inf
5.79/5.86 c 5.9s| 1 | 0 | 5723 | - | 23M| 0 |1157 |2986 |8455 |2986 |8831 | 431 | 0 | 0 | 0.000000e+00 | -- | Inf
7.09/7.17 c 7.2s| 1 | 2 | 5723 | - | 23M| 0 |1157 |2986 |8455 |2986 |8831 | 431 | 0 | 11 | 0.000000e+00 | -- | Inf
51.59/51.66 c
51.59/51.66 c SCIP Status : problem is solved [infeasible]
51.59/51.66 c Solving Time (sec) : 51.66
51.59/51.66 c Solving Nodes : 371
51.59/51.66 c Primal Bound : +1.00000000000000e+20 (0 solutions)
51.59/51.66 c Dual Bound : +1.00000000000000e+20
51.59/51.66 c Gap : 0.00 %
51.59/51.66 s UNSATISFIABLE
51.59/51.66 c SCIP Status : problem is solved [infeasible]
51.59/51.66 c Total Time : 51.66
51.59/51.66 c solving : 51.66
51.59/51.66 c presolving : 0.13 (included in solving)
51.59/51.66 c reading : 0.05 (included in solving)
51.59/51.66 c Original Problem :
51.59/51.66 c Problem name : HOME/instance-3489337-1307759362.opb
51.59/51.66 c Variables : 3249 (3249 binary, 0 integer, 0 implicit integer, 0 continuous)
51.59/51.66 c Constraints : 8983 initial, 8983 maximal
51.59/51.66 c Presolved Problem :
51.59/51.66 c Problem name : t_HOME/instance-3489337-1307759362.opb
51.59/51.66 c Variables : 2986 (2986 binary, 0 integer, 0 implicit integer, 0 continuous)
51.59/51.66 c Constraints : 8400 initial, 8510 maximal
51.59/51.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
51.59/51.66 c trivial : 0.00 2 0 0 0 0 0 0 0 0
51.59/51.66 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c implics : 0.01 0 203 0 0 0 0 0 0 0
51.59/51.66 c probing : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
51.59/51.66 c setppc : 0.01 0 0 0 0 0 0 0 0 0
51.59/51.66 c linear : 0.09 54 4 0 56 0 583 0 192 402
51.59/51.66 c logicor : 0.01 0 0 0 0 0 0 0 0 0
51.59/51.66 c root node : - 1697 - - 1697 - - - - -
51.59/51.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
51.59/51.66 c integral : 0 0 0 256 0 1 0 0 7 0 0 504
51.59/51.66 c knapsack : 384 5 4687 0 0 0 2 0 171 989 0 0
51.59/51.66 c setppc : 5349 5 4687 0 0 0 20749 79 36733 0 0 0
51.59/51.66 c linear : 0+ 5 4607 0 0 0 2 0 2 23 0 0
51.59/51.66 c logicor : 2667+ 5 4138 0 0 0 10167 89 20234 0 0 0
51.59/51.66 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
51.59/51.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
51.59/51.66 c integral : 33.21 0.00 0.00 33.21 0.00 0.00 0.00
51.59/51.66 c knapsack : 0.04 0.01 0.03 0.00 0.00 0.00 0.00
51.59/51.66 c setppc : 0.22 0.00 0.21 0.00 0.00 0.00 0.01
51.59/51.66 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
51.59/51.66 c logicor : 0.08 0.00 0.07 0.00 0.00 0.00 0.01
51.59/51.66 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
51.59/51.66 c Propagators : #Propagate #Resprop Cutoffs DomReds
51.59/51.66 c vbounds : 0 0 0 0
51.59/51.66 c rootredcost : 0 0 0 0
51.59/51.66 c pseudoobj : 0 0 0 0
51.59/51.66 c Propagator Timings : TotalTime Propagate Resprop
51.59/51.66 c vbounds : 0.00 0.00 0.00
51.59/51.66 c rootredcost : 0.00 0.00 0.00
51.59/51.66 c pseudoobj : 0.00 0.00 0.00
51.59/51.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
51.59/51.66 c propagation : 0.02 168 167 642 17.3 15 19.4 -
51.59/51.66 c infeasible LP : 0.02 31 31 149 19.9 5 11.4 0
51.59/51.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
51.59/51.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
51.59/51.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
51.59/51.66 c applied globally : - - - 448 12.6 - - -
51.59/51.66 c applied locally : - - - 0 0.0 - - -
51.59/51.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
51.59/51.66 c cut pool : 0.00 4 - - 82 - (maximal pool size: 1088)
51.59/51.66 c redcost : 0.01 256 0 0 0 0
51.59/51.66 c impliedbounds : 0.00 5 0 0 0 0
51.59/51.66 c intobj : 0.00 0 0 0 0 0
51.59/51.66 c gomory : 2.30 5 0 0 1509 0
51.59/51.66 c cgmip : 0.00 0 0 0 0 0
51.59/51.66 c closecuts : 0.00 0 0 0 0 0
51.59/51.66 c strongcg : 2.01 5 0 0 2266 0
51.59/51.66 c cmir : 0.00 0 0 0 0 0
51.59/51.66 c flowcover : 0.00 0 0 0 0 0
51.59/51.66 c clique : 0.12 5 0 0 37 0
51.59/51.66 c zerohalf : 0.00 0 0 0 0 0
51.59/51.66 c mcf : 0.02 1 0 0 0 0
51.59/51.66 c oddcycle : 0.00 0 0 0 0 0
51.59/51.66 c rapidlearning : 0.15 1 0 0 0 55
51.59/51.66 c Pricers : Time Calls Vars
51.59/51.66 c problem variables: 0.00 0 0
51.59/51.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
51.59/51.66 c relpscost : 33.21 256 0 7 0 0 504
51.59/51.66 c pscost : 0.00 0 0 0 0 0 0
51.59/51.66 c inference : 0.00 0 0 0 0 0 0
51.59/51.66 c mostinf : 0.00 0 0 0 0 0 0
51.59/51.66 c leastinf : 0.00 0 0 0 0 0 0
51.59/51.66 c fullstrong : 0.00 0 0 0 0 0 0
51.59/51.66 c allfullstrong : 0.00 0 0 0 0 0 0
51.59/51.66 c random : 0.00 0 0 0 0 0 0
51.59/51.66 c Primal Heuristics : Time Calls Found
51.59/51.66 c LP solutions : 0.00 - 0
51.59/51.66 c pseudo solutions : 0.00 - 0
51.59/51.66 c trivial : 0.00 1 0
51.59/51.66 c shiftandpropagate: 0.00 0 0
51.59/51.66 c simplerounding : 0.00 0 0
51.59/51.66 c zirounding : 0.00 0 0
51.59/51.66 c rounding : 0.00 0 0
51.59/51.66 c shifting : 0.00 0 0
51.59/51.66 c intshifting : 0.00 0 0
51.59/51.66 c oneopt : 0.00 0 0
51.59/51.66 c twoopt : 0.00 0 0
51.59/51.66 c fixandinfer : 0.00 0 0
51.59/51.66 c feaspump : 0.00 0 0
51.59/51.66 c clique : 0.00 0 0
51.59/51.66 c coefdiving : 0.00 0 0
51.59/51.66 c pscostdiving : 0.00 0 0
51.59/51.66 c fracdiving : 0.00 0 0
51.59/51.66 c veclendiving : 0.00 0 0
51.59/51.66 c intdiving : 0.00 0 0
51.59/51.66 c actconsdiving : 0.00 0 0
51.59/51.66 c objpscostdiving : 0.00 0 0
51.59/51.66 c rootsoldiving : 0.00 0 0
51.59/51.66 c linesearchdiving : 0.00 0 0
51.59/51.66 c guideddiving : 0.00 0 0
51.59/51.66 c octane : 0.00 0 0
51.59/51.66 c rens : 0.00 0 0
51.59/51.66 c rins : 0.00 0 0
51.59/51.66 c localbranching : 0.00 0 0
51.59/51.66 c mutation : 0.00 0 0
51.59/51.66 c crossover : 0.00 0 0
51.59/51.66 c dins : 0.00 0 0
51.59/51.66 c vbounds : 0.00 0 0
51.59/51.66 c undercover : 0.00 0 0
51.59/51.66 c subnlp : 0.00 0 0
51.59/51.66 c trysol : 0.00 0 0
51.59/51.66 c LP : Time Calls Iterations Iter/call Iter/sec
51.59/51.66 c primal LP : 0.00 0 0 0.00 -
51.59/51.66 c dual LP : 12.70 290 62031 213.90 4884.88
51.59/51.66 c lex dual LP : 0.00 0 0 0.00 -
51.59/51.66 c barrier LP : 0.00 0 0 0.00 -
51.59/51.66 c diving/probing LP: 0.00 0 0 0.00 -
51.59/51.66 c strong branching : 33.15 260 137459 528.69 4146.45
51.59/51.66 c (at root node) : - 11 3925 356.82 -
51.59/51.66 c conflict analysis: 0.00 0 0 0.00 -
51.59/51.66 c B&B Tree :
51.59/51.66 c number of runs : 1
51.59/51.66 c nodes : 371
51.59/51.66 c nodes (total) : 371
51.59/51.66 c nodes left : 0
51.59/51.66 c max depth : 35
51.59/51.66 c max depth (total): 35
51.59/51.66 c backtracks : 95 (25.6%)
51.59/51.66 c delayed cutoffs : 134
51.59/51.66 c repropagations : 428 (22352 domain reductions, 80 cutoffs)
51.59/51.66 c avg switch length: 3.53
51.59/51.66 c switching time : 0.16
51.59/51.66 c Solution :
51.59/51.66 c Solutions found : 0 (0 improvements)
51.59/51.66 c Primal Bound : infeasible
51.59/51.66 c Dual Bound : -
51.59/51.66 c Gap : 0.00 %
51.59/51.66 c Root Dual Bound : +0.00000000000000e+00
51.59/51.66 c Root Iterations : 5723
51.59/51.69 c Time complete: 51.68.