0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665770-1276277034.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.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.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.03 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 | 51 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 67 | - |1175k| 0 | 44 | 169 | 197 | 169 | 81 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 101 | - |1434k| 0 | 54 | 169 | 197 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 122 | - |1539k| 0 | 59 | 169 | 197 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 191 | - |1641k| 0 | 62 | 169 | 197 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 223 | - |1682k| 0 | 65 | 169 | 197 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.5s| 1 | 0 | 234 | - |1667k| 0 | 65 | 169 | 185 | 169 | 104 | 31 | 0 | 11 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 316 | - |1578k| 0 | 60 | 169 | 108 | 169 | 104 | 31 | 0 | 21 | 0.000000e+00 | -- | Inf
0.99/1.04 c 1.0s| 1 | 0 | 365 | - |1577k| 0 | 61 | 169 | 107 | 169 | 104 | 31 | 0 | 28 | 0.000000e+00 | -- | Inf
1.20/1.22 c 1.1s| 1 | 0 | 392 | - |1577k| 0 | 58 | 169 | 107 | 169 | 104 | 31 | 0 | 37 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 428 | - |1568k| 0 | 59 | 169 | 99 | 169 | 104 | 31 | 0 | 48 | 0.000000e+00 | -- | Inf
1.69/1.77 c 1.7s| 1 | 0 | 457 | - |1563k| 0 | 57 | 169 | 94 | 169 | 102 | 31 | 0 | 60 | 0.000000e+00 | -- | Inf
1.89/1.90 c 1.8s| 1 | 0 | 484 | - |1562k| 0 | 58 | 169 | 93 | 169 | 102 | 31 | 0 | 67 | 0.000000e+00 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 484 | - |1562k| 0 | - | 169 | 93 | 169 | 102 | 31 | 0 | 73 | 0.000000e+00 | -- | Inf
1.99/2.04 c (run 1, node 1) restarting after 37 global fixings of integer variables
1.99/2.04 c
1.99/2.04 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.99/2.04 c
1.99/2.04 c presolving:
1.99/2.05 c (round 1) 37 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 85 clqs
1.99/2.06 c (round 2) 37 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 48 upgd conss, 18 impls, 85 clqs
1.99/2.06 c (round 3) 37 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 48 upgd conss, 18 impls, 85 clqs
1.99/2.07 c presolving (4 rounds):
1.99/2.07 c 37 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.07 c 18 implications, 85 cliques
1.99/2.07 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 116 constraints
1.99/2.07 c 8 constraints of type <knapsack>
1.99/2.07 c 84 constraints of type <setppc>
1.99/2.07 c 24 constraints of type <logicor>
1.99/2.07 c transformed objective value is always integral (scale: 1)
1.99/2.07 c Presolving Time: 0.02
1.99/2.07 c
1.99/2.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.07 c 2.0s| 1 | 0 | 557 | - | 867k| 0 | 44 | 132 | 116 | 132 | 97 | 0 | 0 | 73 | 0.000000e+00 | -- | Inf
2.09/2.10 c 2.0s| 1 | 0 | 612 | - |1203k| 0 | 53 | 132 | 116 | 132 | 106 | 9 | 0 | 73 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.2s| 1 | 0 | 815 | - |1202k| 0 | 47 | 132 | 116 | 132 | 106 | 9 | 0 | 82 | 0.000000e+00 | -- | Inf
2.40/2.45 c 2.4s| 1 | 0 | 993 | - |1198k| 0 | 42 | 132 | 105 | 132 | 106 | 9 | 0 | 87 | 0.000000e+00 | -- | Inf
2.49/2.52 c 2.4s| 1 | 0 | 993 | - |1198k| 0 | - | 132 | 105 | 132 | 106 | 9 | 0 | 93 | 0.000000e+00 | -- | Inf
2.49/2.52 c (run 2, node 1) restarting after 35 global fixings of integer variables
2.49/2.52 c
2.49/2.52 c (restart) converted 9 cuts from the global cut pool into linear constraints
2.49/2.52 c
2.49/2.52 c presolving:
2.49/2.53 c (round 1) 57 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 44 impls, 61 clqs
2.49/2.53 c (round 2) 57 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 7 upgd conss, 44 impls, 61 clqs
2.49/2.54 c (round 3) 57 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 7 upgd conss, 44 impls, 61 clqs
2.49/2.54 c (round 4) 57 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 7 upgd conss, 44 impls, 61 clqs
2.49/2.54 c presolving (5 rounds):
2.49/2.54 c 57 deleted vars, 30 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 6 changed coefficients
2.49/2.54 c 44 implications, 61 cliques
2.49/2.54 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 84 constraints
2.49/2.54 c 12 constraints of type <knapsack>
2.49/2.54 c 66 constraints of type <setppc>
2.49/2.54 c 6 constraints of type <logicor>
2.49/2.54 c transformed objective value is always integral (scale: 1)
2.49/2.54 c Presolving Time: 0.04
2.49/2.54 c
2.49/2.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.55 c 2.4s| 1 | 0 | 1068 | - | 817k| 0 | 37 | 75 | 84 | 75 | 79 | 0 | 0 | 93 | 0.000000e+00 | -- | Inf
2.49/2.57 c 2.5s| 1 | 0 | 1250 | - |1024k| 0 | - | 75 | 84 | 75 | 87 | 8 | 0 | 93 | -- | -- | 0.00%
2.49/2.57 c 2.5s| 1 | 0 | 1250 | - |1024k| 0 | - | 75 | 84 | 75 | 87 | 8 | 0 | 93 | -- | -- | 0.00%
2.49/2.57 c
2.49/2.57 c SCIP Status : problem is solved [infeasible]
2.49/2.57 c Solving Time (sec) : 2.45
2.49/2.57 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.49/2.57 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.49/2.57 c Dual Bound : +1.00000000000000e+20
2.49/2.57 c Gap : 0.00 %
2.49/2.57 s UNSATISFIABLE
2.49/2.57 c SCIP Status : problem is solved [infeasible]
2.49/2.57 c Solving Time : 2.45
2.49/2.57 c Original Problem :
2.49/2.57 c Problem name : HOME/instance-2665770-1276277034.opb
2.49/2.57 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.57 c Constraints : 101 initial, 101 maximal
2.49/2.57 c Presolved Problem :
2.49/2.57 c Problem name : t_HOME/instance-2665770-1276277034.opb
2.49/2.57 c Variables : 75 (75 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.57 c Constraints : 84 initial, 84 maximal
2.49/2.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.57 c trivial : 0.00 72 0 0 0 0 0 0 0
2.49/2.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.57 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.57 c probing : 0.00 0 0 0 0 0 0 0 0
2.49/2.57 c knapsack : 0.02 0 0 0 0 0 0 0 6
2.49/2.57 c setppc : 0.00 22 0 0 0 0 16 0 0
2.49/2.57 c linear : 0.00 0 0 0 0 0 31 0 0
2.49/2.57 c logicor : 0.01 0 0 0 0 0 17 0 0
2.49/2.57 c root node : - 72 - - 72 - - - -
2.49/2.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.57 c integral : 0 0 0 11 0 0 52 0 0 0
2.49/2.57 c knapsack : 12 7 13 0 0 0 4 0 0 0
2.49/2.57 c setppc : 66 7 13 0 0 0 16 0 0 0
2.49/2.57 c logicor : 6 7 4 0 0 0 0 0 0 0
2.49/2.57 c countsols : 0 0 0 0 0 0 0 0 0 0
2.49/2.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.57 c integral : 2.04 0.00 0.00 2.04 0.00
2.49/2.57 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.49/2.57 c setppc : 0.00 0.00 0.00 0.00 0.00
2.49/2.57 c logicor : 0.00 0.00 0.00 0.00 0.00
2.49/2.57 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.57 c Propagators : Time Calls Cutoffs DomReds
2.49/2.57 c vbounds : 0.00 3 0 0
2.49/2.57 c rootredcost : 0.00 0 0 0
2.49/2.57 c pseudoobj : 0.00 0 0 0
2.49/2.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.57 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.57 c applied globally : - - - 0 0.0 - - -
2.49/2.57 c applied locally : - - - 0 0.0 - - -
2.49/2.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 99)
2.49/2.57 c redcost : 0.00 7 0 0 0 0
2.49/2.57 c impliedbounds : 0.00 7 0 0 0 0
2.49/2.57 c intobj : 0.00 0 0 0 0 0
2.49/2.57 c cgmip : 0.00 0 0 0 0 0
2.49/2.57 c gomory : 0.06 7 0 0 85 0
2.49/2.57 c strongcg : 0.05 7 0 0 313 0
2.49/2.57 c cmir : 0.00 0 0 0 0 0
2.49/2.57 c flowcover : 0.00 0 0 0 0 0
2.49/2.57 c clique : 0.01 7 0 0 36 0
2.49/2.57 c zerohalf : 0.00 0 0 0 0 0
2.49/2.57 c mcf : 0.00 3 0 0 0 0
2.49/2.57 c rapidlearning : 0.17 1 0 0 0 124
2.49/2.57 c Pricers : Time Calls Vars
2.49/2.57 c problem variables: 0.00 0 0
2.49/2.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.57 c relpscost : 2.04 11 0 52 0 0 0
2.49/2.57 c pscost : 0.00 0 0 0 0 0 0
2.49/2.57 c inference : 0.00 0 0 0 0 0 0
2.49/2.57 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.57 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.57 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.57 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.57 c random : 0.00 0 0 0 0 0 0
2.49/2.57 c Primal Heuristics : Time Calls Found
2.49/2.57 c LP solutions : 0.00 - 0
2.49/2.57 c pseudo solutions : 0.00 - 0
2.49/2.57 c trivial : 0.00 1 0
2.49/2.57 c simplerounding : 0.00 0 0
2.49/2.57 c zirounding : 0.00 0 0
2.49/2.57 c rounding : 0.00 0 0
2.49/2.57 c shifting : 0.00 0 0
2.49/2.57 c intshifting : 0.00 0 0
2.49/2.57 c oneopt : 0.00 0 0
2.49/2.57 c twoopt : 0.00 0 0
2.49/2.57 c fixandinfer : 0.00 0 0
2.49/2.57 c feaspump : 0.00 0 0
2.49/2.57 c coefdiving : 0.00 0 0
2.49/2.57 c pscostdiving : 0.00 0 0
2.49/2.57 c fracdiving : 0.00 0 0
2.49/2.57 c veclendiving : 0.00 0 0
2.49/2.57 c intdiving : 0.00 0 0
2.49/2.57 c actconsdiving : 0.00 0 0
2.49/2.57 c objpscostdiving : 0.00 0 0
2.49/2.57 c rootsoldiving : 0.00 0 0
2.49/2.57 c linesearchdiving : 0.00 0 0
2.49/2.57 c guideddiving : 0.00 0 0
2.49/2.57 c octane : 0.00 0 0
2.49/2.57 c rens : 0.00 0 0
2.49/2.57 c rins : 0.00 0 0
2.49/2.57 c localbranching : 0.00 0 0
2.49/2.57 c mutation : 0.00 0 0
2.49/2.57 c crossover : 0.00 0 0
2.49/2.57 c dins : 0.00 0 0
2.49/2.57 c undercover : 0.00 0 0
2.49/2.57 c nlp : 0.00 0 0
2.49/2.57 c trysol : 0.00 0 0
2.49/2.57 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.57 c primal LP : 0.00 0 0 0.00 -
2.49/2.57 c dual LP : 0.05 19 1250 65.79 25000.00
2.49/2.57 c lex dual LP : 0.00 0 0 0.00 -
2.49/2.57 c barrier LP : 0.00 0 0 0.00 -
2.49/2.57 c diving/probing LP: 0.00 0 0 0.00 -
2.49/2.57 c strong branching : 2.03 93 35066 377.05 17273.89
2.49/2.57 c (at root node) : - 93 35066 377.05 -
2.49/2.57 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.57 c B&B Tree :
2.49/2.57 c number of runs : 3
2.49/2.57 c nodes : 1
2.49/2.57 c nodes (total) : 3
2.49/2.57 c nodes left : 0
2.49/2.57 c max depth : 0
2.49/2.57 c max depth (total): 0
2.49/2.57 c backtracks : 0 (0.0%)
2.49/2.57 c delayed cutoffs : 0
2.49/2.57 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.49/2.57 c avg switch length: 2.00
2.49/2.57 c switching time : 0.00
2.49/2.57 c Solution :
2.49/2.57 c Solutions found : 0 (0 improvements)
2.49/2.57 c Primal Bound : infeasible
2.49/2.57 c Dual Bound : -
2.49/2.57 c Gap : 0.00 %
2.49/2.57 c Root Dual Bound : -
2.49/2.57 c Root Iterations : 1250
2.49/2.58 c Time complete: 2.57.