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-2664320-1276274956.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.00/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.00/0.04 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.09/2.12 c 1.9s| 10000 | 7481 | 0 | 0.0 |5546k| 73 | - | 169 |2223 | 0 | 0 | 0 |2209 | 0 | 0.000000e+00 | -- | Inf
5.99/6.09 c 5.7s| 20000 | 13467 | 0 | 0.0 | 10M| 76 | - | 169 |3557 | 0 | 0 | 0 |5634 | 0 | 0.000000e+00 | -- | Inf
10.39/10.40 c 9.8s| 30000 | 19029 | 0 | 0.0 | 14M| 76 | - | 169 |3845 | 0 | 0 | 0 |9337 | 0 | 0.000000e+00 | -- | Inf
15.88/15.92 c 15.1s| 40000 | 23697 | 0 | 0.0 | 18M| 76 | - | 169 |4678 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
22.79/22.85 c 21.8s| 50000 | 27253 | 0 | 0.0 | 22M| 76 | - | 169 |5682 | 0 | 0 | 0 | 19k| 0 | 0.000000e+00 | -- | Inf
32.78/32.81 c 31.4s| 60000 | 28833 | 0 | 0.0 | 25M| 76 | - | 169 |5551 | 0 | 0 | 0 | 26k| 0 | 0.000000e+00 | -- | Inf
41.08/41.15 c 39.6s| 70000 | 32132 | 0 | 0.0 | 29M| 76 | - | 169 |6405 | 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
51.87/51.91 c 50.0s| 80000 | 34399 | 0 | 0.0 | 33M| 76 | - | 169 |7867 | 0 | 0 | 0 | 38k| 0 | 0.000000e+00 | -- | Inf
65.27/65.30 c 63.2s| 90000 | 35775 | 0 | 0.0 | 36M| 76 | - | 169 |8952 | 0 | 0 | 0 | 45k| 0 | 0.000000e+00 | -- | Inf
80.86/80.90 c 78.5s|100000 | 36289 | 0 | 0.0 | 39M| 76 | - | 169 |9847 | 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
98.75/98.89 c 96.2s|110000 | 36110 | 0 | 0.0 | 42M| 76 | - | 169 | 10k| 0 | 0 | 0 | 61k| 0 | 0.000000e+00 | -- | Inf
119.86/119.90 c 117s|120000 | 34961 | 0 | 0.0 | 43M| 76 | - | 169 | 11k| 0 | 0 | 0 | 71k| 0 | 0.000000e+00 | -- | Inf
144.55/144.68 c 141s|130000 | 32642 | 0 | 0.0 | 43M| 76 | - | 169 | 13k| 0 | 0 | 0 | 81k| 0 | 0.000000e+00 | -- | Inf
174.04/174.18 c 170s|140000 | 29428 | 0 | 0.0 | 44M| 76 | - | 169 | 14k| 0 | 0 | 0 | 92k| 0 | 0.000000e+00 | -- | Inf
209.42/209.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
209.42/209.58 c 206s|150000 | 25142 | 0 | 0.0 | 43M| 76 | - | 169 | 16k| 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
252.81/252.97 c 248s|160000 | 19201 | 0 | 0.0 | 39M| 76 | - | 169 | 19k| 0 | 0 | 0 | 116k| 0 | 0.000000e+00 | -- | Inf
306.09/306.28 c 301s|170000 | 10969 | 0 | 0.0 | 30M| 76 | - | 169 | 21k| 0 | 0 | 0 | 130k| 0 | 0.000000e+00 | -- | Inf
360.17/360.36 c
360.17/360.36 c SCIP Status : problem is solved [infeasible]
360.17/360.36 c Solving Time (sec) : 355.05
360.17/360.36 c Solving Nodes : 177230
360.17/360.36 c Primal Bound : +1.00000000000000e+20 (0 solutions)
360.17/360.36 c Dual Bound : +1.00000000000000e+20
360.17/360.36 c Gap : 0.00 %
360.17/360.36 s UNSATISFIABLE
360.17/360.36 c SCIP Status : problem is solved [infeasible]
360.17/360.36 c Solving Time : 355.05
360.17/360.36 c Original Problem :
360.17/360.36 c Problem name : HOME/instance-2664320-1276274956.opb
360.17/360.36 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
360.17/360.36 c Constraints : 101 initial, 101 maximal
360.17/360.36 c Presolved Problem :
360.17/360.36 c Problem name : t_HOME/instance-2664320-1276274956.opb
360.17/360.36 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
360.17/360.36 c Constraints : 73 initial, 25010 maximal
360.17/360.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
360.17/360.36 c trivial : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c implics : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c probing : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c knapsack : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c setppc : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c linear : 0.00 0 0 0 0 0 28 0 0
360.17/360.36 c logicor : 0.00 0 0 0 0 0 0 0 0
360.17/360.36 c root node : - 0 - - 0 - - - -
360.17/360.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
360.17/360.36 c integral : 0 0 0 0 0 0 0 0 0 0
360.17/360.36 c knapsack : 1 0 603790 0 110256 13545 1838434 0 0 0
360.17/360.36 c setppc : 68 0 590245 0 110256 81909 1263099 0 0 0
360.17/360.36 c logicor : 4+ 0 245496 0 26158 1014 91952 0 0 0
360.17/360.36 c countsols : 0 0 0 0 110256 0 0 0 0 0
360.17/360.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
360.17/360.36 c integral : 0.00 0.00 0.00 0.00 0.00
360.17/360.36 c knapsack : 38.55 0.00 37.70 0.00 0.85
360.17/360.36 c setppc : 12.14 0.00 10.65 0.00 1.49
360.17/360.36 c logicor : 155.62 0.00 155.59 0.00 0.03
360.17/360.36 c countsols : 0.02 0.00 0.00 0.00 0.02
360.17/360.36 c Propagators : Time Calls Cutoffs DomReds
360.17/360.36 c vbounds : 0.38 1 0 0
360.17/360.36 c rootredcost : 0.33 0 0 0
360.17/360.36 c pseudoobj : 0.25 0 0 0
360.17/360.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
360.17/360.36 c propagation : 5.27 96468 96458 473608 18.4 2345 22.1 -
360.17/360.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
360.17/360.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
360.17/360.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
360.17/360.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
360.17/360.36 c applied globally : - - - 142930 13.9 - - -
360.17/360.36 c applied locally : - - - 927 34.9 - - -
360.17/360.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
360.17/360.36 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
360.17/360.36 c redcost : 0.00 0 0 0 0 0
360.17/360.36 c impliedbounds : 0.00 0 0 0 0 0
360.17/360.36 c intobj : 0.00 0 0 0 0 0
360.17/360.36 c cgmip : 0.00 0 0 0 0 0
360.17/360.36 c gomory : 0.00 0 0 0 0 0
360.17/360.36 c strongcg : 0.00 0 0 0 0 0
360.17/360.36 c cmir : 0.00 0 0 0 0 0
360.17/360.36 c flowcover : 0.00 0 0 0 0 0
360.17/360.36 c clique : 0.00 0 0 0 0 0
360.17/360.36 c zerohalf : 0.00 0 0 0 0 0
360.17/360.36 c mcf : 0.00 0 0 0 0 0
360.17/360.36 c rapidlearning : 0.00 0 0 0 0 0
360.17/360.36 c Pricers : Time Calls Vars
360.17/360.36 c problem variables: 0.00 0 0
360.17/360.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
360.17/360.36 c relpscost : 0.00 0 0 0 0 0 0
360.17/360.36 c pscost : 0.00 0 0 0 0 0 0
360.17/360.36 c inference : 1.31 110256 0 0 0 0 220512
360.17/360.36 c mostinf : 0.00 0 0 0 0 0 0
360.17/360.36 c leastinf : 0.00 0 0 0 0 0 0
360.17/360.36 c fullstrong : 0.00 0 0 0 0 0 0
360.17/360.36 c allfullstrong : 0.00 0 0 0 0 0 0
360.17/360.36 c random : 0.00 0 0 0 0 0 0
360.17/360.36 c Primal Heuristics : Time Calls Found
360.17/360.36 c LP solutions : 0.00 - 0
360.17/360.36 c pseudo solutions : 0.00 - 0
360.17/360.36 c trivial : 0.01 1 0
360.17/360.36 c simplerounding : 0.00 0 0
360.17/360.36 c zirounding : 0.00 0 0
360.17/360.36 c rounding : 0.00 0 0
360.17/360.36 c shifting : 0.00 0 0
360.17/360.36 c intshifting : 0.00 0 0
360.17/360.36 c oneopt : 0.00 0 0
360.17/360.36 c twoopt : 0.00 0 0
360.17/360.36 c fixandinfer : 0.00 0 0
360.17/360.36 c feaspump : 0.00 0 0
360.17/360.36 c coefdiving : 0.00 0 0
360.17/360.36 c pscostdiving : 0.00 0 0
360.17/360.36 c fracdiving : 0.00 0 0
360.17/360.36 c veclendiving : 0.00 0 0
360.17/360.36 c intdiving : 0.00 0 0
360.17/360.36 c actconsdiving : 0.00 0 0
360.17/360.36 c objpscostdiving : 0.00 0 0
360.17/360.36 c rootsoldiving : 0.00 0 0
360.17/360.36 c linesearchdiving : 0.00 0 0
360.17/360.36 c guideddiving : 0.00 0 0
360.17/360.36 c octane : 0.00 0 0
360.17/360.36 c rens : 0.00 0 0
360.17/360.36 c rins : 0.00 0 0
360.17/360.36 c localbranching : 0.00 0 0
360.17/360.36 c mutation : 0.00 0 0
360.17/360.36 c crossover : 0.00 0 0
360.17/360.36 c dins : 0.00 0 0
360.17/360.36 c undercover : 0.00 0 0
360.17/360.36 c nlp : 0.00 0 0
360.17/360.36 c trysol : 0.00 0 0
360.17/360.36 c LP : Time Calls Iterations Iter/call Iter/sec
360.17/360.36 c primal LP : 0.00 0 0 0.00 -
360.17/360.36 c dual LP : 0.00 0 0 0.00 -
360.17/360.36 c lex dual LP : 0.00 0 0 0.00 -
360.17/360.36 c barrier LP : 0.00 0 0 0.00 -
360.17/360.36 c diving/probing LP: 0.00 0 0 0.00 -
360.17/360.36 c strong branching : 0.00 0 0 0.00 -
360.17/360.36 c (at root node) : - 0 0 0.00 -
360.17/360.36 c conflict analysis: 0.00 0 0 0.00 -
360.17/360.36 c B&B Tree :
360.17/360.36 c number of runs : 1
360.17/360.36 c nodes : 177230
360.17/360.36 c nodes (total) : 177230
360.17/360.36 c nodes left : 0
360.17/360.36 c max depth : 76
360.17/360.36 c max depth (total): 76
360.17/360.36 c backtracks : 72002 (40.6%)
360.17/360.36 c delayed cutoffs : 43283
360.17/360.36 c repropagations : 234217 (848429 domain reductions, 29494 cutoffs)
360.17/360.36 c avg switch length: 21.14
360.17/360.36 c switching time : 101.30
360.17/360.36 c Solution :
360.17/360.36 c Solutions found : 0 (0 improvements)
360.17/360.36 c Primal Bound : infeasible
360.17/360.36 c Dual Bound : -
360.17/360.36 c Gap : 0.00 %
360.17/360.36 c Root Dual Bound : +0.00000000000000e+00
360.17/360.36 c Root Iterations : 0
360.27/360.43 c Time complete: 360.31.