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-2664363-1276278671.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.03/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.10/2.14 c 1.9s| 10000 | 7534 | 0 | 0.0 |5718k| 69 | - | 169 |2240 | 0 | 0 | 0 |2234 | 0 | 0.000000e+00 | -- | Inf
5.99/6.02 c 5.6s| 20000 | 13619 | 0 | 0.0 | 10M| 70 | - | 169 |3600 | 0 | 0 | 0 |5539 | 0 | 0.000000e+00 | -- | Inf
9.90/9.95 c 9.3s| 30000 | 19725 | 0 | 0.0 | 14M| 70 | - | 169 |4102 | 0 | 0 | 0 |8809 | 0 | 0.000000e+00 | -- | Inf
15.09/15.14 c 14.3s| 40000 | 24934 | 0 | 0.0 | 18M| 70 | - | 169 |5201 | 0 | 0 | 0 | 12k| 0 | 0.000000e+00 | -- | Inf
22.18/22.23 c 21.1s| 50000 | 28949 | 0 | 0.0 | 23M| 70 | - | 169 |6769 | 0 | 0 | 0 | 18k| 0 | 0.000000e+00 | -- | Inf
32.08/32.18 c 30.8s| 60000 | 31462 | 0 | 0.0 | 27M| 70 | - | 169 |8540 | 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
44.18/44.27 c 42.6s| 70000 | 33805 | 0 | 0.0 | 30M| 74 | - | 169 |7167 | 0 | 0 | 0 | 31k| 0 | 0.000000e+00 | -- | Inf
55.38/55.43 c 53.5s| 80000 | 36521 | 0 | 0.0 | 34M| 74 | - | 169 |8132 | 0 | 0 | 0 | 37k| 0 | 0.000000e+00 | -- | Inf
67.97/68.03 c 65.8s| 90000 | 38890 | 0 | 0.0 | 38M| 74 | - | 169 |9485 | 0 | 0 | 0 | 43k| 0 | 0.000000e+00 | -- | Inf
82.16/82.25 c 79.8s|100000 | 40845 | 0 | 0.0 | 41M| 74 | - | 169 | 10k| 0 | 0 | 0 | 50k| 0 | 0.000000e+00 | -- | Inf
98.76/98.86 c 96.1s|110000 | 42142 | 0 | 0.0 | 45M| 74 | - | 169 | 11k| 0 | 0 | 0 | 57k| 0 | 0.000000e+00 | -- | Inf
116.16/116.24 c 113s|120000 | 43427 | 0 | 0.0 | 48M| 74 | - | 169 | 12k| 0 | 0 | 0 | 65k| 0 | 0.000000e+00 | -- | Inf
135.27/135.36 c 132s|130000 | 44366 | 0 | 0.0 | 51M| 74 | - | 169 | 13k| 0 | 0 | 0 | 73k| 0 | 0.000000e+00 | -- | Inf
157.25/157.36 c 154s|140000 | 44457 | 0 | 0.0 | 53M| 74 | - | 169 | 15k| 0 | 0 | 0 | 82k| 0 | 0.000000e+00 | -- | Inf
185.14/185.24 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
185.14/185.24 c 181s|150000 | 43187 | 0 | 0.0 | 55M| 74 | - | 169 | 17k| 0 | 0 | 0 | 91k| 0 | 0.000000e+00 | -- | Inf
221.93/222.00 c 218s|160000 | 40669 | 0 | 0.0 | 54M| 74 | - | 169 | 15k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
259.02/259.16 c 254s|170000 | 37518 | 0 | 0.0 | 54M| 74 | - | 169 | 16k| 0 | 0 | 0 | 112k| 0 | 0.000000e+00 | -- | Inf
297.81/297.96 c 293s|180000 | 33695 | 0 | 0.0 | 53M| 74 | - | 169 | 18k| 0 | 0 | 0 | 123k| 0 | 0.000000e+00 | -- | Inf
338.71/338.88 c 333s|190000 | 29884 | 0 | 0.0 | 52M| 74 | - | 169 | 21k| 0 | 0 | 0 | 134k| 0 | 0.000000e+00 | -- | Inf
381.79/381.97 c 376s|200000 | 25868 | 0 | 0.0 | 50M| 74 | - | 169 | 23k| 0 | 0 | 0 | 146k| 0 | 0.000000e+00 | -- | Inf
411.48/411.68 c * 405s|206048 | 0 | 0 | 0.0 | 10M| 74 | - | 169 | 24k| 0 | 0 | 0 | 153k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
411.48/411.69 c
411.48/411.69 c SCIP Status : problem is solved [optimal solution found]
411.48/411.69 c Solving Time (sec) : 405.50
411.48/411.69 c Solving Nodes : 206048
411.48/411.69 c Primal Bound : +0.00000000000000e+00 (1 solutions)
411.48/411.69 c Dual Bound : +0.00000000000000e+00
411.48/411.69 c Gap : 0.00 %
411.48/411.70 s SATISFIABLE
411.48/411.70 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
411.48/411.70 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
411.48/411.70 v -x126 -x125 -x124 -x123 -x122 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
411.48/411.70 v x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 -x83 -x82
411.48/411.70 v -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 x58 -x57 -x56
411.48/411.70 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
411.48/411.70 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
411.48/411.70 v -x4 x3 -x2 -x1
411.48/411.70 c SCIP Status : problem is solved [optimal solution found]
411.48/411.70 c Solving Time : 405.50
411.48/411.70 c Original Problem :
411.48/411.70 c Problem name : HOME/instance-2664363-1276278671.opb
411.48/411.70 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
411.48/411.70 c Constraints : 101 initial, 101 maximal
411.48/411.70 c Presolved Problem :
411.48/411.70 c Problem name : t_HOME/instance-2664363-1276278671.opb
411.48/411.70 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
411.48/411.70 c Constraints : 73 initial, 24943 maximal
411.48/411.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
411.48/411.70 c trivial : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c implics : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c probing : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c knapsack : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c setppc : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c linear : 0.01 0 0 0 0 0 28 0 0
411.48/411.70 c logicor : 0.00 0 0 0 0 0 0 0 0
411.48/411.70 c root node : - 0 - - 0 - - - -
411.48/411.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
411.48/411.70 c integral : 0 0 0 0 0 0 0 0 0 0
411.48/411.70 c knapsack : 1 0 659772 0 136232 16969 1638384 0 0 0
411.48/411.70 c setppc : 68 0 642802 0 136232 85744 1580544 0 0 0
411.48/411.70 c logicor : 4+ 0 299132 0 42793 1562 114275 0 0 0
411.48/411.70 c countsols : 0 0 0 0 136233 0 0 0 0 0
411.48/411.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
411.48/411.70 c integral : 0.00 0.00 0.00 0.00 0.00
411.48/411.70 c knapsack : 43.19 0.00 42.09 0.00 1.10
411.48/411.70 c setppc : 15.96 0.00 14.19 0.00 1.77
411.48/411.70 c logicor : 183.30 0.00 183.26 0.00 0.04
411.48/411.70 c countsols : 0.13 0.00 0.00 0.00 0.13
411.48/411.70 c Propagators : Time Calls Cutoffs DomReds
411.48/411.70 c vbounds : 0.26 1 0 0
411.48/411.70 c rootredcost : 0.44 0 0 0
411.48/411.70 c pseudoobj : 0.19 0 0 0
411.48/411.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
411.48/411.70 c propagation : 6.61 104275 104262 526978 20.1 2823 21.7 -
411.48/411.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
411.48/411.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
411.48/411.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
411.48/411.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
411.48/411.70 c applied globally : - - - 152346 14.6 - - -
411.48/411.70 c applied locally : - - - 1240 34.8 - - -
411.48/411.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
411.48/411.70 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
411.48/411.70 c redcost : 0.00 0 0 0 0 0
411.48/411.70 c impliedbounds : 0.00 0 0 0 0 0
411.48/411.70 c intobj : 0.00 0 0 0 0 0
411.48/411.70 c cgmip : 0.00 0 0 0 0 0
411.48/411.70 c gomory : 0.00 0 0 0 0 0
411.48/411.70 c strongcg : 0.00 0 0 0 0 0
411.48/411.70 c cmir : 0.00 0 0 0 0 0
411.48/411.70 c flowcover : 0.00 0 0 0 0 0
411.48/411.70 c clique : 0.00 0 0 0 0 0
411.48/411.70 c zerohalf : 0.00 0 0 0 0 0
411.48/411.70 c mcf : 0.00 0 0 0 0 0
411.48/411.70 c rapidlearning : 0.00 0 0 0 0 0
411.48/411.70 c Pricers : Time Calls Vars
411.48/411.70 c problem variables: 0.00 0 0
411.48/411.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
411.48/411.70 c relpscost : 0.00 0 0 0 0 0 0
411.48/411.70 c pscost : 0.00 0 0 0 0 0 0
411.48/411.70 c inference : 1.93 136232 0 0 0 0 272464
411.48/411.70 c mostinf : 0.00 0 0 0 0 0 0
411.48/411.70 c leastinf : 0.00 0 0 0 0 0 0
411.48/411.70 c fullstrong : 0.00 0 0 0 0 0 0
411.48/411.70 c allfullstrong : 0.00 0 0 0 0 0 0
411.48/411.70 c random : 0.00 0 0 0 0 0 0
411.48/411.70 c Primal Heuristics : Time Calls Found
411.48/411.70 c LP solutions : 0.00 - 0
411.48/411.70 c pseudo solutions : 0.15 - 1
411.48/411.70 c trivial : 0.00 1 0
411.48/411.70 c simplerounding : 0.00 0 0
411.48/411.70 c zirounding : 0.00 0 0
411.48/411.70 c rounding : 0.00 0 0
411.48/411.70 c shifting : 0.00 0 0
411.48/411.70 c intshifting : 0.00 0 0
411.48/411.70 c oneopt : 0.00 0 0
411.48/411.70 c twoopt : 0.00 0 0
411.48/411.70 c fixandinfer : 0.00 0 0
411.48/411.70 c feaspump : 0.00 0 0
411.48/411.70 c coefdiving : 0.00 0 0
411.48/411.70 c pscostdiving : 0.00 0 0
411.48/411.70 c fracdiving : 0.00 0 0
411.48/411.70 c veclendiving : 0.00 0 0
411.48/411.70 c intdiving : 0.00 0 0
411.48/411.70 c actconsdiving : 0.00 0 0
411.48/411.70 c objpscostdiving : 0.00 0 0
411.48/411.70 c rootsoldiving : 0.00 0 0
411.48/411.70 c linesearchdiving : 0.00 0 0
411.48/411.70 c guideddiving : 0.00 0 0
411.48/411.70 c octane : 0.00 0 0
411.48/411.70 c rens : 0.00 0 0
411.48/411.70 c rins : 0.00 0 0
411.48/411.70 c localbranching : 0.00 0 0
411.58/411.70 c mutation : 0.00 0 0
411.58/411.70 c crossover : 0.00 0 0
411.58/411.70 c dins : 0.00 0 0
411.58/411.70 c undercover : 0.00 0 0
411.58/411.70 c nlp : 0.00 0 0
411.58/411.70 c trysol : 0.00 0 0
411.58/411.70 c LP : Time Calls Iterations Iter/call Iter/sec
411.58/411.70 c primal LP : 0.00 0 0 0.00 -
411.58/411.70 c dual LP : 0.00 0 0 0.00 -
411.58/411.70 c lex dual LP : 0.00 0 0 0.00 -
411.58/411.70 c barrier LP : 0.00 0 0 0.00 -
411.58/411.70 c diving/probing LP: 0.00 0 0 0.00 -
411.58/411.70 c strong branching : 0.00 0 0 0.00 -
411.58/411.70 c (at root node) : - 0 0 0.00 -
411.58/411.70 c conflict analysis: 0.00 0 0 0.00 -
411.58/411.70 c B&B Tree :
411.58/411.70 c number of runs : 1
411.58/411.70 c nodes : 206048
411.58/411.70 c nodes (total) : 206048
411.58/411.70 c nodes left : 0
411.58/411.70 c max depth : 74
411.58/411.70 c max depth (total): 74
411.58/411.70 c backtracks : 72354 (35.1%)
411.58/411.70 c delayed cutoffs : 43499
411.58/411.70 c repropagations : 218415 (921252 domain reductions, 34460 cutoffs)
411.58/411.70 c avg switch length: 18.55
411.58/411.70 c switching time : 110.12
411.58/411.70 c Solution :
411.58/411.70 c Solutions found : 1 (1 improvements)
411.58/411.70 c First Solution : +0.00000000000000e+00 (in run 1, after 206048 nodes, 405.33 seconds, depth 38, found by <relaxation>)
411.58/411.70 c Primal Bound : +0.00000000000000e+00 (in run 1, after 206048 nodes, 405.33 seconds, depth 38, found by <relaxation>)
411.58/411.70 c Dual Bound : +0.00000000000000e+00
411.58/411.70 c Gap : 0.00 %
411.58/411.70 c Root Dual Bound : +0.00000000000000e+00
411.58/411.70 c Root Iterations : 0
411.58/411.77 c Time complete: 411.65.