0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2664412-1276295999.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.05 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.39/4.44 c 4.1s| 10000 | 7669 | 0 | 0.0 |7136k| 100 | - | 231 |4512 | 0 | 0 | 0 |2722 | 0 | 0.000000e+00 | -- | Inf
10.49/10.59 c 10.0s| 20000 | 14082 | 0 | 0.0 | 12M| 100 | - | 231 |5653 | 0 | 0 | 0 |6834 | 0 | 0.000000e+00 | -- | Inf
17.29/17.37 c 16.5s| 30000 | 20772 | 0 | 0.0 | 16M| 100 | - | 231 |6638 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
25.49/25.54 c 24.4s| 40000 | 26869 | 0 | 0.0 | 21M| 100 | - | 231 |7635 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
37.68/37.79 c 36.3s| 50000 | 30785 | 0 | 0.0 | 26M| 100 | - | 231 |9142 | 0 | 0 | 0 | 22k| 0 | 0.000000e+00 | -- | Inf
54.88/54.92 c 53.0s| 60000 | 33033 | 0 | 0.0 | 31M| 100 | - | 231 | 10k| 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
70.47/70.58 c 68.3s| 70000 | 36981 | 0 | 0.0 | 36M| 100 | - | 231 |9979 | 0 | 0 | 0 | 39k| 0 | 0.000000e+00 | -- | Inf
85.57/85.63 c 83.0s| 80000 | 41140 | 0 | 0.0 | 41M| 100 | - | 231 | 10k| 0 | 0 | 0 | 46k| 0 | 0.000000e+00 | -- | Inf
102.17/102.22 c 99.2s| 90000 | 44745 | 0 | 0.0 | 46M| 100 | - | 231 | 11k| 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
121.26/121.38 c 118s|100000 | 47609 | 0 | 0.0 | 52M| 100 | - | 231 | 12k| 0 | 0 | 0 | 62k| 0 | 0.000000e+00 | -- | Inf
142.64/142.76 c 139s|110000 | 50159 | 0 | 0.0 | 57M| 100 | - | 231 | 13k| 0 | 0 | 0 | 71k| 0 | 0.000000e+00 | -- | Inf
167.44/167.57 c 163s|120000 | 51829 | 0 | 0.0 | 62M| 100 | - | 231 | 14k| 0 | 0 | 0 | 80k| 0 | 0.000000e+00 | -- | Inf
194.23/194.38 c 190s|130000 | 53254 | 0 | 0.0 | 67M| 100 | - | 231 | 15k| 0 | 0 | 0 | 91k| 0 | 0.000000e+00 | -- | Inf
222.82/222.99 c 218s|140000 | 54373 | 0 | 0.0 | 71M| 100 | - | 231 | 15k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
253.01/253.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
253.01/253.11 c 248s|150000 | 55049 | 0 | 0.0 | 75M| 100 | - | 231 | 16k| 0 | 0 | 0 | 113k| 0 | 0.000000e+00 | -- | Inf
288.50/288.62 c 283s|160000 | 54536 | 0 | 0.0 | 77M| 100 | - | 231 | 18k| 0 | 0 | 0 | 126k| 0 | 0.000000e+00 | -- | Inf
331.00/331.18 c 325s|170000 | 53307 | 0 | 0.0 | 79M| 100 | - | 231 | 18k| 0 | 0 | 0 | 140k| 0 | 0.000000e+00 | -- | Inf
370.97/371.11 c 364s|180000 | 53042 | 0 | 0.0 | 84M| 100 | - | 231 | 18k| 0 | 0 | 0 | 152k| 0 | 0.000000e+00 | -- | Inf
412.97/413.17 c 406s|190000 | 52230 | 0 | 0.0 | 87M| 100 | - | 231 | 19k| 0 | 0 | 0 | 165k| 0 | 0.000000e+00 | -- | Inf
457.84/458.07 c 450s|200000 | 51188 | 0 | 0.0 | 90M| 100 | - | 231 | 21k| 0 | 0 | 0 | 178k| 0 | 0.000000e+00 | -- | Inf
506.73/506.93 c 499s|210000 | 49687 | 0 | 0.0 | 92M| 100 | - | 231 | 23k| 0 | 0 | 0 | 192k| 0 | 0.000000e+00 | -- | Inf
559.32/559.56 c 551s|220000 | 47670 | 0 | 0.0 | 93M| 100 | - | 231 | 24k| 0 | 0 | 0 | 206k| 0 | 0.000000e+00 | -- | Inf
611.61/611.89 c 603s|230000 | 45911 | 0 | 0.0 | 93M| 100 | - | 231 | 26k| 0 | 0 | 0 | 220k| 0 | 0.000000e+00 | -- | Inf
670.69/670.99 c 661s|240000 | 43115 | 0 | 0.0 | 92M| 100 | - | 231 | 28k| 0 | 0 | 0 | 236k| 0 | 0.000000e+00 | -- | Inf
743.57/743.89 c 734s|250000 | 37959 | 0 | 0.0 | 88M| 100 | - | 231 | 33k| 0 | 0 | 0 | 255k| 0 | 0.000000e+00 | -- | Inf
842.03/842.33 c 832s|260000 | 28670 | 0 | 0.0 | 75M| 100 | - | 231 | 34k| 0 | 0 | 0 | 276k| 0 | 0.000000e+00 | -- | Inf
940.22/940.52 c 929s|270000 | 20196 | 0 | 0.0 | 62M| 100 | - | 231 | 37k| 0 | 0 | 0 | 298k| 0 | 0.000000e+00 | -- | Inf
1060.17/1060.52 c 1048s|280000 | 7935 | 0 | 0.0 | 41M| 100 | - | 231 | 44k| 0 | 0 | 0 | 322k| 0 | 0.000000e+00 | -- | Inf
1129.25/1129.66 c
1129.25/1129.66 c SCIP Status : problem is solved [infeasible]
1129.25/1129.66 c Solving Time (sec) : 1117.19
1129.25/1129.66 c Solving Nodes : 283896
1129.25/1129.66 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1129.25/1129.66 c Dual Bound : +1.00000000000000e+20
1129.25/1129.66 c Gap : 0.00 %
1129.25/1129.66 s UNSATISFIABLE
1129.25/1129.66 c SCIP Status : problem is solved [infeasible]
1129.25/1129.66 c Solving Time : 1117.19
1129.25/1129.66 c Original Problem :
1129.25/1129.66 c Problem name : HOME/instance-2664412-1276295999.opb
1129.25/1129.66 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
1129.25/1129.66 c Constraints : 2707 initial, 2707 maximal
1129.25/1129.66 c Presolved Problem :
1129.25/1129.66 c Problem name : t_HOME/instance-2664412-1276295999.opb
1129.25/1129.66 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
1129.25/1129.66 c Constraints : 2564 initial, 48665 maximal
1129.25/1129.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1129.25/1129.66 c trivial : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c dualfix : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c boundshift : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c implics : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c probing : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c knapsack : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c setppc : 0.00 0 0 0 0 0 0 0 0
1129.25/1129.66 c linear : 0.03 0 0 0 0 0 143 0 0
1129.25/1129.66 c logicor : 0.03 0 0 0 0 0 0 0 0
1129.25/1129.66 c root node : - 0 - - 0 - - - -
1129.25/1129.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1129.25/1129.66 c integral : 0 0 0 0 0 0 0 0 0 0
1129.25/1129.66 c knapsack : 1 0 1252718 0 185460 41424 4149254 0 0 0
1129.25/1129.66 c setppc : 22 0 1218430 0 185460 50988 1452413 0 0 0
1129.25/1129.66 c logicor : 2541+ 0 903477 0 185460 55736 3613343 0 0 0
1129.25/1129.66 c countsols : 0 0 0 0 185460 0 0 0 0 0
1129.25/1129.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1129.25/1129.66 c integral : 0.00 0.00 0.00 0.00 0.00
1129.25/1129.66 c knapsack : 30.92 0.00 29.88 0.00 1.04
1129.25/1129.66 c setppc : 17.18 0.00 14.95 0.00 2.23
1129.25/1129.66 c logicor : 576.63 0.00 551.27 0.00 25.36
1129.25/1129.66 c countsols : 0.12 0.00 0.00 0.00 0.12
1129.25/1129.66 c Propagators : Time Calls Cutoffs DomReds
1129.25/1129.66 c vbounds : 0.66 1 0 0
1129.25/1129.66 c rootredcost : 0.73 0 0 0
1129.25/1129.66 c pseudoobj : 0.37 0 0 0
1129.25/1129.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1129.25/1129.66 c propagation : 9.32 148148 148070 678658 17.0 3529 19.5 -
1129.25/1129.66 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1129.25/1129.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1129.25/1129.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1129.25/1129.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1129.25/1129.66 c applied globally : - - - 332928 13.8 - - -
1129.25/1129.66 c applied locally : - - - 768 34.5 - - -
1129.25/1129.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1129.25/1129.66 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1129.25/1129.66 c redcost : 0.00 0 0 0 0 0
1129.25/1129.66 c impliedbounds : 0.00 0 0 0 0 0
1129.25/1129.66 c intobj : 0.00 0 0 0 0 0
1129.25/1129.66 c cgmip : 0.00 0 0 0 0 0
1129.25/1129.66 c gomory : 0.00 0 0 0 0 0
1129.25/1129.66 c strongcg : 0.00 0 0 0 0 0
1129.25/1129.66 c cmir : 0.00 0 0 0 0 0
1129.25/1129.66 c flowcover : 0.00 0 0 0 0 0
1129.25/1129.66 c clique : 0.00 0 0 0 0 0
1129.25/1129.66 c zerohalf : 0.00 0 0 0 0 0
1129.25/1129.66 c mcf : 0.00 0 0 0 0 0
1129.25/1129.66 c rapidlearning : 0.00 0 0 0 0 0
1129.25/1129.66 c Pricers : Time Calls Vars
1129.25/1129.66 c problem variables: 0.00 0 0
1129.25/1129.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1129.25/1129.66 c relpscost : 0.00 0 0 0 0 0 0
1129.25/1129.66 c pscost : 0.00 0 0 0 0 0 0
1129.25/1129.66 c inference : 5.13 185460 0 0 0 0 370920
1129.25/1129.66 c mostinf : 0.00 0 0 0 0 0 0
1129.25/1129.66 c leastinf : 0.00 0 0 0 0 0 0
1129.25/1129.66 c fullstrong : 0.00 0 0 0 0 0 0
1129.25/1129.66 c allfullstrong : 0.00 0 0 0 0 0 0
1129.25/1129.66 c random : 0.00 0 0 0 0 0 0
1129.25/1129.66 c Primal Heuristics : Time Calls Found
1129.25/1129.66 c LP solutions : 0.00 - 0
1129.25/1129.66 c pseudo solutions : 0.00 - 0
1129.25/1129.66 c trivial : 0.00 1 0
1129.25/1129.66 c simplerounding : 0.00 0 0
1129.25/1129.66 c zirounding : 0.00 0 0
1129.25/1129.66 c rounding : 0.00 0 0
1129.25/1129.66 c shifting : 0.00 0 0
1129.25/1129.66 c intshifting : 0.00 0 0
1129.25/1129.66 c oneopt : 0.00 0 0
1129.25/1129.66 c twoopt : 0.00 0 0
1129.25/1129.66 c fixandinfer : 0.00 0 0
1129.25/1129.66 c feaspump : 0.00 0 0
1129.25/1129.66 c coefdiving : 0.00 0 0
1129.25/1129.66 c pscostdiving : 0.00 0 0
1129.25/1129.66 c fracdiving : 0.00 0 0
1129.25/1129.66 c veclendiving : 0.00 0 0
1129.25/1129.66 c intdiving : 0.00 0 0
1129.25/1129.66 c actconsdiving : 0.00 0 0
1129.25/1129.66 c objpscostdiving : 0.00 0 0
1129.25/1129.66 c rootsoldiving : 0.00 0 0
1129.25/1129.66 c linesearchdiving : 0.00 0 0
1129.25/1129.66 c guideddiving : 0.00 0 0
1129.25/1129.66 c octane : 0.00 0 0
1129.25/1129.66 c rens : 0.00 0 0
1129.25/1129.66 c rins : 0.00 0 0
1129.25/1129.66 c localbranching : 0.00 0 0
1129.25/1129.66 c mutation : 0.00 0 0
1129.25/1129.66 c crossover : 0.00 0 0
1129.25/1129.66 c dins : 0.00 0 0
1129.25/1129.66 c undercover : 0.00 0 0
1129.25/1129.66 c nlp : 0.00 0 0
1129.25/1129.66 c trysol : 0.00 0 0
1129.25/1129.66 c LP : Time Calls Iterations Iter/call Iter/sec
1129.25/1129.66 c primal LP : 0.00 0 0 0.00 -
1129.25/1129.66 c dual LP : 0.00 0 0 0.00 -
1129.25/1129.66 c lex dual LP : 0.00 0 0 0.00 -
1129.25/1129.66 c barrier LP : 0.00 0 0 0.00 -
1129.25/1129.66 c diving/probing LP: 0.00 0 0 0.00 -
1129.25/1129.66 c strong branching : 0.00 0 0 0.00 -
1129.25/1129.66 c (at root node) : - 0 0 0.00 -
1129.25/1129.66 c conflict analysis: 0.00 0 0 0.00 -
1129.25/1129.66 c B&B Tree :
1129.25/1129.66 c number of runs : 1
1129.25/1129.66 c nodes : 283896
1129.25/1129.66 c nodes (total) : 283896
1129.25/1129.66 c nodes left : 0
1129.25/1129.66 c max depth : 100
1129.25/1129.66 c max depth (total): 100
1129.25/1129.66 c backtracks : 112783 (39.7%)
1129.25/1129.66 c delayed cutoffs : 87025
1129.25/1129.66 c repropagations : 420548 (2805260 domain reductions, 49712 cutoffs)
1129.25/1129.66 c avg switch length: 21.59
1129.25/1129.66 c switching time : 319.76
1129.25/1129.66 c Solution :
1129.25/1129.66 c Solutions found : 0 (0 improvements)
1129.25/1129.66 c Primal Bound : infeasible
1129.25/1129.66 c Dual Bound : -
1129.25/1129.66 c Gap : 0.00 %
1129.25/1129.66 c Root Dual Bound : +0.00000000000000e+00
1129.25/1129.66 c Root Iterations : 0
1129.35/1129.80 c Time complete: 1129.44.