0.09/0.19 c SCIP version 1.1.0.7
0.09/0.19 c LP-Solver Clp 1.8.2
0.09/0.19 c user parameter file <scip.set> not found - using default parameters
0.09/0.19 c read problem <HOME/instance-1884548-1245259524.opb>
0.09/0.19 c original problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 7938 constraints
0.19/0.25 c No objective function, only one solution is needed.
0.19/0.25 c start presolving problem
0.19/0.25 c presolving:
0.39/0.40 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 7938 upgd conss, 0 impls, 0 clqs
0.39/0.43 c presolving (2 rounds):
0.39/0.43 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.43 c 0 implications, 0 cliques
0.39/0.43 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 7938 constraints
0.39/0.43 c 7938 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.16
0.39/0.43 c PURESAT
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = c -1
0.39/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/veclendiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/veclendiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/simplerounding/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/shifting/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/rounding/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/rootsoldiving/freq = c -1
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/rens/nodesofs = c 2000
0.39/0.43 c # minimum percentage of integer variables that have to be fixable
0.39/0.43 c # [type: real, range: [0,1], default: 0.5]
0.39/0.43 c heuristics/rens/minfixingrate = c 0.3
0.39/0.43 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c heuristics/rens/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/pscostdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/oneopt/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.43 c # [type: real, range: [0,1], default: 0.01]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/objpscostdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/linesearchdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/intshifting/freq = c -1
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/intdiving/maxlpiterquot = c 0.075
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/guideddiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/guideddiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/fracdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/fracdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/feaspump/maxlpiterofs = c 2000
0.39/0.43 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/feaspump/freq = c -1
0.39/0.43 c # minimum percentage of integer variables that have to be fixed
0.39/0.43 c # [type: real, range: [0,1], default: 0.666]
0.39/0.43 c heuristics/crossover/minfixingrate = c 0.5
0.39/0.43 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.43 c # [type: real, range: [0,1], default: 0.1]
0.39/0.43 c heuristics/crossover/nodesquot = c 0.15
0.39/0.43 c # number of nodes without incumbent change that heuristic should wait
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.43 c heuristics/crossover/nwaitingnodes = c 100
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/crossover/nodesofs = c 750
0.39/0.43 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.43 c heuristics/crossover/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/coefdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/coefdiving/freq = c -1
0.39/0.43 c # priority of node selection rule <dfs> in standard mode
0.39/0.43 c # [type: int, range: [-536870912,536870911], default: 0]
0.39/0.43 c nodeselection/dfs/stdpriority = c 1000000
0.39/0.43 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c presolving/probing/maxrounds = c 0
0.39/0.43 c # should presolving try to simplify knapsacks
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/knapsack/simplifyinequalities = c TRUE
0.39/0.43 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.43 c constraints/knapsack/disaggregation = c FALSE
0.39/0.43 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c constraints/knapsack/maxnumcardlift = c 0
0.39/0.43 c # should presolving try to simplify inequalities
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/linear/simplifyinequalities = c TRUE
0.39/0.43 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/maxroundsroot = c 5
0.39/0.43 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.43 c separating/maxrounds = c 1
0.39/0.43 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.39/0.43 c # [type: char, range: {lafpsqd}, default: l]
0.39/0.43 c lp/pricing = c a
0.39/0.43 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c lp/solvefreq = c 0
0.39/0.43 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c limits/solutions = c 1
0.39/0.43 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/memory = c 1620
0.39/0.43 c # maximal time in seconds to run
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/time = c 1791
0.39/0.43 c # frequency for displaying node information lines
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.43 c display/freq = c 10000
0.39/0.43 c # should enforcement of pseudo solution be disabled?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/disableenfops = c TRUE
0.39/0.43 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c constraints/agelimit = c 1
0.39/0.43 c # should binary conflicts be preferred?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c conflict/preferbinary = c TRUE
0.39/0.43 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c conflict/interconss = c 0
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving problem
0.39/0.43 c
0.59/0.61 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.61 c 0.4s| 1 | 0 | 42 | 15M| 0 | 36 | 36 |7938 |7938 | 36 |7938 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.26 c 1.0s| 1 | 0 | 182 | 15M| 0 | 36 | 36 |7938 |7938 | 36 |7939 | 1 | 0 | 0 | 3.142857e+00 | -- | Inf
1.69/1.79 c 1.5s| 1 | 0 | 257 | 16M| 0 | 36 | 36 |7938 |7938 | 36 |7940 | 2 | 0 | 0 | 3.200000e+00 | -- | Inf
2.79/2.83 c 2.6s| 1 | 0 | 456 | 16M| 0 | 35 | 36 |7938 |7938 | 36 |7941 | 3 | 0 | 0 | 4.000000e+00 | -- | Inf
3.29/3.31 c 3.0s| 1 | 0 | 501 | 17M| 0 | 28 | 36 |7938 |7938 | 36 |7942 | 4 | 0 | 0 | 4.000000e+00 | -- | Inf
4.69/4.73 c 4.5s| 1 | 0 | 687 | 18M| 0 | 36 | 36 |7938 |7938 | 36 |7943 | 5 | 0 | 0 | 4.000000e+00 | -- | Inf
45.47/45.54 c 45.1s| 1 | 2 | 687 | 18M| 0 | 36 | 36 |7938 |7938 | 36 |7943 | 5 | 0 | 33 | 4.000000e+00 | -- | Inf
58.28/58.31 c 57.8s| 10000 | 14 | 687 | 18M| 29 | - | 36 |7965 |1555 | 0 | 0 | 5 |5862 | 33 | 4.000000e+00 | -- | Inf
69.67/69.72 c 69.0s| 20000 | 16 | 687 | 18M| 29 | - | 36 |7962 | 661 | 0 | 0 | 5 | 12k| 33 | 4.000000e+00 | -- | Inf
80.56/80.63 c 79.8s| 30000 | 15 | 687 | 18M| 29 | - | 36 |7964 | 392 | 0 | 0 | 5 | 17k| 33 | 4.000000e+00 | -- | Inf
90.57/90.68 c 89.7s| 40000 | 18 | 687 | 18M| 29 | - | 36 |7958 |1263 | 0 | 0 | 5 | 22k| 33 | 4.000000e+00 | -- | Inf
99.66/99.78 c 98.7s| 50000 | 11 | 687 | 18M| 29 | - | 36 |7960 | 189 | 0 | 0 | 5 | 27k| 33 | 4.000000e+00 | -- | Inf
109.25/109.34 c 108s| 60000 | 14 | 687 | 18M| 29 | - | 36 |7952 | 533 | 0 | 0 | 5 | 31k| 33 | 4.000000e+00 | -- | Inf
118.35/118.44 c 117s| 70000 | 14 | 687 | 18M| 29 | - | 36 |7955 | 689 | 0 | 0 | 5 | 36k| 33 | 4.000000e+00 | -- | Inf
128.05/128.10 c 127s| 80000 | 20 | 687 | 18M| 29 | - | 36 |7946 | 980 | 0 | 0 | 5 | 41k| 33 | 4.000000e+00 | -- | Inf
137.15/137.21 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
137.15/137.21 c 136s| 90000 | 15 | 687 | 18M| 29 | - | 36 |7955 | 277 | 0 | 0 | 5 | 45k| 33 | 4.000000e+00 | -- | Inf
145.34/145.49 c 144s|100000 | 14 | 687 | 18M| 29 | - | 36 |7949 | 515 | 0 | 0 | 5 | 50k| 33 | 4.000000e+00 | -- | Inf
154.04/154.16 c 152s|110000 | 15 | 687 | 18M| 29 | - | 36 |7948 | 966 | 0 | 0 | 5 | 54k| 33 | 4.000000e+00 | -- | Inf
162.64/162.73 c 161s|120000 | 13 | 687 | 18M| 29 | - | 36 |7950 | 406 | 0 | 0 | 5 | 58k| 33 | 4.000000e+00 | -- | Inf
171.84/171.90 c 170s|130000 | 13 | 687 | 18M| 29 | - | 36 |7953 | 485 | 0 | 0 | 5 | 63k| 33 | 4.000000e+00 | -- | Inf
180.54/180.68 c 178s|140000 | 15 | 687 | 18M| 29 | - | 36 |7951 | 381 | 0 | 0 | 5 | 67k| 33 | 4.000000e+00 | -- | Inf
188.44/188.55 c 186s|150000 | 16 | 687 | 18M| 29 | - | 36 |7948 | 836 | 0 | 0 | 5 | 71k| 33 | 4.000000e+00 | -- | Inf
197.34/197.41 c 195s|160000 | 13 | 687 | 18M| 29 | - | 36 |7952 | 463 | 0 | 0 | 5 | 76k| 33 | 4.000000e+00 | -- | Inf
206.13/206.27 c 204s|170000 | 14 | 687 | 18M| 30 | - | 36 |7949 | 384 | 0 | 0 | 5 | 80k| 33 | 4.000000e+00 | -- | Inf
214.23/214.30 c 211s|180000 | 15 | 687 | 18M| 30 | - | 36 |7949 | 510 | 0 | 0 | 5 | 85k| 33 | 4.000000e+00 | -- | Inf
222.42/222.52 c 220s|190000 | 13 | 687 | 18M| 30 | - | 36 |7952 | 445 | 0 | 0 | 5 | 89k| 33 | 4.000000e+00 | -- | Inf
231.23/231.37 c 228s|200000 | 13 | 687 | 18M| 30 | - | 36 |7956 | 278 | 0 | 0 | 5 | 93k| 33 | 4.000000e+00 | -- | Inf
239.22/239.37 c 236s|210000 | 12 | 687 | 18M| 30 | - | 36 |7948 | 547 | 0 | 0 | 5 | 97k| 33 | 4.000000e+00 | -- | Inf
246.91/247.00 c 244s|220000 | 20 | 687 | 18M| 30 | - | 36 |7946 |1000 | 0 | 0 | 5 | 101k| 33 | 4.000000e+00 | -- | Inf
253.91/254.03 c 251s|230000 | 11 | 687 | 18M| 30 | - | 36 |7948 | 383 | 0 | 0 | 5 | 105k| 33 | 4.000000e+00 | -- | Inf
267.31/267.43 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
267.31/267.43 c 264s|240000 | 16 | 687 | 18M| 30 | - | 36 |7966 |1963 | 0 | 0 | 5 | 111k| 33 | 4.000000e+00 | -- | Inf
282.01/282.14 c 278s|250000 | 10 | 687 | 18M| 30 | - | 36 |7987 | 454 | 0 | 0 | 5 | 118k| 33 | 4.000000e+00 | -- | Inf
297.90/298.08 c 294s|260000 | 17 | 687 | 18M| 30 | - | 36 |7966 |2691 | 0 | 0 | 5 | 125k| 33 | 4.000000e+00 | -- | Inf
311.90/312.03 c 308s|270000 | 11 | 687 | 18M| 30 | - | 36 |7987 | 479 | 0 | 0 | 5 | 131k| 33 | 4.000000e+00 | -- | Inf
325.29/325.42 c 321s|280000 | 13 | 687 | 18M| 30 | - | 36 |7980 | 641 | 0 | 0 | 5 | 138k| 33 | 4.000000e+00 | -- | Inf
338.39/338.50 c 334s|290000 | 12 | 687 | 18M| 30 | - | 36 |7977 | 622 | 0 | 0 | 5 | 145k| 33 | 4.000000e+00 | -- | Inf
351.79/351.91 c 347s|300000 | 13 | 687 | 18M| 30 | - | 36 |7983 | 574 | 0 | 0 | 5 | 152k| 33 | 4.000000e+00 | -- | Inf
365.09/365.20 c 360s|310000 | 13 | 687 | 18M| 30 | - | 36 |7974 | 838 | 0 | 0 | 5 | 158k| 33 | 4.000000e+00 | -- | Inf
378.18/378.39 c 374s|320000 | 9 | 687 | 18M| 30 | - | 36 |7985 | 416 | 0 | 0 | 5 | 165k| 33 | 4.000000e+00 | -- | Inf
391.87/392.04 c 387s|330000 | 14 | 687 | 18M| 30 | - | 36 |7979 |1107 | 0 | 0 | 5 | 172k| 33 | 4.000000e+00 | -- | Inf
404.17/404.31 c 399s|340000 | 15 | 687 | 18M| 30 | - | 36 |7980 | 918 | 0 | 0 | 5 | 179k| 33 | 4.000000e+00 | -- | Inf
416.67/416.82 c 411s|350000 | 15 | 687 | 18M| 30 | - | 36 |7989 | 333 | 0 | 0 | 5 | 186k| 33 | 4.000000e+00 | -- | Inf
428.77/428.97 c 423s|360000 | 9 | 687 | 18M| 30 | - | 36 |7979 |1498 | 0 | 0 | 5 | 192k| 33 | 4.000000e+00 | -- | Inf
440.56/440.78 c 435s|370000 | 8 | 687 | 18M| 31 | - | 36 |8001 | 320 | 0 | 0 | 5 | 199k| 33 | 4.000000e+00 | -- | Inf
454.56/454.76 c 449s|380000 | 13 | 687 | 18M| 31 | - | 36 |7977 |1182 | 0 | 0 | 5 | 206k| 33 | 4.000000e+00 | -- | Inf
467.26/467.49 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
467.26/467.49 c 462s|390000 | 13 | 687 | 18M| 31 | - | 36 |7977 |1180 | 0 | 0 | 5 | 213k| 33 | 4.000000e+00 | -- | Inf
480.05/480.20 c 474s|400000 | 15 | 687 | 18M| 31 | - | 36 |7986 | 271 | 0 | 0 | 5 | 219k| 33 | 4.000000e+00 | -- | Inf
490.75/490.99 c 485s|410000 | 11 | 687 | 18M| 31 | - | 36 |7995 | 233 | 0 | 0 | 5 | 226k| 33 | 4.000000e+00 | -- | Inf
501.14/501.36 c 495s|420000 | 9 | 687 | 18M| 31 | - | 36 |7991 | 498 | 0 | 0 | 5 | 233k| 33 | 4.000000e+00 | -- | Inf
512.35/512.54 c 506s|430000 | 15 | 687 | 18M| 31 | - | 36 |7987 | 744 | 0 | 0 | 5 | 240k| 33 | 4.000000e+00 | -- | Inf
523.44/523.69 c 517s|440000 | 13 | 687 | 18M| 31 | - | 36 |7988 | 317 | 0 | 0 | 5 | 247k| 33 | 4.000000e+00 | -- | Inf
534.44/534.65 c 528s|450000 | 8 | 687 | 18M| 31 | - | 36 |7996 | 557 | 0 | 0 | 5 | 254k| 33 | 4.000000e+00 | -- | Inf
546.63/546.86 c 540s|460000 | 18 | 687 | 18M| 31 | - | 36 |7967 |2295 | 0 | 0 | 5 | 260k| 33 | 4.000000e+00 | -- | Inf
560.63/560.84 c 554s|470000 | 16 | 687 | 18M| 31 | - | 36 |7975 |1263 | 0 | 0 | 5 | 267k| 33 | 4.000000e+00 | -- | Inf
573.12/573.34 c 566s|480000 | 12 | 687 | 18M| 31 | - | 36 |7988 | 765 | 0 | 0 | 5 | 274k| 33 | 4.000000e+00 | -- | Inf
584.82/585.04 c 578s|490000 | 15 | 687 | 18M| 31 | - | 36 |7982 | 954 | 0 | 0 | 5 | 281k| 33 | 4.000000e+00 | -- | Inf
596.02/596.27 c 589s|500000 | 19 | 687 | 18M| 31 | - | 36 |7983 | 650 | 0 | 0 | 5 | 288k| 33 | 4.000000e+00 | -- | Inf
607.41/607.66 c 600s|510000 | 12 | 687 | 18M| 31 | - | 36 |7988 | 449 | 0 | 0 | 5 | 294k| 33 | 4.000000e+00 | -- | Inf
618.41/618.69 c 611s|520000 | 14 | 687 | 18M| 31 | - | 36 |7986 | 665 | 0 | 0 | 5 | 301k| 33 | 4.000000e+00 | -- | Inf
629.11/629.36 c 621s|530000 | 7 | 687 | 18M| 31 | - | 36 |7996 | 297 | 0 | 0 | 5 | 308k| 33 | 4.000000e+00 | -- | Inf
642.10/642.33 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
642.10/642.33 c 634s|540000 | 11 | 687 | 18M| 31 | - | 36 |7992 | 290 | 0 | 0 | 5 | 315k| 33 | 4.000000e+00 | -- | Inf
653.30/653.57 c 645s|550000 | 13 | 687 | 18M| 31 | - | 36 |7991 | 410 | 0 | 0 | 5 | 322k| 33 | 4.000000e+00 | -- | Inf
663.40/663.68 c 655s|560000 | 9 | 687 | 18M| 31 | - | 36 |7999 | 110 | 0 | 0 | 5 | 329k| 33 | 4.000000e+00 | -- | Inf
674.19/674.42 c 666s|570000 | 14 | 687 | 18M| 31 | - | 36 |7992 | 417 | 0 | 0 | 5 | 335k| 33 | 4.000000e+00 | -- | Inf
677.70/677.99 c
677.70/677.99 c SCIP Status : problem is solved [infeasible]
677.70/677.99 c Solving Time (sec) : 669.16
677.70/677.99 c Solving Nodes : 573566
677.70/677.99 c Primal Bound : +1.00000000000000e+20 (0 solutions)
677.70/677.99 c Dual Bound : +1.00000000000000e+20
677.70/677.99 c Gap : 0.00 %
677.70/677.99 c NODE 573566
677.70/677.99 c DUAL BOUND 1e+20
677.70/677.99 c PRIMAL BOUND 1e+20
677.70/677.99 c GAP 0
677.70/677.99 s UNSATISFIABLE
677.70/677.99 c SCIP Status : problem is solved [infeasible]
677.70/677.99 c Solving Time : 669.16
677.70/677.99 c Original Problem :
677.70/677.99 c Problem name : HOME/instance-1884548-1245259524.opb
677.70/677.99 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
677.70/677.99 c Constraints : 7938 initial, 7938 maximal
677.70/677.99 c Presolved Problem :
677.70/677.99 c Problem name : t_HOME/instance-1884548-1245259524.opb
677.70/677.99 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
677.70/677.99 c Constraints : 7938 initial, 8012 maximal
677.70/677.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
677.70/677.99 c trivial : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c implics : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c probing : 0.00 0 0 0 0 0 0 0 0
677.70/677.99 c logicor : 0.05 0 0 0 0 0 0 0 0
677.70/677.99 c root node : - 35 - - 35 - - - -
677.70/677.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
677.70/677.99 c integral : 0 0 0 1 0 0 0 0 0 2
677.70/677.99 c logicor : 7938+ 5 1773745 0 0 374910 3402838 0 0 0
677.70/677.99 c countsols : 0 0 0 0 0 0 0 0 0 0
677.70/677.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
677.70/677.99 c integral : 40.70 0.00 0.00 40.70 0.00
677.70/677.99 c logicor : 341.92 0.01 341.91 0.00 0.00
677.70/677.99 c countsols : 0.00 0.00 0.00 0.00 0.00
677.70/677.99 c Propagators : Time Calls Cutoffs DomReds
677.70/677.99 c rootredcost : 0.71 0 0 0
677.70/677.99 c pseudoobj : 5.85 2009774 0 0
677.70/677.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
677.70/677.99 c propagation : 9.15 374910 337004 337004 16.4 1486 17.4 -
677.70/677.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
677.70/677.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
677.70/677.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
677.70/677.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
677.70/677.99 c applied globally : - - - 338490 16.4 - - -
677.70/677.99 c applied locally : - - - 0 0.0 - - -
677.70/677.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
677.70/677.99 c cut pool : 0.01 4 - - 1 - (maximal pool size: 2135)
677.70/677.99 c redcost : 0.00 5 0 0 0 0
677.70/677.99 c impliedbounds : 0.00 5 0 0 0 0
677.70/677.99 c intobj : 0.00 0 0 0 0 0
677.70/677.99 c gomory : 1.23 5 0 0 1527 0
677.70/677.99 c strongcg : 0.47 5 0 0 2412 0
677.70/677.99 c cmir : 0.00 0 0 0 0 0
677.70/677.99 c flowcover : 0.00 0 0 0 0 0
677.70/677.99 c clique : 0.00 1 0 0 0 0
677.70/677.99 c zerohalf : 0.00 0 0 0 0 0
677.70/677.99 c mcf : 0.00 0 0 0 0 0
677.70/677.99 c Pricers : Time Calls Vars
677.70/677.99 c problem variables: 0.00 0 0
677.70/677.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
677.70/677.99 c relpscost : 40.70 1 0 0 0 0 2
677.70/677.99 c pscost : 0.00 0 0 0 0 0 0
677.70/677.99 c inference : 3.12 386306 0 0 0 0 772612
677.70/677.99 c mostinf : 0.00 0 0 0 0 0 0
677.70/677.99 c leastinf : 0.00 0 0 0 0 0 0
677.70/677.99 c fullstrong : 0.00 0 0 0 0 0 0
677.70/677.99 c allfullstrong : 0.00 0 0 0 0 0 0
677.70/677.99 c random : 0.00 0 0 0 0 0 0
677.70/677.99 c Primal Heuristics : Time Calls Found
677.70/677.99 c LP solutions : 0.00 - 0
677.70/677.99 c pseudo solutions : 0.00 - 0
677.70/677.99 c simplerounding : 0.00 0 0
677.70/677.99 c rounding : 0.00 0 0
677.70/677.99 c shifting : 0.00 0 0
677.70/677.99 c intshifting : 0.00 0 0
677.70/677.99 c oneopt : 0.00 0 0
677.70/677.99 c fixandinfer : 0.00 0 0
677.70/677.99 c feaspump : 0.00 0 0
677.70/677.99 c coefdiving : 0.00 0 0
677.70/677.99 c pscostdiving : 0.00 0 0
677.70/677.99 c fracdiving : 0.00 0 0
677.70/677.99 c veclendiving : 0.00 0 0
677.70/677.99 c intdiving : 0.00 0 0
677.70/677.99 c actconsdiving : 0.00 0 0
677.70/677.99 c objpscostdiving : 0.00 0 0
677.70/677.99 c rootsoldiving : 0.00 0 0
677.70/677.99 c linesearchdiving : 0.00 0 0
677.70/677.99 c guideddiving : 0.00 0 0
677.70/677.99 c octane : 0.00 0 0
677.70/677.99 c rens : 0.00 0 0
677.70/677.99 c rins : 0.00 0 0
677.70/677.99 c localbranching : 0.00 0 0
677.70/677.99 c mutation : 0.00 0 0
677.70/677.99 c crossover : 0.00 0 0
677.70/677.99 c dins : 0.00 0 0
677.70/677.99 c LP : Time Calls Iterations Iter/call Iter/sec
677.70/677.99 c primal LP : 0.04 0 0 0.00 0.00
677.70/677.99 c dual LP : 2.47 6 687 114.50 278.14
677.70/677.99 c barrier LP : 0.00 0 0 0.00 -
677.70/677.99 c diving/probing LP: 0.00 0 0 0.00 -
677.70/677.99 c strong branching : 40.70 33 12255 371.36 301.11
677.70/677.99 c (at root node) : - 33 12255 371.36 -
677.70/677.99 c conflict analysis: 0.00 0 0 0.00 -
677.70/677.99 c B&B Tree :
677.70/677.99 c number of runs : 1
677.70/677.99 c nodes : 573566
677.70/677.99 c nodes (total) : 573566
677.70/677.99 c nodes left : 0
677.70/677.99 c max depth : 31
677.70/677.99 c max depth (total): 31
677.70/677.99 c backtracks : 211722 (36.9%)
677.70/677.99 c delayed cutoffs : 199049
677.70/677.99 c repropagations : 387835 (1902718 domain reductions, 187651 cutoffs)
677.70/677.99 c avg switch length: 2.26
677.70/677.99 c switching time : 163.38
677.70/677.99 c Solution :
677.70/677.99 c Solutions found : 0 (0 improvements)
677.70/677.99 c Primal Bound : infeasible
677.70/677.99 c Dual Bound : -
677.70/677.99 c Gap : 0.00 %
677.70/677.99 c Root Dual Bound : +4.00000000000000e+00
677.79/678.03 c Time complete: 677.83.