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-2664295-1276272743.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.29/2.35 c 2.1s| 10000 | 7130 | 0 | 0.0 |5818k| 74 | - | 169 |2596 | 0 | 0 | 0 |2624 | 0 | 0.000000e+00 | -- | Inf
6.69/6.76 c 6.3s| 20000 | 12463 | 0 | 0.0 | 10M| 74 | - | 169 |3550 | 0 | 0 | 0 |6575 | 0 | 0.000000e+00 | -- | Inf
11.79/11.85 c 11.2s| 30000 | 17356 | 0 | 0.0 | 14M| 74 | - | 169 |5601 | 0 | 0 | 0 | 11k| 0 | 0.000000e+00 | -- | Inf
19.38/19.49 c 18.6s| 40000 | 20910 | 0 | 0.0 | 19M| 74 | - | 169 |7076 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
30.69/30.80 c 29.6s| 50000 | 22142 | 0 | 0.0 | 22M| 74 | - | 169 |8269 | 0 | 0 | 0 | 24k| 0 | 0.000000e+00 | -- | Inf
41.18/41.27 c 39.8s| 60000 | 25202 | 0 | 0.0 | 26M| 74 | - | 169 |7436 | 0 | 0 | 0 | 30k| 0 | 0.000000e+00 | -- | Inf
52.69/52.73 c 51.0s| 70000 | 27811 | 0 | 0.0 | 29M| 74 | - | 169 |9680 | 0 | 0 | 0 | 37k| 0 | 0.000000e+00 | -- | Inf
67.48/67.51 c 65.5s| 80000 | 29268 | 0 | 0.0 | 33M| 74 | - | 169 | 11k| 0 | 0 | 0 | 44k| 0 | 0.000000e+00 | -- | Inf
85.68/85.77 c 83.5s| 90000 | 29697 | 0 | 0.0 | 36M| 74 | - | 169 | 13k| 0 | 0 | 0 | 52k| 0 | 0.000000e+00 | -- | Inf
106.87/106.92 c 104s|100000 | 29570 | 0 | 0.0 | 38M| 74 | - | 169 | 15k| 0 | 0 | 0 | 61k| 0 | 0.000000e+00 | -- | Inf
136.16/136.29 c 133s|110000 | 26875 | 0 | 0.0 | 38M| 74 | - | 169 | 16k| 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
169.06/169.10 c 166s|120000 | 24527 | 0 | 0.0 | 39M| 74 | - | 169 | 16k| 0 | 0 | 0 | 83k| 0 | 0.000000e+00 | -- | Inf
205.94/206.03 c 202s|130000 | 20865 | 0 | 0.0 | 38M| 74 | - | 169 | 19k| 0 | 0 | 0 | 95k| 0 | 0.000000e+00 | -- | Inf
248.13/248.24 c 244s|140000 | 15776 | 0 | 0.0 | 36M| 74 | - | 169 | 22k| 0 | 0 | 0 | 107k| 0 | 0.000000e+00 | -- | Inf
311.92/312.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
311.92/312.07 c 307s|150000 | 6277 | 0 | 0.0 | 24M| 74 | - | 169 | 25k| 0 | 0 | 0 | 123k| 0 | 0.000000e+00 | -- | Inf
343.51/343.68 c
343.51/343.68 c SCIP Status : problem is solved [infeasible]
343.51/343.68 c Solving Time (sec) : 338.83
343.51/343.68 c Solving Nodes : 153837
343.51/343.68 c Primal Bound : +1.00000000000000e+20 (0 solutions)
343.51/343.68 c Dual Bound : +1.00000000000000e+20
343.51/343.68 c Gap : 0.00 %
343.51/343.68 s UNSATISFIABLE
343.51/343.68 c SCIP Status : problem is solved [infeasible]
343.51/343.68 c Solving Time : 338.83
343.51/343.68 c Original Problem :
343.51/343.68 c Problem name : HOME/instance-2664295-1276272743.opb
343.51/343.68 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
343.51/343.68 c Constraints : 101 initial, 101 maximal
343.51/343.68 c Presolved Problem :
343.51/343.68 c Problem name : t_HOME/instance-2664295-1276272743.opb
343.51/343.68 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
343.51/343.68 c Constraints : 73 initial, 28532 maximal
343.51/343.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
343.51/343.68 c trivial : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c dualfix : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c implics : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c probing : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c knapsack : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c setppc : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c linear : 0.01 0 0 0 0 0 28 0 0
343.51/343.68 c logicor : 0.00 0 0 0 0 0 0 0 0
343.51/343.68 c root node : - 0 - - 0 - - - -
343.51/343.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
343.51/343.68 c integral : 0 0 0 0 0 0 0 0 0 0
343.51/343.68 c knapsack : 1 0 525224 0 96798 12786 1424618 0 0 0
343.51/343.68 c setppc : 68 0 512438 0 96798 71042 1199567 0 0 0
343.51/343.68 c logicor : 4+ 0 227520 0 50371 1363 94489 0 0 0
343.51/343.68 c countsols : 0 0 0 0 96798 0 0 0 0 0
343.51/343.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
343.51/343.68 c integral : 0.00 0.00 0.00 0.00 0.00
343.51/343.68 c knapsack : 35.11 0.00 34.48 0.00 0.63
343.51/343.68 c setppc : 11.78 0.00 10.42 0.00 1.36
343.51/343.68 c logicor : 152.69 0.00 152.67 0.00 0.02
343.51/343.68 c countsols : 0.07 0.00 0.00 0.00 0.07
343.51/343.68 c Propagators : Time Calls Cutoffs DomReds
343.51/343.68 c vbounds : 0.33 1 0 0
343.51/343.68 c rootredcost : 0.36 0 0 0
343.51/343.68 c pseudoobj : 0.27 0 0 0
343.51/343.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
343.51/343.68 c propagation : 4.74 85191 85158 427106 19.3 2306 21.9 -
343.51/343.68 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
343.51/343.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
343.51/343.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
343.51/343.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
343.51/343.68 c applied globally : - - - 129780 14.2 - - -
343.51/343.68 c applied locally : - - - 921 34.4 - - -
343.51/343.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
343.51/343.68 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
343.51/343.68 c redcost : 0.00 0 0 0 0 0
343.51/343.68 c impliedbounds : 0.00 0 0 0 0 0
343.51/343.68 c intobj : 0.00 0 0 0 0 0
343.51/343.68 c cgmip : 0.00 0 0 0 0 0
343.51/343.68 c gomory : 0.00 0 0 0 0 0
343.51/343.68 c strongcg : 0.00 0 0 0 0 0
343.51/343.68 c cmir : 0.00 0 0 0 0 0
343.51/343.68 c flowcover : 0.00 0 0 0 0 0
343.51/343.68 c clique : 0.00 0 0 0 0 0
343.51/343.68 c zerohalf : 0.00 0 0 0 0 0
343.51/343.68 c mcf : 0.00 0 0 0 0 0
343.51/343.68 c rapidlearning : 0.00 0 0 0 0 0
343.51/343.68 c Pricers : Time Calls Vars
343.51/343.68 c problem variables: 0.00 0 0
343.51/343.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
343.51/343.68 c relpscost : 0.00 0 0 0 0 0 0
343.51/343.68 c pscost : 0.00 0 0 0 0 0 0
343.51/343.68 c inference : 1.34 96798 0 0 0 0 193596
343.51/343.68 c mostinf : 0.00 0 0 0 0 0 0
343.51/343.68 c leastinf : 0.00 0 0 0 0 0 0
343.51/343.68 c fullstrong : 0.00 0 0 0 0 0 0
343.51/343.68 c allfullstrong : 0.00 0 0 0 0 0 0
343.51/343.68 c random : 0.00 0 0 0 0 0 0
343.51/343.68 c Primal Heuristics : Time Calls Found
343.51/343.68 c LP solutions : 0.00 - 0
343.51/343.68 c pseudo solutions : 0.00 - 0
343.51/343.68 c trivial : 0.00 1 0
343.51/343.68 c simplerounding : 0.00 0 0
343.51/343.68 c zirounding : 0.00 0 0
343.51/343.68 c rounding : 0.00 0 0
343.51/343.68 c shifting : 0.00 0 0
343.51/343.68 c intshifting : 0.00 0 0
343.51/343.68 c oneopt : 0.00 0 0
343.51/343.68 c twoopt : 0.00 0 0
343.51/343.68 c fixandinfer : 0.00 0 0
343.51/343.68 c feaspump : 0.00 0 0
343.51/343.68 c coefdiving : 0.00 0 0
343.51/343.68 c pscostdiving : 0.00 0 0
343.51/343.68 c fracdiving : 0.00 0 0
343.51/343.68 c veclendiving : 0.00 0 0
343.51/343.68 c intdiving : 0.00 0 0
343.51/343.68 c actconsdiving : 0.00 0 0
343.51/343.68 c objpscostdiving : 0.00 0 0
343.51/343.68 c rootsoldiving : 0.00 0 0
343.51/343.68 c linesearchdiving : 0.00 0 0
343.51/343.68 c guideddiving : 0.00 0 0
343.51/343.68 c octane : 0.00 0 0
343.51/343.68 c rens : 0.00 0 0
343.51/343.68 c rins : 0.00 0 0
343.51/343.68 c localbranching : 0.00 0 0
343.51/343.68 c mutation : 0.00 0 0
343.51/343.68 c crossover : 0.00 0 0
343.51/343.68 c dins : 0.00 0 0
343.51/343.68 c undercover : 0.00 0 0
343.51/343.68 c nlp : 0.00 0 0
343.51/343.68 c trysol : 0.00 0 0
343.51/343.68 c LP : Time Calls Iterations Iter/call Iter/sec
343.51/343.68 c primal LP : 0.00 0 0 0.00 -
343.51/343.68 c dual LP : 0.00 0 0 0.00 -
343.51/343.68 c lex dual LP : 0.00 0 0 0.00 -
343.51/343.68 c barrier LP : 0.00 0 0 0.00 -
343.51/343.68 c diving/probing LP: 0.00 0 0 0.00 -
343.51/343.68 c strong branching : 0.00 0 0 0.00 -
343.51/343.68 c (at root node) : - 0 0 0.00 -
343.51/343.68 c conflict analysis: 0.00 0 0 0.00 -
343.51/343.68 c B&B Tree :
343.51/343.68 c number of runs : 1
343.51/343.68 c nodes : 153837
343.51/343.68 c nodes (total) : 153837
343.51/343.68 c nodes left : 0
343.51/343.68 c max depth : 74
343.51/343.68 c max depth (total): 74
343.51/343.68 c backtracks : 61523 (40.0%)
343.51/343.68 c delayed cutoffs : 39760
343.51/343.68 c repropagations : 187671 (789711 domain reductions, 28152 cutoffs)
343.51/343.68 c avg switch length: 19.62
343.51/343.68 c switching time : 94.09
343.51/343.68 c Solution :
343.51/343.68 c Solutions found : 0 (0 improvements)
343.51/343.68 c Primal Bound : infeasible
343.51/343.68 c Dual Bound : -
343.51/343.68 c Gap : 0.00 %
343.51/343.68 c Root Dual Bound : +0.00000000000000e+00
343.51/343.68 c Root Iterations : 0
343.61/343.76 c Time complete: 343.67.