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-2703973-1278548281.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 401 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.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 298 impls, 0 clqs
0.00/0.04 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.05 c (round 3) 8 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.05 c (round 4) 8 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.05 c presolving (5 rounds):
0.00/0.05 c 8 deleted vars, 12 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 7146 implications, 0 cliques
0.00/0.05 c presolved problem has 258 variables (258 bin, 0 int, 0 impl, 0 cont) and 389 constraints
0.00/0.05 c 164 constraints of type <knapsack>
0.00/0.05 c 129 constraints of type <setppc>
0.00/0.05 c 96 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1789.99
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/nlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.05/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.06 c 0.0s| 1 | 0 | 118 | - |1596k| 0 | 65 | 258 | 389 | 258 | 389 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 333 | - |2184k| 0 | 132 | 258 | 389 | 258 | 596 | 207 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 569 | - |3311k| 0 | 156 | 258 | 389 | 258 | 716 | 327 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 584 | - |4218k| 0 | 169 | 258 | 389 | 258 | 733 | 344 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 706 | - |5141k| 0 | 171 | 258 | 389 | 258 | 737 | 348 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 834 | - |5909k| 0 | 169 | 258 | 389 | 258 | 800 | 411 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.98 c 2.0s| 1 | 2 | 834 | - |5910k| 0 | 169 | 258 | 389 | 258 | 800 | 411 | 0 | 10 | 0.000000e+00 | -- | Inf
18.09/18.16 c 18.1s| 10000 | 50 | 68084 | 6.7 |6334k| 32 | - | 258 | 853 | 0 | 0 | 411 | 592 |1936 | 0.000000e+00 | -- | Inf
29.39/29.48 c 29.5s| 20000 | 54 |136804 | 6.8 |6427k| 33 | - | 258 | 955 | 0 | 0 | 411 |1267 |1945 | 0.000000e+00 | -- | Inf
42.88/42.92 c 42.9s| 30000 | 50 |212142 | 7.0 |6449k| 34 | - | 258 | 989 | 0 | 0 | 411 |1762 |2416 | 0.000000e+00 | -- | Inf
56.47/56.59 c 56.6s| 40000 | 48 |290846 | 7.3 |6499k| 34 | - | 258 |1122 | 0 | 0 | 411 |2309 |2850 | 0.000000e+00 | -- | Inf
70.96/71.04 c 71.0s| 50000 | 52 |373085 | 7.4 |6567k| 41 | - | 258 |1266 | 0 | 0 | 411 |2813 |3374 | 0.000000e+00 | -- | Inf
84.06/84.18 c 84.2s| 60000 | 58 |448907 | 7.5 |6662k| 41 | - | 258 |1464 | 0 | 0 | 411 |3400 |3696 | 0.000000e+00 | -- | Inf
97.46/97.54 c 97.5s| 70000 | 50 |526881 | 7.5 |6751k| 43 | - | 258 |1717 | 258 | 528 | 411 |3946 |4002 | 0.000000e+00 | -- | Inf
111.56/111.65 c 112s| 80000 | 49 |609096 | 7.6 |6697k| 47 | - | 258 |1497 | 258 | 528 | 411 |4440 |4308 | 0.000000e+00 | -- | Inf
128.05/128.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
128.05/128.10 c 128s| 90000 | 53 |708166 | 7.9 |6735k| 47 | 49 | 258 |1550 | 258 | 528 | 411 |4876 |4674 | 0.000000e+00 | -- | Inf
143.55/143.67 c 144s|100000 | 59 |800819 | 8.0 |6759k| 47 | - | 258 |1542 | 258 | 528 | 411 |5348 |4963 | 0.000000e+00 | -- | Inf
156.44/156.53 c 157s|110000 | 78 |876598 | 8.0 |6836k| 47 | 24 | 258 |1593 | 258 | 528 | 411 |5935 |5154 | 0.000000e+00 | -- | Inf
169.14/169.23 c 169s|120000 | 66 |950169 | 7.9 |6861k| 47 | 21 | 258 |1695 | 258 | 528 | 411 |6539 |5345 | 0.000000e+00 | -- | Inf
182.34/182.46 c 182s|130000 | 71 | 1025k| 7.9 |6931k| 47 | - | 258 |1830 | 0 | 0 | 411 |7132 |5658 | 0.000000e+00 | -- | Inf
195.83/195.97 c 196s|140000 | 77 | 1103k| 7.9 |6843k| 47 | 24 | 258 |1443 | 258 | 528 | 411 |7661 |5858 | 0.000000e+00 | -- | Inf
207.53/207.60 c * 208s|147011 | 0 | 1175k| 8.0 |6618k| 47 | - | 258 |1348 | 258 | 528 | 411 |7959 |6010 | 0.000000e+00 | 0.000000e+00 | 0.00%
207.53/207.60 c
207.53/207.60 c SCIP Status : problem is solved [optimal solution found]
207.53/207.60 c Solving Time (sec) : 207.59
207.53/207.60 c Solving Nodes : 147011
207.53/207.60 c Primal Bound : +0.00000000000000e+00 (1 solutions)
207.53/207.60 c Dual Bound : +0.00000000000000e+00
207.53/207.60 c Gap : 0.00 %
207.53/207.61 s SATISFIABLE
207.53/207.61 v x265 -x266 -x263 x264 x261 -x262 -x259 x260 x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 -x250 x247 -x248 -x245 x246 x243
207.53/207.61 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 x223 -x224 -x221 x222
207.53/207.61 v x219 -x220 -x217 -x218 -x215 -x216 x213 -x214 -x211 -x212 x209 -x210 -x207 x208 x205 -x206 -x203 x204 x201 -x202 -x199 x200
207.53/207.61 v -x197 x198 x195 -x196 -x193 x194 x191 -x192 -x189 x190 x187 -x188 -x185 x186 x183 -x184 x181 -x182 x179 -x180 x177 -x178 -x175
207.53/207.61 v x176 x173 -x174 -x171 x172 x169 -x170 x167 -x168 x165 -x166 -x163 x164 -x162 x160 -x158 x156 -x154 x152 -x150 x148 -x146
207.53/207.61 v -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104
207.53/207.61 v -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
207.53/207.61 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
207.53/207.61 v -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 x125 -x123 x121 -x119
207.53/207.61 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 -x69
207.53/207.61 v -x67 -x65 -x63 -x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19
207.53/207.61 v x17 -x15 x13 -x11 x9 -x7 x5 -x3 -x1
207.53/207.61 c SCIP Status : problem is solved [optimal solution found]
207.53/207.61 c Solving Time : 207.59
207.53/207.61 c Original Problem :
207.53/207.61 c Problem name : HOME/instance-2703973-1278548281.opb
207.53/207.61 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
207.53/207.61 c Constraints : 401 initial, 401 maximal
207.53/207.61 c Presolved Problem :
207.53/207.61 c Problem name : t_HOME/instance-2703973-1278548281.opb
207.53/207.61 c Variables : 258 (258 binary, 0 integer, 0 implicit integer, 0 continuous)
207.53/207.61 c Constraints : 389 initial, 1912 maximal
207.53/207.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
207.53/207.61 c trivial : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c implics : 0.00 0 8 0 0 0 0 0 0
207.53/207.61 c probing : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c knapsack : 0.01 0 0 0 0 0 0 0 0
207.53/207.61 c setppc : 0.00 0 0 0 0 0 12 0 0
207.53/207.61 c logicor : 0.00 0 0 0 0 0 0 0 0
207.53/207.61 c root node : - 0 - - 0 - - - -
207.53/207.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
207.53/207.61 c integral : 0 0 0 74668 0 167 767 0 0 147900
207.53/207.61 c knapsack : 164 5 374900 0 0 54771 1269064 477 0 0
207.53/207.61 c setppc : 129 5 314945 0 0 194 393145 0 0 0
207.53/207.61 c logicor : 96+ 5 243053 0 0 967 253653 0 0 0
207.53/207.61 c countsols : 0 0 0 1 0 0 0 0 0 0
207.53/207.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
207.53/207.61 c integral : 17.55 0.00 0.00 17.55 0.00
207.53/207.61 c knapsack : 10.42 0.01 10.41 0.00 0.00
207.53/207.61 c setppc : 1.58 0.00 1.58 0.00 0.00
207.53/207.61 c logicor : 4.08 0.00 4.08 0.00 0.00
207.53/207.61 c countsols : 0.00 0.00 0.00 0.00 0.00
207.53/207.61 c Propagators : Time Calls Cutoffs DomReds
207.53/207.61 c vbounds : 0.14 1 0 0
207.53/207.61 c rootredcost : 0.16 0 0 0
207.53/207.61 c pseudoobj : 0.12 0 0 0
207.53/207.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
207.53/207.61 c propagation : 1.69 9206 7822 41471 55.1 142 62.2 -
207.53/207.61 c infeasible LP : 2.70 17747 0 0 0.0 0 0.0 0
207.53/207.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
207.53/207.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
207.53/207.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
207.53/207.61 c applied globally : - - - 7882 14.6 - - -
207.53/207.61 c applied locally : - - - 77 39.1 - - -
207.53/207.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
207.53/207.61 c cut pool : 0.00 4 - - 88 - (maximal pool size: 1435)
207.53/207.61 c redcost : 0.64 74419 0 0 0 0
207.53/207.61 c impliedbounds : 0.00 5 0 0 646 0
207.53/207.61 c intobj : 0.00 0 0 0 0 0
207.53/207.61 c cgmip : 0.00 0 0 0 0 0
207.53/207.61 c gomory : 0.29 5 0 0 163 0
207.53/207.61 c strongcg : 0.32 5 0 0 1670 0
207.53/207.61 c cmir : 0.00 0 0 0 0 0
207.53/207.61 c flowcover : 0.00 0 0 0 0 0
207.53/207.61 c clique : 0.00 1 0 0 0 0
207.53/207.61 c zerohalf : 0.00 0 0 0 0 0
207.53/207.61 c mcf : 0.00 1 0 0 0 0
207.53/207.61 c rapidlearning : 0.05 1 0 0 0 0
207.53/207.61 c Pricers : Time Calls Vars
207.53/207.61 c problem variables: 0.00 0 0
207.53/207.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
207.53/207.61 c relpscost : 17.45 74667 167 767 0 0 147900
207.53/207.61 c pscost : 0.00 0 0 0 0 0 0
207.53/207.61 c inference : 0.00 0 0 0 0 0 0
207.53/207.61 c mostinf : 0.00 0 0 0 0 0 0
207.53/207.61 c leastinf : 0.00 0 0 0 0 0 0
207.53/207.61 c fullstrong : 0.00 0 0 0 0 0 0
207.53/207.61 c allfullstrong : 0.00 0 0 0 0 0 0
207.53/207.61 c random : 0.00 0 0 0 0 0 0
207.53/207.61 c Primal Heuristics : Time Calls Found
207.53/207.61 c LP solutions : 0.00 - 1
207.53/207.61 c pseudo solutions : 0.00 - 0
207.53/207.61 c trivial : 0.00 1 0
207.53/207.61 c simplerounding : 0.00 0 0
207.53/207.61 c zirounding : 0.00 0 0
207.53/207.61 c rounding : 0.00 0 0
207.53/207.61 c shifting : 0.00 0 0
207.53/207.61 c intshifting : 0.00 0 0
207.53/207.61 c oneopt : 0.00 0 0
207.53/207.61 c twoopt : 0.00 0 0
207.53/207.61 c fixandinfer : 0.00 0 0
207.53/207.61 c feaspump : 0.00 0 0
207.53/207.61 c coefdiving : 0.00 0 0
207.53/207.61 c pscostdiving : 0.00 0 0
207.53/207.61 c fracdiving : 0.00 0 0
207.53/207.61 c veclendiving : 0.00 0 0
207.53/207.61 c intdiving : 0.00 0 0
207.53/207.61 c actconsdiving : 0.00 0 0
207.53/207.61 c objpscostdiving : 0.00 0 0
207.53/207.61 c rootsoldiving : 0.00 0 0
207.53/207.61 c linesearchdiving : 0.00 0 0
207.53/207.61 c guideddiving : 0.00 0 0
207.53/207.61 c octane : 0.00 0 0
207.53/207.61 c rens : 0.00 0 0
207.53/207.61 c rins : 0.00 0 0
207.53/207.61 c localbranching : 0.00 0 0
207.53/207.61 c mutation : 0.00 0 0
207.53/207.61 c crossover : 0.00 0 0
207.53/207.61 c dins : 0.00 0 0
207.53/207.61 c undercover : 0.00 0 0
207.53/207.61 c nlp : 0.00 0 0
207.53/207.61 c trysol : 0.00 0 0
207.53/207.61 c LP : Time Calls Iterations Iter/call Iter/sec
207.53/207.61 c primal LP : 0.00 0 0 0.00 -
207.53/207.61 c dual LP : 142.39 92312 1175807 12.74 8257.75
207.53/207.61 c lex dual LP : 0.00 0 0 0.00 -
207.53/207.61 c barrier LP : 0.00 0 0 0.00 -
207.53/207.61 c diving/probing LP: 0.00 0 0 0.00 -
207.53/207.61 c strong branching : 15.75 6010 101909 16.96 6469.95
207.53/207.61 c (at root node) : - 10 3497 349.70 -
207.53/207.61 c conflict analysis: 0.00 0 0 0.00 -
207.53/207.61 c B&B Tree :
207.53/207.61 c number of runs : 1
207.53/207.61 c nodes : 147011
207.53/207.61 c nodes (total) : 147011
207.53/207.61 c nodes left : 0
207.53/207.61 c max depth : 47
207.53/207.61 c max depth (total): 47
207.53/207.61 c backtracks : 19922 (13.6%)
207.53/207.61 c delayed cutoffs : 816
207.53/207.61 c repropagations : 16023 (42842 domain reductions, 786 cutoffs)
207.53/207.61 c avg switch length: 2.79
207.53/207.61 c switching time : 8.72
207.53/207.61 c Solution :
207.53/207.61 c Solutions found : 1 (1 improvements)
207.53/207.61 c First Solution : +0.00000000000000e+00 (in run 1, after 147011 nodes, 207.59 seconds, depth 21, found by <relaxation>)
207.53/207.61 c Primal Bound : +0.00000000000000e+00 (in run 1, after 147011 nodes, 207.59 seconds, depth 21, found by <relaxation>)
207.53/207.61 c Dual Bound : +0.00000000000000e+00
207.53/207.61 c Gap : 0.00 %
207.53/207.61 c Root Dual Bound : +0.00000000000000e+00
207.53/207.61 c Root Iterations : 834
207.53/207.62 c Time complete: 207.55.