0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver SoPlex 1.4.1
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1884267-1245256317.opb>
0.00/0.05 c original problem has 892 variables (892 bin, 0 int, 0 impl, 0 cont) and 3006 constraints
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c start presolving problem
0.00/0.06 c presolving:
0.07/0.08 c (round 1) 3 del vars, 3 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4822 impls, 0 clqs
0.07/0.08 c (round 2) 3 del vars, 37 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4822 impls, 0 clqs
0.09/0.12 c (round 3) 3 del vars, 37 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 2969 upgd conss, 4822 impls, 0 clqs
0.09/0.14 c presolving (4 rounds):
0.09/0.14 c 3 deleted vars, 37 deleted constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 4822 implications, 0 cliques
0.09/0.14 c presolved problem has 889 variables (889 bin, 0 int, 0 impl, 0 cont) and 2969 constraints
0.09/0.14 c 2969 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.06
0.09/0.14 c PURESAT
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = c -1
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = c -1
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = c 2000
0.09/0.14 c # minimum percentage of integer variables that have to be fixable
0.09/0.14 c # [type: real, range: [0,1], default: 0.5]
0.09/0.14 c heuristics/rens/minfixingrate = c 0.3
0.09/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/rens/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/pscostdiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/oneopt/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.14 c # [type: real, range: [0,1], default: 0.01]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/objpscostdiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/linesearchdiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/intshifting/freq = c -1
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/guideddiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/fracdiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.14 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/feaspump/freq = c -1
0.09/0.14 c # minimum percentage of integer variables that have to be fixed
0.09/0.14 c # [type: real, range: [0,1], default: 0.666]
0.09/0.14 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.14 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.14 c # [type: real, range: [0,1], default: 0.1]
0.09/0.14 c heuristics/crossover/nodesquot = c 0.15
0.09/0.14 c # number of nodes without incumbent change that heuristic should wait
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.14 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/crossover/nodesofs = c 750
0.09/0.14 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.14 c heuristics/crossover/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/coefdiving/freq = c -1
0.09/0.14 c # priority of node selection rule <dfs> in standard mode
0.09/0.14 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.14 c nodeselection/dfs/stdpriority = c 1000000
0.09/0.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c presolving/probing/maxrounds = c 0
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.14 c constraints/knapsack/disaggregation = c FALSE
0.09/0.14 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.14 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/maxroundsroot = c 5
0.09/0.14 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.14 c separating/maxrounds = c 1
0.09/0.14 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.14 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.14 c lp/pricing = c a
0.09/0.14 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c lp/solvefreq = c 0
0.09/0.14 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c limits/solutions = c 1
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = c 1620
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = c 1791
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = c 10000
0.09/0.14 c # should enforcement of pseudo solution be disabled?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/disableenfops = c TRUE
0.09/0.14 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c constraints/agelimit = c 1
0.09/0.14 c # should binary conflicts be preferred?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c conflict/preferbinary = c TRUE
0.09/0.14 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c conflict/interconss = c 0
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving problem
0.09/0.14 c
0.09/0.17 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 140 |5615k| 0 | 26 | 889 |2969 |2969 | 889 |2969 | 0 | 0 | 0 | 1.775000e+01 | -- | Inf
0.28/0.35 c 0.3s| 1 | 0 | 391 |5641k| 0 | 90 | 889 |2969 |2969 | 889 |2970 | 1 | 0 | 0 | 1.837500e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 527 |5856k| 0 | 23 | 889 |2969 |2969 | 889 |2972 | 3 | 0 | 0 | 1.866667e+01 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 672 |6418k| 0 | 8 | 889 |2969 |2969 | 889 |2974 | 5 | 0 | 0 | 1.900000e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 779 |6676k| 0 | 14 | 889 |2969 |2969 | 889 |2976 | 7 | 0 | 0 | 1.900000e+01 | -- | Inf
0.99/1.07 c 1.0s| 1 | 0 | 1031 |6782k| 0 | 79 | 889 |2969 |2969 | 889 |2977 | 8 | 0 | 0 | 1.904272e+01 | -- | Inf
6.49/6.52 c 6.4s| 1 | 2 | 1031 |6783k| 0 | 79 | 889 |2969 |2969 | 889 |2977 | 8 | 0 | 23 | 1.904272e+01 | -- | Inf
21.68/21.73 c 21.0s| 10000 | 113 | 1031 |7304k| 227 | - | 889 |2974 |1273 | 0 | 0 | 8 |8129 | 23 | 1.939546e+01 | -- | Inf
39.58/39.63 c 38.3s| 20000 | 99 | 1031 |7329k| 227 | - | 889 |2979 | 664 | 0 | 0 | 8 | 16k| 23 | 1.939546e+01 | -- | Inf
57.27/57.40 c 55.4s| 30000 | 83 | 1031 |7373k| 227 | - | 889 |2990 | 171 | 0 | 0 | 8 | 23k| 23 | 1.939546e+01 | -- | Inf
76.37/76.45 c 73.8s| 40000 | 76 | 1031 |7382k| 227 | - | 889 |2998 | 128 | 0 | 0 | 8 | 31k| 23 | 1.939546e+01 | -- | Inf
94.56/94.67 c 91.4s| 50000 | 69 | 1031 |7368k| 227 | - | 889 |3001 |1721 | 0 | 0 | 8 | 38k| 23 | 1.939546e+01 | -- | Inf
112.16/112.28 c 108s| 60000 | 69 | 1031 |7402k| 227 | - | 889 |3014 | 218 | 0 | 0 | 8 | 45k| 23 | 1.939546e+01 | -- | Inf
131.14/131.27 c 127s| 70000 | 64 | 1031 |7399k| 227 | - | 889 |3087 |1213 | 0 | 0 | 8 | 52k| 23 | 1.939546e+01 | -- | Inf
151.14/151.23 c 146s| 80000 | 59 | 1031 |7402k| 227 | - | 889 |3034 |1148 | 0 | 0 | 8 | 59k| 23 | 1.939546e+01 | -- | Inf
170.62/170.73 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
170.62/170.73 c 165s| 90000 | 59 | 1031 |7415k| 227 | - | 889 |3038 | 769 | 0 | 0 | 8 | 67k| 23 | 1.939546e+01 | -- | Inf
188.62/188.74 c 182s|100000 | 61 | 1031 |7443k| 227 | - | 889 |3067 | 356 | 0 | 0 | 8 | 74k| 23 | 1.939546e+01 | -- | Inf
207.11/207.29 c 200s|110000 | 61 | 1031 |7423k| 227 | - | 889 |3013 | 618 | 0 | 0 | 8 | 81k| 23 | 1.939546e+01 | -- | Inf
226.90/227.08 c 220s|120000 | 57 | 1031 |7432k| 227 | - | 889 |3025 | 99 | 0 | 0 | 8 | 89k| 23 | 1.939546e+01 | -- | Inf
247.30/247.47 c 239s|130000 | 59 | 1031 |7441k| 227 | - | 889 |3013 | 573 | 0 | 0 | 8 | 96k| 23 | 1.939546e+01 | -- | Inf
266.70/266.85 c 258s|140000 | 54 | 1031 |7422k| 227 | - | 889 |3001 |1445 | 0 | 0 | 8 | 104k| 23 | 1.939546e+01 | -- | Inf
288.59/288.78 c 279s|150000 | 47 | 1031 |7415k| 227 | - | 889 |2991 |1683 | 0 | 0 | 8 | 110k| 23 | 1.939546e+01 | -- | Inf
307.38/307.57 c 297s|160000 | 51 | 1031 |7475k| 227 | - | 889 |3061 | 239 | 0 | 0 | 8 | 118k| 23 | 1.939546e+01 | -- | Inf
329.17/329.35 c 318s|170000 | 40 | 1031 |7429k| 227 | - | 889 |3016 |1666 | 0 | 0 | 8 | 125k| 23 | 1.939546e+01 | -- | Inf
351.07/351.27 c 340s|180000 | 38 | 1031 |7467k| 227 | - | 889 |3032 | 157 | 0 | 0 | 8 | 132k| 23 | 1.939546e+01 | -- | Inf
373.26/373.48 c 361s|190000 | 36 | 1031 |7469k| 227 | - | 889 |3036 | 271 | 0 | 0 | 8 | 139k| 23 | 1.939546e+01 | -- | Inf
396.15/396.34 c 383s|200000 | 36 | 1031 |7441k| 227 | - | 889 |3013 |1255 | 0 | 0 | 8 | 146k| 23 | 1.939546e+01 | -- | Inf
419.25/419.46 c 406s|210000 | 30 | 1031 |7432k| 227 | - | 889 |3009 |1718 | 0 | 0 | 8 | 153k| 23 | 1.939546e+01 | -- | Inf
444.73/444.93 c 431s|220000 | 31 | 1031 |7456k| 227 | - | 889 |3038 | 901 | 0 | 0 | 8 | 160k| 23 | 1.939546e+01 | -- | Inf
465.43/465.68 c 451s|230000 | 31 | 1031 |7453k| 227 | - | 889 |3035 |1289 | 0 | 0 | 8 | 166k| 23 | 1.939546e+01 | -- | Inf
485.92/486.19 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
485.92/486.19 c 470s|240000 | 30 | 1031 |7480k| 227 | - | 889 |3050 | 247 | 0 | 0 | 8 | 173k| 23 | 1.939546e+01 | -- | Inf
504.72/504.91 c 489s|250000 | 27 | 1031 |7476k| 227 | - | 889 |3043 | 534 | 0 | 0 | 8 | 181k| 23 | 1.939546e+01 | -- | Inf
524.10/524.30 c 507s|260000 | 28 | 1031 |7458k| 227 | - | 889 |3056 |1293 | 0 | 0 | 8 | 188k| 23 | 1.939546e+01 | -- | Inf
544.70/544.99 c 527s|270000 | 29 | 1031 |7490k| 227 | - | 889 |3089 | 506 | 0 | 0 | 8 | 195k| 23 | 1.939546e+01 | -- | Inf
565.40/565.62 c 547s|280000 | 29 | 1031 |7478k| 227 | - | 889 |3061 | 943 | 0 | 0 | 8 | 203k| 23 | 1.939546e+01 | -- | Inf
583.29/583.56 c 565s|290000 | 29 | 1031 |7484k| 227 | - | 889 |3022 | 85 | 0 | 0 | 8 | 210k| 23 | 1.939546e+01 | -- | Inf
601.98/602.21 c 583s|300000 | 28 | 1031 |7466k| 227 | - | 889 |3020 |1150 | 0 | 0 | 8 | 217k| 23 | 1.939546e+01 | -- | Inf
621.77/622.03 c 602s|310000 | 26 | 1031 |7496k| 227 | - | 889 |3062 | 349 | 0 | 0 | 8 | 224k| 23 | 1.939546e+01 | -- | Inf
639.97/640.26 c 620s|320000 | 27 | 1031 |7471k| 227 | - | 889 |3031 |1183 | 0 | 0 | 8 | 231k| 23 | 1.939546e+01 | -- | Inf
659.06/659.39 c 638s|330000 | 26 | 1031 |7474k| 227 | - | 889 |3041 |1378 | 0 | 0 | 8 | 238k| 23 | 1.939546e+01 | -- | Inf
678.85/679.18 c 657s|340000 | 27 | 1031 |7488k| 227 | - | 889 |3088 |1434 | 0 | 0 | 8 | 245k| 23 | 1.939546e+01 | -- | Inf
699.44/699.80 c 677s|350000 | 24 | 1031 |7499k| 227 | - | 889 |3043 | 101 | 0 | 0 | 8 | 253k| 23 | 1.939546e+01 | -- | Inf
720.94/721.26 c 698s|360000 | 23 | 1031 |7515k| 227 | - | 889 |3138 | 676 | 0 | 0 | 8 | 260k| 23 | 1.939546e+01 | -- | Inf
743.23/743.57 c 720s|370000 | 21 | 1031 |7485k| 227 | - | 889 |3005 | 530 | 0 | 0 | 8 | 266k| 23 | 1.939546e+01 | -- | Inf
765.02/765.30 c 741s|380000 | 17 | 1031 |7480k| 227 | - | 889 |3045 |1620 | 0 | 0 | 8 | 268k| 23 | 1.939546e+01 | -- | Inf
785.11/785.44 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
785.11/785.44 c 760s|390000 | 19 | 1031 |7490k| 227 | - | 889 |3004 | 302 | 0 | 0 | 8 | 270k| 23 | 1.939546e+01 | -- | Inf
806.10/806.40 c 781s|400000 | 15 | 1031 |7483k| 227 | - | 889 |3006 | 765 | 0 | 0 | 8 | 273k| 23 | 1.939546e+01 | -- | Inf
828.20/828.52 c 802s|410000 | 11 | 1031 |7490k| 227 | - | 889 |2997 | 207 | 0 | 0 | 8 | 276k| 23 | 1.939546e+01 | -- | Inf
846.19/846.50 c 820s|420000 | 13 | 1031 |7488k| 227 | - | 889 |3027 | 821 | 0 | 0 | 8 | 277k| 23 | 1.939546e+01 | -- | Inf
865.69/866.06 c 839s|430000 | 10 | 1031 |7498k| 227 | - | 889 |3012 | 201 | 0 | 0 | 8 | 278k| 23 | 1.939546e+01 | -- | Inf
885.78/886.17 c 858s|440000 | 9 | 1031 |7479k| 227 | - | 889 |2999 |1191 | 0 | 0 | 8 | 279k| 23 | 1.939546e+01 | -- | Inf
905.57/905.91 c 877s|450000 | 7 | 1031 |7473k| 227 | - | 889 |3012 |1538 | 0 | 0 | 8 | 280k| 23 | 2.792857e+01 | -- | Inf
927.47/927.85 c 899s|460000 | 11 | 1031 |7482k| 227 | - | 889 |2998 | 951 | 0 | 0 | 8 | 287k| 23 | 2.792857e+01 | -- | Inf
952.65/953.08 c 923s|470000 | 10 | 1031 |7497k| 227 | - | 889 |3026 | 461 | 0 | 0 | 8 | 294k| 23 | 2.792857e+01 | -- | Inf
977.45/977.86 c 947s|480000 | 12 | 1031 |7490k| 227 | - | 889 |3010 | 610 | 0 | 0 | 8 | 301k| 23 | 2.792857e+01 | -- | Inf
1004.83/1005.20 c 974s|490000 | 9 | 1031 |7493k| 227 | - | 889 |3036 | 640 | 0 | 0 | 8 | 307k| 23 | 2.792857e+01 | -- | Inf
1034.02/1034.47 c 1002s|500000 | 4 | 1031 |7513k| 227 | - | 889 |3079 | 405 | 0 | 0 | 8 | 314k| 23 | 2.792857e+01 | -- | Inf
1057.22/1057.64 c 1024s|510000 | 9 | 1031 |7497k| 227 | - | 889 |3033 | 443 | 0 | 0 | 8 | 321k| 23 | 2.792857e+01 | -- | Inf
1084.51/1084.97 c 1051s|520000 | 7 | 1031 |7504k| 227 | - | 889 |3042 | 184 | 0 | 0 | 8 | 327k| 23 | 2.792857e+01 | -- | Inf
1111.20/1111.60 c 1077s|530000 | 6 | 1031 |7504k| 227 | - | 889 |3059 | 217 | 0 | 0 | 8 | 334k| 23 | 2.792857e+01 | -- | Inf
1140.29/1140.76 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1140.29/1140.76 c 1105s|540000 | 6 | 1031 |7478k| 227 | - | 889 |3051 |1434 | 0 | 0 | 8 | 341k| 23 | 2.792857e+01 | -- | Inf
1170.28/1170.73 c 1134s|550000 | 4 | 1031 |7413k| 227 | - | 889 |2807 |1688 | 0 | 0 | 8 | 347k| 23 | 4.000000e+01 | -- | Inf
1170.98/1171.43 c
1170.98/1171.43 c SCIP Status : problem is solved [infeasible]
1170.98/1171.43 c Solving Time (sec) : 1134.95
1170.98/1171.43 c Solving Nodes : 550212
1170.98/1171.43 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1170.98/1171.43 c Dual Bound : +1.00000000000000e+20
1170.98/1171.43 c Gap : 0.00 %
1170.98/1171.43 c NODE 550212
1170.98/1171.43 c DUAL BOUND 1e+20
1170.98/1171.43 c PRIMAL BOUND 1e+20
1170.98/1171.43 c GAP 0
1170.98/1171.43 s UNSATISFIABLE
1170.98/1171.43 c SCIP Status : problem is solved [infeasible]
1170.98/1171.43 c Solving Time : 1134.95
1170.98/1171.43 c Original Problem :
1170.98/1171.43 c Problem name : HOME/instance-1884267-1245256317.opb
1170.98/1171.43 c Variables : 892 (892 binary, 0 integer, 0 implicit integer, 0 continuous)
1170.98/1171.43 c Constraints : 3006 initial, 3006 maximal
1170.98/1171.43 c Presolved Problem :
1170.98/1171.43 c Problem name : t_HOME/instance-1884267-1245256317.opb
1170.98/1171.43 c Variables : 889 (889 binary, 0 integer, 0 implicit integer, 0 continuous)
1170.98/1171.43 c Constraints : 2969 initial, 3476 maximal
1170.98/1171.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1170.98/1171.43 c trivial : 0.00 0 0 0 0 0 0 0 0
1170.98/1171.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
1170.98/1171.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
1170.98/1171.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1170.98/1171.43 c implics : 0.01 0 0 0 0 0 0 0 0
1170.98/1171.43 c probing : 0.00 0 0 0 0 0 0 0 0
1170.98/1171.43 c linear : 0.04 3 0 0 3 0 37 0 0
1170.98/1171.43 c logicor : 0.01 0 0 0 0 0 0 0 0
1170.98/1171.43 c root node : - 889 - - 889 - - - -
1170.98/1171.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1170.98/1171.43 c integral : 0 0 0 1 0 0 0 0 0 2
1170.98/1171.43 c logicor : 2969+ 5 11015642 0 0 350336 69621387 0 0 0
1170.98/1171.43 c countsols : 0 0 0 0 0 0 0 0 0 0
1170.98/1171.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1170.98/1171.43 c integral : 5.43 0.00 0.00 5.43 0.00
1170.98/1171.43 c logicor : 451.34 0.00 451.34 0.00 0.00
1170.98/1171.43 c countsols : 0.00 0.00 0.00 0.00 0.00
1170.98/1171.43 c Propagators : Time Calls Cutoffs DomReds
1170.98/1171.43 c rootredcost : 3.58 0 0 0
1170.98/1171.43 c pseudoobj : 413.33 11273242 0 0
1170.98/1171.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1170.98/1171.43 c propagation : 211.49 350336 319843 319843 35.4 28820 17.5 -
1170.98/1171.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1170.98/1171.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1170.98/1171.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1170.98/1171.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1170.98/1171.43 c applied globally : - - - 337618 31.6 - - -
1170.98/1171.43 c applied locally : - - - 10499 103.5 - - -
1170.98/1171.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1170.98/1171.43 c cut pool : 0.00 4 - - 117 - (maximal pool size: 162)
1170.98/1171.43 c redcost : 0.00 5 0 0 0 0
1170.98/1171.43 c impliedbounds : 0.00 5 0 0 0 0
1170.98/1171.43 c intobj : 0.00 0 0 0 0 0
1170.98/1171.43 c gomory : 0.21 5 0 0 566 0
1170.98/1171.43 c strongcg : 0.18 5 0 0 475 0
1170.98/1171.43 c cmir : 0.00 0 0 0 0 0
1170.98/1171.43 c flowcover : 0.00 0 0 0 0 0
1170.98/1171.43 c clique : 0.01 1 0 0 0 0
1170.98/1171.43 c zerohalf : 0.00 0 0 0 0 0
1170.98/1171.43 c mcf : 0.00 1 0 0 0 0
1170.98/1171.43 c Pricers : Time Calls Vars
1170.98/1171.43 c problem variables: 0.00 0 0
1170.98/1171.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1170.98/1171.43 c relpscost : 5.43 1 0 0 0 0 2
1170.98/1171.43 c pscost : 0.00 0 0 0 0 0 0
1170.98/1171.43 c inference : 31.56 360754 0 0 0 0 721508
1170.98/1171.43 c mostinf : 0.00 0 0 0 0 0 0
1170.98/1171.43 c leastinf : 0.00 0 0 0 0 0 0
1170.98/1171.43 c fullstrong : 0.00 0 0 0 0 0 0
1170.98/1171.43 c allfullstrong : 0.00 0 0 0 0 0 0
1170.98/1171.43 c random : 0.00 0 0 0 0 0 0
1170.98/1171.43 c Primal Heuristics : Time Calls Found
1170.98/1171.43 c LP solutions : 0.00 - 0
1170.98/1171.43 c pseudo solutions : 0.00 - 0
1170.98/1171.43 c simplerounding : 0.00 0 0
1170.98/1171.43 c rounding : 0.00 0 0
1170.98/1171.43 c shifting : 0.00 0 0
1170.98/1171.43 c intshifting : 0.00 0 0
1170.98/1171.43 c oneopt : 0.00 0 0
1170.98/1171.43 c fixandinfer : 0.00 0 0
1170.98/1171.43 c feaspump : 0.00 0 0
1170.98/1171.43 c coefdiving : 0.00 0 0
1170.98/1171.43 c pscostdiving : 0.00 0 0
1170.98/1171.43 c fracdiving : 0.00 0 0
1170.98/1171.43 c veclendiving : 0.00 0 0
1170.98/1171.43 c intdiving : 0.00 0 0
1170.98/1171.43 c actconsdiving : 0.00 0 0
1170.98/1171.43 c objpscostdiving : 0.00 0 0
1170.98/1171.43 c rootsoldiving : 0.00 0 0
1170.98/1171.43 c linesearchdiving : 0.00 0 0
1170.98/1171.43 c guideddiving : 0.00 0 0
1170.98/1171.43 c octane : 0.00 0 0
1170.98/1171.43 c rens : 0.00 0 0
1170.98/1171.43 c rins : 0.00 0 0
1170.98/1171.43 c localbranching : 0.00 0 0
1170.98/1171.43 c mutation : 0.00 0 0
1170.98/1171.43 c crossover : 0.00 0 0
1170.98/1171.43 c dins : 0.00 0 0
1170.98/1171.43 c LP : Time Calls Iterations Iter/call Iter/sec
1170.98/1171.43 c primal LP : 0.00 0 0 0.00 -
1170.98/1171.43 c dual LP : 0.49 6 1031 171.83 2104.08
1170.98/1171.43 c barrier LP : 0.00 0 0 0.00 -
1170.98/1171.43 c diving/probing LP: 0.00 0 0 0.00 -
1170.98/1171.43 c strong branching : 5.43 23 7985 347.17 1470.53
1170.98/1171.43 c (at root node) : - 23 7985 347.17 -
1170.98/1171.43 c conflict analysis: 0.00 0 0 0.00 -
1170.98/1171.43 c B&B Tree :
1170.98/1171.43 c number of runs : 1
1170.98/1171.43 c nodes : 550212
1170.98/1171.43 c nodes (total) : 550212
1170.98/1171.43 c nodes left : 0
1170.98/1171.43 c max depth : 227
1170.98/1171.43 c max depth (total): 227
1170.98/1171.43 c backtracks : 182186 (33.1%)
1170.98/1171.43 c delayed cutoffs : 171299
1170.98/1171.43 c repropagations : 436014 (28142544 domain reductions, 160879 cutoffs)
1170.98/1171.43 c avg switch length: 2.48
1170.98/1171.43 c switching time : 145.92
1170.98/1171.43 c Solution :
1170.98/1171.43 c Solutions found : 0 (0 improvements)
1170.98/1171.43 c Primal Bound : infeasible
1170.98/1171.43 c Dual Bound : -
1170.98/1171.43 c Gap : 0.00 %
1170.98/1171.43 c Root Dual Bound : +1.90427206295672e+01
1170.98/1171.45 c Time complete: 1171.03.