0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665724-1276272681.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.02/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.02/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.02/0.03 c presolving (3 rounds):
0.02/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03 c 8 implications, 68 cliques
0.02/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.03 c 1 constraints of type <knapsack>
0.02/0.03 c 68 constraints of type <setppc>
0.02/0.03 c 4 constraints of type <logicor>
0.02/0.03 c transformed objective value is always integral (scale: 1)
0.02/0.03 c Presolving Time: 0.02
0.02/0.03 c - non default parameters ----------------------------------------------------------------------
0.02/0.03 c # SCIP version 1.2.1.2
0.02/0.03 c
0.02/0.03 c # frequency for displaying node information lines
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03 c display/freq = 10000
0.02/0.03 c
0.02/0.03 c # maximal time in seconds to run
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/time = 1800
0.02/0.03 c
0.02/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/memory = 1620
0.02/0.03 c
0.02/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c limits/solutions = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.03 c separating/maxrounds = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/maxroundsroot = 5
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify inequalities
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/linear/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.03 c constraints/knapsack/disaggregation = FALSE
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify knapsacks
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c presolving/probing/maxrounds = 0
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/coefdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.03 c heuristics/crossover/freq = -1
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/crossover/nodesofs = 750
0.02/0.03 c
0.02/0.03 c # number of nodes without incumbent change that heuristic should wait
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.03 c heuristics/crossover/nwaitingnodes = 100
0.02/0.03 c
0.02/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.03 c # [type: real, range: [0,1], default: 0.1]
0.02/0.03 c heuristics/crossover/nodesquot = 0.15
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixed
0.02/0.03 c # [type: real, range: [0,1], default: 0.666]
0.02/0.03 c heuristics/crossover/minfixingrate = 0.5
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/feaspump/freq = -1
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/fracdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/guideddiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/intshifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/linesearchdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/nlp/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/objpscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.03 c # [type: real, range: [0,1], default: 0.01]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/oneopt/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/pscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/rens/freq = -1
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixable
0.02/0.03 c # [type: real, range: [0,1], default: 0.5]
0.02/0.03 c heuristics/rens/minfixingrate = 0.3
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/rens/nodesofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/rootsoldiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/rounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/shifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/simplerounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/trivial/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/trysol/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/veclendiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/zirounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/cmir/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/flowcover/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/rapidlearning/freq = 0
0.02/0.03 c
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c start solving
0.02/0.03 c
0.02/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.04 c 0.0s| 1 | 0 | 47 | - | 743k| 0 | 40 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 161 | - |1206k| 0 | 55 | 169 | 216 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 188 | - |1210k| 0 | 59 | 169 | 216 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 335 | - |1221k| 0 | 58 | 169 | 216 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 415 | - |1231k| 0 | 59 | 169 | 216 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 484 | - |1243k| 0 | 61 | 169 | 216 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 642 | - |1121k| 0 | 58 | 169 | 105 | 169 | 108 | 35 | 0 | 14 | 0.000000e+00 | -- | Inf
1.10/1.19 c 1.1s| 1 | 0 | 705 | - |1118k| 0 | 58 | 169 | 103 | 169 | 108 | 35 | 0 | 27 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.2s| 1 | 0 | 727 | - |1114k| 0 | 60 | 169 | 99 | 169 | 108 | 35 | 0 | 32 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 883 | - |1111k| 0 | 55 | 169 | 96 | 169 | 108 | 35 | 0 | 43 | 0.000000e+00 | -- | Inf
1.79/1.81 c 1.7s| 1 | 0 | 1179 | - |1111k| 0 | 46 | 169 | 96 | 169 | 108 | 35 | 0 | 48 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 1258 | - |1111k| 0 | 60 | 169 | 96 | 169 | 105 | 35 | 0 | 55 | 0.000000e+00 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 1406 | - |1109k| 0 | 55 | 169 | 94 | 169 | 105 | 35 | 0 | 63 | 0.000000e+00 | -- | Inf
2.19/2.29 c 2.2s| 1 | 0 | 1406 | - |1109k| 0 | - | 169 | 94 | 169 | 105 | 35 | 0 | 69 | 0.000000e+00 | -- | Inf
2.19/2.29 c (run 1, node 1) restarting after 38 global fixings of integer variables
2.19/2.29 c
2.19/2.29 c (restart) converted 32 cuts from the global cut pool into linear constraints
2.19/2.29 c
2.19/2.29 c presolving:
2.29/2.30 c (round 1) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 88 clqs
2.29/2.30 c (round 2) 38 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 88 clqs
2.29/2.31 c (round 3) 38 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 50 upgd conss, 12 impls, 88 clqs
2.29/2.32 c (round 4) 38 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 50 upgd conss, 12 impls, 88 clqs
2.29/2.32 c presolving (5 rounds):
2.29/2.32 c 38 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
2.29/2.32 c 12 implications, 88 cliques
2.29/2.32 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 121 constraints
2.29/2.32 c 11 constraints of type <knapsack>
2.29/2.32 c 87 constraints of type <setppc>
2.29/2.32 c 23 constraints of type <logicor>
2.29/2.32 c transformed objective value is always integral (scale: 1)
2.29/2.32 c Presolving Time: 0.04
2.29/2.32 c
2.29/2.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.33 c 2.2s| 1 | 0 | 1458 | - | 919k| 0 | 40 | 131 | 121 | 131 | 102 | 0 | 0 | 69 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.3s| 1 | 0 | 1533 | - |1233k| 0 | 48 | 131 | 121 | 131 | 113 | 11 | 0 | 69 | 0.000000e+00 | -- | Inf
2.59/2.64 c 2.5s| 1 | 0 | 1855 | - |1233k| 0 | 49 | 131 | 121 | 131 | 113 | 11 | 0 | 85 | 0.000000e+00 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 1916 | - |1233k| 0 | 47 | 131 | 121 | 131 | 113 | 11 | 0 | 90 | 0.000000e+00 | -- | Inf
2.69/2.75 c 2.6s| 1 | 0 | 1997 | - |1232k| 0 | 46 | 131 | 120 | 131 | 113 | 11 | 0 | 95 | 0.000000e+00 | -- | Inf
2.79/2.81 c 2.7s| 1 | 0 | 2044 | - |1231k| 0 | 50 | 131 | 120 | 131 | 113 | 11 | 0 | 100 | 0.000000e+00 | -- | Inf
2.79/2.90 c 2.8s| 1 | 0 | 2207 | - |1230k| 0 | 49 | 131 | 116 | 131 | 113 | 11 | 0 | 105 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.8s| 1 | 0 | 2207 | - |1229k| 0 | - | 131 | 116 | 131 | 113 | 11 | 0 | 110 | 0.000000e+00 | -- | Inf
2.89/2.93 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.89/2.93 c
2.89/2.93 c (restart) converted 11 cuts from the global cut pool into linear constraints
2.89/2.93 c
2.89/2.93 c presolving:
2.89/2.94 c (round 1) 30 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 32 impls, 80 clqs
2.89/2.95 c (round 2) 30 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 32 impls, 80 clqs
2.89/2.96 c presolving (3 rounds):
2.89/2.96 c 30 deleted vars, 21 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.89/2.96 c 32 implications, 80 cliques
2.89/2.96 c presolved problem has 101 variables (101 bin, 0 int, 0 impl, 0 cont) and 106 constraints
2.89/2.96 c 18 constraints of type <knapsack>
2.89/2.96 c 82 constraints of type <setppc>
2.89/2.96 c 6 constraints of type <logicor>
2.89/2.96 c transformed objective value is always integral (scale: 1)
2.89/2.96 c Presolving Time: 0.05
2.89/2.96 c
2.89/2.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.96 c 2.8s| 1 | 0 | 2280 | - | 934k| 0 | 40 | 101 | 106 | 101 | 101 | 0 | 0 | 110 | 0.000000e+00 | -- | Inf
2.89/2.99 c 2.9s| 1 | 0 | 2408 | - |1325k| 0 | 48 | 101 | 106 | 101 | 111 | 10 | 0 | 110 | 0.000000e+00 | -- | Inf
2.99/3.08 c 3.0s| 1 | 0 | 2539 | - |1323k| 0 | - | 101 | 99 | 101 | 111 | 10 | 0 | 115 | -- | -- | 0.00%
2.99/3.08 c 3.0s| 1 | 0 | 2539 | - |1323k| 0 | - | 101 | 99 | 101 | 111 | 10 | 0 | 115 | -- | -- | 0.00%
2.99/3.08 c
2.99/3.08 c SCIP Status : problem is solved [infeasible]
2.99/3.08 c Solving Time (sec) : 2.95
2.99/3.08 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.99/3.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.99/3.08 c Dual Bound : +1.00000000000000e+20
2.99/3.08 c Gap : 0.00 %
2.99/3.08 s UNSATISFIABLE
2.99/3.08 c SCIP Status : problem is solved [infeasible]
2.99/3.08 c Solving Time : 2.95
2.99/3.08 c Original Problem :
2.99/3.08 c Problem name : HOME/instance-2665724-1276272681.opb
2.99/3.08 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.08 c Constraints : 101 initial, 101 maximal
2.99/3.08 c Presolved Problem :
2.99/3.08 c Problem name : t_HOME/instance-2665724-1276272681.opb
2.99/3.08 c Variables : 101 (101 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.08 c Constraints : 106 initial, 106 maximal
2.99/3.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.08 c trivial : 0.00 68 0 0 0 0 0 0 0
2.99/3.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.08 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.08 c probing : 0.00 0 0 0 0 0 0 0 0
2.99/3.08 c knapsack : 0.02 0 0 0 0 0 0 0 0
2.99/3.08 c setppc : 0.01 0 0 0 0 0 7 0 0
2.99/3.08 c linear : 0.02 0 0 0 0 0 32 1 0
2.99/3.08 c logicor : 0.00 0 0 0 0 0 15 0 0
2.99/3.08 c root node : - 92 - - 92 - - - -
2.99/3.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.08 c integral : 0 0 0 15 0 0 73 0 0 0
2.99/3.08 c knapsack : 18 7 17 0 0 0 0 0 0 0
2.99/3.08 c setppc : 82 7 17 0 0 0 19 0 0 0
2.99/3.08 c logicor : 6 7 7 0 0 0 0 0 0 0
2.99/3.08 c countsols : 0 0 0 0 0 0 0 0 0 0
2.99/3.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.08 c integral : 2.46 0.00 0.00 2.46 0.00
2.99/3.08 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.99/3.08 c setppc : 0.00 0.00 0.00 0.00 0.00
2.99/3.08 c logicor : 0.00 0.00 0.00 0.00 0.00
2.99/3.08 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.08 c Propagators : Time Calls Cutoffs DomReds
2.99/3.08 c vbounds : 0.00 3 0 0
2.99/3.08 c rootredcost : 0.00 0 0 0
2.99/3.08 c pseudoobj : 0.00 0 0 0
2.99/3.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.08 c applied globally : - - - 0 0.0 - - -
2.99/3.08 c applied locally : - - - 0 0.0 - - -
2.99/3.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 135)
2.99/3.08 c redcost : 0.00 7 0 0 0 0
2.99/3.08 c impliedbounds : 0.00 7 0 0 0 0
2.99/3.08 c intobj : 0.00 0 0 0 0 0
2.99/3.08 c cgmip : 0.00 0 0 0 0 0
2.99/3.08 c gomory : 0.05 7 0 0 120 0
2.99/3.08 c strongcg : 0.05 7 0 0 222 0
2.99/3.08 c cmir : 0.00 0 0 0 0 0
2.99/3.08 c flowcover : 0.00 0 0 0 0 0
2.99/3.08 c clique : 0.01 7 0 0 38 0
2.99/3.08 c zerohalf : 0.00 0 0 0 0 0
2.99/3.08 c mcf : 0.00 3 0 0 0 0
2.99/3.08 c rapidlearning : 0.16 1 0 0 0 143
2.99/3.08 c Pricers : Time Calls Vars
2.99/3.08 c problem variables: 0.00 0 0
2.99/3.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.08 c relpscost : 2.46 15 0 73 0 0 0
2.99/3.08 c pscost : 0.00 0 0 0 0 0 0
2.99/3.08 c inference : 0.00 0 0 0 0 0 0
2.99/3.08 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.08 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.08 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.08 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.08 c random : 0.00 0 0 0 0 0 0
2.99/3.08 c Primal Heuristics : Time Calls Found
2.99/3.08 c LP solutions : 0.00 - 0
2.99/3.08 c pseudo solutions : 0.00 - 0
2.99/3.08 c trivial : 0.00 1 0
2.99/3.08 c simplerounding : 0.00 0 0
2.99/3.08 c zirounding : 0.00 0 0
2.99/3.08 c rounding : 0.00 0 0
2.99/3.08 c shifting : 0.00 0 0
2.99/3.08 c intshifting : 0.00 0 0
2.99/3.08 c oneopt : 0.00 0 0
2.99/3.08 c twoopt : 0.00 0 0
2.99/3.08 c fixandinfer : 0.00 0 0
2.99/3.08 c feaspump : 0.00 0 0
2.99/3.08 c coefdiving : 0.00 0 0
2.99/3.08 c pscostdiving : 0.00 0 0
2.99/3.08 c fracdiving : 0.00 0 0
2.99/3.08 c veclendiving : 0.00 0 0
2.99/3.08 c intdiving : 0.00 0 0
2.99/3.08 c actconsdiving : 0.00 0 0
2.99/3.08 c objpscostdiving : 0.00 0 0
2.99/3.08 c rootsoldiving : 0.00 0 0
2.99/3.08 c linesearchdiving : 0.00 0 0
2.99/3.08 c guideddiving : 0.00 0 0
2.99/3.08 c octane : 0.00 0 0
2.99/3.08 c rens : 0.00 0 0
2.99/3.08 c rins : 0.00 0 0
2.99/3.08 c localbranching : 0.00 0 0
2.99/3.08 c mutation : 0.00 0 0
2.99/3.08 c crossover : 0.00 0 0
2.99/3.08 c dins : 0.00 0 0
2.99/3.08 c undercover : 0.00 0 0
2.99/3.08 c nlp : 0.00 0 0
2.99/3.08 c trysol : 0.00 0 0
2.99/3.08 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.08 c primal LP : 0.00 0 0 0.00 -
2.99/3.08 c dual LP : 0.15 23 2539 110.39 16926.67
2.99/3.08 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.08 c barrier LP : 0.00 0 0 0.00 -
2.99/3.08 c diving/probing LP: 0.00 0 0 0.00 -
2.99/3.08 c strong branching : 2.46 115 41247 358.67 16767.07
2.99/3.08 c (at root node) : - 115 41247 358.67 -
2.99/3.08 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.08 c B&B Tree :
2.99/3.08 c number of runs : 3
2.99/3.08 c nodes : 1
2.99/3.08 c nodes (total) : 3
2.99/3.08 c nodes left : 0
2.99/3.08 c max depth : 0
2.99/3.08 c max depth (total): 0
2.99/3.08 c backtracks : 0 (0.0%)
2.99/3.08 c delayed cutoffs : 0
2.99/3.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.99/3.08 c avg switch length: 2.00
2.99/3.08 c switching time : 0.00
2.99/3.08 c Solution :
2.99/3.08 c Solutions found : 0 (0 improvements)
2.99/3.08 c Primal Bound : infeasible
2.99/3.08 c Dual Bound : -
2.99/3.08 c Gap : 0.00 %
2.99/3.08 c Root Dual Bound : -
2.99/3.08 c Root Iterations : 2539
2.99/3.09 c Time complete: 3.08.