0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3453360-1307116465.opb>
0.09/0.11 c original problem has 4836 variables (4836 bin, 0 int, 0 impl, 0 cont) and 16649 constraints
0.09/0.11 c problem read
0.09/0.11 c No objective function, only one solution is needed.
0.09/0.11 c presolving settings loaded
0.09/0.15 c presolving:
0.39/0.43 c (round 1) 1166 del vars, 2991 del conss, 0 add conss, 841 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 866384 impls, 0 clqs
0.49/0.52 c (round 2) 2220 del vars, 7511 del conss, 0 add conss, 1773 chg bounds, 3 chg sides, 2 chg coeffs, 0 upgd conss, 874159 impls, 0 clqs
0.49/0.54 c (round 3) 2641 del vars, 9394 del conss, 0 add conss, 2026 chg bounds, 46 chg sides, 57 chg coeffs, 0 upgd conss, 879164 impls, 7 clqs
0.49/0.55 c (round 4) 2778 del vars, 10051 del conss, 0 add conss, 2109 chg bounds, 56 chg sides, 65 chg coeffs, 0 upgd conss, 880635 impls, 6 clqs
0.49/0.55 c (round 5) 2842 del vars, 10304 del conss, 0 add conss, 2146 chg bounds, 56 chg sides, 65 chg coeffs, 0 upgd conss, 881145 impls, 5 clqs
0.49/0.56 c (round 6) 2858 del vars, 10420 del conss, 0 add conss, 2150 chg bounds, 56 chg sides, 65 chg coeffs, 0 upgd conss, 881345 impls, 4 clqs
0.49/0.56 c (round 7) 2859 del vars, 10429 del conss, 0 add conss, 2150 chg bounds, 56 chg sides, 65 chg coeffs, 0 upgd conss, 881353 impls, 4 clqs
0.49/0.56 c (round 8) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 56 chg sides, 65 chg coeffs, 0 upgd conss, 881353 impls, 4 clqs
0.49/0.59 c (round 9) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 56 chg sides, 65 chg coeffs, 6219 upgd conss, 881353 impls, 4 clqs
0.59/0.62 c (round 10) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 80 chg sides, 288 chg coeffs, 6219 upgd conss, 881675 impls, 328 clqs
0.59/0.64 c (round 11) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 85 chg sides, 476 chg coeffs, 6219 upgd conss, 881687 impls, 379 clqs
0.59/0.65 c (round 12) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 86 chg sides, 603 chg coeffs, 6219 upgd conss, 881959 impls, 421 clqs
0.59/0.66 c (round 13) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 86 chg sides, 695 chg coeffs, 6219 upgd conss, 881967 impls, 437 clqs
0.59/0.67 c (round 14) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 86 chg sides, 744 chg coeffs, 6219 upgd conss, 882207 impls, 453 clqs
0.59/0.69 c (round 15) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 89 chg sides, 794 chg coeffs, 6219 upgd conss, 882219 impls, 456 clqs
0.59/0.69 c (round 16) 2859 del vars, 10430 del conss, 0 add conss, 2150 chg bounds, 89 chg sides, 808 chg coeffs, 6219 upgd conss, 882219 impls, 462 clqs
0.69/0.70 c presolving (17 rounds):
0.69/0.70 c 2859 deleted vars, 10430 deleted constraints, 0 added constraints, 2150 tightened bounds, 0 added holes, 89 changed sides, 814 changed coefficients
0.69/0.70 c 882219 implications, 462 cliques
0.69/0.70 c presolved problem has 1977 variables (1977 bin, 0 int, 0 impl, 0 cont) and 6219 constraints
0.69/0.70 c 244 constraints of type <knapsack>
0.69/0.70 c 5054 constraints of type <setppc>
0.69/0.70 c 921 constraints of type <logicor>
0.69/0.70 c transformed objective value is always integral (scale: 1)
0.69/0.70 c Presolving Time: 0.58
0.69/0.70 c - non default parameters ----------------------------------------------------------------------
0.69/0.70 c # SCIP version 2.0.1.4
0.69/0.70 c
0.69/0.70 c # frequency for displaying node information lines
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.70 c display/freq = 10000
0.69/0.70 c
0.69/0.70 c # maximal time in seconds to run
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/time = 1800
0.69/0.70 c
0.69/0.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/memory = 13950
0.69/0.70 c
0.69/0.70 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c limits/solutions = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.70 c separating/maxrounds = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/maxroundsroot = 5
0.69/0.70 c
0.69/0.70 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.69/0.70 c # [type: int, range: [1,2], default: 1]
0.69/0.70 c timing/clocktype = 2
0.69/0.70 c
0.69/0.70 c # belongs reading time to solving time?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c timing/reading = TRUE
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify inequalities
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/linear/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/indicator/addCouplingCons = TRUE
0.69/0.70 c
0.69/0.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.70 c constraints/knapsack/disaggregation = FALSE
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify knapsacks
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c presolving/probing/maxrounds = 0
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/coefdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.70 c heuristics/crossover/freq = -1
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/crossover/nodesofs = 750
0.69/0.70 c
0.69/0.70 c # number of nodes without incumbent change that heuristic should wait
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.70 c heuristics/crossover/nwaitingnodes = 100
0.69/0.70 c
0.69/0.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.70 c # [type: real, range: [0,1], default: 0.1]
0.69/0.70 c heuristics/crossover/nodesquot = 0.15
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixed
0.69/0.70 c # [type: real, range: [0,1], default: 0.666]
0.69/0.70 c heuristics/crossover/minfixingrate = 0.5
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/feaspump/freq = -1
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/fracdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/guideddiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/intshifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/linesearchdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/objpscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.70 c # [type: real, range: [0,1], default: 0.01]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/oneopt/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/pscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/rens/freq = -1
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixable
0.69/0.70 c # [type: real, range: [0,1], default: 0.5]
0.69/0.70 c heuristics/rens/minfixingrate = 0.3
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/rens/nodesofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/rootsoldiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/rounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/shiftandpropagate/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/shifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/simplerounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/subnlp/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/trivial/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/trysol/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/undercover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/veclendiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/zirounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/cmir/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/flowcover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/rapidlearning/freq = 0
0.69/0.70 c
0.69/0.70 c -----------------------------------------------------------------------------------------------
0.69/0.70 c start solving
0.69/0.70 c
1.00/1.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.10 c 1.1s| 1 | 0 | 3405 | - | 29M| 0 |1048 |1977 |6219 |1977 |6219 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.20/3.23 c 3.2s| 1 | 0 | 7005 | - | 28M| 0 |1288 |1977 |5377 |1977 |5186 | 677 | 0 | 0 | 0.000000e+00 | -- | Inf
5.78/5.87 c 5.9s| 1 | 0 | 9655 | - | 28M| 0 |1318 |1977 |5377 |1977 |5230 | 721 | 0 | 0 | 0.000000e+00 | -- | Inf
7.89/7.99 c 8.0s| 1 | 0 | 11976 | - | 28M| 0 |1374 |1977 |5377 |1977 |5274 | 765 | 0 | 0 | 0.000000e+00 | -- | Inf
9.80/9.89 c 9.9s| 1 | 0 | 13056 | - | 28M| 0 |1375 |1977 |5377 |1977 |5299 | 790 | 0 | 0 | 0.000000e+00 | -- | Inf
11.79/11.82 c 11.8s| 1 | 0 | 14335 | - | 28M| 0 |1381 |1977 |5377 |1977 |5312 | 803 | 0 | 0 | 0.000000e+00 | -- | Inf
17.61/17.69 c 17.7s| 1 | 2 | 14335 | - | 28M| 0 |1381 |1977 |5377 |1977 |5312 | 803 | 0 | 19 | 0.000000e+00 | -- | Inf
17.61/17.69 c (run 1, node 1) restarting after 268 global fixings of integer variables
17.61/17.69 c
17.61/17.69 c (restart) converted 11 cuts from the global cut pool into linear constraints
17.61/17.69 c
17.69/17.70 c presolving:
17.69/17.73 c (round 1) 416 del vars, 5 del conss, 0 add conss, 7 chg bounds, 13 chg sides, 159 chg coeffs, 0 upgd conss, 909572 impls, 355 clqs
17.69/17.75 c (round 2) 432 del vars, 218 del conss, 0 add conss, 7 chg bounds, 15 chg sides, 294 chg coeffs, 0 upgd conss, 911546 impls, 461 clqs
17.69/17.77 c (round 3) 432 del vars, 330 del conss, 0 add conss, 7 chg bounds, 18 chg sides, 381 chg coeffs, 0 upgd conss, 911568 impls, 504 clqs
17.69/17.79 c (round 4) 432 del vars, 337 del conss, 0 add conss, 7 chg bounds, 18 chg sides, 421 chg coeffs, 289 upgd conss, 911678 impls, 519 clqs
17.79/17.80 c (round 5) 432 del vars, 337 del conss, 0 add conss, 7 chg bounds, 18 chg sides, 437 chg coeffs, 289 upgd conss, 911756 impls, 524 clqs
17.79/17.81 c (round 6) 432 del vars, 337 del conss, 0 add conss, 7 chg bounds, 18 chg sides, 445 chg coeffs, 289 upgd conss, 911756 impls, 531 clqs
17.79/17.82 c presolving (7 rounds):
17.79/17.82 c 432 deleted vars, 337 deleted constraints, 0 added constraints, 7 tightened bounds, 0 added holes, 18 changed sides, 448 changed coefficients
17.79/17.82 c 911756 implications, 537 cliques
17.79/17.82 c presolved problem has 1545 variables (1545 bin, 0 int, 0 impl, 0 cont) and 5051 constraints
17.79/17.82 c 244 constraints of type <knapsack>
17.79/17.82 c 3706 constraints of type <setppc>
17.79/17.82 c 1101 constraints of type <logicor>
17.79/17.82 c transformed objective value is always integral (scale: 1)
17.79/17.82 c Presolving Time: 0.70
17.79/17.82 c
18.09/18.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
18.09/18.13 c 18.1s| 1 | 0 | 16977 | - | 26M| 0 | 872 |1545 |5051 |1545 |4634 | 0 | 0 | 19 | 0.000000e+00 | -- | Inf
19.29/19.32 c 19.3s| 1 | 0 | 20286 | - | 28M| 0 |1129 |1545 |5051 |1545 |4705 | 71 | 0 | 19 | 0.000000e+00 | -- | Inf
23.59/23.66 c 23.7s| 1 | 2 | 20286 | - | 28M| 0 |1129 |1545 |5051 |1545 |4705 | 71 | 0 | 36 | 0.000000e+00 | -- | Inf
140.50/140.51 c
140.50/140.51 c SCIP Status : problem is solved [infeasible]
140.50/140.51 c Solving Time (sec) : 140.51
140.50/140.51 c Solving Nodes : 244 (total of 245 nodes in 2 runs)
140.50/140.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
140.50/140.51 c Dual Bound : +1.00000000000000e+20
140.50/140.51 c Gap : 0.00 %
140.50/140.51 s UNSATISFIABLE
140.50/140.51 c SCIP Status : problem is solved [infeasible]
140.50/140.51 c Total Time : 140.51
140.50/140.51 c solving : 140.51
140.50/140.51 c presolving : 0.70 (included in solving)
140.50/140.51 c reading : 0.11 (included in solving)
140.50/140.51 c Original Problem :
140.50/140.51 c Problem name : HOME/instance-3453360-1307116465.opb
140.50/140.51 c Variables : 4836 (4836 binary, 0 integer, 0 implicit integer, 0 continuous)
140.50/140.51 c Constraints : 16649 initial, 16649 maximal
140.50/140.51 c Presolved Problem :
140.50/140.51 c Problem name : t_HOME/instance-3453360-1307116465.opb
140.50/140.51 c Variables : 1545 (1545 binary, 0 integer, 0 implicit integer, 0 continuous)
140.50/140.51 c Constraints : 5051 initial, 5121 maximal
140.50/140.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
140.50/140.51 c trivial : 0.00 369 0 0 0 0 0 0 0 0
140.50/140.51 c dualfix : 0.00 30 0 0 0 0 0 0 0 0
140.50/140.51 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
140.50/140.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
140.50/140.51 c implics : 0.02 0 148 0 0 0 0 0 0 0
140.50/140.51 c probing : 0.00 0 0 0 0 0 0 0 0 0
140.50/140.51 c knapsack : 0.11 0 0 0 0 0 0 0 47 1191
140.50/140.51 c setppc : 0.05 5 0 0 0 0 213 0 0 0
140.50/140.51 c linear : 0.41 2057 682 0 2157 0 10541 0 60 71
140.50/140.51 c logicor : 0.04 0 0 0 0 0 13 0 0 0
140.50/140.51 c root node : - 1188 - - 1188 - - - - -
140.50/140.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
140.50/140.51 c integral : 0 0 0 159 0 2 0 1 12 0 0 306
140.50/140.51 c knapsack : 244 7 2498 0 0 0 1699 23 11760 524 0 0
140.50/140.51 c setppc : 3706 7 2475 0 0 0 7612 33 28797 1 0 0
140.50/140.51 c logicor : 1101+ 7 2032 0 0 0 3148 66 8189 2 0 0
140.50/140.51 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
140.50/140.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
140.50/140.51 c integral : 72.56 0.00 0.00 72.56 0.00 0.00 0.00
140.50/140.51 c knapsack : 0.04 0.01 0.03 0.00 0.00 0.00 0.00
140.50/140.51 c setppc : 0.13 0.00 0.13 0.00 0.00 0.00 0.00
140.50/140.51 c logicor : 0.04 0.00 0.03 0.00 0.00 0.00 0.00
140.50/140.51 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
140.50/140.51 c Propagators : #Propagate #Resprop Cutoffs DomReds
140.50/140.51 c vbounds : 0 0 0 0
140.50/140.51 c rootredcost : 0 0 0 0
140.50/140.51 c pseudoobj : 0 0 0 0
140.50/140.51 c Propagator Timings : TotalTime Propagate Resprop
140.50/140.51 c vbounds : 0.00 0.00 0.00
140.50/140.51 c rootredcost : 0.00 0.00 0.00
140.50/140.51 c pseudoobj : 0.00 0.00 0.00
140.50/140.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
140.50/140.51 c propagation : 0.01 122 119 431 10.9 12 5.2 -
140.50/140.51 c infeasible LP : 0.01 15 15 93 33.0 0 0.0 0
140.50/140.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
140.50/140.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
140.50/140.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
140.50/140.51 c applied globally : - - - 286 12.9 - - -
140.50/140.51 c applied locally : - - - 0 0.0 - - -
140.50/140.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
140.50/140.51 c cut pool : 0.00 0 - - 0 - (maximal pool size: 237)
140.50/140.51 c redcost : 0.00 161 0 0 0 0
140.50/140.51 c impliedbounds : 0.01 6 0 0 20 0
140.50/140.51 c intobj : 0.00 0 0 0 0 0
140.50/140.51 c gomory : 2.99 6 0 0 1015 0
140.50/140.51 c cgmip : 0.00 0 0 0 0 0
140.50/140.51 c closecuts : 0.00 0 0 0 0 0
140.50/140.51 c strongcg : 3.46 6 0 0 1035 0
140.50/140.51 c cmir : 0.00 0 0 0 0 0
140.50/140.51 c flowcover : 0.00 0 0 0 0 0
140.50/140.51 c clique : 0.48 6 0 0 50 0
140.50/140.51 c zerohalf : 0.00 0 0 0 0 0
140.50/140.51 c mcf : 0.02 2 0 0 0 0
140.50/140.51 c oddcycle : 0.00 0 0 0 0 0
140.50/140.51 c rapidlearning : 0.74 1 0 268 0 396
140.50/140.51 c Pricers : Time Calls Vars
140.50/140.51 c problem variables: 0.00 0 0
140.50/140.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
140.50/140.51 c relpscost : 72.56 159 1 12 0 0 306
140.50/140.51 c pscost : 0.00 0 0 0 0 0 0
140.50/140.51 c inference : 0.00 0 0 0 0 0 0
140.50/140.51 c mostinf : 0.00 0 0 0 0 0 0
140.50/140.51 c leastinf : 0.00 0 0 0 0 0 0
140.50/140.51 c fullstrong : 0.00 0 0 0 0 0 0
140.50/140.51 c allfullstrong : 0.00 0 0 0 0 0 0
140.50/140.51 c random : 0.00 0 0 0 0 0 0
140.50/140.51 c Primal Heuristics : Time Calls Found
140.50/140.51 c LP solutions : 0.00 - 0
140.50/140.51 c pseudo solutions : 0.00 - 0
140.50/140.51 c trivial : 0.00 1 0
140.50/140.51 c shiftandpropagate: 0.00 0 0
140.50/140.51 c simplerounding : 0.00 0 0
140.50/140.51 c zirounding : 0.00 0 0
140.50/140.51 c rounding : 0.00 0 0
140.50/140.51 c shifting : 0.00 0 0
140.50/140.51 c intshifting : 0.00 0 0
140.50/140.51 c oneopt : 0.00 0 0
140.50/140.51 c twoopt : 0.00 0 0
140.50/140.51 c fixandinfer : 0.00 0 0
140.50/140.51 c feaspump : 0.00 0 0
140.50/140.51 c clique : 0.00 0 0
140.50/140.51 c coefdiving : 0.00 0 0
140.50/140.51 c pscostdiving : 0.00 0 0
140.50/140.51 c fracdiving : 0.00 0 0
140.50/140.51 c veclendiving : 0.00 0 0
140.50/140.51 c intdiving : 0.00 0 0
140.50/140.51 c actconsdiving : 0.00 0 0
140.50/140.51 c objpscostdiving : 0.00 0 0
140.50/140.51 c rootsoldiving : 0.00 0 0
140.50/140.51 c linesearchdiving : 0.00 0 0
140.50/140.51 c guideddiving : 0.00 0 0
140.50/140.51 c octane : 0.00 0 0
140.50/140.51 c rens : 0.00 0 0
140.50/140.51 c rins : 0.00 0 0
140.50/140.51 c localbranching : 0.00 0 0
140.50/140.51 c mutation : 0.00 0 0
140.50/140.51 c crossover : 0.00 0 0
140.50/140.51 c dins : 0.00 0 0
140.50/140.51 c vbounds : 0.00 0 0
140.50/140.51 c undercover : 0.00 0 0
140.50/140.51 c subnlp : 0.00 0 0
140.50/140.51 c trysol : 0.00 0 0
140.50/140.51 c LP : Time Calls Iterations Iter/call Iter/sec
140.50/140.51 c primal LP : 0.00 0 0 0.00 -
140.50/140.51 c dual LP : 58.93 181 237207 1310.54 4025.25
140.50/140.51 c lex dual LP : 0.00 0 0 0.00 -
140.50/140.51 c barrier LP : 0.00 0 0 0.00 -
140.50/140.51 c diving/probing LP: 0.00 0 0 0.00 -
140.50/140.51 c strong branching : 72.53 326 257784 790.75 3554.14
140.50/140.51 c (at root node) : - 36 31772 882.56 -
140.50/140.51 c conflict analysis: 0.00 0 0 0.00 -
140.50/140.51 c B&B Tree :
140.50/140.51 c number of runs : 2
140.50/140.51 c nodes : 244
140.50/140.51 c nodes (total) : 245
140.50/140.51 c nodes left : 0
140.50/140.51 c max depth : 18
140.50/140.51 c max depth (total): 18
140.50/140.51 c backtracks : 74 (30.3%)
140.50/140.51 c delayed cutoffs : 61
140.50/140.51 c repropagations : 266 (20168 domain reductions, 46 cutoffs)
140.50/140.51 c avg switch length: 3.43
140.50/140.51 c switching time : 0.09
140.50/140.51 c Solution :
140.50/140.51 c Solutions found : 0 (0 improvements)
140.50/140.51 c Primal Bound : infeasible
140.50/140.51 c Dual Bound : -
140.50/140.51 c Gap : 0.00 %
140.50/140.51 c Root Dual Bound : +0.00000000000000e+00
140.50/140.51 c Root Iterations : 20286
140.50/140.54 c Time complete: 140.53.