0.01/0.05 c SCIP version 1.1.0.7
0.01/0.05 c LP-Solver Clp 1.8.2
0.01/0.05 c user parameter file <scip.set> not found - using default parameters
0.01/0.05 c read problem <HOME/instance-1884268-1245256321.opb>
0.01/0.05 c original problem has 892 variables (892 bin, 0 int, 0 impl, 0 cont) and 3006 constraints
0.01/0.07 c No objective function, only one solution is needed.
0.01/0.07 c start presolving problem
0.01/0.07 c presolving:
0.01/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.01/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.13 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 | 143 |5615k| 0 | 26 | 889 |2969 |2969 | 889 |2969 | 0 | 0 | 0 | 1.775000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 278 |5642k| 0 | 20 | 889 |2969 |2969 | 889 |2970 | 1 | 0 | 0 | 1.816667e+01 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 346 |5701k| 0 | 24 | 889 |2969 |2969 | 889 |2972 | 3 | 0 | 0 | 1.843590e+01 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 421 |6093k| 0 | 16 | 889 |2969 |2969 | 889 |2975 | 6 | 0 | 0 | 1.860000e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 605 |6778k| 0 | 72 | 889 |2969 |2969 | 889 |2977 | 8 | 0 | 0 | 1.874696e+01 | -- | Inf
0.89/0.93 c 0.8s| 1 | 0 | 776 |6953k| 0 | 83 | 889 |2969 |2969 | 889 |2978 | 9 | 0 | 0 | 1.884646e+01 | -- | Inf
2.69/2.77 c 2.7s| 1 | 2 | 776 |6953k| 0 | 83 | 889 |2969 |2969 | 889 |2978 | 9 | 0 | 30 | 1.884646e+01 | -- | Inf
18.38/18.48 c 17.8s| 10000 | 114 | 776 |7489k| 224 | - | 889 |2972 | 575 | 0 | 0 | 9 |8684 | 30 | 1.891621e+01 | -- | Inf
36.28/36.34 c 35.0s| 20000 | 98 | 776 |7513k| 224 | - | 889 |2987 | 290 | 0 | 0 | 9 | 16k| 30 | 1.891621e+01 | -- | Inf
54.27/54.38 c 52.4s| 30000 | 81 | 776 |7540k| 224 | - | 889 |2988 | 402 | 0 | 0 | 9 | 24k| 30 | 1.891621e+01 | -- | Inf
72.96/73.03 c 70.4s| 40000 | 75 | 776 |7563k| 224 | - | 889 |3003 | 203 | 0 | 0 | 9 | 31k| 30 | 1.891621e+01 | -- | Inf
90.86/90.91 c 87.7s| 50000 | 71 | 776 |7571k| 224 | - | 889 |3005 | 152 | 0 | 0 | 9 | 38k| 30 | 1.891621e+01 | -- | Inf
109.65/109.75 c 106s| 60000 | 67 | 776 |7576k| 224 | - | 889 |3004 | 156 | 0 | 0 | 9 | 45k| 30 | 1.891621e+01 | -- | Inf
129.65/129.71 c 125s| 70000 | 60 | 776 |7574k| 224 | - | 889 |3010 | 562 | 0 | 0 | 9 | 52k| 30 | 1.891621e+01 | -- | Inf
148.84/148.92 c 144s| 80000 | 59 | 776 |7586k| 224 | - | 889 |3010 | 252 | 0 | 0 | 9 | 59k| 30 | 1.891621e+01 | -- | Inf
166.13/166.22 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
166.13/166.22 c 161s| 90000 | 59 | 776 |7595k| 224 | - | 889 |3054 | 890 | 0 | 0 | 9 | 65k| 30 | 1.891621e+01 | -- | Inf
182.93/183.04 c 177s|100000 | 58 | 776 |7615k| 224 | - | 889 |3093 | 437 | 0 | 0 | 9 | 71k| 30 | 1.891621e+01 | -- | Inf
200.72/200.89 c 194s|110000 | 56 | 776 |7599k| 224 | - | 889 |3056 |1154 | 0 | 0 | 9 | 78k| 30 | 1.891621e+01 | -- | Inf
220.11/220.27 c 213s|120000 | 59 | 776 |7606k| 224 | - | 889 |3028 | 138 | 0 | 0 | 9 | 84k| 30 | 1.891621e+01 | -- | Inf
238.01/238.13 c 230s|130000 | 55 | 776 |7612k| 224 | - | 889 |3037 | 823 | 0 | 0 | 9 | 90k| 30 | 1.891621e+01 | -- | Inf
257.21/257.36 c 249s|140000 | 55 | 776 |7617k| 224 | - | 889 |3026 | 602 | 0 | 0 | 9 | 98k| 30 | 1.891621e+01 | -- | Inf
277.60/277.76 c 269s|150000 | 48 | 776 |7609k| 224 | - | 889 |2995 | 249 | 0 | 0 | 9 | 104k| 30 | 1.891621e+01 | -- | Inf
296.80/296.94 c 287s|160000 | 48 | 776 |7620k| 224 | - | 889 |3031 | 925 | 0 | 0 | 9 | 111k| 30 | 1.891621e+01 | -- | Inf
317.48/317.62 c 307s|170000 | 39 | 776 |7601k| 224 | - | 889 |3018 |1760 | 0 | 0 | 9 | 117k| 30 | 1.891621e+01 | -- | Inf
338.48/338.62 c 327s|180000 | 42 | 776 |7614k| 224 | - | 889 |2985 | 168 | 0 | 0 | 9 | 122k| 30 | 1.891621e+01 | -- | Inf
360.87/361.02 c 349s|190000 | 39 | 776 |7621k| 224 | - | 889 |3020 | 692 | 0 | 0 | 9 | 127k| 30 | 1.891621e+01 | -- | Inf
381.06/381.27 c 369s|200000 | 36 | 776 |7621k| 224 | - | 889 |3029 | 939 | 0 | 0 | 9 | 132k| 30 | 1.891621e+01 | -- | Inf
402.65/402.83 c 390s|210000 | 37 | 776 |7625k| 224 | - | 889 |3007 | 282 | 0 | 0 | 9 | 137k| 30 | 1.891621e+01 | -- | Inf
426.35/426.56 c 413s|220000 | 29 | 776 |7644k| 224 | - | 889 |3040 | 223 | 0 | 0 | 9 | 143k| 30 | 1.891621e+01 | -- | Inf
447.24/447.47 c 433s|230000 | 31 | 776 |7625k| 224 | - | 889 |2998 | 150 | 0 | 0 | 9 | 149k| 30 | 1.891621e+01 | -- | Inf
466.93/467.15 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
466.93/467.15 c 452s|240000 | 30 | 776 |7635k| 224 | - | 889 |3053 | 669 | 0 | 0 | 9 | 155k| 30 | 1.891621e+01 | -- | Inf
485.03/485.20 c 470s|250000 | 31 | 776 |7637k| 224 | - | 889 |3014 | 142 | 0 | 0 | 9 | 161k| 30 | 1.891621e+01 | -- | Inf
504.12/504.37 c 488s|260000 | 27 | 776 |7624k| 224 | - | 889 |3006 | 804 | 0 | 0 | 9 | 168k| 30 | 1.891621e+01 | -- | Inf
525.22/525.42 c 509s|270000 | 24 | 776 |7663k| 224 | - | 889 |3090 | 210 | 0 | 0 | 9 | 175k| 30 | 1.891621e+01 | -- | Inf
543.41/543.65 c 526s|280000 | 27 | 776 |7647k| 224 | - | 889 |3075 |1369 | 0 | 0 | 9 | 180k| 30 | 1.891621e+01 | -- | Inf
561.40/561.65 c 544s|290000 | 30 | 776 |7669k| 224 | - | 889 |3124 | 676 | 0 | 0 | 9 | 185k| 30 | 1.891621e+01 | -- | Inf
578.40/578.66 c 560s|300000 | 29 | 776 |7697k| 224 | - | 889 |3183 | 242 | 0 | 0 | 9 | 191k| 30 | 1.891621e+01 | -- | Inf
595.70/595.95 c 577s|310000 | 29 | 776 |7678k| 224 | - | 889 |3091 | 184 | 0 | 0 | 9 | 197k| 30 | 1.891621e+01 | -- | Inf
612.68/612.93 c 593s|320000 | 26 | 776 |7701k| 224 | - | 889 |3225 |1267 | 0 | 0 | 9 | 203k| 30 | 1.891621e+01 | -- | Inf
630.68/630.94 c 611s|330000 | 26 | 776 |7656k| 224 | - | 889 |3059 |1409 | 0 | 0 | 9 | 209k| 30 | 1.891621e+01 | -- | Inf
648.38/648.64 c 628s|340000 | 24 | 776 |7686k| 224 | - | 889 |3188 |1474 | 0 | 0 | 9 | 215k| 30 | 1.891621e+01 | -- | Inf
667.37/667.64 c 646s|350000 | 25 | 776 |7695k| 224 | - | 889 |3144 | 865 | 0 | 0 | 9 | 221k| 30 | 1.891621e+01 | -- | Inf
685.46/685.76 c 664s|360000 | 25 | 776 |7644k| 224 | - | 889 |2975 |1058 | 0 | 0 | 9 | 226k| 30 | 1.891621e+01 | -- | Inf
704.76/705.08 c 683s|370000 | 24 | 776 |7684k| 224 | - | 889 |3070 | 505 | 0 | 0 | 9 | 231k| 30 | 1.891621e+01 | -- | Inf
725.65/725.94 c 703s|380000 | 22 | 776 |7667k| 224 | - | 889 |3002 | 684 | 0 | 0 | 9 | 234k| 30 | 1.891621e+01 | -- | Inf
749.63/749.93 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
749.63/749.93 c 726s|390000 | 19 | 776 |7655k| 224 | - | 889 |2981 | 851 | 0 | 0 | 9 | 237k| 30 | 1.891621e+01 | -- | Inf
770.13/770.49 c 746s|400000 | 17 | 776 |7674k| 224 | - | 889 |2997 | 219 | 0 | 0 | 9 | 239k| 30 | 1.891621e+01 | -- | Inf
791.63/791.99 c 767s|410000 | 16 | 776 |7663k| 224 | - | 889 |3018 |1323 | 0 | 0 | 9 | 242k| 30 | 1.891621e+01 | -- | Inf
812.82/813.15 c 788s|420000 | 15 | 776 |7673k| 224 | - | 889 |2987 | 144 | 0 | 0 | 9 | 245k| 30 | 1.891621e+01 | -- | Inf
832.71/833.07 c 807s|430000 | 8 | 776 |7687k| 224 | - | 889 |3037 | 241 | 0 | 0 | 9 | 246k| 30 | 1.891621e+01 | -- | Inf
850.20/850.54 c 824s|440000 | 8 | 776 |7676k| 224 | - | 889 |3020 | 754 | 0 | 0 | 9 | 248k| 30 | 1.891621e+01 | -- | Inf
869.80/870.19 c 843s|450000 | 7 | 776 |7682k| 224 | - | 889 |3016 | 268 | 0 | 0 | 9 | 249k| 30 | 1.891621e+01 | -- | Inf
889.60/889.99 c 862s|460000 | 10 | 776 |7667k| 224 | - | 889 |2989 |1005 | 0 | 0 | 9 | 251k| 30 | 2.197500e+01 | -- | Inf
911.19/911.55 c 883s|470000 | 12 | 776 |7677k| 224 | - | 889 |3007 | 471 | 0 | 0 | 9 | 258k| 30 | 2.197500e+01 | -- | Inf
935.08/935.48 c 906s|480000 | 10 | 776 |7672k| 224 | - | 889 |3024 | 983 | 0 | 0 | 9 | 265k| 30 | 2.197500e+01 | -- | Inf
959.77/960.16 c 930s|490000 | 8 | 776 |7679k| 224 | - | 889 |3035 | 766 | 0 | 0 | 9 | 272k| 30 | 2.197500e+01 | -- | Inf
985.17/985.57 c 955s|500000 | 11 | 776 |7687k| 224 | - | 889 |3034 | 360 | 0 | 0 | 9 | 278k| 30 | 2.197500e+01 | -- | Inf
1012.95/1013.38 c 982s|510000 | 7 | 776 |7681k| 224 | - | 889 |3066 | 994 | 0 | 0 | 9 | 285k| 30 | 2.197500e+01 | -- | Inf
1038.94/1039.39 c 1007s|520000 | 7 | 776 |7680k| 224 | - | 889 |3055 | 883 | 0 | 0 | 9 | 292k| 30 | 2.197500e+01 | -- | Inf
1066.83/1067.22 c 1034s|530000 | 8 | 776 |7685k| 224 | - | 889 |3046 | 454 | 0 | 0 | 9 | 298k| 30 | 2.197500e+01 | -- | Inf
1096.22/1096.69 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1096.22/1096.69 c 1063s|540000 | 7 | 776 |7692k| 224 | - | 889 |3054 | 182 | 0 | 0 | 9 | 305k| 30 | 2.197500e+01 | -- | Inf
1125.32/1125.71 c 1091s|550000 | 7 | 776 |7692k| 224 | - | 889 |3060 | 222 | 0 | 0 | 9 | 312k| 30 | 2.197500e+01 | -- | Inf
1153.50/1153.92 c 1118s|560000 | 4 | 776 |7563k| 224 | - | 889 |2597 | 308 | 0 | 0 | 9 | 319k| 30 | 7.800000e+01 | -- | Inf
1153.70/1154.15 c
1153.70/1154.15 c SCIP Status : problem is solved [infeasible]
1153.70/1154.15 c Solving Time (sec) : 1118.66
1153.70/1154.15 c Solving Nodes : 560063
1153.70/1154.15 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1153.70/1154.15 c Dual Bound : +1.00000000000000e+20
1153.70/1154.15 c Gap : 0.00 %
1153.70/1154.15 c NODE 560063
1153.70/1154.15 c DUAL BOUND 1e+20
1153.70/1154.15 c PRIMAL BOUND 1e+20
1153.70/1154.15 c GAP 0
1153.70/1154.15 s UNSATISFIABLE
1153.70/1154.15 c SCIP Status : problem is solved [infeasible]
1153.70/1154.15 c Solving Time : 1118.66
1153.70/1154.15 c Original Problem :
1153.70/1154.15 c Problem name : HOME/instance-1884268-1245256321.opb
1153.70/1154.15 c Variables : 892 (892 binary, 0 integer, 0 implicit integer, 0 continuous)
1153.70/1154.15 c Constraints : 3006 initial, 3006 maximal
1153.70/1154.15 c Presolved Problem :
1153.70/1154.15 c Problem name : t_HOME/instance-1884268-1245256321.opb
1153.70/1154.15 c Variables : 889 (889 binary, 0 integer, 0 implicit integer, 0 continuous)
1153.70/1154.15 c Constraints : 2969 initial, 3277 maximal
1153.70/1154.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1153.70/1154.15 c trivial : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c dualfix : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c implics : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c probing : 0.00 0 0 0 0 0 0 0 0
1153.70/1154.15 c linear : 0.03 3 0 0 3 0 37 0 0
1153.70/1154.15 c logicor : 0.02 0 0 0 0 0 0 0 0
1153.70/1154.15 c root node : - 889 - - 889 - - - -
1153.70/1154.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1153.70/1154.15 c integral : 0 0 0 1 0 0 0 0 0 2
1153.70/1154.15 c logicor : 2969+ 5 11009003 0 0 347574 69031096 0 0 0
1153.70/1154.15 c countsols : 0 0 0 0 0 0 0 0 0 0
1153.70/1154.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1153.70/1154.15 c integral : 1.83 0.00 0.00 1.83 0.00
1153.70/1154.15 c logicor : 437.60 0.00 437.60 0.00 0.00
1153.70/1154.15 c countsols : 0.00 0.00 0.00 0.00 0.00
1153.70/1154.15 c Propagators : Time Calls Cutoffs DomReds
1153.70/1154.15 c rootredcost : 3.47 0 0 0
1153.70/1154.15 c pseudoobj : 416.94 11210427 0 0
1153.70/1154.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1153.70/1154.15 c propagation : 204.73 347574 286701 286701 34.0 33217 15.5 -
1153.70/1154.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1153.70/1154.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1153.70/1154.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1153.70/1154.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1153.70/1154.15 c applied globally : - - - 308745 29.5 - - -
1153.70/1154.15 c applied locally : - - - 10547 104.1 - - -
1153.70/1154.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1153.70/1154.15 c cut pool : 0.00 4 - - 27 - (maximal pool size: 197)
1153.70/1154.15 c redcost : 0.00 5 0 0 0 0
1153.70/1154.15 c impliedbounds : 0.00 5 0 0 0 0
1153.70/1154.15 c intobj : 0.00 0 0 0 0 0
1153.70/1154.15 c gomory : 0.25 5 0 0 619 0
1153.70/1154.15 c strongcg : 0.24 5 0 0 660 0
1153.70/1154.15 c cmir : 0.00 0 0 0 0 0
1153.70/1154.15 c flowcover : 0.00 0 0 0 0 0
1153.70/1154.15 c clique : 0.00 1 0 0 0 0
1153.70/1154.15 c zerohalf : 0.00 0 0 0 0 0
1153.70/1154.15 c mcf : 0.00 1 0 0 0 0
1153.70/1154.15 c Pricers : Time Calls Vars
1153.70/1154.15 c problem variables: 0.00 0 0
1153.70/1154.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1153.70/1154.15 c relpscost : 1.83 1 0 0 0 0 2
1153.70/1154.15 c pscost : 0.00 0 0 0 0 0 0
1153.70/1154.15 c inference : 30.81 357117 0 0 0 0 714234
1153.70/1154.15 c mostinf : 0.00 0 0 0 0 0 0
1153.70/1154.15 c leastinf : 0.00 0 0 0 0 0 0
1153.70/1154.15 c fullstrong : 0.00 0 0 0 0 0 0
1153.70/1154.15 c allfullstrong : 0.00 0 0 0 0 0 0
1153.70/1154.15 c random : 0.00 0 0 0 0 0 0
1153.70/1154.15 c Primal Heuristics : Time Calls Found
1153.70/1154.15 c LP solutions : 0.00 - 0
1153.70/1154.15 c pseudo solutions : 0.00 - 0
1153.70/1154.15 c simplerounding : 0.00 0 0
1153.70/1154.15 c rounding : 0.00 0 0
1153.70/1154.15 c shifting : 0.00 0 0
1153.70/1154.15 c intshifting : 0.00 0 0
1153.70/1154.15 c oneopt : 0.00 0 0
1153.70/1154.15 c fixandinfer : 0.00 0 0
1153.70/1154.15 c feaspump : 0.00 0 0
1153.70/1154.15 c coefdiving : 0.00 0 0
1153.70/1154.15 c pscostdiving : 0.00 0 0
1153.70/1154.15 c fracdiving : 0.00 0 0
1153.70/1154.15 c veclendiving : 0.00 0 0
1153.70/1154.15 c intdiving : 0.00 0 0
1153.70/1154.15 c actconsdiving : 0.00 0 0
1153.70/1154.15 c objpscostdiving : 0.00 0 0
1153.70/1154.15 c rootsoldiving : 0.00 0 0
1153.70/1154.15 c linesearchdiving : 0.00 0 0
1153.70/1154.15 c guideddiving : 0.00 0 0
1153.70/1154.15 c octane : 0.00 0 0
1153.70/1154.15 c rens : 0.00 0 0
1153.70/1154.15 c rins : 0.00 0 0
1153.70/1154.15 c localbranching : 0.00 0 0
1153.70/1154.15 c mutation : 0.00 0 0
1153.70/1154.15 c crossover : 0.00 0 0
1153.70/1154.15 c dins : 0.00 0 0
1153.70/1154.15 c LP : Time Calls Iterations Iter/call Iter/sec
1153.70/1154.15 c primal LP : 0.01 0 0 0.00 0.00
1153.70/1154.15 c dual LP : 0.24 6 776 129.33 3233.33
1153.70/1154.15 c barrier LP : 0.00 0 0 0.00 -
1153.70/1154.15 c diving/probing LP: 0.00 0 0 0.00 -
1153.70/1154.15 c strong branching : 1.83 30 4728 157.60 2583.61
1153.70/1154.15 c (at root node) : - 30 4728 157.60 -
1153.70/1154.15 c conflict analysis: 0.00 0 0 0.00 -
1153.70/1154.15 c B&B Tree :
1153.70/1154.15 c number of runs : 1
1153.70/1154.15 c nodes : 560063
1153.70/1154.15 c nodes (total) : 560063
1153.70/1154.15 c nodes left : 0
1153.70/1154.15 c max depth : 224
1153.70/1154.15 c max depth (total): 224
1153.70/1154.15 c backtracks : 182966 (32.7%)
1153.70/1154.15 c delayed cutoffs : 154174
1153.70/1154.15 c repropagations : 364518 (25575676 domain reductions, 144629 cutoffs)
1153.70/1154.15 c avg switch length: 2.37
1153.70/1154.15 c switching time : 144.76
1153.70/1154.15 c Solution :
1153.70/1154.15 c Solutions found : 0 (0 improvements)
1153.70/1154.15 c Primal Bound : infeasible
1153.70/1154.15 c Dual Bound : -
1153.70/1154.15 c Gap : 0.00 %
1153.70/1154.15 c Root Dual Bound : +1.88464637043555e+01
1153.70/1154.18 c Time complete: 1153.78.