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-2704063-1278548345.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 72 constraints of type <setppc>
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.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = 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 | 118 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 151 | - |1135k| 0 | 53 | 169 | 198 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 186 | - |1396k| 0 | 55 | 169 | 198 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 226 | - |1563k| 0 | 59 | 169 | 198 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 343 | - |1825k| 0 | 57 | 169 | 198 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 415 | - |1933k| 0 | 62 | 169 | 198 | 169 | 114 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 426 | - |1864k| 0 | 59 | 169 | 134 | 169 | 114 | 41 | 0 | 11 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 429 | - |1863k| 0 | 60 | 169 | 133 | 169 | 114 | 41 | 0 | 23 | 0.000000e+00 | -- | Inf
0.89/0.99 c 1.0s| 1 | 0 | 434 | - |1863k| 0 | 60 | 169 | 133 | 169 | 114 | 41 | 0 | 33 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 446 | - |1861k| 0 | 61 | 169 | 131 | 169 | 114 | 41 | 0 | 46 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.5s| 1 | 0 | 452 | - |1856k| 0 | 59 | 169 | 126 | 169 | 114 | 41 | 0 | 59 | 0.000000e+00 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 462 | - |1854k| 0 | 62 | 169 | 124 | 169 | 106 | 41 | 0 | 71 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.8s| 1 | 0 | 470 | - |1849k| 0 | 62 | 169 | 120 | 169 | 106 | 41 | 0 | 77 | 0.000000e+00 | -- | Inf
1.89/1.97 c 2.0s| 1 | 0 | 478 | - |1842k| 0 | 61 | 169 | 113 | 169 | 106 | 41 | 0 | 90 | 0.000000e+00 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 486 | - |1840k| 0 | 61 | 169 | 111 | 169 | 106 | 41 | 0 | 97 | 0.000000e+00 | -- | Inf
1.99/2.10 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.10 c 2.1s| 1 | 0 | 489 | - |1838k| 0 | 61 | 169 | 110 | 169 | 106 | 41 | 0 | 100 | 0.000000e+00 | -- | Inf
2.10/2.13 c 2.1s| 1 | 0 | 491 | - |1838k| 0 | 60 | 169 | 110 | 169 | 106 | 41 | 0 | 103 | 0.000000e+00 | -- | Inf
2.10/2.14 c 2.1s| 1 | 2 | 491 | - |1839k| 0 | 60 | 169 | 110 | 169 | 106 | 41 | 0 | 104 | 0.000000e+00 | -- | Inf
2.10/2.14 c (run 1, node 1) restarting after 33 global fixings of integer variables
2.10/2.14 c
2.10/2.14 c (restart) converted 24 cuts from the global cut pool into linear constraints
2.10/2.14 c
2.10/2.15 c presolving:
2.10/2.15 c (round 1) 33 del vars, 2 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 84 clqs
2.10/2.16 c (round 2) 33 del vars, 4 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 61 upgd conss, 10 impls, 84 clqs
2.10/2.16 c presolving (3 rounds):
2.10/2.16 c 33 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
2.10/2.16 c 10 implications, 84 cliques
2.10/2.16 c presolved problem has 136 variables (136 bin, 0 int, 0 impl, 0 cont) and 130 constraints
2.10/2.16 c 8 constraints of type <knapsack>
2.10/2.16 c 86 constraints of type <setppc>
2.10/2.16 c 36 constraints of type <logicor>
2.10/2.16 c transformed objective value is always integral (scale: 1)
2.10/2.16 c Presolving Time: 0.03
2.10/2.16 c
2.10/2.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.17 c 2.2s| 1 | 0 | 566 | - | 870k| 0 | 47 | 136 | 130 | 136 | 94 | 0 | 0 | 104 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.2s| 1 | 0 | 584 | - |1111k| 0 | 52 | 136 | 130 | 136 | 107 | 13 | 0 | 104 | 0.000000e+00 | -- | Inf
2.29/2.34 c 2.3s| 1 | 0 | 590 | - |1111k| 0 | 53 | 136 | 130 | 136 | 107 | 13 | 0 | 122 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.5s| 1 | 0 | 599 | - |1111k| 0 | 56 | 136 | 130 | 136 | 107 | 13 | 0 | 141 | 0.000000e+00 | -- | Inf
2.59/2.68 c 2.7s| 1 | 0 | 608 | - |1110k| 0 | 55 | 136 | 129 | 136 | 107 | 13 | 0 | 158 | 0.000000e+00 | -- | Inf
2.79/2.82 c 2.8s| 1 | 0 | 634 | - |1109k| 0 | 53 | 136 | 127 | 136 | 107 | 13 | 0 | 172 | 0.000000e+00 | -- | Inf
2.89/2.91 c 2.9s| 1 | 0 | 648 | - |1109k| 0 | 53 | 136 | 126 | 136 | 107 | 13 | 0 | 180 | 0.000000e+00 | -- | Inf
2.99/3.00 c 3.0s| 1 | 0 | 665 | - |1109k| 0 | 54 | 136 | 126 | 136 | 107 | 13 | 0 | 188 | 0.000000e+00 | -- | Inf
2.99/3.09 c 3.1s| 1 | 0 | 673 | - |1109k| 0 | 52 | 136 | 125 | 136 | 107 | 13 | 0 | 197 | 0.000000e+00 | -- | Inf
3.09/3.12 c 3.1s| 1 | 2 | 673 | - |1109k| 0 | 52 | 136 | 125 | 136 | 107 | 13 | 0 | 200 | 0.000000e+00 | -- | Inf
3.09/3.12 c (run 2, node 1) restarting after 25 global fixings of integer variables
3.09/3.12 c
3.09/3.12 c (restart) converted 8 cuts from the global cut pool into linear constraints
3.09/3.12 c
3.09/3.12 c presolving:
3.09/3.13 c (round 1) 25 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 16 impls, 82 clqs
3.09/3.14 c presolving (2 rounds):
3.09/3.14 c 25 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.09/3.14 c 16 implications, 82 cliques
3.09/3.14 c presolved problem has 111 variables (111 bin, 0 int, 0 impl, 0 cont) and 118 constraints
3.09/3.14 c 15 constraints of type <knapsack>
3.09/3.14 c 86 constraints of type <setppc>
3.09/3.14 c 17 constraints of type <logicor>
3.09/3.14 c transformed objective value is always integral (scale: 1)
3.09/3.14 c Presolving Time: 0.05
3.09/3.14 c
3.09/3.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.15 c 3.1s| 1 | 0 | 749 | - | 899k| 0 | 48 | 111 | 118 | 111 | 101 | 0 | 0 | 200 | 0.000000e+00 | -- | Inf
3.09/3.17 c 3.2s| 1 | 0 | 769 | - |1135k| 0 | 56 | 111 | 118 | 111 | 112 | 11 | 0 | 200 | 0.000000e+00 | -- | Inf
3.30/3.33 c 3.3s| 1 | 2 | 769 | - |1136k| 0 | 56 | 111 | 118 | 111 | 112 | 11 | 0 | 217 | 0.000000e+00 | -- | Inf
3.99/4.02 c * 4.0s| 6 | 0 | 1185 | 83.2 |1172k| 3 | - | 111 | 120 | 111 | 83 | 11 | 3 | 418 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.99/4.02 c
3.99/4.02 c SCIP Status : problem is solved [optimal solution found]
3.99/4.02 c Solving Time (sec) : 4.00
3.99/4.02 c Solving Nodes : 6 (total of 8 nodes in 3 runs)
3.99/4.02 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.99/4.02 c Dual Bound : +0.00000000000000e+00
3.99/4.02 c Gap : 0.00 %
3.99/4.02 s SATISFIABLE
3.99/4.02 v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
3.99/4.02 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.99/4.02 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
3.99/4.02 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
3.99/4.02 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 -x56
3.99/4.02 v -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
3.99/4.02 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
3.99/4.02 v x4 -x3 -x2 -x1
3.99/4.02 c SCIP Status : problem is solved [optimal solution found]
3.99/4.02 c Solving Time : 4.00
3.99/4.02 c Original Problem :
3.99/4.02 c Problem name : HOME/instance-2704063-1278548345.opb
3.99/4.02 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.02 c Constraints : 101 initial, 101 maximal
3.99/4.02 c Presolved Problem :
3.99/4.02 c Problem name : t_HOME/instance-2704063-1278548345.opb
3.99/4.02 c Variables : 111 (111 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.02 c Constraints : 118 initial, 120 maximal
3.99/4.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.02 c trivial : 0.00 58 0 0 0 0 0 0 0
3.99/4.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c knapsack : 0.02 0 0 0 0 0 0 0 0
3.99/4.02 c setppc : 0.01 0 0 0 0 0 0 0 0
3.99/4.02 c linear : 0.01 0 0 0 0 0 30 2 0
3.99/4.02 c logicor : 0.00 0 0 0 0 0 17 0 0
3.99/4.02 c root node : - 60 - - 60 - - - -
3.99/4.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.02 c integral : 0 0 0 47 0 1 149 0 0 10
3.99/4.02 c knapsack : 15 7 57 1 0 0 1 0 0 0
3.99/4.02 c setppc : 86 7 57 1 0 1 75 0 0 0
3.99/4.02 c logicor : 17+ 2 20 0 0 0 2 0 0 0
3.99/4.02 c countsols : 0 0 0 1 0 0 0 0 0 0
3.99/4.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.02 c integral : 3.52 0.00 0.00 3.52 0.00
3.99/4.02 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.99/4.02 c setppc : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c logicor : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c Propagators : Time Calls Cutoffs DomReds
3.99/4.02 c vbounds : 0.00 3 0 0
3.99/4.02 c rootredcost : 0.00 0 0 0
3.99/4.02 c pseudoobj : 0.00 0 0 0
3.99/4.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.02 c propagation : 0.00 1 1 2 7.5 1 7.0 -
3.99/4.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.02 c applied globally : - - - 3 7.3 - - -
3.99/4.02 c applied locally : - - - 0 0.0 - - -
3.99/4.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 87)
3.99/4.02 c redcost : 0.00 11 0 0 0 0
3.99/4.02 c impliedbounds : 0.00 7 0 0 0 0
3.99/4.02 c intobj : 0.00 0 0 0 0 0
3.99/4.02 c cgmip : 0.00 0 0 0 0 0
3.99/4.02 c gomory : 0.05 7 0 0 10 0
3.99/4.02 c strongcg : 0.07 7 0 0 394 0
3.99/4.02 c cmir : 0.00 0 0 0 0 0
3.99/4.02 c flowcover : 0.00 0 0 0 0 0
3.99/4.02 c clique : 0.00 7 0 0 38 0
3.99/4.02 c zerohalf : 0.00 0 0 0 0 0
3.99/4.02 c mcf : 0.00 3 0 0 0 0
3.99/4.02 c rapidlearning : 0.17 1 0 0 0 125
3.99/4.02 c Pricers : Time Calls Vars
3.99/4.02 c problem variables: 0.00 0 0
3.99/4.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.02 c relpscost : 3.52 46 1 149 0 0 10
3.99/4.02 c pscost : 0.00 0 0 0 0 0 0
3.99/4.02 c inference : 0.00 0 0 0 0 0 0
3.99/4.02 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.02 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.02 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.02 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.02 c random : 0.00 0 0 0 0 0 0
3.99/4.02 c Primal Heuristics : Time Calls Found
3.99/4.02 c LP solutions : 0.00 - 1
3.99/4.02 c pseudo solutions : 0.00 - 0
3.99/4.02 c trivial : 0.00 1 0
3.99/4.02 c simplerounding : 0.00 0 0
3.99/4.02 c zirounding : 0.00 0 0
3.99/4.02 c rounding : 0.00 0 0
3.99/4.02 c shifting : 0.00 0 0
3.99/4.02 c intshifting : 0.00 0 0
3.99/4.02 c oneopt : 0.00 0 0
3.99/4.02 c twoopt : 0.00 0 0
3.99/4.02 c fixandinfer : 0.00 0 0
3.99/4.02 c feaspump : 0.00 0 0
3.99/4.02 c coefdiving : 0.00 0 0
3.99/4.02 c pscostdiving : 0.00 0 0
3.99/4.02 c fracdiving : 0.00 0 0
3.99/4.02 c veclendiving : 0.00 0 0
3.99/4.02 c intdiving : 0.00 0 0
3.99/4.02 c actconsdiving : 0.00 0 0
3.99/4.02 c objpscostdiving : 0.00 0 0
3.99/4.02 c rootsoldiving : 0.00 0 0
3.99/4.02 c linesearchdiving : 0.00 0 0
3.99/4.02 c guideddiving : 0.00 0 0
3.99/4.02 c octane : 0.00 0 0
3.99/4.02 c rens : 0.00 0 0
3.99/4.02 c rins : 0.00 0 0
3.99/4.02 c localbranching : 0.00 0 0
3.99/4.02 c mutation : 0.00 0 0
3.99/4.02 c crossover : 0.00 0 0
3.99/4.02 c dins : 0.00 0 0
3.99/4.02 c undercover : 0.00 0 0
3.99/4.02 c nlp : 0.00 0 0
3.99/4.02 c trysol : 0.00 0 0
3.99/4.02 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.02 c primal LP : 0.00 0 0 0.00 -
3.99/4.02 c dual LP : 0.10 54 1185 21.94 12216.87
3.99/4.02 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.02 c barrier LP : 0.00 0 0 0.00 -
3.99/4.02 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.02 c strong branching : 3.52 418 39308 94.04 11167.38
3.99/4.02 c (at root node) : - 217 29250 134.79 -
3.99/4.02 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.02 c B&B Tree :
3.99/4.02 c number of runs : 3
3.99/4.02 c nodes : 6
3.99/4.02 c nodes (total) : 8
3.99/4.02 c nodes left : 0
3.99/4.02 c max depth : 3
3.99/4.02 c max depth (total): 3
3.99/4.02 c backtracks : 0 (0.0%)
3.99/4.02 c delayed cutoffs : 0
3.99/4.02 c repropagations : 2 (2 domain reductions, 0 cutoffs)
3.99/4.02 c avg switch length: 2.33
3.99/4.02 c switching time : 0.00
3.99/4.02 c Solution :
3.99/4.02 c Solutions found : 1 (1 improvements)
3.99/4.02 c First Solution : +0.00000000000000e+00 (in run 3, after 6 nodes, 4.00 seconds, depth 3, found by <relaxation>)
3.99/4.02 c Primal Bound : +0.00000000000000e+00 (in run 3, after 6 nodes, 4.00 seconds, depth 3, found by <relaxation>)
3.99/4.02 c Dual Bound : +0.00000000000000e+00
3.99/4.02 c Gap : 0.00 %
3.99/4.02 c Root Dual Bound : +0.00000000000000e+00
3.99/4.02 c Root Iterations : 769
3.99/4.03 c Time complete: 4.02.