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-2664568-1276337706.opb>
0.09/0.17 c original problem has 3249 variables (3249 bin, 0 int, 0 impl, 0 cont) and 8983 constraints
0.09/0.17 c problem read
0.09/0.17 c No objective function, only one solution is needed.
0.09/0.17 c presolving settings loaded
0.09/0.17 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.19/0.22 c presolving:
0.29/0.38 c (round 1) 253 del vars, 139 del conss, 48 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.39/0.40 c (round 2) 255 del vars, 559 del conss, 50 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.39/0.41 c (round 3) 257 del vars, 564 del conss, 52 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156872 impls, 0 clqs
0.39/0.42 c (round 4) 259 del vars, 569 del conss, 55 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156911 impls, 0 clqs
0.39/0.43 c (round 5) 261 del vars, 576 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156986 impls, 0 clqs
0.39/0.44 c (round 6) 263 del vars, 581 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.39/0.45 c (round 7) 263 del vars, 583 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.49/0.56 c (round 8) 263 del vars, 583 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 8400 upgd conss, 157052 impls, 0 clqs
0.49/0.59 c presolving (9 rounds):
0.49/0.59 c 263 deleted vars, 583 deleted constraints, 56 tightened bounds, 0 added holes, 192 changed sides, 402 changed coefficients
0.49/0.59 c 157052 implications, 0 cliques
0.49/0.59 c presolved problem has 2986 variables (2986 bin, 0 int, 0 impl, 0 cont) and 8400 constraints
0.49/0.59 c 384 constraints of type <knapsack>
0.49/0.59 c 8016 constraints of type <logicor>
0.49/0.59 c transformed objective value is always integral (scale: 1)
0.49/0.59 c Presolving Time: 0.32
0.49/0.59 c - non default parameters ----------------------------------------------------------------------
0.49/0.59 c # SCIP version 1.2.1.2
0.49/0.59 c
0.49/0.59 c # frequency for displaying node information lines
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.59 c display/freq = 10000
0.49/0.59 c
0.49/0.59 c # maximal time in seconds to run
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.59 c limits/time = 1799.84
0.49/0.59 c
0.49/0.59 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.59 c limits/memory = 1620
0.49/0.59 c
0.49/0.59 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.59 c limits/solutions = 1
0.49/0.59 c
0.49/0.59 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c lp/solvefreq = -1
0.49/0.59 c
0.49/0.59 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.59 c separating/maxrounds = 1
0.49/0.59 c
0.49/0.59 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.59 c separating/maxroundsroot = 5
0.49/0.59 c
0.49/0.59 c # should presolving try to simplify inequalities
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.59 c constraints/linear/simplifyinequalities = TRUE
0.49/0.59 c
0.49/0.59 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.59 c constraints/knapsack/disaggregation = FALSE
0.49/0.59 c
0.49/0.59 c # should presolving try to simplify knapsacks
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.59 c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.59 c
0.49/0.59 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.59 c presolving/probing/maxrounds = 0
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/coefdiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.59 c heuristics/crossover/freq = -1
0.49/0.59 c
0.49/0.59 c # number of nodes added to the contingent of the total nodes
0.49/0.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.59 c heuristics/crossover/nodesofs = 750
0.49/0.59 c
0.49/0.59 c # number of nodes without incumbent change that heuristic should wait
0.49/0.59 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.59 c heuristics/crossover/nwaitingnodes = 100
0.49/0.59 c
0.49/0.59 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.59 c # [type: real, range: [0,1], default: 0.1]
0.49/0.59 c heuristics/crossover/nodesquot = 0.15
0.49/0.59 c
0.49/0.59 c # minimum percentage of integer variables that have to be fixed
0.49/0.59 c # [type: real, range: [0,1], default: 0.666]
0.49/0.59 c heuristics/crossover/minfixingrate = 0.5
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.59 c heuristics/feaspump/freq = -1
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/fracdiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/guideddiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/intshifting/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/linesearchdiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/nlp/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.59 c heuristics/objpscostdiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.59 c # [type: real, range: [0,1], default: 0.01]
0.49/0.59 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/oneopt/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/pscostdiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.59 c heuristics/rens/freq = -1
0.49/0.59 c
0.49/0.59 c # minimum percentage of integer variables that have to be fixable
0.49/0.59 c # [type: real, range: [0,1], default: 0.5]
0.49/0.59 c heuristics/rens/minfixingrate = 0.3
0.49/0.59 c
0.49/0.59 c # number of nodes added to the contingent of the total nodes
0.49/0.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.59 c heuristics/rens/nodesofs = 2000
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.59 c heuristics/rootsoldiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.59 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/rounding/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/shifting/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/simplerounding/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.59 c heuristics/trivial/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/trysol/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.59 c heuristics/veclendiving/freq = -1
0.49/0.59 c
0.49/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.59 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.59 c
0.49/0.59 c # additional number of allowed LP iterations
0.49/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.59 c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.59 c
0.49/0.59 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.59 c heuristics/zirounding/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.59 c separating/cmir/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.59 c separating/flowcover/freq = -1
0.49/0.59 c
0.49/0.59 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.59 c separating/rapidlearning/freq = 0
0.49/0.59 c
0.49/0.59 c -----------------------------------------------------------------------------------------------
0.49/0.59 c start solving
0.58/0.60 c
0.58/0.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.58/0.61 c 0.3s| 1 | 2 | 0 | - | 17M| 0 | - |2986 |8400 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
39.17/39.26 c 38.2s| 10000 | 3555 | 0 | 0.0 | 41M| 175 | - |2986 | 10k| 0 | 0 | 0 |8394 | 0 | 0.000000e+00 | -- | Inf
90.07/90.13 c 88.2s| 20000 | 4806 | 0 | 0.0 | 65M| 175 | - |2986 | 11k| 0 | 0 | 0 | 18k| 0 | 0.000000e+00 | -- | Inf
143.04/143.19 c 140s| 30000 | 4734 | 0 | 0.0 | 70M| 175 | - |2986 | 13k| 0 | 0 | 0 | 28k| 0 | 0.000000e+00 | -- | Inf
204.91/205.05 c 201s| 40000 | 1791 | 0 | 0.0 | 48M| 175 | - |2986 | 13k| 0 | 0 | 0 | 39k| 0 | 0.000000e+00 | -- | Inf
225.32/225.45 c
225.32/225.45 c SCIP Status : problem is solved [infeasible]
225.32/225.45 c Solving Time (sec) : 221.14
225.32/225.45 c Solving Nodes : 43047
225.32/225.45 c Primal Bound : +1.00000000000000e+20 (0 solutions)
225.32/225.45 c Dual Bound : +1.00000000000000e+20
225.32/225.45 c Gap : 0.00 %
225.32/225.45 s UNSATISFIABLE
225.32/225.45 c SCIP Status : problem is solved [infeasible]
225.32/225.45 c Solving Time : 221.14
225.32/225.45 c Original Problem :
225.32/225.45 c Problem name : HOME/instance-2664568-1276337706.opb
225.32/225.45 c Variables : 3249 (3249 binary, 0 integer, 0 implicit integer, 0 continuous)
225.32/225.45 c Constraints : 8983 initial, 8983 maximal
225.32/225.45 c Presolved Problem :
225.32/225.45 c Problem name : t_HOME/instance-2664568-1276337706.opb
225.32/225.45 c Variables : 2986 (2986 binary, 0 integer, 0 implicit integer, 0 continuous)
225.32/225.45 c Constraints : 8400 initial, 14294 maximal
225.32/225.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
225.32/225.45 c trivial : 0.01 2 0 0 0 0 0 0 0
225.32/225.45 c dualfix : 0.00 0 0 0 0 0 0 0 0
225.32/225.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
225.32/225.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
225.32/225.45 c implics : 0.02 0 203 0 0 0 0 0 0
225.32/225.45 c probing : 0.00 0 0 0 0 0 0 0 0
225.32/225.45 c knapsack : 0.00 0 0 0 0 0 0 0 0
225.32/225.45 c linear : 0.20 54 4 0 56 0 583 192 402
225.32/225.45 c logicor : 0.05 0 0 0 0 0 0 0 0
225.32/225.45 c root node : - 202 - - 202 - - - -
225.32/225.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
225.32/225.45 c integral : 0 0 0 0 0 0 0 0 0 0
225.32/225.45 c knapsack : 384 0 554043 0 32154 6328 119922 0 0 0
225.32/225.45 c logicor : 8016+ 0 526831 0 32154 13757 5360535 0 0 0
225.32/225.45 c countsols : 0 0 0 0 32154 0 0 0 0 0
225.32/225.45 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
225.32/225.45 c integral : 0.00 0.00 0.00 0.00 0.00
225.32/225.45 c knapsack : 13.74 0.00 13.40 0.00 0.34
225.32/225.45 c logicor : 106.60 0.00 56.80 0.00 49.80
225.32/225.45 c countsols : 0.04 0.00 0.00 0.00 0.04
225.32/225.45 c Propagators : Time Calls Cutoffs DomReds
225.32/225.45 c vbounds : 0.33 1 0 0
225.32/225.45 c rootredcost : 0.35 0 0 0
225.32/225.45 c pseudoobj : 0.27 0 0 0
225.32/225.45 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
225.32/225.45 c propagation : 4.22 20085 19045 144937 29.4 561 16.1 -
225.32/225.45 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
225.32/225.45 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
225.32/225.45 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
225.32/225.45 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
225.32/225.45 c applied globally : - - - 44187 23.3 - - -
225.32/225.45 c applied locally : - - - 0 0.0 - - -
225.32/225.45 c Separators : Time Calls Cutoffs DomReds Cuts Conss
225.32/225.45 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
225.32/225.45 c redcost : 0.00 0 0 0 0 0
225.32/225.45 c impliedbounds : 0.00 0 0 0 0 0
225.32/225.45 c intobj : 0.00 0 0 0 0 0
225.32/225.45 c cgmip : 0.00 0 0 0 0 0
225.32/225.45 c gomory : 0.00 0 0 0 0 0
225.32/225.45 c strongcg : 0.00 0 0 0 0 0
225.32/225.45 c cmir : 0.00 0 0 0 0 0
225.32/225.45 c flowcover : 0.00 0 0 0 0 0
225.32/225.45 c clique : 0.00 0 0 0 0 0
225.32/225.45 c zerohalf : 0.00 0 0 0 0 0
225.32/225.45 c mcf : 0.00 0 0 0 0 0
225.32/225.45 c rapidlearning : 0.00 0 0 0 0 0
225.32/225.45 c Pricers : Time Calls Vars
225.32/225.45 c problem variables: 0.00 0 0
225.32/225.45 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
225.32/225.45 c relpscost : 0.00 0 0 0 0 0 0
225.32/225.45 c pscost : 0.00 0 0 0 0 0 0
225.32/225.45 c inference : 22.49 32154 0 0 0 0 64308
225.32/225.45 c mostinf : 0.00 0 0 0 0 0 0
225.32/225.45 c leastinf : 0.00 0 0 0 0 0 0
225.32/225.45 c fullstrong : 0.00 0 0 0 0 0 0
225.32/225.45 c allfullstrong : 0.00 0 0 0 0 0 0
225.32/225.45 c random : 0.00 0 0 0 0 0 0
225.32/225.45 c Primal Heuristics : Time Calls Found
225.32/225.45 c LP solutions : 0.00 - 0
225.32/225.45 c pseudo solutions : 0.00 - 0
225.32/225.45 c trivial : 0.00 1 0
225.32/225.45 c simplerounding : 0.00 0 0
225.32/225.45 c zirounding : 0.00 0 0
225.32/225.45 c rounding : 0.00 0 0
225.32/225.45 c shifting : 0.00 0 0
225.32/225.45 c intshifting : 0.00 0 0
225.32/225.45 c oneopt : 0.00 0 0
225.32/225.45 c twoopt : 0.00 0 0
225.32/225.45 c fixandinfer : 0.00 0 0
225.32/225.45 c feaspump : 0.00 0 0
225.32/225.45 c coefdiving : 0.00 0 0
225.32/225.45 c pscostdiving : 0.00 0 0
225.32/225.45 c fracdiving : 0.00 0 0
225.32/225.45 c veclendiving : 0.00 0 0
225.32/225.45 c intdiving : 0.00 0 0
225.32/225.45 c actconsdiving : 0.00 0 0
225.32/225.45 c objpscostdiving : 0.00 0 0
225.32/225.45 c rootsoldiving : 0.00 0 0
225.32/225.45 c linesearchdiving : 0.00 0 0
225.32/225.45 c guideddiving : 0.00 0 0
225.32/225.45 c octane : 0.00 0 0
225.32/225.45 c rens : 0.00 0 0
225.32/225.45 c rins : 0.00 0 0
225.32/225.45 c localbranching : 0.00 0 0
225.32/225.45 c mutation : 0.00 0 0
225.32/225.45 c crossover : 0.00 0 0
225.32/225.45 c dins : 0.00 0 0
225.32/225.45 c undercover : 0.00 0 0
225.32/225.45 c nlp : 0.00 0 0
225.32/225.45 c trysol : 0.00 0 0
225.32/225.45 c LP : Time Calls Iterations Iter/call Iter/sec
225.32/225.45 c primal LP : 0.00 0 0 0.00 -
225.32/225.45 c dual LP : 0.00 0 0 0.00 -
225.32/225.45 c lex dual LP : 0.00 0 0 0.00 -
225.32/225.45 c barrier LP : 0.00 0 0 0.00 -
225.32/225.45 c diving/probing LP: 0.00 0 0 0.00 -
225.32/225.45 c strong branching : 0.00 0 0 0.00 -
225.32/225.45 c (at root node) : - 0 0 0.00 -
225.32/225.45 c conflict analysis: 0.00 0 0 0.00 -
225.32/225.45 c B&B Tree :
225.32/225.45 c number of runs : 1
225.32/225.45 c nodes : 43047
225.32/225.45 c nodes (total) : 43047
225.32/225.45 c nodes left : 0
225.32/225.45 c max depth : 175
225.32/225.45 c max depth (total): 175
225.32/225.45 c backtracks : 11957 (27.8%)
225.32/225.45 c delayed cutoffs : 21262
225.32/225.45 c repropagations : 28140 (1713674 domain reductions, 9192 cutoffs)
225.32/225.45 c avg switch length: 8.33
225.32/225.45 c switching time : 62.32
225.32/225.45 c Solution :
225.32/225.45 c Solutions found : 0 (0 improvements)
225.32/225.45 c Primal Bound : infeasible
225.32/225.45 c Dual Bound : -
225.32/225.45 c Gap : 0.00 %
225.32/225.45 c Root Dual Bound : +0.00000000000000e+00
225.32/225.45 c Root Iterations : 0
225.42/225.52 c Time complete: 225.43.