0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691910-1338038184.opb>
0.00/0.01 c original problem has 1564 variables (100 bin, 0 int, 1464 impl, 0 cont) and 1716 constraints
0.00/0.01 c problem read in 0.01
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.00/0.06 c (round 1) 0 del vars, 1664 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 51 upgd conss, 5956 impls, 99 clqs
0.00/0.07 c (round 2) 1464 del vars, 1664 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5956 impls, 0 clqs
0.00/0.07 c presolving (3 rounds):
0.00/0.07 c 1464 deleted vars, 1664 deleted constraints, 100 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 5956 implications, 0 cliques
0.00/0.07 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.07 c 101 constraints of type <knapsack>
0.00/0.07 c 50 constraints of type <setppc>
0.00/0.07 c 1 constraints of type <linear>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.06
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 2.1.1.4
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1797
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 13950
0.00/0.07 c
0.00/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c limits/solutions = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.07 c separating/maxrounds = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/maxroundsroot = 5
0.00/0.07 c
0.00/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
0.00/0.07 c
0.00/0.07 c # belongs reading time to solving time?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c timing/reading = TRUE
0.00/0.07 c
0.00/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.07 c constraints/knapsack/disaggregation = FALSE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/coefdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.07 c heuristics/crossover/freq = -1
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/crossover/nodesofs = 750
0.00/0.07 c
0.00/0.07 c # number of nodes without incumbent change that heuristic should wait
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.07 c heuristics/crossover/nwaitingnodes = 100
0.00/0.07 c
0.00/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.07 c # [type: real, range: [0,1], default: 0.1]
0.00/0.07 c heuristics/crossover/nodesquot = 0.15
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixed
0.00/0.07 c # [type: real, range: [0,1], default: 0.666]
0.00/0.07 c heuristics/crossover/minfixingrate = 0.5
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/feaspump/freq = -1
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/fracdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/guideddiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/intshifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/linesearchdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/objpscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.07 c # [type: real, range: [0,1], default: 0.01]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/oneopt/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/pscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/rens/freq = -1
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixable
0.00/0.07 c # [type: real, range: [0,1], default: 0.5]
0.00/0.07 c heuristics/rens/minfixingrate = 0.3
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/rens/nodesofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/rootsoldiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/rounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/shiftandpropagate/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/shifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/simplerounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/subnlp/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/trivial/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/trysol/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/undercover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/veclendiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/zirounding/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c propagating/probing/maxprerounds = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/cmir/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/flowcover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/indoneopt/freq = -1
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.08 c 0.1s| 1 | 0 | 81 | - |4311k| 0 | 49 | 100 | 152 | 100 | 152 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 159 | - |4459k| 0 | 100 | 100 | 198 | 100 | 171 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 173 | - |4413k| 0 | 88 | 100 | 176 | 100 | 171 | 19 | 0 | 13 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 176 | - |4418k| 0 | 87 | 100 | 176 | 100 | 172 | 20 | 0 | 13 | 0.000000e+00 | -- | Inf
0.38/0.44 c 0.4s| 1 | 0 | 200 | - |4395k| 0 | 74 | 100 | 169 | 100 | 172 | 20 | 0 | 28 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 233 | - |4391k| 0 | 78 | 100 | 168 | 100 | 172 | 20 | 0 | 36 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 246 | - |4374k| 0 | 77 | 100 | 161 | 100 | 172 | 20 | 0 | 43 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 246 | - |4356k| 0 | - | 100 | 161 | 100 | 172 | 20 | 0 | 53 | 0.000000e+00 | -- | Inf
0.59/0.64 c (run 1, node 1) restarting after 25 global fixings of integer variables
0.59/0.64 c
0.59/0.64 c (restart) converted 2 cuts from the global cut pool into linear constraints
0.59/0.64 c
0.59/0.64 c presolving:
0.59/0.65 c (round 1) 25 del vars, 36 del conss, 0 add conss, 0 chg bounds, 75 chg sides, 75 chg coeffs, 0 upgd conss, 5956 impls, 0 clqs
0.59/0.65 c (round 2) 25 del vars, 38 del conss, 0 add conss, 0 chg bounds, 77 chg sides, 75 chg coeffs, 0 upgd conss, 5956 impls, 0 clqs
0.59/0.65 c (round 3) 25 del vars, 38 del conss, 0 add conss, 0 chg bounds, 77 chg sides, 75 chg coeffs, 17 upgd conss, 5956 impls, 0 clqs
0.59/0.65 c presolving (4 rounds):
0.59/0.65 c 25 deleted vars, 38 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 77 changed sides, 75 changed coefficients
0.59/0.65 c 5956 implications, 0 cliques
0.59/0.65 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 125 constraints
0.59/0.65 c 78 constraints of type <knapsack>
0.59/0.65 c 31 constraints of type <setppc>
0.59/0.65 c 1 constraints of type <linear>
0.59/0.65 c 15 constraints of type <logicor>
0.59/0.65 c transformed objective value is always integral (scale: 1)
0.59/0.65 c Presolving Time: 0.07
0.59/0.65 c
0.59/0.65 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.65 c 0.7s| 1 | 0 | 341 | - |4102k| 0 | 56 | 75 | 125 | 75 | 110 | 0 | 0 | 53 | 0.000000e+00 | -- | Inf
0.59/0.66 c 0.7s| 1 | 0 | 348 | - |4196k| 0 | 60 | 75 | 125 | 75 | 117 | 7 | 0 | 53 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.7s| 1 | 0 | 375 | - |4185k| 0 | 60 | 75 | 122 | 75 | 117 | 7 | 0 | 58 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 397 | - |4172k| 0 | 57 | 75 | 118 | 75 | 117 | 7 | 0 | 63 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 0 | 434 | - |4159k| 0 | 54 | 75 | 114 | 75 | 117 | 7 | 0 | 68 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 434 | - |4143k| 0 | - | 75 | 114 | 75 | 117 | 7 | 0 | 73 | 0.000000e+00 | -- | Inf
0.69/0.73 c (run 2, node 1) restarting after 20 global fixings of integer variables
0.69/0.73 c
0.69/0.73 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.69/0.73 c
0.69/0.73 c presolving:
0.69/0.73 c (round 1) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 111 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.73 c (round 2) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 114 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 3) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 117 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 4) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 121 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 5) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 124 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 6) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 127 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 7) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 130 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 8) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 135 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 9) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 137 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 10) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 140 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 11) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 143 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 12) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 145 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 13) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 147 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 14) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 148 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c (round 15) 20 del vars, 38 del conss, 0 add conss, 0 chg bounds, 108 chg sides, 149 chg coeffs, 1 upgd conss, 5956 impls, 0 clqs
0.69/0.74 c presolving (16 rounds):
0.69/0.74 c 20 deleted vars, 38 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 108 changed sides, 149 changed coefficients
0.69/0.74 c 5956 implications, 0 cliques
0.69/0.74 c presolved problem has 55 variables (55 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.69/0.74 c 59 constraints of type <knapsack>
0.69/0.74 c 15 constraints of type <setppc>
0.69/0.74 c 1 constraints of type <linear>
0.69/0.74 c 2 constraints of type <logicor>
0.69/0.74 c transformed objective value is always integral (scale: 1)
0.69/0.74 c Presolving Time: 0.07
0.69/0.74 c
0.69/0.74 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.74 c 0.7s| 1 | 0 | 508 | - |3941k| 0 | - | 55 | 77 | 55 | 75 | 0 | 0 | 73 | cutoff | -- | 0.00%
0.69/0.74 c 0.7s| 1 | 0 | 508 | - |3941k| 0 | - | 55 | 77 | 55 | 75 | 0 | 0 | 73 | cutoff | -- | 0.00%
0.69/0.74 c
0.69/0.74 c SCIP Status : problem is solved [infeasible]
0.69/0.74 c Solving Time (sec) : 0.74
0.69/0.74 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.69/0.74 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.74 c Dual Bound : +1.00000000000000e+20
0.69/0.74 c Gap : 0.00 %
0.69/0.74 s UNSATISFIABLE
0.69/0.74 c SCIP Status : problem is solved [infeasible]
0.69/0.74 c Total Time : 0.74
0.69/0.74 c solving : 0.74
0.69/0.74 c presolving : 0.07 (included in solving)
0.69/0.74 c reading : 0.01 (included in solving)
0.69/0.74 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.69/0.74 c Original Problem :
0.69/0.74 c Problem name : HOME/instance-3691910-1338038184.opb
0.69/0.74 c Variables : 1564 (100 binary, 0 integer, 1464 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 1716 initial, 1716 maximal
0.69/0.74 c Objective sense : minimize
0.69/0.74 c Presolved Problem :
0.69/0.74 c Problem name : t_HOME/instance-3691910-1338038184.opb
0.69/0.74 c Variables : 55 (55 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 77 initial, 77 maximal
0.69/0.74 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.74 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c trivial : 0.00 0.00 45 0 0 0 0 0 0 0 0
0.69/0.74 c dualfix : 0.00 0.00 1464 0 0 0 0 0 0 0 0
0.69/0.74 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c knapsack : 0.02 0.00 0 0 0 0 0 45 0 183 224
0.69/0.74 c setppc : 0.00 0.00 0 0 0 0 0 10 0 0 0
0.69/0.74 c linear : 0.00 0.00 0 0 0 0 0 8 0 2 0
0.69/0.74 c logicor : 0.00 0.00 0 0 0 0 0 13 0 0 0
0.69/0.74 c pseudoboolean : 0.00 0.00 0 0 0 0 0 1664 100 0 0
0.69/0.74 c root node : - - 45 - - 45 - - - - -
0.69/0.74 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.69/0.74 c integral : 0 0 0 0 9 0 2 0 0 45 0 0 0
0.69/0.74 c knapsack : 59 59 6 10 0 0 0 0 0 0 94 0 0
0.69/0.74 c setppc : 15 15 6 10 0 0 0 0 0 0 0 0 0
0.69/0.74 c linear : 1 1 7 10 0 0 0 0 0 0 0 0 0
0.69/0.74 c logicor : 2 2 1 2 0 0 0 0 0 0 0 0 0
0.69/0.74 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.69/0.74 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.69/0.74 c integral : 0.50 0.00 0.00 0.00 0.50 0.00 0.00 0.00
0.69/0.74 c knapsack : 0.01 0.00 0.01 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.69/0.74 c rootredcost : 0 0 0 0
0.69/0.74 c pseudoobj : 0 0 0 0
0.69/0.74 c vbounds : 0 0 0 0
0.69/0.74 c redcost : 12 0 0 0
0.69/0.74 c probing : 0 0 0 0
0.69/0.74 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.69/0.74 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c redcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c probing : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c applied globally : - - - 0 0.0 - - -
0.69/0.74 c applied locally : - - - 0 0.0 - - -
0.69/0.74 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.69/0.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.74 c closecuts : 0.00 0.00 0 0 0 0 0
0.69/0.74 c impliedbounds : 0.00 0.00 6 0 0 0 0
0.69/0.74 c intobj : 0.00 0.00 0 0 0 0 0
0.69/0.74 c gomory : 0.04 0.00 6 0 0 0 0
0.69/0.74 c cgmip : 0.00 0.00 0 0 0 0 0
0.69/0.74 c strongcg : 0.02 0.00 6 0 0 60 0
0.69/0.74 c cmir : 0.00 0.00 0 0 0 0 0
0.69/0.74 c flowcover : 0.00 0.00 0 0 0 0 0
0.69/0.74 c clique : 0.00 0.00 2 0 0 0 0
0.69/0.74 c zerohalf : 0.00 0.00 0 0 0 0 0
0.69/0.74 c mcf : 0.00 0.00 2 0 0 0 0
0.69/0.74 c oddcycle : 0.00 0.00 0 0 0 0 0
0.69/0.74 c rapidlearning : 0.06 0.00 1 0 0 0 46
0.69/0.74 c Pricers : ExecTime SetupTime Calls Vars
0.69/0.74 c problem variables: 0.00 - 0 0
0.69/0.74 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.69/0.74 c relpscost : 0.50 0.00 9 0 45 0 0 0
0.69/0.74 c pscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c inference : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c random : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c Primal Heuristics : ExecTime SetupTime Calls Found
0.69/0.74 c LP solutions : 0.00 - - 0
0.69/0.74 c pseudo solutions : 0.00 - - 0
0.69/0.74 c smallcard : 0.00 0.00 0 0
0.69/0.74 c trivial : 0.00 0.00 1 0
0.69/0.74 c shiftandpropagate: 0.00 0.00 0 0
0.69/0.74 c simplerounding : 0.00 0.00 0 0
0.69/0.74 c zirounding : 0.00 0.00 0 0
0.69/0.74 c rounding : 0.00 0.00 0 0
0.69/0.74 c shifting : 0.00 0.00 0 0
0.69/0.74 c intshifting : 0.00 0.00 0 0
0.69/0.74 c oneopt : 0.00 0.00 0 0
0.69/0.74 c twoopt : 0.00 0.00 0 0
0.69/0.74 c indtwoopt : 0.00 0.00 0 0
0.69/0.74 c indoneopt : 0.00 0.00 0 0
0.69/0.74 c fixandinfer : 0.00 0.00 0 0
0.69/0.74 c feaspump : 0.00 0.00 0 0
0.69/0.74 c clique : 0.00 0.00 0 0
0.69/0.74 c indrounding : 0.00 0.00 0 0
0.69/0.74 c indcoefdiving : 0.00 0.00 0 0
0.69/0.74 c coefdiving : 0.00 0.00 0 0
0.69/0.74 c pscostdiving : 0.00 0.00 0 0
0.69/0.74 c nlpdiving : 0.00 0.00 0 0
0.69/0.74 c fracdiving : 0.00 0.00 0 0
0.69/0.74 c veclendiving : 0.00 0.00 0 0
0.69/0.74 c intdiving : 0.00 0.00 0 0
0.69/0.74 c actconsdiving : 0.00 0.00 0 0
0.69/0.74 c objpscostdiving : 0.00 0.00 0 0
0.69/0.74 c rootsoldiving : 0.00 0.00 0 0
0.69/0.74 c linesearchdiving : 0.00 0.00 0 0
0.69/0.74 c guideddiving : 0.00 0.00 0 0
0.69/0.74 c octane : 0.00 0.00 0 0
0.69/0.74 c rens : 0.00 0.00 0 0
0.69/0.74 c rins : 0.00 0.00 0 0
0.69/0.74 c localbranching : 0.00 0.00 0 0
0.69/0.74 c mutation : 0.00 0.00 0 0
0.69/0.74 c crossover : 0.00 0.00 0 0
0.69/0.74 c dins : 0.00 0.00 0 0
0.69/0.74 c vbounds : 0.00 0.00 0 0
0.69/0.74 c undercover : 0.00 0.00 0 0
0.69/0.74 c subnlp : 0.00 0.00 0 0
0.69/0.74 c trysol : 0.00 0.00 0 0
0.69/0.74 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.69/0.74 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.74 c dual LP : 0.03 13 508 39.08 15861.62 0.00 0
0.69/0.74 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.74 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.74 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.74 c strong branching : 0.50 73 7131 97.68 14367.75
0.69/0.74 c (at root node) : - 73 7131 97.68 -
0.69/0.74 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.74 c B&B Tree :
0.69/0.74 c number of runs : 3
0.69/0.74 c nodes : 1
0.69/0.74 c nodes (total) : 3
0.69/0.74 c nodes left : 0
0.69/0.74 c max depth : 0
0.69/0.74 c max depth (total): 0
0.69/0.74 c backtracks : 0 (0.0%)
0.69/0.74 c delayed cutoffs : 0
0.69/0.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.74 c avg switch length: 2.00
0.69/0.74 c switching time : 0.00
0.69/0.74 c Solution :
0.69/0.74 c Solutions found : 0 (0 improvements)
0.69/0.74 c Primal Bound : infeasible
0.69/0.74 c Dual Bound : -
0.69/0.74 c Gap : 0.00 %
0.69/0.74 c Root Dual Bound : -
0.69/0.74 c Root Iterations : 508
0.69/0.75 c Time complete: 0.74.