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-2665696-1276268870.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 809 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.03/0.04 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.03/0.04 c (round 2) 16 del vars, 20 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.03/0.04 c (round 3) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.03/0.07 c (round 4) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 406 impls, 0 clqs
0.03/0.09 c (round 5) 22 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 11256 impls, 6 clqs
0.03/0.09 c presolving (6 rounds):
0.03/0.09 c 22 deleted vars, 33 deleted constraints, 14 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.03/0.09 c 11256 implications, 6 cliques
0.03/0.09 c presolved problem has 348 variables (348 bin, 0 int, 0 impl, 0 cont) and 776 constraints
0.03/0.09 c 240 constraints of type <knapsack>
0.03/0.09 c 536 constraints of type <logicor>
0.03/0.09 c transformed objective value is always integral (scale: 1)
0.03/0.09 c Presolving Time: 0.05
0.03/0.09 c - non default parameters ----------------------------------------------------------------------
0.03/0.09 c # SCIP version 1.2.1.2
0.03/0.09 c
0.03/0.09 c # frequency for displaying node information lines
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.09 c display/freq = 10000
0.03/0.09 c
0.03/0.09 c # maximal time in seconds to run
0.03/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09 c limits/time = 1799.98
0.03/0.09 c
0.03/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09 c limits/memory = 1620
0.03/0.09 c
0.03/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09 c limits/solutions = 1
0.03/0.09 c
0.03/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.03/0.09 c separating/maxrounds = 1
0.03/0.09 c
0.03/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09 c separating/maxroundsroot = 5
0.03/0.09 c
0.03/0.09 c # should presolving try to simplify inequalities
0.03/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09 c constraints/linear/simplifyinequalities = TRUE
0.03/0.09 c
0.03/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.03/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.03/0.09 c constraints/knapsack/disaggregation = FALSE
0.03/0.09 c
0.03/0.09 c # should presolving try to simplify knapsacks
0.03/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.09 c
0.03/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09 c presolving/probing/maxrounds = 0
0.03/0.09 c
0.03/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09 c heuristics/coefdiving/freq = -1
0.03/0.09 c
0.03/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.03/0.09 c
0.03/0.09 c # additional number of allowed LP iterations
0.03/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.03/0.09 c
0.03/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.03/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.03/0.09 c heuristics/crossover/freq = -1
0.03/0.09 c
0.03/0.09 c # number of nodes added to the contingent of the total nodes
0.03/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.09 c heuristics/crossover/nodesofs = 750
0.03/0.09 c
0.03/0.09 c # number of nodes without incumbent change that heuristic should wait
0.03/0.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.03/0.10 c heuristics/crossover/nwaitingnodes = 100
0.03/0.10 c
0.03/0.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.03/0.10 c # [type: real, range: [0,1], default: 0.1]
0.03/0.10 c heuristics/crossover/nodesquot = 0.15
0.03/0.10 c
0.03/0.10 c # minimum percentage of integer variables that have to be fixed
0.03/0.10 c # [type: real, range: [0,1], default: 0.666]
0.03/0.10 c heuristics/crossover/minfixingrate = 0.5
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.10 c heuristics/feaspump/freq = -1
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/feaspump/maxlpiterofs = 2000
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/fracdiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/fracdiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/fracdiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/guideddiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/guideddiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/guideddiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/intdiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/intshifting/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/linesearchdiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/nlp/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.10 c heuristics/objpscostdiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to total iteration number
0.03/0.10 c # [type: real, range: [0,1], default: 0.01]
0.03/0.10 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/oneopt/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/pscostdiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/pscostdiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.10 c heuristics/rens/freq = -1
0.03/0.10 c
0.03/0.10 c # minimum percentage of integer variables that have to be fixable
0.03/0.10 c # [type: real, range: [0,1], default: 0.5]
0.03/0.10 c heuristics/rens/minfixingrate = 0.3
0.03/0.10 c
0.03/0.10 c # number of nodes added to the contingent of the total nodes
0.03/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.10 c heuristics/rens/nodesofs = 2000
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.10 c heuristics/rootsoldiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.03/0.10 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/rounding/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/shifting/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/simplerounding/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.10 c heuristics/trivial/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/trysol/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.10 c heuristics/veclendiving/freq = -1
0.03/0.10 c
0.03/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.10 c heuristics/veclendiving/maxlpiterquot = 0.075
0.03/0.10 c
0.03/0.10 c # additional number of allowed LP iterations
0.03/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.10 c heuristics/veclendiving/maxlpiterofs = 1500
0.03/0.10 c
0.03/0.10 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.10 c heuristics/zirounding/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.10 c separating/cmir/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.10 c separating/flowcover/freq = -1
0.03/0.10 c
0.03/0.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.10 c separating/rapidlearning/freq = 0
0.03/0.10 c
0.03/0.10 c -----------------------------------------------------------------------------------------------
0.03/0.10 c start solving
0.09/0.10 c
0.09/0.13 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.13 c 0.1s| 1 | 0 | 266 | - |2534k| 0 | 165 | 348 | 776 | 348 | 770 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 964 | - |6517k| 0 | 258 | 348 | 812 | 348 |1128 | 358 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.8s| 1 | 0 | 2177 | - | 10M| 0 | 272 | 348 | 812 | 348 |1323 | 553 | 0 | 0 | 0.000000e+00 | -- | Inf
2.99/3.02 c 2.9s| 1 | 0 | 3395 | - | 13M| 0 | 286 | 348 | 812 | 348 |1506 | 736 | 0 | 0 | 0.000000e+00 | -- | Inf
4.09/4.13 c 4.0s| 1 | 0 | 4650 | - | 17M| 0 | 295 | 348 | 812 | 348 |1626 | 856 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.98 c 4.8s| 1 | 0 | 5287 | - | 20M| 0 | 312 | 348 | 812 | 348 |1692 | 922 | 0 | 0 | 0.000000e+00 | -- | Inf
7.89/7.94 c 7.8s| 1 | 2 | 5287 | - | 20M| 0 | 312 | 348 | 812 | 348 |1692 | 922 | 0 | 9 | 0.000000e+00 | -- | Inf
84.58/84.60 c 82.7s| 10000 | 45 |243481 | 23.8 | 21M| 31 | 37 | 348 |1935 | 348 |1035 | 922 |1544 |2091 | 0.000000e+00 | -- | Inf
132.47/132.53 c 129s| 20000 | 60 |469936 | 23.2 | 21M| 35 | 62 | 348 |2579 | 348 |1035 | 922 |2874 |2295 | 0.000000e+00 | -- | Inf
188.85/188.92 c 184s| 30000 | 52 |721566 | 23.9 | 21M| 35 | - | 348 |2536 | 348 |1035 | 922 |4373 |2813 | 0.000000e+00 | -- | Inf
242.84/242.94 c 236s| 40000 | 51 |954440 | 23.7 | 21M| 40 | - | 348 |3068 | 348 |1035 | 922 |5777 |3355 | 0.000000e+00 | -- | Inf
292.54/292.64 c 284s| 50000 | 50 | 1177k| 23.5 | 21M| 40 | - | 348 |3551 | 348 |1035 | 922 |7488 |3627 | 0.000000e+00 | -- | Inf
345.62/345.78 c 335s| 60000 | 50 | 1411k| 23.4 | 22M| 51 | - | 348 |3925 | 348 |1035 | 922 |8623 |3954 | 0.000000e+00 | -- | Inf
395.01/395.12 c 382s| 70000 | 60 | 1617k| 23.0 | 22M| 51 | 45 | 348 |4480 | 348 |1035 | 922 | 10k|4348 | 0.000000e+00 | -- | Inf
453.30/453.43 c 438s| 80000 | 65 | 1872k| 23.3 | 22M| 51 | 16 | 348 |4459 | 348 |1035 | 922 | 11k|4698 | 0.000000e+00 | -- | Inf
514.49/514.65 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
514.49/514.65 c 497s| 90000 | 54 | 2148k| 23.8 | 22M| 51 | - | 348 |4385 | 348 |1035 | 922 | 12k|5017 | 0.000000e+00 | -- | Inf
572.28/572.46 c 553s|100000 | 55 | 2404k| 24.0 | 22M| 51 | 50 | 348 |3915 | 348 |1035 | 922 | 14k|5298 | 0.000000e+00 | -- | Inf
623.56/623.79 c 603s|110000 | 47 | 2633k| 23.9 | 22M| 51 | 70 | 348 |4959 | 348 |1035 | 922 | 16k|5478 | 0.000000e+00 | -- | Inf
688.94/689.17 c 666s|120000 | 63 | 2891k| 24.1 | 22M| 51 | 32 | 348 |4883 | 348 |1035 | 922 | 18k|6292 | 0.000000e+00 | -- | Inf
728.64/728.86 c 704s|130000 | 61 | 3069k| 23.6 | 23M| 51 | 25 | 348 |5580 | 348 |1035 | 922 | 19k|6354 | 0.000000e+00 | -- | Inf
775.43/775.69 c 749s|140000 | 54 | 3279k| 23.4 | 23M| 51 | - | 348 |5749 | 348 |1035 | 922 | 21k|6425 | 0.000000e+00 | -- | Inf
790.23/790.49 c * 763s|143418 | 0 | 3345k| 23.3 | 23M| 51 | - | 348 |6131 | 348 |1035 | 922 | 22k|6476 | 0.000000e+00 | 0.000000e+00 | 0.00%
790.23/790.49 c
790.23/790.49 c SCIP Status : problem is solved [optimal solution found]
790.23/790.49 c Solving Time (sec) : 763.18
790.23/790.50 c Solving Nodes : 143418
790.23/790.50 c Primal Bound : +0.00000000000000e+00 (1 solutions)
790.23/790.50 c Dual Bound : +0.00000000000000e+00
790.23/790.50 c Gap : 0.00 %
790.23/790.50 s SATISFIABLE
790.23/790.50 v x369 -x370 -x367 x368 x365 -x366 x363 -x364 x361 -x362 -x359 x360 -x357 x358 -x355 x356 -x353 -x354 -x351 x352 -x349 x350 -x347
790.23/790.50 v -x348 -x345 x346 -x343 -x344 -x341 x342 x339 -x340 x337 -x338 x335 -x336 -x333 x334 -x331 x332 -x329 x330 x327 -x328 -x325 x326
790.23/790.50 v x323 -x324 x321 -x322 x319 -x320 -x317 x318 -x315 -x316 -x313 x314 -x311 -x312 -x309 x310 -x307 x308 -x305 -x306 -x303 x304
790.23/790.50 v -x301 -x302 -x299 x300 x297 -x298 x295 -x296 x293 -x294 -x291 x292 x289 -x290 -x287 x288 -x285 x286 -x283 x284 -x281 x282
790.23/790.50 v x279 -x280 x277 -x278 x275 -x276 x273 -x274 x271 -x272 -x269 x270 x267 -x268 -x265 x266 -x263 x264 x261 -x262 -x259 x260 x257
790.23/790.50 v -x258 x255 -x256 x253 -x254 x251 -x252 x249 -x250 -x247 x248 x245 -x246 -x243 x244 -x242 -x240 -x238 -x236 -x234 -x232 -x230
790.23/790.50 v -x228 -x226 -x224 -x222 -x220 -x218 -x216 -x214 x212 x210 x208 -x206 -x204 -x202 -x200 -x198 -x196 -x194 -x192 -x190 -x188 -x186
790.23/790.50 v -x184 -x182 -x180 -x178 -x176 -x174 -x172 -x170 x168 -x166 -x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 x148 -x146 -x144
790.23/790.50 v -x142 x140 -x138 x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122 x120 -x118 -x116 x114 -x112 -x110 -x108 -x106 -x104 -x102
790.23/790.50 v x100 -x98 x96 -x94 x92 -x90 -x88 -x86 -x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50
790.23/790.50 v -x48 -x46 -x44 -x42 -x40 -x38 x36 x34 x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 x241 -x239
790.23/790.50 v x237 -x235 -x233 -x231 -x229 -x227 x225 -x223 x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 -x205 -x203 -x201 -x199 x197 -x195
790.23/790.50 v x193 -x191 -x189 -x187 -x185 -x183 x181 -x179 x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153
790.23/790.50 v -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113 -x111
790.23/790.50 v -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 x65 x63
790.23/790.50 v x61 -x59 -x57 -x55 -x53 -x51 x49 -x47 x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 x21 -x19 x17 -x15 -x13 -x11
790.23/790.50 v -x9 -x7 x5 -x3 x1
790.23/790.50 c SCIP Status : problem is solved [optimal solution found]
790.23/790.50 c Solving Time : 763.18
790.23/790.50 c Original Problem :
790.23/790.50 c Problem name : HOME/instance-2665696-1276268870.opb
790.23/790.50 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
790.23/790.50 c Constraints : 809 initial, 809 maximal
790.23/790.50 c Presolved Problem :
790.23/790.50 c Problem name : t_HOME/instance-2665696-1276268870.opb
790.23/790.50 c Variables : 348 (348 binary, 0 integer, 0 implicit integer, 0 continuous)
790.23/790.50 c Constraints : 776 initial, 6136 maximal
790.23/790.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
790.23/790.50 c trivial : 0.00 0 0 0 0 0 0 0 0
790.23/790.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
790.23/790.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
790.23/790.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
790.23/790.50 c implics : 0.00 0 8 0 0 0 0 0 0
790.23/790.50 c probing : 0.00 0 0 0 0 0 0 0 0
790.23/790.50 c knapsack : 0.01 0 0 0 0 0 0 0 0
790.23/790.50 c linear : 0.02 14 0 0 14 0 33 0 0
790.23/790.50 c logicor : 0.01 0 0 0 0 0 0 0 0
790.23/790.50 c root node : - 3 - - 3 - - - -
790.23/790.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
790.23/790.50 c integral : 0 0 0 73592 0 110 1181 0 0 145432
790.23/790.50 c knapsack : 240 5 509325 1 0 30303 1584824 900 0 0
790.23/790.50 c linear : 0+ 5 262723 0 0 40 3310 0 0 0
790.23/790.50 c logicor : 536+ 5 410490 1 0 9499 909140 0 0 0
790.23/790.50 c countsols : 0 0 0 1 0 0 0 0 0 0
790.23/790.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
790.23/790.50 c integral : 74.24 0.00 0.00 74.24 0.00
790.23/790.50 c knapsack : 21.30 0.04 21.26 0.00 0.00
790.23/790.50 c linear : 0.58 0.00 0.58 0.00 0.00
790.23/790.50 c logicor : 21.91 0.00 21.91 0.00 0.00
790.23/790.50 c countsols : 0.00 0.00 0.00 0.00 0.00
790.23/790.50 c Propagators : Time Calls Cutoffs DomReds
790.23/790.50 c vbounds : 0.25 1 0 0
790.23/790.50 c rootredcost : 0.35 0 0 0
790.23/790.50 c pseudoobj : 0.26 0 0 0
790.23/790.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
790.23/790.50 c propagation : 6.13 16026 15401 132689 71.8 297 23.3 -
790.23/790.50 c infeasible LP : 7.88 32629 0 0 0.0 0 0.0 0
790.23/790.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
790.23/790.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
790.23/790.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
790.23/790.50 c applied globally : - - - 22653 18.1 - - -
790.23/790.50 c applied locally : - - - 97 101.2 - - -
790.23/790.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
790.23/790.50 c cut pool : 0.01 4 - - 63 - (maximal pool size: 3263)
790.23/790.50 c redcost : 0.91 73004 0 0 0 0
790.23/790.50 c impliedbounds : 0.01 5 0 0 1823 0
790.23/790.50 c intobj : 0.00 0 0 0 0 0
790.23/790.50 c cgmip : 0.00 0 0 0 0 0
790.23/790.50 c gomory : 1.24 5 0 0 76 0
790.23/790.50 c strongcg : 0.77 5 0 0 2500 0
790.23/790.50 c cmir : 0.00 0 0 0 0 0
790.23/790.50 c flowcover : 0.00 0 0 0 0 0
790.23/790.50 c clique : 0.01 5 0 0 7 0
790.23/790.50 c zerohalf : 0.00 0 0 0 0 0
790.23/790.50 c mcf : 0.01 1 0 0 0 0
790.23/790.50 c rapidlearning : 0.19 1 0 0 0 36
790.23/790.50 c Pricers : Time Calls Vars
790.23/790.50 c problem variables: 0.00 0 0
790.23/790.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
790.23/790.50 c relpscost : 74.02 73591 110 1181 0 0 145432
790.23/790.50 c pscost : 0.00 0 0 0 0 0 0
790.23/790.50 c inference : 0.00 0 0 0 0 0 0
790.23/790.50 c mostinf : 0.00 0 0 0 0 0 0
790.23/790.50 c leastinf : 0.00 0 0 0 0 0 0
790.23/790.50 c fullstrong : 0.00 0 0 0 0 0 0
790.23/790.50 c allfullstrong : 0.00 0 0 0 0 0 0
790.23/790.50 c random : 0.00 0 0 0 0 0 0
790.23/790.50 c Primal Heuristics : Time Calls Found
790.23/790.50 c LP solutions : 0.00 - 1
790.23/790.50 c pseudo solutions : 0.00 - 0
790.23/790.50 c trivial : 0.00 1 0
790.23/790.50 c simplerounding : 0.00 0 0
790.23/790.50 c zirounding : 0.00 0 0
790.23/790.50 c rounding : 0.00 0 0
790.23/790.50 c shifting : 0.00 0 0
790.23/790.50 c intshifting : 0.00 0 0
790.23/790.50 c oneopt : 0.00 0 0
790.23/790.50 c twoopt : 0.00 0 0
790.23/790.50 c fixandinfer : 0.00 0 0
790.23/790.50 c feaspump : 0.00 0 0
790.23/790.50 c coefdiving : 0.00 0 0
790.23/790.50 c pscostdiving : 0.00 0 0
790.23/790.50 c fracdiving : 0.00 0 0
790.23/790.50 c veclendiving : 0.00 0 0
790.23/790.50 c intdiving : 0.00 0 0
790.23/790.50 c actconsdiving : 0.00 0 0
790.23/790.50 c objpscostdiving : 0.00 0 0
790.23/790.50 c rootsoldiving : 0.00 0 0
790.23/790.50 c linesearchdiving : 0.00 0 0
790.23/790.50 c guideddiving : 0.00 0 0
790.23/790.50 c octane : 0.00 0 0
790.23/790.50 c rens : 0.00 0 0
790.23/790.50 c rins : 0.00 0 0
790.23/790.50 c localbranching : 0.00 0 0
790.23/790.50 c mutation : 0.00 0 0
790.23/790.50 c crossover : 0.00 0 0
790.23/790.50 c dins : 0.00 0 0
790.23/790.50 c undercover : 0.00 0 0
790.23/790.50 c nlp : 0.00 0 0
790.23/790.50 c trysol : 0.00 0 0
790.23/790.50 c LP : Time Calls Iterations Iter/call Iter/sec
790.23/790.50 c primal LP : 0.01 0 0 0.00 0.00
790.23/790.50 c dual LP : 582.41 106190 3345462 31.50 5744.17
790.23/790.50 c lex dual LP : 0.00 0 0 0.00 -
790.23/790.50 c barrier LP : 0.00 0 0 0.00 -
790.23/790.50 c diving/probing LP: 0.00 0 0 0.00 -
790.23/790.50 c strong branching : 71.29 6476 340630 52.60 4778.09
790.23/790.50 c (at root node) : - 9 5786 642.89 -
790.23/790.50 c conflict analysis: 0.00 0 0 0.00 -
790.23/790.50 c B&B Tree :
790.23/790.50 c number of runs : 1
790.23/790.50 c nodes : 143418
790.23/790.50 c nodes (total) : 143418
790.23/790.50 c nodes left : 0
790.23/790.50 c max depth : 51
790.23/790.50 c max depth (total): 51
790.23/790.50 c backtracks : 24693 (17.2%)
790.23/790.50 c delayed cutoffs : 1952
790.23/790.50 c repropagations : 21006 (127997 domain reductions, 1880 cutoffs)
790.23/790.50 c avg switch length: 2.85
790.23/790.50 c switching time : 18.99
790.23/790.50 c Solution :
790.23/790.50 c Solutions found : 1 (1 improvements)
790.23/790.50 c First Solution : +0.00000000000000e+00 (in run 1, after 143418 nodes, 763.17 seconds, depth 35, found by <relaxation>)
790.23/790.50 c Primal Bound : +0.00000000000000e+00 (in run 1, after 143418 nodes, 763.17 seconds, depth 35, found by <relaxation>)
790.23/790.50 c Dual Bound : +0.00000000000000e+00
790.23/790.50 c Gap : 0.00 %
790.23/790.50 c Root Dual Bound : +0.00000000000000e+00
790.23/790.50 c Root Iterations : 5287
790.32/790.52 c Time complete: 790.35.