0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667178-1276274859.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.00/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.00/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.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.00
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/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.00/0.04 c 0.0s| 1 | 0 | 100 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 136 | - |1204k| 0 | 51 | 169 | 224 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 189 | - |1437k| 0 | 53 | 169 | 224 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 260 | - |1623k| 0 | 58 | 169 | 224 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 367 | - |1653k| 0 | 57 | 169 | 224 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 409 | - |1725k| 0 | 57 | 169 | 224 | 169 | 113 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 432 | - |1704k| 0 | 57 | 169 | 205 | 169 | 113 | 40 | 0 | 10 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 475 | - |1622k| 0 | 55 | 169 | 134 | 169 | 113 | 40 | 0 | 17 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 543 | - |1609k| 0 | 51 | 169 | 123 | 169 | 113 | 40 | 0 | 28 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 575 | - |1608k| 0 | 51 | 169 | 121 | 169 | 113 | 40 | 0 | 36 | 0.000000e+00 | -- | Inf
0.99/1.01 c 0.9s| 1 | 0 | 589 | - |1606k| 0 | 51 | 169 | 119 | 169 | 113 | 40 | 0 | 41 | 0.000000e+00 | -- | Inf
0.99/1.09 c 1.0s| 1 | 0 | 599 | - |1606k| 0 | 48 | 169 | 119 | 169 | 102 | 40 | 0 | 51 | 0.000000e+00 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 599 | - |1606k| 0 | - | 169 | 119 | 169 | 102 | 40 | 0 | 56 | 0.000000e+00 | -- | Inf
1.09/1.13 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.09/1.13 c
1.09/1.13 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.09/1.13 c
1.09/1.13 c presolving:
1.09/1.14 c (round 1) 35 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 89 clqs
1.09/1.14 c (round 2) 35 del vars, 6 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 89 clqs
1.09/1.15 c (round 3) 35 del vars, 9 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 70 upgd conss, 10 impls, 89 clqs
1.09/1.16 c (round 4) 35 del vars, 13 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 70 upgd conss, 10 impls, 89 clqs
1.09/1.16 c presolving (5 rounds):
1.09/1.16 c 35 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.09/1.16 c 10 implications, 89 cliques
1.09/1.16 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 135 constraints
1.09/1.16 c 7 constraints of type <knapsack>
1.09/1.16 c 86 constraints of type <setppc>
1.09/1.16 c 42 constraints of type <logicor>
1.09/1.16 c transformed objective value is always integral (scale: 1)
1.09/1.16 c Presolving Time: 0.02
1.09/1.16 c
1.09/1.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.17 c 1.1s| 1 | 0 | 713 | - | 888k| 0 | 43 | 134 | 135 | 134 | 97 | 0 | 0 | 56 | 0.000000e+00 | -- | Inf
1.09/1.19 c 1.1s| 1 | 0 | 742 | - |1113k| 0 | 51 | 134 | 135 | 134 | 109 | 12 | 0 | 56 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 796 | - |1102k| 0 | 44 | 134 | 100 | 134 | 109 | 12 | 0 | 63 | 0.000000e+00 | -- | Inf
1.29/1.31 c 1.2s| 1 | 0 | 796 | - |1102k| 0 | - | 134 | 100 | 134 | 109 | 12 | 0 | 69 | 0.000000e+00 | -- | Inf
1.29/1.31 c (run 2, node 1) restarting after 39 global fixings of integer variables
1.29/1.31 c
1.29/1.31 c (restart) converted 12 cuts from the global cut pool into linear constraints
1.29/1.31 c
1.29/1.31 c presolving:
1.29/1.32 c (round 1) 39 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 68 clqs
1.29/1.33 c (round 2) 39 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 68 clqs
1.29/1.33 c presolving (3 rounds):
1.29/1.33 c 39 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.33 c 38 implications, 68 cliques
1.29/1.33 c presolved problem has 95 variables (95 bin, 0 int, 0 impl, 0 cont) and 95 constraints
1.29/1.33 c 15 constraints of type <knapsack>
1.29/1.33 c 72 constraints of type <setppc>
1.29/1.33 c 8 constraints of type <logicor>
1.29/1.33 c transformed objective value is always integral (scale: 1)
1.29/1.33 c Presolving Time: 0.04
1.29/1.33 c
1.29/1.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.33 c 1.2s| 1 | 0 | 860 | - | 891k| 0 | 41 | 95 | 95 | 95 | 89 | 0 | 0 | 69 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 963 | - |1058k| 0 | - | 95 | 95 | 95 | 97 | 8 | 0 | 69 | -- | -- | 0.00%
1.29/1.36 c 1.3s| 1 | 0 | 963 | - |1058k| 0 | - | 95 | 95 | 95 | 97 | 8 | 0 | 69 | -- | -- | 0.00%
1.29/1.36 c
1.29/1.36 c SCIP Status : problem is solved [infeasible]
1.29/1.36 c Solving Time (sec) : 1.26
1.29/1.36 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.29/1.36 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.29/1.36 c Dual Bound : +1.00000000000000e+20
1.29/1.36 c Gap : 0.00 %
1.29/1.36 s UNSATISFIABLE
1.29/1.36 c SCIP Status : problem is solved [infeasible]
1.29/1.36 c Solving Time : 1.26
1.29/1.36 c Original Problem :
1.29/1.36 c Problem name : HOME/instance-2667178-1276274859.opb
1.29/1.36 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 101 initial, 101 maximal
1.29/1.36 c Presolved Problem :
1.29/1.36 c Problem name : t_HOME/instance-2667178-1276274859.opb
1.29/1.36 c Variables : 95 (95 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 95 initial, 95 maximal
1.29/1.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.36 c trivial : 0.00 74 0 0 0 0 0 0 0
1.29/1.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c knapsack : 0.04 0 0 0 0 0 0 0 0
1.29/1.36 c setppc : 0.00 0 0 0 0 0 13 0 0
1.29/1.36 c linear : 0.00 0 0 0 0 0 33 2 0
1.29/1.36 c logicor : 0.00 0 0 0 0 0 12 0 0
1.29/1.36 c root node : - 74 - - 74 - - - -
1.29/1.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.36 c integral : 0 0 0 9 0 0 45 0 0 0
1.29/1.36 c knapsack : 15 7 11 0 0 0 0 0 0 0
1.29/1.36 c setppc : 72 7 11 0 0 0 28 0 0 0
1.29/1.36 c logicor : 8 7 4 0 0 0 1 0 0 0
1.29/1.36 c countsols : 0 0 0 0 0 0 0 0 0 0
1.29/1.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.36 c integral : 0.88 0.00 0.00 0.88 0.00
1.29/1.36 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.29/1.36 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c Propagators : Time Calls Cutoffs DomReds
1.29/1.36 c vbounds : 0.00 3 0 0
1.29/1.36 c rootredcost : 0.00 0 0 0
1.29/1.36 c pseudoobj : 0.00 0 0 0
1.29/1.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.36 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.36 c applied globally : - - - 0 0.0 - - -
1.29/1.36 c applied locally : - - - 0 0.0 - - -
1.29/1.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.36 c cut pool : 0.00 0 - - 0 - (maximal pool size: 68)
1.29/1.36 c redcost : 0.00 7 0 0 0 0
1.29/1.36 c impliedbounds : 0.00 7 0 0 0 0
1.29/1.36 c intobj : 0.00 0 0 0 0 0
1.29/1.36 c cgmip : 0.00 0 0 0 0 0
1.29/1.36 c gomory : 0.04 7 0 0 15 0
1.29/1.36 c strongcg : 0.05 7 0 0 313 0
1.29/1.36 c cmir : 0.00 0 0 0 0 0
1.29/1.36 c flowcover : 0.00 0 0 0 0 0
1.29/1.36 c clique : 0.01 7 0 0 36 0
1.29/1.36 c zerohalf : 0.00 0 0 0 0 0
1.29/1.36 c mcf : 0.00 3 0 0 0 0
1.29/1.36 c rapidlearning : 0.16 1 0 0 0 151
1.29/1.36 c Pricers : Time Calls Vars
1.29/1.36 c problem variables: 0.00 0 0
1.29/1.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.36 c relpscost : 0.88 9 0 45 0 0 0
1.29/1.36 c pscost : 0.00 0 0 0 0 0 0
1.29/1.36 c inference : 0.00 0 0 0 0 0 0
1.29/1.36 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.36 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.36 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c random : 0.00 0 0 0 0 0 0
1.29/1.36 c Primal Heuristics : Time Calls Found
1.29/1.36 c LP solutions : 0.00 - 0
1.29/1.36 c pseudo solutions : 0.00 - 0
1.29/1.36 c trivial : 0.00 1 0
1.29/1.36 c simplerounding : 0.00 0 0
1.29/1.36 c zirounding : 0.00 0 0
1.29/1.36 c rounding : 0.00 0 0
1.29/1.36 c shifting : 0.00 0 0
1.29/1.36 c intshifting : 0.00 0 0
1.29/1.36 c oneopt : 0.00 0 0
1.29/1.36 c twoopt : 0.00 0 0
1.29/1.36 c fixandinfer : 0.00 0 0
1.29/1.36 c feaspump : 0.00 0 0
1.29/1.36 c coefdiving : 0.00 0 0
1.29/1.36 c pscostdiving : 0.00 0 0
1.29/1.36 c fracdiving : 0.00 0 0
1.29/1.36 c veclendiving : 0.00 0 0
1.29/1.36 c intdiving : 0.00 0 0
1.29/1.36 c actconsdiving : 0.00 0 0
1.29/1.36 c objpscostdiving : 0.00 0 0
1.29/1.36 c rootsoldiving : 0.00 0 0
1.29/1.36 c linesearchdiving : 0.00 0 0
1.29/1.36 c guideddiving : 0.00 0 0
1.29/1.36 c octane : 0.00 0 0
1.29/1.36 c rens : 0.00 0 0
1.29/1.36 c rins : 0.00 0 0
1.29/1.36 c localbranching : 0.00 0 0
1.29/1.36 c mutation : 0.00 0 0
1.29/1.36 c crossover : 0.00 0 0
1.29/1.36 c dins : 0.00 0 0
1.29/1.36 c undercover : 0.00 0 0
1.29/1.36 c nlp : 0.00 0 0
1.29/1.36 c trysol : 0.00 0 0
1.29/1.36 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.36 c primal LP : 0.00 0 0 0.00 -
1.29/1.36 c dual LP : 0.04 17 963 56.65 24075.00
1.29/1.36 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.36 c barrier LP : 0.00 0 0 0.00 -
1.29/1.36 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.36 c strong branching : 0.88 69 8998 130.41 10225.00
1.29/1.36 c (at root node) : - 69 8998 130.41 -
1.29/1.36 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.36 c B&B Tree :
1.29/1.36 c number of runs : 3
1.29/1.36 c nodes : 1
1.29/1.36 c nodes (total) : 3
1.29/1.36 c nodes left : 0
1.29/1.36 c max depth : 0
1.29/1.36 c max depth (total): 0
1.29/1.36 c backtracks : 0 (0.0%)
1.29/1.36 c delayed cutoffs : 0
1.29/1.36 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.36 c avg switch length: 2.00
1.29/1.36 c switching time : 0.00
1.29/1.36 c Solution :
1.29/1.36 c Solutions found : 0 (0 improvements)
1.29/1.36 c Primal Bound : infeasible
1.29/1.36 c Dual Bound : -
1.29/1.36 c Gap : 0.00 %
1.29/1.36 c Root Dual Bound : -
1.29/1.36 c Root Iterations : 963
1.29/1.37 c Time complete: 1.36.