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-2665702-1276270659.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 573 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 2) 14 del vars, 18 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 3) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.05 c (round 4) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 302 impls, 0 clqs
0.00/0.07 c (round 5) 20 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 6476 impls, 6 clqs
0.06/0.07 c presolving (6 rounds):
0.06/0.07 c 20 deleted vars, 29 deleted constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.06/0.07 c 6476 implications, 6 cliques
0.06/0.07 c presolved problem has 246 variables (246 bin, 0 int, 0 impl, 0 cont) and 544 constraints
0.06/0.07 c 162 constraints of type <knapsack>
0.06/0.07 c 382 constraints of type <logicor>
0.06/0.07 c transformed objective value is always integral (scale: 1)
0.06/0.07 c Presolving Time: 0.03
0.06/0.07 c - non default parameters ----------------------------------------------------------------------
0.06/0.07 c # SCIP version 1.2.1.2
0.06/0.07 c
0.06/0.07 c # frequency for displaying node information lines
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.07 c display/freq = 10000
0.06/0.07 c
0.06/0.07 c # maximal time in seconds to run
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/time = 1799.99
0.06/0.07 c
0.06/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/memory = 1620
0.06/0.07 c
0.06/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c limits/solutions = 1
0.06/0.07 c
0.06/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.06/0.07 c separating/maxrounds = 1
0.06/0.07 c
0.06/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c separating/maxroundsroot = 5
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify inequalities
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/linear/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.06/0.07 c constraints/knapsack/disaggregation = FALSE
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify knapsacks
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c presolving/probing/maxrounds = 0
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/coefdiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.06/0.07 c heuristics/crossover/freq = -1
0.06/0.07 c
0.06/0.07 c # number of nodes added to the contingent of the total nodes
0.06/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.06/0.07 c heuristics/crossover/nodesofs = 750
0.06/0.07 c
0.06/0.07 c # number of nodes without incumbent change that heuristic should wait
0.06/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.06/0.07 c heuristics/crossover/nwaitingnodes = 100
0.06/0.07 c
0.06/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.06/0.07 c # [type: real, range: [0,1], default: 0.1]
0.06/0.07 c heuristics/crossover/nodesquot = 0.15
0.06/0.07 c
0.06/0.07 c # minimum percentage of integer variables that have to be fixed
0.06/0.07 c # [type: real, range: [0,1], default: 0.666]
0.06/0.07 c heuristics/crossover/minfixingrate = 0.5
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.07 c heuristics/feaspump/freq = -1
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/fracdiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/guideddiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/intshifting/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/linesearchdiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/nlp/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.07 c heuristics/objpscostdiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.06/0.07 c # [type: real, range: [0,1], default: 0.01]
0.06/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/oneopt/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/pscostdiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.07 c heuristics/rens/freq = -1
0.06/0.07 c
0.06/0.07 c # minimum percentage of integer variables that have to be fixable
0.06/0.07 c # [type: real, range: [0,1], default: 0.5]
0.06/0.07 c heuristics/rens/minfixingrate = 0.3
0.06/0.07 c
0.06/0.07 c # number of nodes added to the contingent of the total nodes
0.06/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.06/0.07 c heuristics/rens/nodesofs = 2000
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.07 c heuristics/rootsoldiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.06/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/rounding/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/shifting/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/simplerounding/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.07 c heuristics/trivial/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/trysol/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.07 c heuristics/veclendiving/freq = -1
0.06/0.07 c
0.06/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.06/0.07 c
0.06/0.07 c # additional number of allowed LP iterations
0.06/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.06/0.07 c
0.06/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.07 c heuristics/zirounding/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.07 c separating/cmir/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.07 c separating/flowcover/freq = -1
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c separating/rapidlearning/freq = 0
0.06/0.07 c
0.06/0.07 c -----------------------------------------------------------------------------------------------
0.06/0.07 c start solving
0.06/0.07 c
0.09/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.10 c 0.1s| 1 | 0 | 201 | - |1772k| 0 | 125 | 246 | 544 | 246 | 538 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 521 | - |3929k| 0 | 173 | 246 | 565 | 246 | 750 | 212 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.8s| 1 | 0 | 1031 | - |6466k| 0 | 181 | 246 | 565 | 246 | 862 | 324 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.30 c 1.2s| 1 | 0 | 1448 | - |8831k| 0 | 183 | 246 | 565 | 246 | 970 | 432 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 1715 | - | 11M| 0 | 193 | 246 | 565 | 246 |1053 | 515 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/2.00 c 1.9s| 1 | 0 | 1935 | - | 13M| 0 | 195 | 246 | 565 | 246 |1094 | 556 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.97 c 2.9s| 1 | 2 | 1935 | - | 13M| 0 | 195 | 246 | 565 | 246 |1094 | 556 | 0 | 10 | 0.000000e+00 | -- | Inf
63.97/64.03 c 62.5s| 10000 | 17 |247753 | 24.6 | 14M| 35 | 53 | 246 |1946 | 246 | 721 | 556 |2202 |1939 | 0.000000e+00 | -- | Inf
102.46/102.50 c 99.5s| 20000 | 28 |463554 | 23.1 | 14M| 36 | 22 | 246 |3224 | 246 | 721 | 556 |4339 |1963 | 0.000000e+00 | -- | Inf
140.96/141.02 c 136s| 30000 | 25 |661217 | 22.0 | 15M| 36 | - | 246 |3912 | 0 | 0 | 556 |6620 |2324 | 0.000000e+00 | -- | Inf
178.54/178.66 c 173s| 40000 | 24 |857471 | 21.4 | 15M| 36 | - | 246 |4219 | 246 | 721 | 556 |8897 |2567 | 0.000000e+00 | -- | Inf
217.94/218.03 c 210s| 50000 | 20 | 1062k| 21.2 | 15M| 44 | 76 | 246 |5172 | 246 | 721 | 556 | 11k|2827 | 0.000000e+00 | -- | Inf
270.32/270.47 c 261s| 60000 | 23 | 1324k| 22.0 | 15M| 44 | - | 246 |4054 | 0 | 0 | 556 | 13k|3260 | 0.000000e+00 | -- | Inf
314.11/314.25 c 303s| 70000 | 30 | 1553k| 22.2 | 15M| 44 | - | 246 |5011 | 0 | 0 | 556 | 15k|3455 | 0.000000e+00 | -- | Inf
359.30/359.41 c 346s| 80000 | 31 | 1791k| 22.4 | 16M| 45 | - | 246 |5695 | 246 | 721 | 556 | 17k|3666 | 0.000000e+00 | -- | Inf
405.98/406.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
405.98/406.13 c 391s| 90000 | 23 | 2032k| 22.6 | 16M| 45 | 50 | 246 |6156 | 246 | 721 | 556 | 19k|3920 | 0.000000e+00 | -- | Inf
452.28/452.49 c 436s|100000 | 28 | 2274k| 22.7 | 16M| 45 | - | 246 |6594 | 0 | 0 | 556 | 21k|4145 | 0.000000e+00 | -- | Inf
501.37/501.60 c 483s|110000 | 39 | 2530k| 23.0 | 16M| 50 | - | 246 |6840 | 0 | 0 | 556 | 23k|4316 | 0.000000e+00 | -- | Inf
550.25/550.49 c 530s|120000 | 38 | 2782k| 23.2 | 16M| 50 | 73 | 246 |7391 | 246 | 721 | 556 | 25k|4496 | 0.000000e+00 | -- | Inf
600.84/601.06 c 579s|130000 | 25 | 3041k| 23.4 | 16M| 50 | 57 | 246 |6500 | 246 | 721 | 556 | 27k|4638 | 0.000000e+00 | -- | Inf
658.73/658.91 c 634s|140000 | 28 | 3331k| 23.8 | 16M| 50 | 21 | 246 |5510 | 246 | 721 | 556 | 29k|5067 | 0.000000e+00 | -- | Inf
693.21/693.42 c 667s|150000 | 28 | 3510k| 23.4 | 16M| 50 | - | 246 |5685 | 246 | 721 | 556 | 31k|5169 | 0.000000e+00 | -- | Inf
731.90/732.11 c 704s|160000 | 30 | 3717k| 23.2 | 16M| 50 | 76 | 246 |5890 | 246 | 721 | 556 | 33k|5256 | 0.000000e+00 | -- | Inf
771.40/771.60 c 742s|170000 | 31 | 3922k| 23.1 | 16M| 50 | 52 | 246 |6156 | 246 | 721 | 556 | 35k|5369 | 0.000000e+00 | -- | Inf
820.88/821.18 c 790s|180000 | 19 | 4159k| 23.1 | 16M| 50 | - | 246 |5593 | 246 | 721 | 556 | 37k|5873 | 0.000000e+00 | -- | Inf
869.37/869.68 c 836s|190000 | 17 | 4419k| 23.2 | 16M| 50 | 56 | 246 |6467 | 246 | 721 | 556 | 40k|5890 | 0.000000e+00 | -- | Inf
883.56/883.85 c * 850s|193081 | 0 | 4493k| 23.3 | 16M| 50 | - | 246 |6425 | 246 | 721 | 556 | 41k|5894 | 0.000000e+00 | 0.000000e+00 | 0.00%
883.56/883.85 c
883.56/883.85 c SCIP Status : problem is solved [optimal solution found]
883.56/883.85 c Solving Time (sec) : 850.01
883.56/883.85 c Solving Nodes : 193081
883.56/883.85 c Primal Bound : +0.00000000000000e+00 (1 solutions)
883.56/883.85 c Dual Bound : +0.00000000000000e+00
883.56/883.85 c Gap : 0.00 %
883.56/883.85 s SATISFIABLE
883.56/883.85 v x265 -x266 -x263 x264 x261 -x262 -x259 x260 -x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 x250 -x247 -x248 -x245 x246 -x243
883.56/883.85 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 -x226 x223 -x224 -x221
883.56/883.85 v x222 -x219 -x220 -x217 x218 -x215 x216 -x213 -x214 -x211 x212 x209 -x210 -x207 -x208 x205 -x206 -x203 x204 x201 -x202 -x199
883.56/883.85 v x200 -x197 x198 x195 -x196 -x193 x194 x191 -x192 x189 -x190 x187 -x188 x185 -x186 x183 -x184 -x181 x182 -x179 x180 x177 -x178
883.56/883.85 v -x175 x176 x173 -x174 x171 -x172 x169 -x170 -x167 x168 x165 -x166 -x163 x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148
883.56/883.85 v -x146 -x144 -x142 -x140 -x138 x136 -x134 x132 -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106
883.56/883.85 v -x104 -x102 x100 -x98 x96 -x94 -x92 -x90 x88 -x86 x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 x64 -x62 x60 -x58 -x56 -x54
883.56/883.85 v -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36 -x34 -x32 -x30 x28 -x26 x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 x161
883.56/883.85 v -x159 x157 -x155 -x153 -x151 -x149 -x147 x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 x125 -x123 x121 -x119
883.56/883.85 v -x117 -x115 -x113 -x111 x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71
883.56/883.85 v -x69 -x67 -x65 -x63 -x61 -x59 -x57 -x55 x53 -x51 x49 -x47 -x45 -x43 -x41 -x39 x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21
883.56/883.85 v -x19 x17 -x15 x13 -x11 -x9 -x7 -x5 -x3 x1
883.56/883.85 c SCIP Status : problem is solved [optimal solution found]
883.56/883.85 c Solving Time : 850.01
883.56/883.85 c Original Problem :
883.56/883.85 c Problem name : HOME/instance-2665702-1276270659.opb
883.56/883.85 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
883.56/883.85 c Constraints : 573 initial, 573 maximal
883.56/883.85 c Presolved Problem :
883.56/883.85 c Problem name : t_HOME/instance-2665702-1276270659.opb
883.56/883.85 c Variables : 246 (246 binary, 0 integer, 0 implicit integer, 0 continuous)
883.56/883.85 c Constraints : 544 initial, 7449 maximal
883.56/883.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
883.56/883.85 c trivial : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c dualfix : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c boundshift : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c implics : 0.00 0 8 0 0 0 0 0 0
883.56/883.85 c probing : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c knapsack : 0.01 0 0 0 0 0 0 0 0
883.56/883.85 c linear : 0.01 12 0 0 12 0 29 0 0
883.56/883.85 c logicor : 0.00 0 0 0 0 0 0 0 0
883.56/883.85 c root node : - 0 - - 0 - - - -
883.56/883.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
883.56/883.85 c integral : 0 0 0 98737 0 107 992 0 0 196062
883.56/883.85 c knapsack : 162 5 673632 1 0 45028 1976154 685 0 0
883.56/883.85 c linear : 0+ 5 309083 0 0 106 2766 0 0 0
883.56/883.85 c logicor : 382+ 5 543382 1 0 14554 1269098 0 0 0
883.56/883.85 c countsols : 0 0 0 1 0 0 0 0 0 0
883.56/883.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
883.56/883.85 c integral : 52.77 0.00 0.00 52.77 0.00
883.56/883.85 c knapsack : 25.02 0.00 25.02 0.00 0.00
883.56/883.85 c linear : 0.64 0.00 0.64 0.00 0.00
883.56/883.85 c logicor : 35.95 0.00 35.95 0.00 0.00
883.56/883.85 c countsols : 0.00 0.00 0.00 0.00 0.00
883.56/883.85 c Propagators : Time Calls Cutoffs DomReds
883.56/883.85 c vbounds : 0.39 1 0 0
883.56/883.85 c rootredcost : 0.53 0 0 0
883.56/883.85 c pseudoobj : 0.34 0 0 0
883.56/883.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
883.56/883.85 c propagation : 5.92 26261 25160 180265 48.5 511 20.1 -
883.56/883.85 c infeasible LP : 5.78 38106 2 11 26.4 0 0.0 0
883.56/883.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
883.56/883.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
883.56/883.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
883.56/883.85 c applied globally : - - - 40669 18.0 - - -
883.56/883.85 c applied locally : - - - 656 38.3 - - -
883.56/883.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
883.56/883.85 c cut pool : 0.02 4 - - 57 - (maximal pool size: 2651)
883.56/883.85 c redcost : 0.96 98317 0 0 0 0
883.56/883.85 c impliedbounds : 0.00 5 0 0 1066 0
883.56/883.85 c intobj : 0.00 0 0 0 0 0
883.56/883.85 c cgmip : 0.00 0 0 0 0 0
883.56/883.85 c gomory : 0.58 5 0 0 60 0
883.56/883.85 c strongcg : 0.50 5 0 0 2394 0
883.56/883.85 c cmir : 0.00 0 0 0 0 0
883.56/883.85 c flowcover : 0.00 0 0 0 0 0
883.56/883.85 c clique : 0.01 5 0 0 7 0
883.56/883.85 c zerohalf : 0.00 0 0 0 0 0
883.56/883.85 c mcf : 0.00 1 0 0 0 0
883.56/883.85 c rapidlearning : 0.15 1 0 0 0 21
883.56/883.85 c Pricers : Time Calls Vars
883.56/883.85 c problem variables: 0.00 0 0
883.56/883.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
883.56/883.85 c relpscost : 52.53 98736 107 992 0 0 196062
883.56/883.85 c pscost : 0.00 0 0 0 0 0 0
883.56/883.85 c inference : 0.00 0 0 0 0 0 0
883.56/883.85 c mostinf : 0.00 0 0 0 0 0 0
883.56/883.85 c leastinf : 0.00 0 0 0 0 0 0
883.56/883.85 c fullstrong : 0.00 0 0 0 0 0 0
883.56/883.85 c allfullstrong : 0.00 0 0 0 0 0 0
883.56/883.85 c random : 0.00 0 0 0 0 0 0
883.56/883.85 c Primal Heuristics : Time Calls Found
883.56/883.85 c LP solutions : 0.00 - 1
883.56/883.85 c pseudo solutions : 0.00 - 0
883.56/883.85 c trivial : 0.01 1 0
883.56/883.85 c simplerounding : 0.00 0 0
883.56/883.85 c zirounding : 0.00 0 0
883.56/883.85 c rounding : 0.00 0 0
883.56/883.85 c shifting : 0.00 0 0
883.56/883.85 c intshifting : 0.00 0 0
883.56/883.85 c oneopt : 0.00 0 0
883.56/883.85 c twoopt : 0.00 0 0
883.56/883.85 c fixandinfer : 0.00 0 0
883.56/883.85 c feaspump : 0.00 0 0
883.56/883.85 c coefdiving : 0.00 0 0
883.56/883.85 c pscostdiving : 0.00 0 0
883.56/883.85 c fracdiving : 0.00 0 0
883.56/883.85 c veclendiving : 0.00 0 0
883.56/883.85 c intdiving : 0.00 0 0
883.56/883.85 c actconsdiving : 0.00 0 0
883.56/883.85 c objpscostdiving : 0.00 0 0
883.56/883.85 c rootsoldiving : 0.00 0 0
883.56/883.85 c linesearchdiving : 0.00 0 0
883.56/883.85 c guideddiving : 0.00 0 0
883.56/883.85 c octane : 0.00 0 0
883.56/883.85 c rens : 0.00 0 0
883.56/883.85 c rins : 0.00 0 0
883.56/883.85 c localbranching : 0.00 0 0
883.56/883.85 c mutation : 0.00 0 0
883.56/883.85 c crossover : 0.00 0 0
883.56/883.85 c dins : 0.00 0 0
883.56/883.85 c undercover : 0.00 0 0
883.56/883.85 c nlp : 0.00 0 0
883.56/883.85 c trysol : 0.00 0 0
883.56/883.85 c LP : Time Calls Iterations Iter/call Iter/sec
883.56/883.85 c primal LP : 0.00 0 0 0.00 -
883.56/883.85 c dual LP : 664.32 136799 4493697 32.85 6764.36
883.56/883.85 c lex dual LP : 0.00 0 0 0.00 -
883.56/883.85 c barrier LP : 0.00 0 0 0.00 -
883.56/883.85 c diving/probing LP: 0.00 0 0 0.00 -
883.56/883.85 c strong branching : 48.54 5894 304236 51.62 6267.74
883.56/883.85 c (at root node) : - 10 3263 326.30 -
883.56/883.85 c conflict analysis: 0.00 0 0 0.00 -
883.56/883.85 c B&B Tree :
883.56/883.85 c number of runs : 1
883.56/883.85 c nodes : 193081
883.56/883.85 c nodes (total) : 193081
883.56/883.85 c nodes left : 0
883.56/883.85 c max depth : 50
883.56/883.85 c max depth (total): 50
883.56/883.85 c backtracks : 30915 (16.0%)
883.56/883.85 c delayed cutoffs : 2960
883.56/883.85 c repropagations : 37574 (176269 domain reductions, 2852 cutoffs)
883.56/883.85 c avg switch length: 2.89
883.56/883.85 c switching time : 29.39
883.56/883.85 c Solution :
883.56/883.85 c Solutions found : 1 (1 improvements)
883.56/883.85 c First Solution : +0.00000000000000e+00 (in run 1, after 193081 nodes, 850.01 seconds, depth 23, found by <relaxation>)
883.56/883.85 c Primal Bound : +0.00000000000000e+00 (in run 1, after 193081 nodes, 850.01 seconds, depth 23, found by <relaxation>)
883.56/883.85 c Dual Bound : +0.00000000000000e+00
883.56/883.85 c Gap : 0.00 %
883.56/883.85 c Root Dual Bound : +0.00000000000000e+00
883.56/883.85 c Root Iterations : 1935
883.56/883.87 c Time complete: 883.64.