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-3691909-1338038357.opb>
0.00/0.01 c original problem has 1576 variables (100 bin, 0 int, 1476 impl, 0 cont) and 1728 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.02 c presolving:
0.09/0.18 c (round 1) 0 del vars, 1676 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 51 upgd conss, 6004 impls, 99 clqs
0.09/0.19 c (round 2) 1476 del vars, 1676 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 6004 impls, 0 clqs
0.09/0.19 c presolving (3 rounds):
0.09/0.19 c 1476 deleted vars, 1676 deleted constraints, 100 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.19 c 6004 implications, 0 cliques
0.09/0.19 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.09/0.19 c 101 constraints of type <knapsack>
0.09/0.19 c 50 constraints of type <setppc>
0.09/0.19 c 1 constraints of type <linear>
0.09/0.19 c transformed objective value is always integral (scale: 1)
0.09/0.19 c Presolving Time: 0.18
0.09/0.19 c - non default parameters ----------------------------------------------------------------------
0.09/0.19 c # SCIP version 2.1.1.4
0.09/0.19 c
0.09/0.19 c # maximal time in seconds to run
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/time = 1797
0.09/0.19 c
0.09/0.19 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/memory = 13950
0.09/0.19 c
0.09/0.19 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.19 c limits/solutions = 1
0.09/0.19 c
0.09/0.19 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.19 c separating/maxrounds = 1
0.09/0.19 c
0.09/0.19 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.19 c separating/maxroundsroot = 5
0.09/0.19 c
0.09/0.19 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.19 c # [type: int, range: [1,2], default: 1]
0.09/0.19 c timing/clocktype = 2
0.09/0.19 c
0.09/0.19 c # belongs reading time to solving time?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c timing/reading = TRUE
0.09/0.19 c
0.09/0.19 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.19 c constraints/knapsack/disaggregation = FALSE
0.09/0.19 c
0.09/0.19 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.19 c heuristics/coefdiving/freq = -1
0.09/0.19 c
0.09/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.19 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.19 c
0.09/0.19 c # additional number of allowed LP iterations
0.09/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.19 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.20 c heuristics/crossover/freq = -1
0.09/0.20 c
0.09/0.20 c # number of nodes added to the contingent of the total nodes
0.09/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.20 c heuristics/crossover/nodesofs = 750
0.09/0.20 c
0.09/0.20 c # number of nodes without incumbent change that heuristic should wait
0.09/0.20 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.20 c heuristics/crossover/nwaitingnodes = 100
0.09/0.20 c
0.09/0.20 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.20 c # [type: real, range: [0,1], default: 0.1]
0.09/0.20 c heuristics/crossover/nodesquot = 0.15
0.09/0.20 c
0.09/0.20 c # minimum percentage of integer variables that have to be fixed
0.09/0.20 c # [type: real, range: [0,1], default: 0.666]
0.09/0.20 c heuristics/crossover/minfixingrate = 0.5
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.20 c heuristics/feaspump/freq = -1
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.20 c heuristics/fracdiving/freq = -1
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.20 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.20 c heuristics/guideddiving/freq = -1
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.20 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.20 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.20 c heuristics/intshifting/freq = -1
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.20 c heuristics/linesearchdiving/freq = -1
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.20 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.20 c heuristics/objpscostdiving/freq = -1
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.20 c # [type: real, range: [0,1], default: 0.01]
0.09/0.20 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.20 c heuristics/oneopt/freq = -1
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.20 c heuristics/pscostdiving/freq = -1
0.09/0.20 c
0.09/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.20 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.20 c
0.09/0.20 c # additional number of allowed LP iterations
0.09/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.20 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.20 c heuristics/rens/freq = -1
0.09/0.20 c
0.09/0.20 c # minimum percentage of integer variables that have to be fixable
0.09/0.20 c # [type: real, range: [0,1], default: 0.5]
0.09/0.20 c heuristics/rens/minfixingrate = 0.3
0.09/0.20 c
0.09/0.20 c # number of nodes added to the contingent of the total nodes
0.09/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.20 c heuristics/rens/nodesofs = 2000
0.09/0.20 c
0.09/0.20 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.20 c heuristics/rootsoldiving/freq = -1
0.09/0.20 c
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.20 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.19/0.20 c
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/rounding/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c heuristics/shiftandpropagate/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/shifting/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/simplerounding/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/subnlp/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c heuristics/trivial/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/trysol/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c heuristics/undercover/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/veclendiving/freq = -1
0.19/0.20 c
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/veclendiving/maxlpiterquot = 0.075
0.19/0.20 c
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/veclendiving/maxlpiterofs = 1500
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/zirounding/freq = -1
0.19/0.20 c
0.19/0.20 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c propagating/probing/maxprerounds = 0
0.19/0.20 c
0.19/0.20 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c separating/cmir/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c separating/flowcover/freq = -1
0.19/0.20 c
0.19/0.20 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c separating/rapidlearning/freq = 0
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/indoneopt/freq = -1
0.19/0.20 c
0.19/0.20 c -----------------------------------------------------------------------------------------------
0.19/0.20 c start solving
0.19/0.20 c
0.19/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.20 c 0.2s| 1 | 0 | 78 | - |4341k| 0 | 47 | 100 | 152 | 100 | 152 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 167 | - |4481k| 0 | 100 | 100 | 198 | 100 | 174 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 174 | - |4474k| 0 | 97 | 100 | 196 | 100 | 174 | 22 | 0 | 14 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 186 | - |4453k| 0 | 93 | 100 | 188 | 100 | 174 | 22 | 0 | 29 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.8s| 1 | 0 | 193 | - |4429k| 0 | 88 | 100 | 179 | 100 | 174 | 22 | 0 | 44 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.9s| 1 | 0 | 208 | - |4406k| 0 | 77 | 100 | 169 | 100 | 174 | 22 | 0 | 54 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 208 | - |4394k| 0 | - | 100 | 169 | 100 | 174 | 22 | 0 | 64 | 0.000000e+00 | -- | Inf
0.89/0.94 c (run 1, node 1) restarting after 21 global fixings of integer variables
0.89/0.94 c
0.89/0.94 c (restart) converted 3 cuts from the global cut pool into linear constraints
0.89/0.94 c
0.89/0.95 c presolving:
0.89/0.95 c (round 1) 21 del vars, 25 del conss, 0 add conss, 0 chg bounds, 78 chg sides, 78 chg coeffs, 0 upgd conss, 6004 impls, 0 clqs
0.89/0.95 c (round 2) 21 del vars, 25 del conss, 0 add conss, 0 chg bounds, 78 chg sides, 78 chg coeffs, 32 upgd conss, 6004 impls, 0 clqs
0.89/0.95 c presolving (3 rounds):
0.89/0.95 c 21 deleted vars, 25 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 78 changed sides, 78 changed coefficients
0.89/0.95 c 6004 implications, 0 cliques
0.89/0.95 c presolved problem has 79 variables (79 bin, 0 int, 0 impl, 0 cont) and 147 constraints
0.89/0.95 c 83 constraints of type <knapsack>
0.89/0.95 c 34 constraints of type <setppc>
0.89/0.95 c 1 constraints of type <linear>
0.89/0.95 c 29 constraints of type <logicor>
0.89/0.95 c transformed objective value is always integral (scale: 1)
0.89/0.95 c Presolving Time: 0.19
0.89/0.95 c
0.89/0.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.96 c 1.0s| 1 | 0 | 300 | - |4173k| 0 | 53 | 79 | 147 | 79 | 118 | 0 | 0 | 64 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 316 | - |4262k| 0 | 60 | 79 | 147 | 79 | 136 | 18 | 0 | 64 | 0.000000e+00 | -- | Inf
0.99/1.01 c 1.0s| 1 | 0 | 334 | - |4244k| 0 | 61 | 79 | 142 | 79 | 136 | 18 | 0 | 71 | 0.000000e+00 | -- | Inf
0.99/1.03 c 1.0s| 1 | 0 | 351 | - |4231k| 0 | 60 | 79 | 138 | 79 | 136 | 18 | 0 | 76 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.1s| 1 | 0 | 367 | - |4216k| 0 | 56 | 79 | 134 | 79 | 136 | 18 | 0 | 81 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 367 | - |4207k| 0 | - | 79 | 134 | 79 | 136 | 18 | 0 | 86 | 0.000000e+00 | -- | Inf
0.99/1.07 c (run 2, node 1) restarting after 20 global fixings of integer variables
0.99/1.07 c
0.99/1.07 c (restart) converted 2 cuts from the global cut pool into linear constraints
0.99/1.07 c
0.99/1.07 c presolving:
0.99/1.07 c (round 1) 20 del vars, 40 del conss, 0 add conss, 0 chg bounds, 64 chg sides, 65 chg coeffs, 2 upgd conss, 6004 impls, 0 clqs
0.99/1.07 c (round 2) 20 del vars, 40 del conss, 0 add conss, 0 chg bounds, 64 chg sides, 66 chg coeffs, 2 upgd conss, 6004 impls, 0 clqs
0.99/1.07 c (round 3) 20 del vars, 40 del conss, 0 add conss, 0 chg bounds, 64 chg sides, 67 chg coeffs, 2 upgd conss, 6004 impls, 0 clqs
0.99/1.08 c presolving (4 rounds):
0.99/1.08 c 20 deleted vars, 40 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 64 changed sides, 67 changed coefficients
0.99/1.08 c 6004 implications, 0 cliques
0.99/1.08 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 96 constraints
0.99/1.08 c 64 constraints of type <knapsack>
0.99/1.08 c 18 constraints of type <setppc>
0.99/1.08 c 1 constraints of type <linear>
0.99/1.08 c 13 constraints of type <logicor>
0.99/1.08 c transformed objective value is always integral (scale: 1)
0.99/1.08 c Presolving Time: 0.20
0.99/1.08 c
0.99/1.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.08 c 1.1s| 1 | 0 | 450 | - |4006k| 0 | - | 59 | 96 | 59 | 83 | 0 | 0 | 86 | cutoff | -- | 0.00%
0.99/1.08 c 1.1s| 1 | 0 | 450 | - |4006k| 0 | - | 59 | 96 | 59 | 83 | 0 | 0 | 86 | cutoff | -- | 0.00%
0.99/1.08 c
0.99/1.08 c SCIP Status : problem is solved [infeasible]
0.99/1.08 c Solving Time (sec) : 1.08
0.99/1.08 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.99/1.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.99/1.08 c Dual Bound : +1.00000000000000e+20
0.99/1.08 c Gap : 0.00 %
0.99/1.08 s UNSATISFIABLE
0.99/1.08 c SCIP Status : problem is solved [infeasible]
0.99/1.08 c Total Time : 1.08
0.99/1.08 c solving : 1.08
0.99/1.08 c presolving : 0.20 (included in solving)
0.99/1.08 c reading : 0.01 (included in solving)
0.99/1.08 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.99/1.08 c Original Problem :
0.99/1.08 c Problem name : HOME/instance-3691909-1338038357.opb
0.99/1.08 c Variables : 1576 (100 binary, 0 integer, 1476 implicit integer, 0 continuous)
0.99/1.08 c Constraints : 1728 initial, 1728 maximal
0.99/1.08 c Objective sense : minimize
0.99/1.08 c Presolved Problem :
0.99/1.08 c Problem name : t_HOME/instance-3691909-1338038357.opb
0.99/1.08 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.08 c Constraints : 96 initial, 96 maximal
0.99/1.08 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.99/1.08 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c trivial : 0.00 0.00 41 0 0 0 0 0 0 0 0
0.99/1.08 c dualfix : 0.00 0.00 1476 0 0 0 0 0 0 0 0
0.99/1.08 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.08 c knapsack : 0.01 0.00 0 0 0 0 0 42 0 142 145
0.99/1.08 c setppc : 0.00 0.00 0 0 0 0 0 6 0 0 0
0.99/1.08 c linear : 0.01 0.00 0 0 0 0 0 1 0 0 0
0.99/1.08 c logicor : 0.00 0.00 0 0 0 0 0 16 0 0 0
0.99/1.08 c pseudoboolean : 0.00 0.00 0 0 0 0 0 1676 100 0 0
0.99/1.08 c root node : - - 41 - - 41 - - - - -
0.99/1.08 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.99/1.08 c integral : 0 0 0 0 9 0 2 0 0 41 0 0 0
0.99/1.08 c knapsack : 64 64 6 10 0 0 0 0 0 0 140 0 0
0.99/1.08 c setppc : 18 18 6 10 0 0 0 0 0 0 0 0 0
0.99/1.08 c linear : 1 1 7 10 0 0 0 0 0 0 0 0 0
0.99/1.08 c logicor : 13 13 1 2 0 0 0 0 0 0 0 0 0
0.99/1.08 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.99/1.08 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.99/1.08 c integral : 0.64 0.00 0.00 0.00 0.64 0.00 0.00 0.00
0.99/1.08 c knapsack : 0.01 0.00 0.01 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.99/1.08 c rootredcost : 0 0 0 0
0.99/1.08 c pseudoobj : 0 0 0 0
0.99/1.08 c vbounds : 0 0 0 0
0.99/1.08 c redcost : 11 0 0 0
0.99/1.08 c probing : 0 0 0 0
0.99/1.08 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.99/1.08 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c redcost : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c probing : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.08 c applied globally : - - - 0 0.0 - - -
0.99/1.08 c applied locally : - - - 0 0.0 - - -
0.99/1.08 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.99/1.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.99/1.08 c closecuts : 0.00 0.00 0 0 0 0 0
0.99/1.08 c impliedbounds : 0.00 0.00 6 0 0 0 0
0.99/1.08 c intobj : 0.00 0.00 0 0 0 0 0
0.99/1.08 c gomory : 0.04 0.00 6 0 0 0 0
0.99/1.08 c cgmip : 0.00 0.00 0 0 0 0 0
0.99/1.08 c strongcg : 0.03 0.00 6 0 0 48 0
0.99/1.08 c cmir : 0.00 0.00 0 0 0 0 0
0.99/1.08 c flowcover : 0.00 0.00 0 0 0 0 0
0.99/1.08 c clique : 0.00 0.00 2 0 0 0 0
0.99/1.08 c zerohalf : 0.00 0.00 0 0 0 0 0
0.99/1.08 c mcf : 0.00 0.00 2 0 0 0 0
0.99/1.08 c oddcycle : 0.00 0.00 0 0 0 0 0
0.99/1.08 c rapidlearning : 0.11 0.00 1 0 0 0 46
0.99/1.08 c Pricers : ExecTime SetupTime Calls Vars
0.99/1.08 c problem variables: 0.00 - 0 0
0.99/1.08 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.99/1.08 c relpscost : 0.64 0.00 9 0 41 0 0 0
0.99/1.08 c pscost : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c inference : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c random : 0.00 0.00 0 0 0 0 0 0
0.99/1.08 c Primal Heuristics : ExecTime SetupTime Calls Found
0.99/1.08 c LP solutions : 0.00 - - 0
0.99/1.08 c pseudo solutions : 0.00 - - 0
0.99/1.08 c smallcard : 0.00 0.00 0 0
0.99/1.08 c trivial : 0.00 0.00 1 0
0.99/1.08 c shiftandpropagate: 0.00 0.00 0 0
0.99/1.08 c simplerounding : 0.00 0.00 0 0
0.99/1.08 c zirounding : 0.00 0.00 0 0
0.99/1.08 c rounding : 0.00 0.00 0 0
0.99/1.08 c shifting : 0.00 0.00 0 0
0.99/1.08 c intshifting : 0.00 0.00 0 0
0.99/1.08 c oneopt : 0.00 0.00 0 0
0.99/1.08 c twoopt : 0.00 0.00 0 0
0.99/1.08 c indtwoopt : 0.00 0.00 0 0
0.99/1.08 c indoneopt : 0.00 0.00 0 0
0.99/1.08 c fixandinfer : 0.00 0.00 0 0
0.99/1.08 c feaspump : 0.00 0.00 0 0
0.99/1.08 c clique : 0.00 0.00 0 0
0.99/1.08 c indrounding : 0.00 0.00 0 0
0.99/1.08 c indcoefdiving : 0.00 0.00 0 0
0.99/1.08 c coefdiving : 0.00 0.00 0 0
0.99/1.08 c pscostdiving : 0.00 0.00 0 0
0.99/1.08 c nlpdiving : 0.00 0.00 0 0
0.99/1.08 c fracdiving : 0.00 0.00 0 0
0.99/1.08 c veclendiving : 0.00 0.00 0 0
0.99/1.08 c intdiving : 0.00 0.00 0 0
0.99/1.08 c actconsdiving : 0.00 0.00 0 0
0.99/1.08 c objpscostdiving : 0.00 0.00 0 0
0.99/1.08 c rootsoldiving : 0.00 0.00 0 0
0.99/1.08 c linesearchdiving : 0.00 0.00 0 0
0.99/1.08 c guideddiving : 0.00 0.00 0 0
0.99/1.08 c octane : 0.00 0.00 0 0
0.99/1.08 c rens : 0.00 0.00 0 0
0.99/1.08 c rins : 0.00 0.00 0 0
0.99/1.08 c localbranching : 0.00 0.00 0 0
0.99/1.08 c mutation : 0.00 0.00 0 0
0.99/1.08 c crossover : 0.00 0.00 0 0
0.99/1.08 c dins : 0.00 0.00 0 0
0.99/1.08 c vbounds : 0.00 0.00 0 0
0.99/1.08 c undercover : 0.00 0.00 0 0
0.99/1.08 c subnlp : 0.00 0.00 0 0
0.99/1.08 c trysol : 0.00 0.00 0 0
0.99/1.08 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.99/1.08 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.99/1.08 c dual LP : 0.03 12 450 37.50 14035.74 0.00 0
0.99/1.08 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.08 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.99/1.08 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.08 c strong branching : 0.64 86 8940 103.95 13897.05
0.99/1.08 c (at root node) : - 86 8940 103.95 -
0.99/1.08 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.08 c B&B Tree :
0.99/1.08 c number of runs : 3
0.99/1.08 c nodes : 1
0.99/1.08 c nodes (total) : 3
0.99/1.08 c nodes left : 0
0.99/1.08 c max depth : 0
0.99/1.08 c max depth (total): 0
0.99/1.08 c backtracks : 0 (0.0%)
0.99/1.08 c delayed cutoffs : 0
0.99/1.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.08 c avg switch length: 2.00
0.99/1.08 c switching time : 0.00
0.99/1.08 c Solution :
0.99/1.08 c Solutions found : 0 (0 improvements)
0.99/1.08 c Primal Bound : infeasible
0.99/1.08 c Dual Bound : -
0.99/1.08 c Gap : 0.00 %
0.99/1.08 c Root Dual Bound : -
0.99/1.08 c Root Iterations : 450
0.99/1.09 c Time complete: 1.08.