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-2667182-1276275153.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.02 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.01
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.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 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 | 129 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 178 | - |1195k| 0 | 48 | 169 | 253 | 169 | 83 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 222 | - |1295k| 0 | 53 | 169 | 253 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 249 | - |1321k| 0 | 54 | 169 | 253 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.30 c 0.2s| 1 | 0 | 307 | - |1335k| 0 | 58 | 169 | 253 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.33 c 0.3s| 1 | 0 | 406 | - |1366k| 0 | 59 | 169 | 253 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 436 | - |1189k| 0 | 53 | 169 | 83 | 169 | 106 | 33 | 0 | 5 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 436 | - |1189k| 0 | - | 169 | 83 | 169 | 106 | 33 | 0 | 11 | 0.000000e+00 | -- | Inf
0.49/0.51 c (run 1, node 1) restarting after 54 global fixings of integer variables
0.49/0.51 c
0.49/0.51 c (restart) converted 33 cuts from the global cut pool into linear constraints
0.49/0.51 c
0.49/0.51 c presolving:
0.49/0.52 c (round 1) 54 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 82 clqs
0.49/0.52 c (round 2) 54 del vars, 14 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 82 clqs
0.49/0.52 c (round 3) 54 del vars, 14 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 37 upgd conss, 16 impls, 82 clqs
0.49/0.53 c (round 4) 54 del vars, 16 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 37 upgd conss, 16 impls, 82 clqs
0.49/0.53 c presolving (5 rounds):
0.49/0.53 c 54 deleted vars, 16 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
0.49/0.53 c 16 implications, 82 cliques
0.49/0.53 c presolved problem has 115 variables (115 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.49/0.53 c 10 constraints of type <knapsack>
0.49/0.53 c 78 constraints of type <setppc>
0.49/0.53 c 12 constraints of type <logicor>
0.49/0.53 c transformed objective value is always integral (scale: 1)
0.49/0.53 c Presolving Time: 0.02
0.49/0.53 c
0.49/0.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.5s| 1 | 0 | 519 | - | 882k| 0 | 40 | 115 | 100 | 115 | 90 | 0 | 0 | 11 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 556 | - |1148k| 0 | 45 | 115 | 100 | 115 | 103 | 13 | 0 | 11 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 569 | - |1148k| 0 | 46 | 115 | 100 | 115 | 103 | 13 | 0 | 18 | 0.000000e+00 | -- | Inf
0.69/0.71 c 0.6s| 1 | 0 | 628 | - |1147k| 0 | 47 | 115 | 99 | 115 | 103 | 13 | 0 | 24 | 0.000000e+00 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 665 | - |1147k| 0 | 42 | 115 | 98 | 115 | 103 | 13 | 0 | 29 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 709 | - |1145k| 0 | 35 | 115 | 88 | 115 | 103 | 13 | 0 | 35 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 709 | - |1145k| 0 | - | 115 | 88 | 115 | 103 | 13 | 0 | 40 | 0.000000e+00 | -- | Inf
0.79/0.89 c (run 2, node 1) restarting after 49 global fixings of integer variables
0.79/0.89 c
0.79/0.89 c (restart) converted 13 cuts from the global cut pool into linear constraints
0.79/0.89 c
0.79/0.89 c presolving:
0.79/0.89 c (round 1) 50 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 63 clqs
0.89/0.90 c (round 2) 50 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 12 upgd conss, 34 impls, 63 clqs
0.89/0.90 c (round 3) 50 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 12 upgd conss, 34 impls, 63 clqs
0.89/0.90 c presolving (4 rounds):
0.89/0.90 c 50 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
0.89/0.90 c 34 implications, 63 cliques
0.89/0.90 c presolved problem has 65 variables (65 bin, 0 int, 0 impl, 0 cont) and 92 constraints
0.89/0.90 c 19 constraints of type <knapsack>
0.89/0.90 c 67 constraints of type <setppc>
0.89/0.90 c 6 constraints of type <logicor>
0.89/0.90 c transformed objective value is always integral (scale: 1)
0.89/0.90 c Presolving Time: 0.03
0.89/0.90 c
0.89/0.91 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.91 c 0.8s| 1 | 0 | 774 | - | 870k| 0 | 22 | 65 | 92 | 65 | 89 | 0 | 0 | 40 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.8s| 1 | 0 | 829 | - |1048k| 0 | - | 65 | 92 | 65 | 95 | 6 | 0 | 40 | -- | -- | 0.00%
0.89/0.92 c 0.8s| 1 | 0 | 829 | - |1048k| 0 | - | 65 | 92 | 65 | 95 | 6 | 0 | 40 | -- | -- | 0.00%
0.89/0.92 c
0.89/0.92 c SCIP Status : problem is solved [infeasible]
0.89/0.92 c Solving Time (sec) : 0.85
0.89/0.92 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.89/0.92 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.89/0.92 c Dual Bound : +1.00000000000000e+20
0.89/0.92 c Gap : 0.00 %
0.89/0.92 s UNSATISFIABLE
0.89/0.92 c SCIP Status : problem is solved [infeasible]
0.89/0.92 c Solving Time : 0.85
0.89/0.92 c Original Problem :
0.89/0.92 c Problem name : HOME/instance-2667182-1276275153.opb
0.89/0.92 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.92 c Constraints : 101 initial, 101 maximal
0.89/0.92 c Presolved Problem :
0.89/0.92 c Problem name : t_HOME/instance-2667182-1276275153.opb
0.89/0.92 c Variables : 65 (65 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.92 c Constraints : 92 initial, 92 maximal
0.89/0.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.92 c trivial : 0.00 103 0 0 0 0 0 0 0
0.89/0.92 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.92 c knapsack : 0.01 0 0 0 0 0 0 0 3
0.89/0.92 c setppc : 0.00 0 1 0 0 0 6 0 0
0.89/0.92 c linear : 0.00 0 0 0 0 0 39 4 0
0.89/0.92 c logicor : 0.00 0 0 0 0 0 8 0 0
0.89/0.92 c root node : - 103 - - 103 - - - -
0.89/0.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.92 c integral : 0 0 0 7 0 0 35 0 0 0
0.89/0.92 c knapsack : 19 7 10 0 0 0 0 2 0 0
0.89/0.92 c setppc : 67 7 10 0 0 0 68 0 0 0
0.89/0.92 c logicor : 6 7 6 0 0 0 0 0 0 0
0.89/0.92 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.92 c integral : 0.48 0.00 0.00 0.48 0.00
0.89/0.92 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.92 c Propagators : Time Calls Cutoffs DomReds
0.89/0.92 c vbounds : 0.00 3 0 0
0.89/0.92 c rootredcost : 0.00 0 0 0
0.89/0.92 c pseudoobj : 0.00 0 0 0
0.89/0.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.92 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.92 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.92 c applied globally : - - - 0 0.0 - - -
0.89/0.92 c applied locally : - - - 0 0.0 - - -
0.89/0.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.92 c cut pool : 0.00 0 - - 0 - (maximal pool size: 96)
0.89/0.92 c redcost : 0.00 7 0 0 0 0
0.89/0.92 c impliedbounds : 0.00 7 0 0 0 0
0.89/0.92 c intobj : 0.00 0 0 0 0 0
0.89/0.92 c cgmip : 0.00 0 0 0 0 0
0.89/0.92 c gomory : 0.04 7 0 0 90 0
0.89/0.92 c strongcg : 0.04 7 0 0 224 0
0.89/0.92 c cmir : 0.00 0 0 0 0 0
0.89/0.92 c flowcover : 0.00 0 0 0 0 0
0.89/0.92 c clique : 0.01 7 0 0 32 0
0.89/0.92 c zerohalf : 0.00 0 0 0 0 0
0.89/0.92 c mcf : 0.00 3 0 0 0 0
0.89/0.92 c rapidlearning : 0.15 1 0 0 0 180
0.89/0.92 c Pricers : Time Calls Vars
0.89/0.92 c problem variables: 0.00 0 0
0.89/0.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.92 c relpscost : 0.48 7 0 35 0 0 0
0.89/0.92 c pscost : 0.00 0 0 0 0 0 0
0.89/0.92 c inference : 0.00 0 0 0 0 0 0
0.89/0.92 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.92 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.92 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.92 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.92 c random : 0.00 0 0 0 0 0 0
0.89/0.92 c Primal Heuristics : Time Calls Found
0.89/0.92 c LP solutions : 0.00 - 0
0.89/0.92 c pseudo solutions : 0.00 - 0
0.89/0.92 c trivial : 0.00 1 0
0.89/0.92 c simplerounding : 0.00 0 0
0.89/0.92 c zirounding : 0.00 0 0
0.89/0.92 c rounding : 0.00 0 0
0.89/0.92 c shifting : 0.00 0 0
0.89/0.92 c intshifting : 0.00 0 0
0.89/0.92 c oneopt : 0.00 0 0
0.89/0.92 c twoopt : 0.00 0 0
0.89/0.92 c fixandinfer : 0.00 0 0
0.89/0.92 c feaspump : 0.00 0 0
0.89/0.92 c coefdiving : 0.00 0 0
0.89/0.92 c pscostdiving : 0.00 0 0
0.89/0.92 c fracdiving : 0.00 0 0
0.89/0.92 c veclendiving : 0.00 0 0
0.89/0.92 c intdiving : 0.00 0 0
0.89/0.92 c actconsdiving : 0.00 0 0
0.89/0.92 c objpscostdiving : 0.00 0 0
0.89/0.92 c rootsoldiving : 0.00 0 0
0.89/0.92 c linesearchdiving : 0.00 0 0
0.89/0.92 c guideddiving : 0.00 0 0
0.89/0.92 c octane : 0.00 0 0
0.89/0.92 c rens : 0.00 0 0
0.89/0.92 c rins : 0.00 0 0
0.89/0.92 c localbranching : 0.00 0 0
0.89/0.92 c mutation : 0.00 0 0
0.89/0.92 c crossover : 0.00 0 0
0.89/0.92 c dins : 0.00 0 0
0.89/0.92 c undercover : 0.00 0 0
0.89/0.92 c nlp : 0.00 0 0
0.89/0.92 c trysol : 0.00 0 0
0.89/0.92 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.92 c primal LP : 0.00 0 0 0.00 -
0.89/0.92 c dual LP : 0.06 15 829 55.27 13816.67
0.89/0.92 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.92 c barrier LP : 0.00 0 0 0.00 -
0.89/0.92 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.92 c strong branching : 0.47 40 5486 137.15 11672.34
0.89/0.92 c (at root node) : - 40 5486 137.15 -
0.89/0.92 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.92 c B&B Tree :
0.89/0.92 c number of runs : 3
0.89/0.92 c nodes : 1
0.89/0.92 c nodes (total) : 3
0.89/0.92 c nodes left : 0
0.89/0.92 c max depth : 0
0.89/0.92 c max depth (total): 0
0.89/0.92 c backtracks : 0 (0.0%)
0.89/0.92 c delayed cutoffs : 0
0.89/0.92 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.92 c avg switch length: 2.00
0.89/0.92 c switching time : 0.00
0.89/0.92 c Solution :
0.89/0.92 c Solutions found : 0 (0 improvements)
0.89/0.92 c Primal Bound : infeasible
0.89/0.92 c Dual Bound : -
0.89/0.92 c Gap : 0.00 %
0.89/0.92 c Root Dual Bound : -
0.89/0.92 c Root Iterations : 829
0.89/0.93 c Time complete: 0.93.