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-2663412-1276675595.opb>
0.00/0.03 c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 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.02/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, 10152 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 10152 implications, 200 cliques
0.39/0.42 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 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 1244 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.43 c heuristics/zirounding/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/rapidlearning/freq = 0
0.39/0.43 c
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving
0.39/0.43 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 | - |4012k| 0 | - |1444 |1546 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.09 c * 0.8s| 1500 | 0 | 0 | 0.0 |4575k| 233 | - |1444 |1564 | 0 | 0 | 0 | 37 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.99/1.09 c
0.99/1.09 c SCIP Status : problem is solved [optimal solution found]
0.99/1.09 c Solving Time (sec) : 0.83
0.99/1.09 c Solving Nodes : 1500
0.99/1.09 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.99/1.09 c Dual Bound : +0.00000000000000e+00
0.99/1.09 c Gap : 0.00 %
0.99/1.09 s SATISFIABLE
0.99/1.09 v -x166 x164 -x158 -x163 -x121 x171 -x113 -x156 -x144 -x135 x152 -x161 -x122 -x130 -x157 x146 -x181 -x129 -x111 -x192 -x167 x154
0.99/1.09 v x185 -x127 -x117 x184 -x120 -x124 x134 -x178 x168 -x136 -x172 -x110 -x187 -x190 -x200 -x105 -x151 -x131 -x109 -x106 -x183 -x153
0.99/1.09 v -x182 -x189 -x149 -x195 -x104 -x198 x193 -x188 -x128 -x119 -x112 x191 -x179 -x162 -x107 -x137 -x115 -x175 x145 -x132 -x108
0.99/1.09 v -x199 -x138 x148 -x174 -x139 x143 -x197 -x180 -x160 -x155 -x150 -x118 -x114 -x116 x196 -x176 -x142 -x103 -x140 -x194 -x125 -x101
0.99/1.09 v -x170 -x133 -x123 -x159 -x165 -x102 -x177 -x173 -x126 -x141 -x169 -x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
0.99/1.09 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
0.99/1.09 v x65 -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
0.99/1.09 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
0.99/1.09 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 -x2 x1
0.99/1.09 c SCIP Status : problem is solved [optimal solution found]
0.99/1.09 c Solving Time : 0.83
0.99/1.09 c Original Problem :
0.99/1.09 c Problem name : HOME/instance-2663412-1276675595.opb
0.99/1.09 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.09 c Constraints : 1546 initial, 1546 maximal
0.99/1.09 c Presolved Problem :
0.99/1.09 c Problem name : t_HOME/instance-2663412-1276675595.opb
0.99/1.09 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.09 c Constraints : 1546 initial, 1564 maximal
0.99/1.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c setppc : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c and : 0.19 0 0 0 0 0 0 0 0
0.99/1.09 c linear : 0.01 0 0 0 0 0 0 0 0
0.99/1.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.99/1.09 c root node : - 0 - - 0 - - - -
0.99/1.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.99/1.09 c knapsack : 1 0 2407 0 1196 5 338 0 0 0
0.99/1.09 c setppc : 200 0 3109 0 1445 14 58 0 0 0
0.99/1.09 c and : 1244 0 3146 0 1473 0 11531 0 0 0
0.99/1.09 c linear : 1 0 3136 0 1473 16 209 0 0 0
0.99/1.09 c logicor : 100+ 0 75 0 1474 1 282 0 0 0
0.99/1.09 c countsols : 0 0 0 0 1474 0 0 0 0 0
0.99/1.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.99/1.09 c knapsack : 0.02 0.00 0.01 0.00 0.01
0.99/1.09 c setppc : 0.16 0.00 0.01 0.00 0.15
0.99/1.09 c and : 0.12 0.00 0.08 0.00 0.04
0.99/1.09 c linear : 0.07 0.00 0.07 0.00 0.00
0.99/1.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.99/1.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.09 c Propagators : Time Calls Cutoffs DomReds
0.99/1.09 c vbounds : 0.00 1 0 0
0.99/1.09 c rootredcost : 0.00 0 0 0
0.99/1.09 c pseudoobj : 0.00 0 0 0
0.99/1.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.09 c propagation : 0.02 36 35 67 146.6 0 0.0 -
0.99/1.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.09 c applied globally : - - - 18 82.0 - - -
0.99/1.09 c applied locally : - - - 19 165.9 - - -
0.99/1.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.99/1.09 c redcost : 0.00 0 0 0 0 0
0.99/1.09 c impliedbounds : 0.00 0 0 0 0 0
0.99/1.09 c intobj : 0.00 0 0 0 0 0
0.99/1.09 c cgmip : 0.00 0 0 0 0 0
0.99/1.09 c gomory : 0.00 0 0 0 0 0
0.99/1.09 c strongcg : 0.00 0 0 0 0 0
0.99/1.09 c cmir : 0.00 0 0 0 0 0
0.99/1.09 c flowcover : 0.00 0 0 0 0 0
0.99/1.09 c clique : 0.00 0 0 0 0 0
0.99/1.09 c zerohalf : 0.00 0 0 0 0 0
0.99/1.09 c mcf : 0.00 0 0 0 0 0
0.99/1.09 c rapidlearning : 0.00 0 0 0 0 0
0.99/1.09 c Pricers : Time Calls Vars
0.99/1.09 c problem variables: 0.00 0 0
0.99/1.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.09 c relpscost : 0.00 0 0 0 0 0 0
0.99/1.09 c pscost : 0.00 0 0 0 0 0 0
0.99/1.09 c inference : 0.20 1473 0 0 0 0 2946
0.99/1.09 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.09 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.09 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.09 c random : 0.00 0 0 0 0 0 0
0.99/1.09 c Primal Heuristics : Time Calls Found
0.99/1.09 c LP solutions : 0.00 - 0
0.99/1.09 c pseudo solutions : 0.00 - 1
0.99/1.09 c trivial : 0.00 1 0
0.99/1.09 c simplerounding : 0.00 0 0
0.99/1.09 c zirounding : 0.00 0 0
0.99/1.09 c rounding : 0.00 0 0
0.99/1.09 c shifting : 0.00 0 0
0.99/1.09 c intshifting : 0.00 0 0
0.99/1.09 c oneopt : 0.00 0 0
0.99/1.09 c twoopt : 0.00 0 0
0.99/1.09 c fixandinfer : 0.00 0 0
0.99/1.09 c feaspump : 0.00 0 0
0.99/1.09 c coefdiving : 0.00 0 0
0.99/1.09 c pscostdiving : 0.00 0 0
0.99/1.09 c fracdiving : 0.00 0 0
0.99/1.09 c veclendiving : 0.00 0 0
0.99/1.09 c intdiving : 0.00 0 0
0.99/1.09 c actconsdiving : 0.00 0 0
0.99/1.09 c objpscostdiving : 0.00 0 0
0.99/1.09 c rootsoldiving : 0.00 0 0
0.99/1.09 c linesearchdiving : 0.00 0 0
0.99/1.09 c guideddiving : 0.00 0 0
0.99/1.09 c octane : 0.00 0 0
0.99/1.09 c rens : 0.00 0 0
0.99/1.09 c rins : 0.00 0 0
0.99/1.09 c localbranching : 0.00 0 0
0.99/1.09 c mutation : 0.00 0 0
0.99/1.09 c crossover : 0.00 0 0
0.99/1.09 c dins : 0.00 0 0
0.99/1.09 c undercover : 0.00 0 0
0.99/1.09 c nlp : 0.00 0 0
0.99/1.09 c trysol : 0.00 0 0
0.99/1.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.09 c primal LP : 0.00 0 0 0.00 -
0.99/1.09 c dual LP : 0.00 0 0 0.00 -
0.99/1.09 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.09 c barrier LP : 0.00 0 0 0.00 -
0.99/1.09 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.09 c strong branching : 0.00 0 0 0.00 -
0.99/1.09 c (at root node) : - 0 0 0.00 -
0.99/1.09 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.09 c B&B Tree :
0.99/1.09 c number of runs : 1
0.99/1.09 c nodes : 1500
0.99/1.09 c nodes (total) : 1500
0.99/1.09 c nodes left : 0
0.99/1.09 c max depth : 233
0.99/1.09 c max depth (total): 233
0.99/1.09 c backtracks : 11 (0.7%)
0.99/1.09 c delayed cutoffs : 10
0.99/1.09 c repropagations : 130 (289 domain reductions, 10 cutoffs)
0.99/1.09 c avg switch length: 2.67
0.99/1.09 c switching time : 0.02
0.99/1.09 c Solution :
0.99/1.09 c Solutions found : 1 (1 improvements)
0.99/1.10 c First Solution : +0.00000000000000e+00 (in run 1, after 1500 nodes, 0.83 seconds, depth 156, found by <relaxation>)
0.99/1.10 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1500 nodes, 0.83 seconds, depth 156, found by <relaxation>)
0.99/1.10 c Dual Bound : +0.00000000000000e+00
0.99/1.10 c Gap : 0.00 %
0.99/1.10 c Root Dual Bound : +0.00000000000000e+00
0.99/1.10 c Root Iterations : 0
1.09/1.11 c Time complete: 1.1.