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-2663446-1276679111.opb>
0.00/0.02 c original problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 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.04 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10216 impls, 200 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 10216 implications, 200 cliques
0.39/0.42 c presolved problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 200 constraints of type <setppc>
0.39/0.42 c 1252 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 100 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.20
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c lp/solvefreq = -1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.39/0.43 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.43 c 0.2s| 1 | 2 | 0 | - |4031k| 0 | - |1452 |1554 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.88/3.94 c * 3.5s| 9708 | 0 | 0 | 0.0 |4964k| 258 | - |1452 |1823 | 0 | 0 | 0 | 351 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.88/3.94 c
3.88/3.94 c SCIP Status : problem is solved [optimal solution found]
3.88/3.94 c Solving Time (sec) : 3.46
3.88/3.94 c Solving Nodes : 9708
3.88/3.94 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.88/3.94 c Dual Bound : +0.00000000000000e+00
3.88/3.94 c Gap : 0.00 %
3.88/3.95 s SATISFIABLE
3.88/3.95 v -x148 -x139 -x160 x157 -x183 -x131 -x156 -x196 -x165 -x122 -x198 -x197 x170 -x113 -x163 -x158 -x130 -x126 -x125 x119 -x159 x192
3.88/3.95 v -x195 -x144 -x142 -x120 -x164 -x175 -x107 x181 -x118 -x188 -x145 -x191 -x151 -x169 -x134 -x117 -x143 x190 -x186 -x116 -x124
3.88/3.95 v -x136 -x104 -x193 x179 -x140 -x108 -x138 -x154 -x172 -x162 -x200 -x109 -x103 -x194 x178 x146 -x141 -x137 -x185 -x128 -x147 x168
3.88/3.95 v -x153 -x184 x180 -x102 -x171 -x135 -x114 -x110 -x105 -x106 -x115 -x187 -x129 x199 -x161 -x127 -x101 -x189 -x167 -x155 x152
3.88/3.95 v -x149 -x132 -x123 -x112 -x182 -x174 -x150 x121 -x133 x177 -x173 -x111 -x166 -x176 -x100 -x99 -x98 -x97 x96 x95 x94 x93 -x92
3.88/3.95 v x91 -x90 x89 x88 -x87 -x86 x85 x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65
3.88/3.95 v -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40
3.88/3.95 v -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14
3.88/3.95 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
3.88/3.95 c SCIP Status : problem is solved [optimal solution found]
3.88/3.95 c Solving Time : 3.46
3.88/3.95 c Original Problem :
3.88/3.95 c Problem name : HOME/instance-2663446-1276679111.opb
3.88/3.95 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.88/3.95 c Constraints : 1554 initial, 1554 maximal
3.88/3.95 c Presolved Problem :
3.88/3.95 c Problem name : t_HOME/instance-2663446-1276679111.opb
3.88/3.95 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.88/3.95 c Constraints : 1554 initial, 1824 maximal
3.88/3.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.88/3.95 c trivial : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c implics : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c probing : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c setppc : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c and : 0.18 0 0 0 0 0 0 0 0
3.88/3.95 c linear : 0.01 0 0 0 0 0 0 0 0
3.88/3.95 c logicor : 0.00 0 0 0 0 0 0 0 0
3.88/3.95 c root node : - 0 - - 0 - - - -
3.88/3.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.88/3.95 c integral : 0 0 0 0 0 0 0 0 0 0
3.88/3.95 c knapsack : 1 0 12538 0 6177 13 1914 0 0 0
3.88/3.95 c setppc : 200 0 22246 0 9516 215 798 0 0 0
3.88/3.95 c and : 1252 0 22089 0 9557 0 62069 0 0 0
3.88/3.95 c linear : 1 0 21947 0 9557 28 2076 0 0 0
3.88/3.95 c logicor : 100+ 0 1216 0 9552 3 2132 0 0 0
3.88/3.95 c countsols : 0 0 0 0 9558 0 0 0 0 0
3.88/3.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.88/3.95 c integral : 0.00 0.00 0.00 0.00 0.00
3.88/3.95 c knapsack : 0.07 0.00 0.06 0.00 0.01
3.88/3.95 c setppc : 0.50 0.00 0.09 0.00 0.41
3.88/3.95 c and : 0.57 0.00 0.29 0.00 0.28
3.88/3.95 c linear : 0.40 0.00 0.38 0.00 0.02
3.88/3.95 c logicor : 0.07 0.00 0.01 0.00 0.06
3.88/3.95 c countsols : 0.00 0.00 0.00 0.00 0.00
3.88/3.95 c Propagators : Time Calls Cutoffs DomReds
3.88/3.95 c vbounds : 0.01 1 0 0
3.88/3.95 c rootredcost : 0.02 0 0 0
3.88/3.95 c pseudoobj : 0.01 0 0 0
3.88/3.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.88/3.95 c propagation : 0.04 259 257 414 86.3 2 100.0 -
3.88/3.95 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.88/3.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.88/3.95 c applied globally : - - - 329 65.7 - - -
3.88/3.95 c applied locally : - - - 22 168.5 - - -
3.88/3.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.88/3.95 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.88/3.95 c redcost : 0.00 0 0 0 0 0
3.88/3.95 c impliedbounds : 0.00 0 0 0 0 0
3.88/3.95 c intobj : 0.00 0 0 0 0 0
3.88/3.95 c cgmip : 0.00 0 0 0 0 0
3.88/3.95 c gomory : 0.00 0 0 0 0 0
3.88/3.95 c strongcg : 0.00 0 0 0 0 0
3.88/3.95 c cmir : 0.00 0 0 0 0 0
3.88/3.95 c flowcover : 0.00 0 0 0 0 0
3.88/3.95 c clique : 0.00 0 0 0 0 0
3.88/3.95 c zerohalf : 0.00 0 0 0 0 0
3.88/3.95 c mcf : 0.00 0 0 0 0 0
3.88/3.95 c rapidlearning : 0.00 0 0 0 0 0
3.88/3.95 c Pricers : Time Calls Vars
3.88/3.95 c problem variables: 0.00 0 0
3.88/3.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.88/3.95 c relpscost : 0.00 0 0 0 0 0 0
3.88/3.95 c pscost : 0.00 0 0 0 0 0 0
3.88/3.95 c inference : 1.01 9557 0 0 0 0 19114
3.88/3.95 c mostinf : 0.00 0 0 0 0 0 0
3.88/3.95 c leastinf : 0.00 0 0 0 0 0 0
3.88/3.95 c fullstrong : 0.00 0 0 0 0 0 0
3.88/3.95 c allfullstrong : 0.00 0 0 0 0 0 0
3.88/3.95 c random : 0.00 0 0 0 0 0 0
3.88/3.95 c Primal Heuristics : Time Calls Found
3.88/3.95 c LP solutions : 0.00 - 0
3.88/3.95 c pseudo solutions : 0.02 - 1
3.88/3.95 c trivial : 0.01 1 0
3.88/3.95 c simplerounding : 0.00 0 0
3.88/3.95 c zirounding : 0.00 0 0
3.88/3.95 c rounding : 0.00 0 0
3.88/3.95 c shifting : 0.00 0 0
3.88/3.95 c intshifting : 0.00 0 0
3.88/3.95 c oneopt : 0.00 0 0
3.88/3.95 c twoopt : 0.00 0 0
3.88/3.95 c fixandinfer : 0.00 0 0
3.88/3.95 c feaspump : 0.00 0 0
3.88/3.95 c coefdiving : 0.00 0 0
3.88/3.95 c pscostdiving : 0.00 0 0
3.88/3.95 c fracdiving : 0.00 0 0
3.88/3.95 c veclendiving : 0.00 0 0
3.88/3.95 c intdiving : 0.00 0 0
3.88/3.95 c actconsdiving : 0.00 0 0
3.88/3.95 c objpscostdiving : 0.00 0 0
3.88/3.95 c rootsoldiving : 0.00 0 0
3.88/3.95 c linesearchdiving : 0.00 0 0
3.88/3.95 c guideddiving : 0.00 0 0
3.88/3.95 c octane : 0.00 0 0
3.88/3.95 c rens : 0.00 0 0
3.88/3.95 c rins : 0.00 0 0
3.88/3.95 c localbranching : 0.00 0 0
3.88/3.95 c mutation : 0.00 0 0
3.88/3.95 c crossover : 0.00 0 0
3.88/3.95 c dins : 0.00 0 0
3.88/3.95 c undercover : 0.00 0 0
3.88/3.95 c nlp : 0.00 0 0
3.88/3.95 c trysol : 0.00 0 0
3.88/3.95 c LP : Time Calls Iterations Iter/call Iter/sec
3.88/3.95 c primal LP : 0.00 0 0 0.00 -
3.88/3.95 c dual LP : 0.00 0 0 0.00 -
3.88/3.95 c lex dual LP : 0.00 0 0 0.00 -
3.88/3.95 c barrier LP : 0.00 0 0 0.00 -
3.88/3.95 c diving/probing LP: 0.00 0 0 0.00 -
3.88/3.95 c strong branching : 0.00 0 0 0.00 -
3.88/3.95 c (at root node) : - 0 0 0.00 -
3.88/3.95 c conflict analysis: 0.00 0 0 0.00 -
3.88/3.95 c B&B Tree :
3.88/3.95 c number of runs : 1
3.88/3.95 c nodes : 9708
3.88/3.95 c nodes (total) : 9708
3.88/3.95 c nodes left : 0
3.88/3.95 c max depth : 258
3.88/3.95 c max depth (total): 258
3.88/3.95 c backtracks : 120 (1.2%)
3.88/3.95 c delayed cutoffs : 109
3.88/3.95 c repropagations : 2799 (2637 domain reductions, 109 cutoffs)
3.88/3.95 c avg switch length: 2.78
3.88/3.95 c switching time : 0.23
3.88/3.95 c Solution :
3.88/3.95 c Solutions found : 1 (1 improvements)
3.88/3.95 c First Solution : +0.00000000000000e+00 (in run 1, after 9708 nodes, 3.44 seconds, depth 153, found by <relaxation>)
3.88/3.95 c Primal Bound : +0.00000000000000e+00 (in run 1, after 9708 nodes, 3.44 seconds, depth 153, found by <relaxation>)
3.88/3.95 c Dual Bound : +0.00000000000000e+00
3.88/3.95 c Gap : 0.00 %
3.88/3.95 c Root Dual Bound : +0.00000000000000e+00
3.88/3.95 c Root Iterations : 0
3.88/3.96 c Time complete: 3.95.