0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3729388-1338678733.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 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.00/0.01 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.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/nlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c 0.0s| 1 | 0 | 127 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.10 c 0.1s| 1 | 0 | 174 | - |1166k| 0 | 56 | 169 | 206 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.11 c 0.1s| 1 | 0 | 248 | - |1274k| 0 | 51 | 169 | 206 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.11 c 0.1s| 1 | 0 | 287 | - |1399k| 0 | 56 | 169 | 206 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.12 c 0.1s| 1 | 0 | 323 | - |1441k| 0 | 57 | 169 | 206 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.13 c 0.1s| 1 | 0 | 378 | - |1519k| 0 | 55 | 169 | 206 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.21 c 0.2s| 1 | 0 | 432 | - |1513k| 0 | 57 | 169 | 201 | 169 | 109 | 36 | 0 | 11 | 0.000000e+00 | -- | Inf
0.18/0.29 c 0.3s| 1 | 0 | 456 | - |1493k| 0 | 57 | 169 | 185 | 169 | 109 | 36 | 0 | 23 | 0.000000e+00 | -- | Inf
0.28/0.37 c 0.4s| 1 | 0 | 522 | - |1442k| 0 | 53 | 169 | 140 | 169 | 109 | 36 | 0 | 34 | 0.000000e+00 | -- | Inf
0.28/0.44 c 0.4s| 1 | 0 | 545 | - |1436k| 0 | 53 | 169 | 132 | 169 | 109 | 36 | 0 | 47 | 0.000000e+00 | -- | Inf
0.44/0.49 c 0.5s| 1 | 0 | 564 | - |1435k| 0 | 48 | 169 | 131 | 169 | 109 | 36 | 0 | 58 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 584 | - |1422k| 0 | 46 | 169 | 120 | 169 | 99 | 36 | 0 | 70 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 597 | - |1421k| 0 | 49 | 169 | 119 | 169 | 99 | 36 | 0 | 81 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 618 | - |1419k| 0 | 45 | 169 | 117 | 169 | 99 | 36 | 0 | 87 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 618 | - |1419k| 0 | - | 169 | 117 | 169 | 99 | 36 | 0 | 91 | 0.000000e+00 | -- | Inf
0.59/0.63 c (run 1, node 1) restarting after 36 global fixings of integer variables
0.59/0.63 c
0.59/0.63 c (restart) converted 25 cuts from the global cut pool into linear constraints
0.59/0.63 c
0.59/0.63 c presolving:
0.59/0.63 c (round 1) 36 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
0.59/0.63 c (round 2) 36 del vars, 6 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
0.59/0.63 c (round 3) 36 del vars, 6 del conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 64 upgd conss, 18 impls, 81 clqs
0.59/0.63 c presolving (4 rounds):
0.59/0.63 c 36 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients
0.59/0.63 c 18 implications, 81 cliques
0.59/0.63 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.59/0.63 c 8 constraints of type <knapsack>
0.59/0.63 c 85 constraints of type <setppc>
0.59/0.63 c 43 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.01
0.59/0.63 c
0.59/0.64 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.64 c 0.6s| 1 | 0 | 703 | - | 886k| 0 | 44 | 133 | 136 | 133 | 93 | 0 | 0 | 91 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 731 | - |1133k| 0 | 51 | 133 | 136 | 133 | 105 | 12 | 0 | 91 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 741 | - |1133k| 0 | 52 | 133 | 136 | 133 | 105 | 12 | 0 | 110 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 0 | 752 | - |1133k| 0 | 52 | 133 | 136 | 133 | 105 | 12 | 0 | 119 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 757 | - |1132k| 0 | 51 | 133 | 135 | 133 | 105 | 12 | 0 | 129 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 799 | - |1132k| 0 | 44 | 133 | 134 | 133 | 105 | 12 | 0 | 134 | 0.000000e+00 | -- | Inf
0.79/0.90 c 0.9s| 1 | 0 | 857 | - |1131k| 0 | 41 | 133 | 131 | 133 | 105 | 12 | 0 | 146 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 857 | - |1130k| 0 | - | 133 | 131 | 133 | 105 | 12 | 0 | 154 | 0.000000e+00 | -- | Inf
0.89/0.92 c (run 2, node 1) restarting after 30 global fixings of integer variables
0.89/0.92 c
0.89/0.92 c (restart) converted 12 cuts from the global cut pool into linear constraints
0.89/0.92 c
0.89/0.92 c presolving:
0.89/0.93 c (round 1) 30 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 32 impls, 75 clqs
0.89/0.93 c (round 2) 30 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 32 impls, 75 clqs
0.89/0.93 c presolving (3 rounds):
0.89/0.93 c 30 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.89/0.93 c 32 implications, 75 cliques
0.89/0.93 c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 123 constraints
0.89/0.93 c 16 constraints of type <knapsack>
0.89/0.93 c 80 constraints of type <setppc>
0.89/0.93 c 27 constraints of type <logicor>
0.89/0.93 c transformed objective value is always integral (scale: 1)
0.89/0.93 c Presolving Time: 0.02
0.89/0.93 c
0.89/0.93 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.93 c 0.9s| 1 | 0 | 931 | - | 914k| 0 | 45 | 103 | 123 | 103 | 96 | 0 | 0 | 154 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 963 | - |1120k| 0 | 50 | 103 | 123 | 103 | 106 | 10 | 0 | 154 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 1005 | - |1120k| 0 | 44 | 103 | 123 | 103 | 106 | 10 | 0 | 161 | 0.000000e+00 | -- | Inf
0.99/1.02 c 1.0s| 1 | 0 | 1024 | - |1117k| 0 | 41 | 103 | 114 | 103 | 106 | 10 | 0 | 174 | 0.000000e+00 | -- | Inf
0.99/1.03 c 1.0s| 1 | 0 | 1024 | - |1116k| 0 | - | 103 | 114 | 103 | 106 | 10 | 0 | 179 | 0.000000e+00 | -- | Inf
0.99/1.03 c (run 3, node 1) restarting after 26 global fixings of integer variables
0.99/1.03 c
0.99/1.03 c (restart) converted 10 cuts from the global cut pool into linear constraints
0.99/1.03 c
0.99/1.03 c presolving:
0.99/1.04 c (round 1) 38 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 60 impls, 54 clqs
0.99/1.04 c (round 2) 39 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 10 upgd conss, 66 impls, 54 clqs
0.99/1.04 c (round 3) 39 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 10 upgd conss, 66 impls, 54 clqs
0.99/1.04 c (round 4) 39 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 10 upgd conss, 66 impls, 54 clqs
0.99/1.04 c presolving (5 rounds):
0.99/1.04 c 39 deleted vars, 27 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 18 changed coefficients
0.99/1.04 c 66 implications, 54 cliques
0.99/1.04 c presolved problem has 64 variables (64 bin, 0 int, 0 impl, 0 cont) and 97 constraints
0.99/1.04 c 22 constraints of type <knapsack>
0.99/1.04 c 65 constraints of type <setppc>
0.99/1.04 c 10 constraints of type <logicor>
0.99/1.04 c transformed objective value is always integral (scale: 1)
0.99/1.04 c Presolving Time: 0.03
0.99/1.04 c
0.99/1.05 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.05 c 1.0s| 1 | 0 | 1087 | - | 869k| 0 | 31 | 64 | 97 | 64 | 87 | 0 | 0 | 179 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 1115 | - |1124k| 0 | 33 | 64 | 97 | 64 | 95 | 8 | 0 | 179 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 1147 | - |1114k| 0 | 12 | 64 | 68 | 64 | 95 | 8 | 0 | 185 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 1147 | - |1114k| 0 | - | 64 | 68 | 64 | 95 | 8 | 0 | 190 | 0.000000e+00 | -- | Inf
0.99/1.07 c (run 4, node 1) restarting after 39 global fixings of integer variables
0.99/1.07 c
0.99/1.07 c (restart) converted 8 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) 59 del vars, 42 del conss, 0 chg bounds, 70 chg sides, 98 chg coeffs, 0 upgd conss, 78 impls, 1 clqs
0.99/1.07 c (round 2) 64 del vars, 71 del conss, 0 chg bounds, 70 chg sides, 103 chg coeffs, 0 upgd conss, 80 impls, 0 clqs
0.99/1.07 c presolving (3 rounds):
0.99/1.07 c 64 deleted vars, 76 deleted constraints, 0 tightened bounds, 0 added holes, 70 changed sides, 103 changed coefficients
0.99/1.07 c 80 implications, 0 cliques
0.99/1.07 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.99/1.07 c transformed objective value is always integral (scale: 1)
0.99/1.07 c Presolving Time: 0.03
0.99/1.07 c
0.99/1.07 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.07 c * 1.1s| 1 | 0 | 1147 | - | 652k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 190 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.99/1.07 c 1.1s| 1 | 0 | 1147 | - | 652k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 190 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.99/1.07 c
0.99/1.07 c SCIP Status : problem is solved [optimal solution found]
0.99/1.07 c Solving Time (sec) : 1.07
0.99/1.07 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
0.99/1.07 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.99/1.07 c Dual Bound : +0.00000000000000e+00
0.99/1.07 c Gap : 0.00 %
0.99/1.08 s SATISFIABLE
0.99/1.08 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.99/1.08 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.99/1.08 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.99/1.08 v x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 -x95 -x94 -x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
0.99/1.08 v -x81 -x80 -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
0.99/1.08 v x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31
0.99/1.08 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
0.99/1.08 v -x4 -x3 x2 -x1
0.99/1.08 c SCIP Status : problem is solved [optimal solution found]
0.99/1.08 c Solving Time : 1.07
0.99/1.08 c Original Problem :
0.99/1.08 c Problem name : HOME/instance-3729388-1338678733.opb
0.99/1.08 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.08 c Constraints : 101 initial, 101 maximal
0.99/1.08 c Presolved Problem :
0.99/1.08 c Problem name : t_HOME/instance-3729388-1338678733.opb
0.99/1.08 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.08 c Constraints : 0 initial, 0 maximal
0.99/1.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.08 c trivial : 0.00 131 0 0 0 0 0 0 0
0.99/1.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.08 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.08 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.08 c knapsack : 0.02 0 0 0 0 0 22 69 121
0.99/1.08 c setppc : 0.00 33 4 0 0 0 61 0 0
0.99/1.08 c linear : 0.00 1 0 0 0 0 43 6 0
0.99/1.08 c logicor : 0.00 0 0 0 0 0 31 0 0
0.99/1.08 c root node : - 131 - - 131 - - - -
0.99/1.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.08 c integral : 0 0 0 20 0 0 91 0 0 0
0.99/1.08 c countsols : 0 0 0 0 0 0 0 0 0 0
0.99/1.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.08 c integral : 0.87 0.00 0.00 0.87 0.00
0.99/1.08 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.08 c Propagators : Time Calls Cutoffs DomReds
0.99/1.08 c vbounds : 0.00 5 0 0
0.99/1.08 c rootredcost : 0.00 0 0 0
0.99/1.08 c pseudoobj : 0.00 0 0 0
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 1 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 : Time 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 redcost : 0.00 8 0 0 0 0
0.99/1.08 c impliedbounds : 0.00 8 0 0 0 0
0.99/1.08 c intobj : 0.00 0 0 0 0 0
0.99/1.08 c cgmip : 0.00 0 0 0 0 0
0.99/1.08 c gomory : 0.02 8 0 0 88 0
0.99/1.08 c strongcg : 0.02 8 0 0 349 0
0.99/1.08 c cmir : 0.00 0 0 0 0 0
0.99/1.08 c flowcover : 0.00 0 0 0 0 0
0.99/1.08 c clique : 0.00 8 0 0 36 0
0.99/1.08 c zerohalf : 0.00 0 0 0 0 0
0.99/1.08 c mcf : 0.00 4 0 0 0 0
0.99/1.08 c rapidlearning : 0.08 1 0 0 0 133
0.99/1.08 c Pricers : Time Calls Vars
0.99/1.08 c problem variables: 0.00 0 0
0.99/1.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.08 c relpscost : 0.87 20 0 91 0 0 0
0.99/1.08 c pscost : 0.00 0 0 0 0 0 0
0.99/1.08 c inference : 0.00 0 0 0 0 0 0
0.99/1.08 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.08 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.08 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.08 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.08 c random : 0.00 0 0 0 0 0 0
0.99/1.08 c Primal Heuristics : Time 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 trivial : 0.00 1 0
0.99/1.08 c simplerounding : 0.00 0 0
0.99/1.08 c zirounding : 0.00 0 0
0.99/1.08 c rounding : 0.00 0 0
0.99/1.08 c shifting : 0.00 0 0
0.99/1.08 c intshifting : 0.00 0 0
0.99/1.08 c oneopt : 0.00 0 0
0.99/1.08 c twoopt : 0.00 0 0
0.99/1.08 c fixandinfer : 0.00 0 0
0.99/1.08 c feaspump : 0.00 0 0
0.99/1.08 c coefdiving : 0.00 0 0
0.99/1.08 c pscostdiving : 0.00 0 0
0.99/1.08 c fracdiving : 0.00 0 0
0.99/1.08 c veclendiving : 0.00 0 0
0.99/1.08 c intdiving : 0.00 0 0
0.99/1.08 c actconsdiving : 0.00 0 0
0.99/1.08 c objpscostdiving : 0.00 0 0
0.99/1.08 c rootsoldiving : 0.00 0 0
0.99/1.08 c linesearchdiving : 0.00 0 0
0.99/1.08 c guideddiving : 0.00 0 0
0.99/1.08 c octane : 0.00 0 0
0.99/1.08 c rens : 0.00 0 0
0.99/1.08 c rins : 0.00 0 0
0.99/1.08 c localbranching : 0.00 0 0
0.99/1.08 c mutation : 0.00 0 0
0.99/1.08 c crossover : 0.00 0 0
0.99/1.08 c dins : 0.00 0 0
0.99/1.08 c undercover : 0.00 0 0
0.99/1.08 c nlp : 0.00 0 0
0.99/1.08 c trysol : 0.00 0 0
0.99/1.08 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.08 c primal LP : 0.00 0 0 0.00 -
0.99/1.08 c dual LP : 0.03 28 1147 40.96 35657.66
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.99/1.08 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.08 c strong branching : 0.87 190 24038 126.52 27695.34
0.99/1.08 c (at root node) : - 190 24038 126.52 -
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 : 5
0.99/1.08 c nodes : 1
0.99/1.08 c nodes (total) : 5
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 : 1 (1 improvements)
0.99/1.08 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.07 seconds, depth 0, found by <relaxation>)
0.99/1.08 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 1.07 seconds, depth 0, found by <relaxation>)
0.99/1.08 c Dual Bound : +0.00000000000000e+00
0.99/1.08 c Gap : 0.00 %
0.99/1.08 c Root Dual Bound : +0.00000000000000e+00
0.99/1.08 c Root Iterations : 1147
0.99/1.08 c Time complete: 1.07.