0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690478-1338016919.opb>
0.00/0.00 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 3 del vars, 1 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.01 c (round 2) 13 del vars, 17 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.01 c (round 3) 13 del vars, 27 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.01/0.02 c (round 4) 13 del vars, 27 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.01/0.02 c (round 5) 19 del vars, 27 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.02 c (round 6) 19 del vars, 33 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.02 c (round 7) 19 del vars, 35 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.03 c presolving (8 rounds):
0.01/0.03 c 19 deleted vars, 35 deleted constraints, 0 added constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 4704 implications, 6 cliques
0.01/0.03 c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 435 constraints
0.01/0.03 c 129 constraints of type <knapsack>
0.01/0.03 c 95 constraints of type <setppc>
0.01/0.03 c 211 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.02
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 2.1.1.4
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1797
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 13950
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.03 c # [type: int, range: [1,2], default: 1]
0.01/0.03 c timing/clocktype = 2
0.01/0.03 c
0.01/0.03 c # belongs reading time to solving time?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c timing/reading = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/shiftandpropagate/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/subnlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/undercover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c propagating/probing/maxprerounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/flowcover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/indoneopt/freq = -1
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/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.01/0.04 c 0.0s| 1 | 0 | 325 | - |1580k| 0 | 102 | 201 | 435 | 201 | 435 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 688 | - |2907k| 0 | 152 | 201 | 463 | 201 | 648 | 213 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 1087 | - |4652k| 0 | 154 | 201 | 463 | 201 | 740 | 305 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 1266 | - |6473k| 0 | 162 | 201 | 463 | 201 | 791 | 356 | 0 | 0 | 0.000000e+00 | -- | Inf
0.48/0.51 c 0.5s| 1 | 0 | 1424 | - |8096k| 0 | 155 | 201 | 463 | 201 | 813 | 378 | 0 | 0 | 0.000000e+00 | -- | Inf
0.58/0.60 c 0.6s| 1 | 0 | 1507 | - |9759k| 0 | 163 | 201 | 463 | 201 | 825 | 390 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.9s| 1 | 2 | 1507 | - |9760k| 0 | 163 | 201 | 463 | 201 | 825 | 390 | 0 | 9 | 0.000000e+00 | -- | Inf
2.69/2.70 c 2.7s| 100 | 12 | 5409 | 39.4 |9892k| 12 | - | 201 | 508 | 0 | 0 | 390 | 47 | 747 | 0.000000e+00 | -- | Inf
3.69/3.71 c 3.7s| 200 | 17 | 7904 | 32.1 |9927k| 13 | 38 | 201 | 556 | 201 | 567 | 390 | 99 |1073 | 0.000000e+00 | -- | Inf
3.98/4.02 c 4.0s| 300 | 17 | 9649 | 27.2 |9947k| 16 | 41 | 201 | 609 | 201 | 567 | 390 | 155 |1176 | 0.000000e+00 | -- | Inf
4.19/4.20 c 4.2s| 400 | 17 | 11548 | 25.2 |9969k| 16 | 32 | 201 | 677 | 201 | 567 | 390 | 223 |1207 | 0.000000e+00 | -- | Inf
4.29/4.35 c 4.4s| 500 | 21 | 13438 | 23.9 |9995k| 17 | - | 201 | 726 | 201 | 567 | 390 | 272 |1232 | 0.000000e+00 | -- | Inf
4.39/4.47 c 4.5s| 600 | 23 | 14959 | 22.5 | 10M| 21 | 28 | 201 | 786 | 201 | 567 | 390 | 333 |1250 | 0.000000e+00 | -- | Inf
4.49/4.55 c 4.6s| 700 | 16 | 16444 | 21.4 | 10M| 21 | - | 201 | 843 | 201 | 567 | 390 | 394 |1251 | 0.000000e+00 | -- | Inf
4.59/4.66 c 4.7s| 800 | 17 | 18444 | 21.2 | 10M| 21 | 35 | 201 | 878 | 201 | 567 | 390 | 441 |1252 | 0.000000e+00 | -- | Inf
4.68/4.76 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.68/4.76 c 4.8s| 900 | 20 | 20176 | 20.8 | 10M| 21 | 7 | 201 | 940 | 201 | 567 | 390 | 511 |1252 | 0.000000e+00 | -- | Inf
4.78/4.85 c 4.9s| 1000 | 17 | 21849 | 20.4 | 10M| 21 | 30 | 201 |1007 | 201 | 567 | 390 | 583 |1252 | 0.000000e+00 | -- | Inf
4.89/4.94 c 4.9s| 1100 | 16 | 23468 | 20.0 | 10M| 21 | 32 | 201 |1068 | 201 | 567 | 390 | 650 |1252 | 0.000000e+00 | -- | Inf
5.19/5.28 c 5.3s| 1200 | 16 | 25614 | 20.1 | 10M| 21 | 43 | 201 |1112 | 201 | 567 | 390 | 698 |1307 | 0.000000e+00 | -- | Inf
5.40/5.43 c 5.4s| 1300 | 19 | 27043 | 19.7 | 10M| 21 | 10 | 201 |1167 | 201 | 567 | 390 | 761 |1324 | 0.000000e+00 | -- | Inf
5.78/5.84 c 5.8s| 1400 | 16 | 29244 | 19.8 | 10M| 21 | 52 | 201 |1212 | 201 | 567 | 390 | 814 |1402 | 0.000000e+00 | -- | Inf
5.89/5.94 c 5.9s| 1500 | 18 | 30137 | 19.1 | 10M| 21 | 29 | 201 |1276 | 201 | 567 | 390 | 884 |1426 | 0.000000e+00 | -- | Inf
5.98/6.01 c 6.0s| 1600 | 19 | 31356 | 18.7 | 10M| 21 | - | 201 |1317 | 0 | 0 | 390 | 933 |1426 | 0.000000e+00 | -- | Inf
6.09/6.11 c 6.1s| 1700 | 13 | 33031 | 18.6 | 10M| 21 | - | 201 |1362 | 0 | 0 | 390 | 982 |1426 | 0.000000e+00 | -- | Inf
6.19/6.24 c 6.2s| 1800 | 13 | 35142 | 18.7 | 10M| 21 | - | 201 |1390 | 0 | 0 | 390 |1028 |1429 | 0.000000e+00 | -- | Inf
6.29/6.34 c 6.3s| 1900 | 20 | 37028 | 18.7 | 10M| 21 | - | 201 |1414 | 0 | 0 | 390 |1079 |1429 | 0.000000e+00 | -- | Inf
6.39/6.44 c 6.4s| 2000 | 16 | 38455 | 18.5 | 10M| 21 | - | 201 |1459 | 0 | 0 | 390 |1138 |1434 | 0.000000e+00 | -- | Inf
6.49/6.52 c 6.5s| 2100 | 15 | 39614 | 18.2 | 10M| 22 | 61 | 201 |1501 | 201 | 567 | 390 |1194 |1435 | 0.000000e+00 | -- | Inf
6.49/6.57 c * 6.6s| 2158 | 0 | 40515 | 18.1 | 10M| 22 | - | 201 |1529 | 201 | 567 | 390 |1228 |1435 | 0.000000e+00 | 0.000000e+00 | 0.00%
6.49/6.57 c
6.49/6.57 c SCIP Status : problem is solved [optimal solution found]
6.49/6.57 c Solving Time (sec) : 6.57
6.49/6.57 c Solving Nodes : 2158
6.49/6.57 c Primal Bound : +0.00000000000000e+00 (1 solutions)
6.49/6.57 c Dual Bound : +0.00000000000000e+00
6.49/6.57 c Gap : 0.00 %
6.49/6.57 s SATISFIABLE
6.49/6.57 v x219 -x220 x217 -x218 x215 -x216 -x213 -x214 x211 -x212 -x209 -x210 x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 -x197
6.49/6.57 v x198 x195 -x196 -x193 x194 x191 -x192 -x189 x190 x187 -x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175
6.49/6.57 v -x176 -x173 x174 -x171 -x172 -x169 x170 -x167 x168 -x165 x166 x163 -x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 x153 -x154
6.49/6.57 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 -x143 x144 -x141 x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 x131 -x132
6.49/6.57 v x129 -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 x96 x94 -x92 x90 -x88
6.49/6.57 v -x86 -x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38
6.49/6.57 v -x36 -x34 -x32 x30 -x28 x26 -x24 -x22 -x20 -x18 x16 -x14 x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 x119 -x117 x115 -x113
6.49/6.57 v -x111 -x109 -x107 -x105 -x103 x101 -x99 x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65
6.49/6.57 v -x63 -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
6.49/6.57 v -x11 -x9 -x7 -x5 -x3 -x1
6.49/6.57 c SCIP Status : problem is solved [optimal solution found]
6.49/6.57 c Total Time : 6.57
6.49/6.57 c solving : 6.57
6.49/6.57 c presolving : 0.02 (included in solving)
6.49/6.57 c reading : 0.00 (included in solving)
6.49/6.57 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
6.49/6.57 c Original Problem :
6.49/6.57 c Problem name : HOME/instance-3690478-1338016919.opb
6.49/6.57 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.57 c Constraints : 470 initial, 470 maximal
6.49/6.57 c Objective sense : minimize
6.49/6.57 c Presolved Problem :
6.49/6.57 c Problem name : t_HOME/instance-3690478-1338016919.opb
6.49/6.57 c Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.57 c Constraints : 435 initial, 1529 maximal
6.49/6.57 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
6.49/6.57 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c implics : 0.00 0.00 0 8 0 0 0 0 0 0 0
6.49/6.57 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c setppc : 0.00 0.00 0 0 0 0 0 8 0 0 0
6.49/6.57 c linear : 0.01 0.00 11 0 0 11 0 27 0 0 0
6.49/6.57 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
6.49/6.57 c root node : - - 0 - - 0 - - - - -
6.49/6.57 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
6.49/6.57 c integral : 0 0 0 0 1341 0 3 0 14 163 0 0 2490
6.49/6.57 c knapsack : 129 129 5 9659 0 0 0 78526 772 23225 465 0 0
6.49/6.57 c setppc : 95 95 5 8825 0 0 0 19098 84 6653 0 0 0
6.49/6.57 c linear : 0+ 28 5 7478 0 0 0 140 7 206 0 0 0
6.49/6.57 c logicor : 211+ 1277 5 6924 1 0 0 4784 197 8753 0 0 0
6.49/6.57 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
6.49/6.57 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
6.49/6.57 c integral : 3.73 0.00 0.00 0.00 3.73 0.00 0.00 0.00
6.49/6.57 c knapsack : 0.15 0.00 0.00 0.12 0.00 0.00 0.00 0.03
6.49/6.57 c setppc : 0.03 0.00 0.00 0.02 0.00 0.00 0.00 0.01
6.49/6.57 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
6.49/6.57 c logicor : 0.06 0.00 0.00 0.05 0.00 0.00 0.00 0.00
6.49/6.57 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c Propagators : #Propagate #ResProp Cutoffs DomReds
6.49/6.57 c rootredcost : 0 0 0 0
6.49/6.57 c pseudoobj : 0 0 0 0
6.49/6.57 c vbounds : 0 0 0 0
6.49/6.57 c redcost : 1346 0 0 0
6.49/6.57 c probing : 0 0 0 0
6.49/6.57 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
6.49/6.57 c rootredcost : 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c vbounds : 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c redcost : 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c probing : 0.00 0.00 0.00 0.00 0.00
6.49/6.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.49/6.57 c propagation : 0.10 1060 870 5762 44.5 20 33.7 -
6.49/6.57 c infeasible LP : 0.01 126 8 58 41.7 0 0.0 0
6.49/6.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.49/6.57 c applied globally : - - - 1196 14.1 - - -
6.49/6.57 c applied locally : - - - 32 53.0 - - -
6.49/6.57 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
6.49/6.57 c cut pool : 0.00 4 - - 48 - (maximal pool size: 2202)
6.49/6.57 c closecuts : 0.00 0.00 0 0 0 0 0
6.49/6.57 c impliedbounds : 0.00 0.00 5 0 0 603 0
6.49/6.57 c intobj : 0.00 0.00 0 0 0 0 0
6.49/6.57 c gomory : 0.17 0.00 5 0 0 106 0
6.49/6.57 c cgmip : 0.00 0.00 0 0 0 0 0
6.49/6.57 c strongcg : 0.17 0.00 5 0 0 2352 0
6.49/6.57 c cmir : 0.00 0.00 0 0 0 0 0
6.49/6.57 c flowcover : 0.00 0.00 0 0 0 0 0
6.49/6.57 c clique : 0.00 0.00 5 0 0 11 0
6.49/6.57 c zerohalf : 0.00 0.00 0 0 0 0 0
6.49/6.57 c mcf : 0.00 0.00 1 0 0 0 0
6.49/6.57 c oddcycle : 0.00 0.00 0 0 0 0 0
6.49/6.57 c rapidlearning : 0.08 0.00 1 0 0 0 28
6.49/6.57 c Pricers : ExecTime SetupTime Calls Vars
6.49/6.57 c problem variables: 0.00 - 0 0
6.49/6.57 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
6.49/6.57 c relpscost : 3.73 0.00 1340 14 163 0 0 2490
6.49/6.57 c pscost : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c inference : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c mostinf : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c leastinf : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c fullstrong : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c random : 0.00 0.00 0 0 0 0 0 0
6.49/6.57 c Primal Heuristics : ExecTime SetupTime Calls Found
6.49/6.57 c LP solutions : 0.00 - - 1
6.49/6.57 c pseudo solutions : 0.00 - - 0
6.49/6.57 c smallcard : 0.00 0.00 0 0
6.49/6.57 c trivial : 0.00 0.00 1 0
6.49/6.57 c shiftandpropagate: 0.00 0.00 0 0
6.49/6.57 c simplerounding : 0.00 0.00 0 0
6.49/6.57 c zirounding : 0.00 0.00 0 0
6.49/6.57 c rounding : 0.00 0.00 0 0
6.49/6.57 c shifting : 0.00 0.00 0 0
6.49/6.57 c intshifting : 0.00 0.00 0 0
6.49/6.57 c oneopt : 0.00 0.00 0 0
6.49/6.57 c twoopt : 0.00 0.00 0 0
6.49/6.57 c indtwoopt : 0.00 0.00 0 0
6.49/6.57 c indoneopt : 0.00 0.00 0 0
6.49/6.57 c fixandinfer : 0.00 0.00 0 0
6.49/6.57 c feaspump : 0.00 0.00 0 0
6.49/6.57 c clique : 0.00 0.00 0 0
6.49/6.57 c indrounding : 0.00 0.00 0 0
6.49/6.57 c indcoefdiving : 0.00 0.00 0 0
6.49/6.57 c coefdiving : 0.00 0.00 0 0
6.49/6.57 c pscostdiving : 0.00 0.00 0 0
6.49/6.57 c nlpdiving : 0.00 0.00 0 0
6.49/6.57 c fracdiving : 0.00 0.00 0 0
6.49/6.57 c veclendiving : 0.00 0.00 0 0
6.49/6.57 c intdiving : 0.00 0.00 0 0
6.49/6.57 c actconsdiving : 0.00 0.00 0 0
6.49/6.57 c objpscostdiving : 0.00 0.00 0 0
6.49/6.57 c rootsoldiving : 0.00 0.00 0 0
6.49/6.57 c linesearchdiving : 0.00 0.00 0 0
6.49/6.57 c guideddiving : 0.00 0.00 0 0
6.49/6.57 c octane : 0.00 0.00 0 0
6.49/6.57 c rens : 0.00 0.00 0 0
6.49/6.57 c rins : 0.00 0.00 0 0
6.49/6.57 c localbranching : 0.00 0.00 0 0
6.49/6.57 c mutation : 0.00 0.00 0 0
6.49/6.57 c crossover : 0.00 0.00 0 0
6.49/6.57 c dins : 0.00 0.00 0 0
6.49/6.57 c vbounds : 0.00 0.00 0 0
6.49/6.57 c undercover : 0.00 0.00 0 0
6.49/6.57 c subnlp : 0.00 0.00 0 0
6.49/6.57 c trysol : 0.00 0.00 0 0
6.49/6.57 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
6.49/6.57 c primal LP : 0.00 1 0 0.00 - 0.00 1
6.49/6.57 c dual LP : 1.88 1472 40515 27.52 21538.18 0.00 0
6.49/6.57 c lex dual LP : 0.00 0 0 0.00 -
6.49/6.57 c barrier LP : 0.00 0 0 0.00 - 0.00 0
6.49/6.57 c diving/probing LP: 0.00 0 0 0.00 -
6.49/6.57 c strong branching : 3.70 1435 66187 46.12 17872.76
6.49/6.57 c (at root node) : - 9 3681 409.00 -
6.49/6.57 c conflict analysis: 0.00 0 0 0.00 -
6.49/6.57 c B&B Tree :
6.49/6.57 c number of runs : 1
6.49/6.57 c nodes : 2158
6.49/6.57 c nodes (total) : 2158
6.49/6.57 c nodes left : 0
6.49/6.57 c max depth : 22
6.49/6.57 c max depth (total): 22
6.49/6.57 c backtracks : 509 (23.6%)
6.49/6.57 c delayed cutoffs : 314
6.49/6.57 c repropagations : 1328 (9779 domain reductions, 288 cutoffs)
6.49/6.57 c avg switch length: 3.17
6.49/6.57 c switching time : 0.09
6.49/6.57 c Solution :
6.49/6.57 c Solutions found : 1 (1 improvements)
6.49/6.57 c First Solution : +0.00000000000000e+00 (in run 1, after 2158 nodes, 6.57 seconds, depth 15, found by <relaxation>)
6.49/6.57 c Primal Bound : +0.00000000000000e+00 (in run 1, after 2158 nodes, 6.57 seconds, depth 15, found by <relaxation>)
6.49/6.57 c Dual Bound : +0.00000000000000e+00
6.49/6.57 c Gap : 0.00 %
6.49/6.57 c Root Dual Bound : +0.00000000000000e+00
6.49/6.57 c Root Iterations : 1507
6.49/6.58 c Time complete: 6.57.