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-2664310-1276274367.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 = 1799.99
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.29/2.31 c 2.1s| 10000 | 7070 | 0 | 0.0 |5654k| 69 | - | 169 |2420 | 0 | 0 | 0 |2419 | 0 | 0.000000e+00 | -- | Inf
6.29/6.39 c 6.0s| 20000 | 12470 | 0 | 0.0 | 10M| 70 | - | 169 |3178 | 0 | 0 | 0 |6028 | 0 | 0.000000e+00 | -- | Inf
12.00/12.10 c 11.4s| 30000 | 16540 | 0 | 0.0 | 14M| 70 | - | 169 |5567 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
21.28/21.33 c 20.4s| 40000 | 18505 | 0 | 0.0 | 18M| 70 | - | 169 |6635 | 0 | 0 | 0 | 17k| 0 | 0.000000e+00 | -- | Inf
31.78/31.84 c 30.6s| 50000 | 19557 | 0 | 0.0 | 21M| 70 | - | 169 |6085 | 0 | 0 | 0 | 24k| 0 | 0.000000e+00 | -- | Inf
43.68/43.71 c 42.2s| 60000 | 20833 | 0 | 0.0 | 24M| 70 | - | 169 |9821 | 0 | 0 | 0 | 31k| 0 | 0.000000e+00 | -- | Inf
61.27/61.33 c 59.5s| 70000 | 20738 | 0 | 0.0 | 27M| 70 | - | 169 | 12k| 0 | 0 | 0 | 40k| 0 | 0.000000e+00 | -- | Inf
85.05/85.14 c 83.0s| 80000 | 18854 | 0 | 0.0 | 29M| 70 | - | 169 | 15k| 0 | 0 | 0 | 49k| 0 | 0.000000e+00 | -- | Inf
118.44/118.55 c 116s| 90000 | 14466 | 0 | 0.0 | 27M| 70 | - | 169 | 15k| 0 | 0 | 0 | 61k| 0 | 0.000000e+00 | -- | Inf
159.23/159.34 c 156s|100000 | 9145 | 0 | 0.0 | 25M| 70 | - | 169 | 23k| 0 | 0 | 0 | 73k| 0 | 0.000000e+00 | -- | Inf
216.11/216.21 c
216.11/216.21 c SCIP Status : problem is solved [infeasible]
216.11/216.21 c Solving Time (sec) : 212.78
216.11/216.21 c Solving Nodes : 108389
216.11/216.21 c Primal Bound : +1.00000000000000e+20 (0 solutions)
216.11/216.21 c Dual Bound : +1.00000000000000e+20
216.11/216.21 c Gap : 0.00 %
216.11/216.21 s UNSATISFIABLE
216.11/216.21 c SCIP Status : problem is solved [infeasible]
216.11/216.21 c Solving Time : 212.78
216.11/216.21 c Original Problem :
216.11/216.21 c Problem name : HOME/instance-2664310-1276274367.opb
216.11/216.21 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
216.11/216.21 c Constraints : 101 initial, 101 maximal
216.11/216.21 c Presolved Problem :
216.11/216.21 c Problem name : t_HOME/instance-2664310-1276274367.opb
216.11/216.21 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
216.11/216.21 c Constraints : 73 initial, 28645 maximal
216.11/216.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
216.11/216.21 c trivial : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c dualfix : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c boundshift : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c implics : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c probing : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c knapsack : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c setppc : 0.01 0 0 0 0 0 0 0 0
216.11/216.21 c linear : 0.00 0 0 0 0 0 28 0 0
216.11/216.21 c logicor : 0.00 0 0 0 0 0 0 0 0
216.11/216.21 c root node : - 0 - - 0 - - - -
216.11/216.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
216.11/216.21 c integral : 0 0 0 0 0 0 0 0 0 0
216.11/216.21 c knapsack : 1 0 383906 0 67713 7799 1249385 0 0 0
216.11/216.21 c setppc : 68 0 376107 0 67713 52644 846293 0 0 0
216.11/216.21 c logicor : 4+ 0 155973 0 36788 642 64841 0 0 0
216.11/216.21 c countsols : 0 0 0 0 67713 0 0 0 0 0
216.11/216.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
216.11/216.21 c integral : 0.00 0.00 0.00 0.00 0.00
216.11/216.21 c knapsack : 24.94 0.00 24.53 0.00 0.41
216.11/216.21 c setppc : 7.79 0.00 6.76 0.00 1.03
216.11/216.21 c logicor : 91.61 0.00 91.58 0.00 0.03
216.11/216.21 c countsols : 0.01 0.00 0.00 0.00 0.01
216.11/216.21 c Propagators : Time Calls Cutoffs DomReds
216.11/216.21 c vbounds : 0.18 1 0 0
216.11/216.21 c rootredcost : 0.21 0 0 0
216.11/216.21 c pseudoobj : 0.10 0 0 0
216.11/216.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
216.11/216.21 c propagation : 3.17 61085 61063 290089 18.1 1776 21.9 -
216.11/216.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
216.11/216.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
216.11/216.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
216.11/216.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
216.11/216.21 c applied globally : - - - 86832 13.7 - - -
216.11/216.21 c applied locally : - - - 684 34.2 - - -
216.11/216.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
216.11/216.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
216.11/216.21 c redcost : 0.00 0 0 0 0 0
216.11/216.21 c impliedbounds : 0.00 0 0 0 0 0
216.11/216.21 c intobj : 0.00 0 0 0 0 0
216.11/216.21 c cgmip : 0.00 0 0 0 0 0
216.11/216.21 c gomory : 0.00 0 0 0 0 0
216.11/216.21 c strongcg : 0.00 0 0 0 0 0
216.11/216.21 c cmir : 0.00 0 0 0 0 0
216.11/216.21 c flowcover : 0.00 0 0 0 0 0
216.11/216.21 c clique : 0.00 0 0 0 0 0
216.11/216.21 c zerohalf : 0.00 0 0 0 0 0
216.11/216.21 c mcf : 0.00 0 0 0 0 0
216.11/216.21 c rapidlearning : 0.00 0 0 0 0 0
216.11/216.21 c Pricers : Time Calls Vars
216.11/216.21 c problem variables: 0.00 0 0
216.11/216.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
216.11/216.21 c relpscost : 0.00 0 0 0 0 0 0
216.11/216.21 c pscost : 0.00 0 0 0 0 0 0
216.11/216.21 c inference : 0.94 67713 0 0 0 0 135426
216.11/216.21 c mostinf : 0.00 0 0 0 0 0 0
216.11/216.21 c leastinf : 0.00 0 0 0 0 0 0
216.11/216.21 c fullstrong : 0.00 0 0 0 0 0 0
216.11/216.21 c allfullstrong : 0.00 0 0 0 0 0 0
216.11/216.21 c random : 0.00 0 0 0 0 0 0
216.11/216.21 c Primal Heuristics : Time Calls Found
216.11/216.21 c LP solutions : 0.00 - 0
216.11/216.21 c pseudo solutions : 0.00 - 0
216.11/216.21 c trivial : 0.00 1 0
216.11/216.21 c simplerounding : 0.00 0 0
216.11/216.21 c zirounding : 0.00 0 0
216.11/216.21 c rounding : 0.00 0 0
216.11/216.21 c shifting : 0.00 0 0
216.11/216.21 c intshifting : 0.00 0 0
216.11/216.21 c oneopt : 0.00 0 0
216.11/216.21 c twoopt : 0.00 0 0
216.11/216.21 c fixandinfer : 0.00 0 0
216.11/216.21 c feaspump : 0.00 0 0
216.11/216.21 c coefdiving : 0.00 0 0
216.11/216.21 c pscostdiving : 0.00 0 0
216.11/216.21 c fracdiving : 0.00 0 0
216.11/216.21 c veclendiving : 0.00 0 0
216.11/216.21 c intdiving : 0.00 0 0
216.11/216.21 c actconsdiving : 0.00 0 0
216.11/216.21 c objpscostdiving : 0.00 0 0
216.11/216.21 c rootsoldiving : 0.00 0 0
216.11/216.21 c linesearchdiving : 0.00 0 0
216.11/216.21 c guideddiving : 0.00 0 0
216.11/216.21 c octane : 0.00 0 0
216.11/216.21 c rens : 0.00 0 0
216.11/216.21 c rins : 0.00 0 0
216.11/216.21 c localbranching : 0.00 0 0
216.11/216.21 c mutation : 0.00 0 0
216.11/216.21 c crossover : 0.00 0 0
216.11/216.21 c dins : 0.00 0 0
216.11/216.21 c undercover : 0.00 0 0
216.11/216.21 c nlp : 0.00 0 0
216.11/216.21 c trysol : 0.00 0 0
216.11/216.21 c LP : Time Calls Iterations Iter/call Iter/sec
216.11/216.21 c primal LP : 0.00 0 0 0.00 -
216.11/216.21 c dual LP : 0.00 0 0 0.00 -
216.11/216.21 c lex dual LP : 0.00 0 0 0.00 -
216.11/216.21 c barrier LP : 0.00 0 0 0.00 -
216.11/216.21 c diving/probing LP: 0.00 0 0 0.00 -
216.11/216.21 c strong branching : 0.00 0 0 0.00 -
216.11/216.21 c (at root node) : - 0 0 0.00 -
216.11/216.21 c conflict analysis: 0.00 0 0 0.00 -
216.11/216.21 c B&B Tree :
216.11/216.21 c number of runs : 1
216.11/216.21 c nodes : 108389
216.11/216.21 c nodes (total) : 108389
216.11/216.21 c nodes left : 0
216.11/216.21 c max depth : 70
216.11/216.21 c max depth (total): 70
216.11/216.21 c backtracks : 44658 (41.2%)
216.11/216.21 c delayed cutoffs : 27038
216.11/216.21 c repropagations : 145687 (632632 domain reductions, 20409 cutoffs)
216.11/216.21 c avg switch length: 19.86
216.11/216.21 c switching time : 59.69
216.11/216.21 c Solution :
216.11/216.21 c Solutions found : 0 (0 improvements)
216.11/216.21 c Primal Bound : infeasible
216.11/216.21 c Dual Bound : -
216.11/216.21 c Gap : 0.00 %
216.11/216.21 c Root Dual Bound : +0.00000000000000e+00
216.11/216.21 c Root Iterations : 0
216.11/216.29 c Time complete: 216.2.