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-2664323-1276275224.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.03/0.03 c presolving (3 rounds):
0.03/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.03/0.03 c 8 implications, 68 cliques
0.03/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.03/0.03 c 1 constraints of type <knapsack>
0.03/0.03 c 68 constraints of type <setppc>
0.03/0.03 c 4 constraints of type <logicor>
0.03/0.03 c transformed objective value is always integral (scale: 1)
0.03/0.03 c Presolving Time: 0.01
0.03/0.03 c - non default parameters ----------------------------------------------------------------------
0.03/0.03 c # SCIP version 1.2.1.2
0.03/0.03 c
0.03/0.03 c # frequency for displaying node information lines
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.03 c display/freq = 10000
0.03/0.03 c
0.03/0.03 c # maximal time in seconds to run
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.03 c limits/time = 1799.99
0.03/0.03 c
0.03/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.03 c limits/memory = 1620
0.03/0.03 c
0.03/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.03 c limits/solutions = 1
0.03/0.03 c
0.03/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c lp/solvefreq = -1
0.03/0.03 c
0.03/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.03/0.03 c separating/maxrounds = 1
0.03/0.03 c
0.03/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.03 c separating/maxroundsroot = 5
0.03/0.03 c
0.03/0.03 c # should presolving try to simplify inequalities
0.03/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.03 c constraints/linear/simplifyinequalities = TRUE
0.03/0.03 c
0.03/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.03/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.03/0.03 c constraints/knapsack/disaggregation = FALSE
0.03/0.03 c
0.03/0.03 c # should presolving try to simplify knapsacks
0.03/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.03 c
0.03/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.03 c presolving/probing/maxrounds = 0
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/coefdiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.03/0.03 c heuristics/crossover/freq = -1
0.03/0.03 c
0.03/0.03 c # number of nodes added to the contingent of the total nodes
0.03/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.03 c heuristics/crossover/nodesofs = 750
0.03/0.03 c
0.03/0.03 c # number of nodes without incumbent change that heuristic should wait
0.03/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.03/0.03 c heuristics/crossover/nwaitingnodes = 100
0.03/0.03 c
0.03/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.03/0.03 c # [type: real, range: [0,1], default: 0.1]
0.03/0.03 c heuristics/crossover/nodesquot = 0.15
0.03/0.03 c
0.03/0.03 c # minimum percentage of integer variables that have to be fixed
0.03/0.03 c # [type: real, range: [0,1], default: 0.666]
0.03/0.03 c heuristics/crossover/minfixingrate = 0.5
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.03 c heuristics/feaspump/freq = -1
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/fracdiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/guideddiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/intshifting/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/linesearchdiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/nlp/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.03 c heuristics/objpscostdiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.03/0.03 c # [type: real, range: [0,1], default: 0.01]
0.03/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/oneopt/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/pscostdiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.03 c heuristics/rens/freq = -1
0.03/0.03 c
0.03/0.03 c # minimum percentage of integer variables that have to be fixable
0.03/0.03 c # [type: real, range: [0,1], default: 0.5]
0.03/0.03 c heuristics/rens/minfixingrate = 0.3
0.03/0.03 c
0.03/0.03 c # number of nodes added to the contingent of the total nodes
0.03/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.03 c heuristics/rens/nodesofs = 2000
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.03 c heuristics/rootsoldiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.03/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/rounding/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/shifting/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/simplerounding/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.03 c heuristics/trivial/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/trysol/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.03 c heuristics/veclendiving/freq = -1
0.03/0.03 c
0.03/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.03/0.03 c
0.03/0.03 c # additional number of allowed LP iterations
0.03/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.03/0.03 c
0.03/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.03 c heuristics/zirounding/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.03 c separating/cmir/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.03 c separating/flowcover/freq = -1
0.03/0.03 c
0.03/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.03 c separating/rapidlearning/freq = 0
0.03/0.03 c
0.03/0.03 c -----------------------------------------------------------------------------------------------
0.03/0.03 c start solving
0.03/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.69/2.70 c 2.5s| 10000 | 6420 | 0 | 0.0 |5994k| 72 | - | 169 |3037 | 0 | 0 | 0 |3124 | 0 | 0.000000e+00 | -- | Inf
7.19/7.26 c 6.8s| 20000 | 11683 | 0 | 0.0 | 10M| 72 | - | 169 |3710 | 0 | 0 | 0 |7042 | 0 | 0.000000e+00 | -- | Inf
13.59/13.66 c 12.9s| 30000 | 15215 | 0 | 0.0 | 14M| 72 | - | 169 |6144 | 0 | 0 | 0 | 12k| 0 | 0.000000e+00 | -- | Inf
25.19/25.23 c 24.2s| 40000 | 16496 | 0 | 0.0 | 17M| 72 | - | 169 |7216 | 0 | 0 | 0 | 20k| 0 | 0.000000e+00 | -- | Inf
38.39/38.42 c 37.1s| 50000 | 17197 | 0 | 0.0 | 20M| 72 | - | 169 |8552 | 0 | 0 | 0 | 27k| 0 | 0.000000e+00 | -- | Inf
53.88/53.93 c 52.3s| 60000 | 17484 | 0 | 0.0 | 23M| 72 | - | 169 | 11k| 0 | 0 | 0 | 36k| 0 | 0.000000e+00 | -- | Inf
75.57/75.67 c 73.7s| 70000 | 16463 | 0 | 0.0 | 25M| 72 | - | 169 | 15k| 0 | 0 | 0 | 46k| 0 | 0.000000e+00 | -- | Inf
110.76/110.88 c 109s| 80000 | 11821 | 0 | 0.0 | 23M| 72 | - | 169 | 16k| 0 | 0 | 0 | 58k| 0 | 0.000000e+00 | -- | Inf
151.15/151.20 c 148s| 90000 | 5873 | 0 | 0.0 | 20M| 72 | - | 169 | 20k| 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
178.15/178.25 c
178.15/178.25 c SCIP Status : problem is solved [infeasible]
178.15/178.25 c Solving Time (sec) : 175.26
178.15/178.25 c Solving Nodes : 94078
178.15/178.25 c Primal Bound : +1.00000000000000e+20 (0 solutions)
178.15/178.25 c Dual Bound : +1.00000000000000e+20
178.15/178.25 c Gap : 0.00 %
178.15/178.25 s UNSATISFIABLE
178.15/178.25 c SCIP Status : problem is solved [infeasible]
178.15/178.25 c Solving Time : 175.26
178.15/178.25 c Original Problem :
178.15/178.25 c Problem name : HOME/instance-2664323-1276275224.opb
178.15/178.25 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
178.15/178.25 c Constraints : 101 initial, 101 maximal
178.15/178.25 c Presolved Problem :
178.15/178.25 c Problem name : t_HOME/instance-2664323-1276275224.opb
178.15/178.25 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
178.15/178.25 c Constraints : 73 initial, 23281 maximal
178.15/178.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
178.15/178.25 c trivial : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c dualfix : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c implics : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c probing : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c knapsack : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c setppc : 0.01 0 0 0 0 0 0 0 0
178.15/178.25 c linear : 0.00 0 0 0 0 0 28 0 0
178.15/178.25 c logicor : 0.00 0 0 0 0 0 0 0 0
178.15/178.25 c root node : - 0 - - 0 - - - -
178.15/178.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
178.15/178.25 c integral : 0 0 0 0 0 0 0 0 0 0
178.15/178.25 c knapsack : 1 0 331852 0 58786 6348 1070248 0 0 0
178.15/178.25 c setppc : 68 0 325504 0 58786 45011 660182 0 0 0
178.15/178.25 c logicor : 4+ 0 133236 0 27169 604 55206 0 0 0
178.15/178.25 c countsols : 0 0 0 0 58786 0 0 0 0 0
178.15/178.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
178.15/178.25 c integral : 0.00 0.00 0.00 0.00 0.00
178.15/178.25 c knapsack : 19.67 0.00 19.40 0.00 0.27
178.15/178.25 c setppc : 6.88 0.00 5.98 0.00 0.90
178.15/178.25 c logicor : 74.68 0.00 74.62 0.00 0.06
178.15/178.25 c countsols : 0.02 0.00 0.00 0.00 0.02
178.15/178.25 c Propagators : Time Calls Cutoffs DomReds
178.15/178.25 c vbounds : 0.21 1 0 0
178.15/178.25 c rootredcost : 0.29 0 0 0
178.15/178.25 c pseudoobj : 0.08 0 0 0
178.15/178.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
178.15/178.25 c propagation : 3.05 51963 51946 251294 17.7 1562 21.3 -
178.15/178.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
178.15/178.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
178.15/178.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
178.15/178.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
178.15/178.25 c applied globally : - - - 79792 13.6 - - -
178.15/178.25 c applied locally : - - - 418 34.0 - - -
178.15/178.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
178.15/178.25 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
178.15/178.25 c redcost : 0.00 0 0 0 0 0
178.15/178.25 c impliedbounds : 0.00 0 0 0 0 0
178.15/178.25 c intobj : 0.00 0 0 0 0 0
178.15/178.25 c cgmip : 0.00 0 0 0 0 0
178.15/178.25 c gomory : 0.00 0 0 0 0 0
178.15/178.25 c strongcg : 0.00 0 0 0 0 0
178.15/178.25 c cmir : 0.00 0 0 0 0 0
178.15/178.25 c flowcover : 0.00 0 0 0 0 0
178.15/178.25 c clique : 0.00 0 0 0 0 0
178.15/178.25 c zerohalf : 0.00 0 0 0 0 0
178.15/178.25 c mcf : 0.00 0 0 0 0 0
178.15/178.25 c rapidlearning : 0.00 0 0 0 0 0
178.15/178.25 c Pricers : Time Calls Vars
178.15/178.25 c problem variables: 0.00 0 0
178.15/178.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
178.15/178.25 c relpscost : 0.00 0 0 0 0 0 0
178.15/178.25 c pscost : 0.00 0 0 0 0 0 0
178.15/178.25 c inference : 1.04 58786 0 0 0 0 117572
178.15/178.25 c mostinf : 0.00 0 0 0 0 0 0
178.15/178.25 c leastinf : 0.00 0 0 0 0 0 0
178.15/178.25 c fullstrong : 0.00 0 0 0 0 0 0
178.15/178.25 c allfullstrong : 0.00 0 0 0 0 0 0
178.15/178.25 c random : 0.00 0 0 0 0 0 0
178.15/178.25 c Primal Heuristics : Time Calls Found
178.15/178.25 c LP solutions : 0.00 - 0
178.15/178.25 c pseudo solutions : 0.00 - 0
178.15/178.25 c trivial : 0.00 1 0
178.15/178.25 c simplerounding : 0.00 0 0
178.15/178.25 c zirounding : 0.00 0 0
178.15/178.25 c rounding : 0.00 0 0
178.15/178.25 c shifting : 0.00 0 0
178.15/178.25 c intshifting : 0.00 0 0
178.15/178.25 c oneopt : 0.00 0 0
178.15/178.25 c twoopt : 0.00 0 0
178.15/178.25 c fixandinfer : 0.00 0 0
178.15/178.25 c feaspump : 0.00 0 0
178.15/178.25 c coefdiving : 0.00 0 0
178.15/178.25 c pscostdiving : 0.00 0 0
178.15/178.25 c fracdiving : 0.00 0 0
178.15/178.25 c veclendiving : 0.00 0 0
178.15/178.25 c intdiving : 0.00 0 0
178.15/178.25 c actconsdiving : 0.00 0 0
178.15/178.25 c objpscostdiving : 0.00 0 0
178.15/178.25 c rootsoldiving : 0.00 0 0
178.15/178.25 c linesearchdiving : 0.00 0 0
178.15/178.25 c guideddiving : 0.00 0 0
178.15/178.25 c octane : 0.00 0 0
178.15/178.25 c rens : 0.00 0 0
178.15/178.25 c rins : 0.00 0 0
178.15/178.25 c localbranching : 0.00 0 0
178.15/178.25 c mutation : 0.00 0 0
178.15/178.25 c crossover : 0.00 0 0
178.15/178.25 c dins : 0.00 0 0
178.15/178.25 c undercover : 0.00 0 0
178.15/178.25 c nlp : 0.00 0 0
178.15/178.25 c trysol : 0.00 0 0
178.15/178.25 c LP : Time Calls Iterations Iter/call Iter/sec
178.15/178.25 c primal LP : 0.00 0 0 0.00 -
178.15/178.25 c dual LP : 0.00 0 0 0.00 -
178.15/178.25 c lex dual LP : 0.00 0 0 0.00 -
178.15/178.25 c barrier LP : 0.00 0 0 0.00 -
178.15/178.25 c diving/probing LP: 0.00 0 0 0.00 -
178.15/178.25 c strong branching : 0.00 0 0 0.00 -
178.15/178.25 c (at root node) : - 0 0 0.00 -
178.15/178.25 c conflict analysis: 0.00 0 0 0.00 -
178.15/178.25 c B&B Tree :
178.15/178.25 c number of runs : 1
178.15/178.25 c nodes : 94078
178.15/178.25 c nodes (total) : 94078
178.15/178.25 c nodes left : 0
178.15/178.25 c max depth : 72
178.15/178.25 c max depth (total): 72
178.15/178.25 c backtracks : 38666 (41.1%)
178.15/178.25 c delayed cutoffs : 23495
178.15/178.25 c repropagations : 131628 (503830 domain reductions, 16671 cutoffs)
178.15/178.25 c avg switch length: 19.89
178.15/178.25 c switching time : 50.08
178.15/178.25 c Solution :
178.15/178.25 c Solutions found : 0 (0 improvements)
178.15/178.25 c Primal Bound : infeasible
178.15/178.25 c Dual Bound : -
178.15/178.25 c Gap : 0.00 %
178.15/178.25 c Root Dual Bound : +0.00000000000000e+00
178.15/178.25 c Root Iterations : 0
178.24/178.32 c Time complete: 178.27.