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-2664314-1276274541.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.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.19/2.21 c 2.0s| 10000 | 7329 | 0 | 0.0 |5713k| 77 | - | 169 |2380 | 0 | 0 | 0 |2397 | 0 | 0.000000e+00 | -- | Inf
6.38/6.48 c 6.1s| 20000 | 12813 | 0 | 0.0 | 10M| 77 | - | 169 |3524 | 0 | 0 | 0 |6250 | 0 | 0.000000e+00 | -- | Inf
11.19/11.20 c 10.6s| 30000 | 17857 | 0 | 0.0 | 14M| 77 | - | 169 |4100 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
17.39/17.48 c 16.6s| 40000 | 21602 | 0 | 0.0 | 18M| 77 | - | 169 |5104 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
25.68/25.79 c 24.6s| 50000 | 24061 | 0 | 0.0 | 22M| 77 | - | 169 |6311 | 0 | 0 | 0 | 22k| 0 | 0.000000e+00 | -- | Inf
35.78/35.81 c 34.4s| 60000 | 26124 | 0 | 0.0 | 25M| 77 | - | 169 |6805 | 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
47.07/47.12 c 45.4s| 70000 | 28167 | 0 | 0.0 | 29M| 77 | - | 169 |8622 | 0 | 0 | 0 | 35k| 0 | 0.000000e+00 | -- | Inf
60.87/60.94 c 59.0s| 80000 | 29482 | 0 | 0.0 | 32M| 77 | - | 169 |9782 | 0 | 0 | 0 | 43k| 0 | 0.000000e+00 | -- | Inf
76.46/76.55 c 74.3s| 90000 | 29915 | 0 | 0.0 | 35M| 77 | - | 169 | 10k| 0 | 0 | 0 | 51k| 0 | 0.000000e+00 | -- | Inf
94.36/94.46 c 91.8s|100000 | 29321 | 0 | 0.0 | 37M| 77 | - | 169 | 11k| 0 | 0 | 0 | 60k| 0 | 0.000000e+00 | -- | Inf
115.66/115.78 c 113s|110000 | 28126 | 0 | 0.0 | 38M| 77 | - | 169 | 12k| 0 | 0 | 0 | 70k| 0 | 0.000000e+00 | -- | Inf
143.44/143.55 c 140s|120000 | 24866 | 0 | 0.0 | 37M| 77 | - | 169 | 13k| 0 | 0 | 0 | 81k| 0 | 0.000000e+00 | -- | Inf
172.44/172.54 c 169s|130000 | 21909 | 0 | 0.0 | 37M| 77 | - | 169 | 16k| 0 | 0 | 0 | 91k| 0 | 0.000000e+00 | -- | Inf
208.02/208.12 c 204s|140000 | 17182 | 0 | 0.0 | 35M| 77 | - | 169 | 19k| 0 | 0 | 0 | 104k| 0 | 0.000000e+00 | -- | Inf
256.22/256.36 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
256.22/256.36 c 252s|150000 | 9532 | 0 | 0.0 | 26M| 77 | - | 169 | 21k| 0 | 0 | 0 | 118k| 0 | 0.000000e+00 | -- | Inf
302.30/302.46 c
302.30/302.46 c SCIP Status : problem is solved [infeasible]
302.30/302.46 c Solving Time (sec) : 297.62
302.30/302.46 c Solving Nodes : 156717
302.30/302.46 c Primal Bound : +1.00000000000000e+20 (0 solutions)
302.30/302.46 c Dual Bound : +1.00000000000000e+20
302.30/302.46 c Gap : 0.00 %
302.30/302.46 s UNSATISFIABLE
302.30/302.46 c SCIP Status : problem is solved [infeasible]
302.30/302.46 c Solving Time : 297.62
302.30/302.46 c Original Problem :
302.30/302.46 c Problem name : HOME/instance-2664314-1276274541.opb
302.30/302.46 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
302.30/302.46 c Constraints : 101 initial, 101 maximal
302.30/302.46 c Presolved Problem :
302.30/302.46 c Problem name : t_HOME/instance-2664314-1276274541.opb
302.30/302.46 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
302.30/302.46 c Constraints : 73 initial, 26493 maximal
302.30/302.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
302.30/302.46 c trivial : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c implics : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c probing : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c knapsack : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c setppc : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c linear : 0.00 0 0 0 0 0 28 0 0
302.30/302.46 c logicor : 0.00 0 0 0 0 0 0 0 0
302.30/302.46 c root node : - 0 - - 0 - - - -
302.30/302.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
302.30/302.46 c integral : 0 0 0 0 0 0 0 0 0 0
302.30/302.46 c knapsack : 1 0 529773 0 97786 12084 1689314 0 0 0
302.30/302.46 c setppc : 68 0 517689 0 97786 73438 1162024 0 0 0
302.30/302.46 c logicor : 4+ 0 221794 0 24708 1014 84051 0 0 0
302.30/302.46 c countsols : 0 0 0 0 97786 0 0 0 0 0
302.30/302.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
302.30/302.46 c integral : 0.00 0.00 0.00 0.00 0.00
302.30/302.46 c knapsack : 34.40 0.00 33.70 0.00 0.70
302.30/302.46 c setppc : 11.49 0.00 9.72 0.00 1.77
302.30/302.46 c logicor : 131.02 0.00 131.01 0.00 0.01
302.30/302.46 c countsols : 0.02 0.00 0.00 0.00 0.02
302.30/302.46 c Propagators : Time Calls Cutoffs DomReds
302.30/302.46 c vbounds : 0.17 1 0 0
302.30/302.46 c rootredcost : 0.19 0 0 0
302.30/302.46 c pseudoobj : 0.16 0 0 0
302.30/302.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
302.30/302.46 c propagation : 4.81 86536 86519 428291 18.3 2350 21.4 -
302.30/302.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
302.30/302.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
302.30/302.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
302.30/302.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
302.30/302.46 c applied globally : - - - 129606 13.6 - - -
302.30/302.46 c applied locally : - - - 791 34.2 - - -
302.30/302.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
302.30/302.46 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
302.30/302.46 c redcost : 0.00 0 0 0 0 0
302.30/302.46 c impliedbounds : 0.00 0 0 0 0 0
302.30/302.46 c intobj : 0.00 0 0 0 0 0
302.30/302.46 c cgmip : 0.00 0 0 0 0 0
302.30/302.46 c gomory : 0.00 0 0 0 0 0
302.30/302.46 c strongcg : 0.00 0 0 0 0 0
302.30/302.46 c cmir : 0.00 0 0 0 0 0
302.30/302.46 c flowcover : 0.00 0 0 0 0 0
302.30/302.46 c clique : 0.00 0 0 0 0 0
302.30/302.46 c zerohalf : 0.00 0 0 0 0 0
302.30/302.46 c mcf : 0.00 0 0 0 0 0
302.30/302.46 c rapidlearning : 0.00 0 0 0 0 0
302.30/302.46 c Pricers : Time Calls Vars
302.30/302.46 c problem variables: 0.00 0 0
302.30/302.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
302.30/302.46 c relpscost : 0.00 0 0 0 0 0 0
302.30/302.46 c pscost : 0.00 0 0 0 0 0 0
302.30/302.46 c inference : 1.37 97786 0 0 0 0 195572
302.30/302.46 c mostinf : 0.00 0 0 0 0 0 0
302.30/302.46 c leastinf : 0.00 0 0 0 0 0 0
302.30/302.46 c fullstrong : 0.00 0 0 0 0 0 0
302.30/302.46 c allfullstrong : 0.00 0 0 0 0 0 0
302.30/302.46 c random : 0.00 0 0 0 0 0 0
302.30/302.46 c Primal Heuristics : Time Calls Found
302.30/302.46 c LP solutions : 0.00 - 0
302.30/302.46 c pseudo solutions : 0.00 - 0
302.30/302.46 c trivial : 0.01 1 0
302.30/302.46 c simplerounding : 0.00 0 0
302.30/302.46 c zirounding : 0.00 0 0
302.30/302.46 c rounding : 0.00 0 0
302.30/302.47 c shifting : 0.00 0 0
302.30/302.47 c intshifting : 0.00 0 0
302.30/302.47 c oneopt : 0.00 0 0
302.30/302.47 c twoopt : 0.00 0 0
302.30/302.47 c fixandinfer : 0.00 0 0
302.30/302.47 c feaspump : 0.00 0 0
302.30/302.47 c coefdiving : 0.00 0 0
302.30/302.47 c pscostdiving : 0.00 0 0
302.30/302.47 c fracdiving : 0.00 0 0
302.30/302.47 c veclendiving : 0.00 0 0
302.30/302.47 c intdiving : 0.00 0 0
302.30/302.47 c actconsdiving : 0.00 0 0
302.30/302.47 c objpscostdiving : 0.00 0 0
302.30/302.47 c rootsoldiving : 0.00 0 0
302.30/302.47 c linesearchdiving : 0.00 0 0
302.30/302.47 c guideddiving : 0.00 0 0
302.30/302.47 c octane : 0.00 0 0
302.30/302.47 c rens : 0.00 0 0
302.30/302.47 c rins : 0.00 0 0
302.30/302.47 c localbranching : 0.00 0 0
302.30/302.47 c mutation : 0.00 0 0
302.30/302.47 c crossover : 0.00 0 0
302.30/302.47 c dins : 0.00 0 0
302.30/302.47 c undercover : 0.00 0 0
302.30/302.47 c nlp : 0.00 0 0
302.30/302.47 c trysol : 0.00 0 0
302.30/302.47 c LP : Time Calls Iterations Iter/call Iter/sec
302.30/302.47 c primal LP : 0.00 0 0 0.00 -
302.30/302.47 c dual LP : 0.00 0 0 0.00 -
302.30/302.47 c lex dual LP : 0.00 0 0 0.00 -
302.30/302.47 c barrier LP : 0.00 0 0 0.00 -
302.30/302.47 c diving/probing LP: 0.00 0 0 0.00 -
302.30/302.47 c strong branching : 0.00 0 0 0.00 -
302.30/302.47 c (at root node) : - 0 0 0.00 -
302.30/302.47 c conflict analysis: 0.00 0 0 0.00 -
302.30/302.47 c B&B Tree :
302.30/302.47 c number of runs : 1
302.30/302.47 c nodes : 156717
302.30/302.47 c nodes (total) : 156717
302.30/302.47 c nodes left : 0
302.30/302.47 c max depth : 77
302.30/302.47 c max depth (total): 77
302.30/302.47 c backtracks : 63188 (40.3%)
302.30/302.47 c delayed cutoffs : 38856
302.30/302.47 c repropagations : 194127 (814936 domain reductions, 27605 cutoffs)
302.30/302.47 c avg switch length: 20.23
302.30/302.47 c switching time : 82.63
302.30/302.47 c Solution :
302.30/302.47 c Solutions found : 0 (0 improvements)
302.30/302.47 c Primal Bound : infeasible
302.30/302.47 c Dual Bound : -
302.30/302.47 c Gap : 0.00 %
302.30/302.47 c Root Dual Bound : +0.00000000000000e+00
302.30/302.47 c Root Iterations : 0
302.40/302.54 c Time complete: 302.43.