0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3451932-1307112962.opb>
0.00/0.00 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10264 impls, 200 clqs
0.04/0.06 c presolving (2 rounds):
0.04/0.06 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.04/0.06 c 10264 implications, 200 cliques
0.04/0.06 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.04/0.06 c 1 constraints of type <knapsack>
0.04/0.06 c 300 constraints of type <setppc>
0.04/0.06 c 1258 constraints of type <and>
0.04/0.06 c 1 constraints of type <linear>
0.04/0.06 c transformed objective value is always integral (scale: 1)
0.04/0.06 c Presolving Time: 0.06
0.04/0.06 c - non default parameters ----------------------------------------------------------------------
0.04/0.06 c # SCIP version 2.0.1.4
0.04/0.06 c
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = 10000
0.04/0.06 c
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = 1800
0.04/0.06 c
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = 13950
0.04/0.06 c
0.04/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c limits/solutions = 1
0.04/0.06 c
0.04/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.04/0.06 c separating/maxrounds = 1
0.04/0.06 c
0.04/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/maxroundsroot = 5
0.04/0.06 c
0.04/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.04/0.06 c # [type: int, range: [1,2], default: 1]
0.04/0.06 c timing/clocktype = 2
0.04/0.06 c
0.04/0.06 c # belongs reading time to solving time?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c timing/reading = TRUE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/indicator/addCouplingCons = TRUE
0.04/0.06 c
0.04/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.04/0.06 c constraints/knapsack/disaggregation = FALSE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c presolving/probing/maxrounds = 0
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/coefdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.04/0.06 c heuristics/crossover/freq = -1
0.04/0.06 c
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/crossover/nodesofs = 750
0.04/0.06 c
0.04/0.06 c # number of nodes without incumbent change that heuristic should wait
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.04/0.06 c heuristics/crossover/nwaitingnodes = 100
0.04/0.06 c
0.04/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.04/0.06 c # [type: real, range: [0,1], default: 0.1]
0.04/0.06 c heuristics/crossover/nodesquot = 0.15
0.04/0.06 c
0.04/0.06 c # minimum percentage of integer variables that have to be fixed
0.04/0.06 c # [type: real, range: [0,1], default: 0.666]
0.04/0.06 c heuristics/crossover/minfixingrate = 0.5
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/feaspump/freq = -1
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/fracdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/guideddiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/intshifting/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/linesearchdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/objpscostdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.04/0.06 c # [type: real, range: [0,1], default: 0.01]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/oneopt/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/pscostdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/rens/freq = -1
0.04/0.06 c
0.04/0.06 c # minimum percentage of integer variables that have to be fixable
0.04/0.06 c # [type: real, range: [0,1], default: 0.5]
0.04/0.06 c heuristics/rens/minfixingrate = 0.3
0.04/0.06 c
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/rens/nodesofs = 2000
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/rootsoldiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/rounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/shiftandpropagate/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/shifting/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/simplerounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/subnlp/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/trivial/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/trysol/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/undercover/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/veclendiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/zirounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/cmir/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/flowcover/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/rapidlearning/freq = 0
0.04/0.06 c
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving
0.04/0.06 c
0.04/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.09 c 0.1s| 1 | 0 | 227 | - |6177k| 0 | 100 |1458 |1560 |1458 |2818 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 289 | - |6533k| 0 | 108 |1458 |1570 |1458 |2830 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 327 | - |6962k| 0 | 107 |1458 |1570 |1458 |2847 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 357 | - |7416k| 0 | 100 |1458 |1570 |1458 |2853 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.96 c 1.0s| 1 | 0 | 393 | - |7829k| 0 | 113 |1458 |1570 |1458 |2861 | 43 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 415 | - |8391k| 0 | 110 |1458 |1570 |1458 |2865 | 47 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.5s| 1 | 2 | 415 | - |8391k| 0 | 110 |1458 |1570 |1458 |2865 | 47 | 0 | 9 | 0.000000e+00 | -- | Inf
1.89/1.95 c * 1.9s| 27 | 0 | 914 | 19.2 |8201k| 26 | - |1458 |1570 |1458 | 500 | 163 | 0 | 282 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.89/1.95 c
1.89/1.95 c SCIP Status : problem is solved [optimal solution found]
1.89/1.95 c Solving Time (sec) : 1.95
1.89/1.95 c Solving Nodes : 27
1.89/1.95 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.89/1.95 c Dual Bound : +0.00000000000000e+00
1.89/1.95 c Gap : 0.00 %
1.89/1.95 s SATISFIABLE
1.89/1.95 v -x128 -x141 -x182 -x146 -x136 -x166 -x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 -x124 -x133 -x188 -x189 -x147 -x139 -x197 -x191
1.89/1.95 v -x163 -x130 -x192 -x194 -x106 -x170 -x140 -x109 -x117 -x107 -x196 -x187 -x168 -x190 -x148 -x171 -x161 x160 x158 -x154 x151
1.89/1.95 v x114 -x173 -x199 x176 -x177 -x193 -x172 -x143 -x135 -x162 -x125 -x195 -x120 -x200 -x157 -x167 -x134 -x113 -x111 -x131 -x121
1.89/1.95 v -x183 -x123 x174 -x180 x169 -x198 -x159 -x137 -x132 -x122 -x119 x112 x105 -x118 -x150 x142 -x103 -x104 -x165 -x115 -x155 -x101
1.89/1.95 v -x144 -x116 x110 x108 x145 -x186 -x129 x126 -x138 -x164 -x127 -x175 -x184 x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
1.89/1.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
1.89/1.95 v -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 x48 -x47 x46 -x45 -x44 -x43 -x42
1.89/1.95 v x41 -x40 -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
1.89/1.95 v -x14 x13 -x12 x11 -x10 -x9 -x8 -x7 x6 -x5 x4 -x3 -x2 -x1
1.89/1.95 c SCIP Status : problem is solved [optimal solution found]
1.89/1.95 c Total Time : 1.95
1.89/1.95 c solving : 1.95
1.89/1.95 c presolving : 0.06 (included in solving)
1.89/1.95 c reading : 0.01 (included in solving)
1.89/1.95 c Original Problem :
1.89/1.95 c Problem name : HOME/instance-3451932-1307112962.opb
1.89/1.95 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.95 c Constraints : 302 initial, 302 maximal
1.89/1.95 c Presolved Problem :
1.89/1.95 c Problem name : t_HOME/instance-3451932-1307112962.opb
1.89/1.95 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.95 c Constraints : 1560 initial, 1570 maximal
1.89/1.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.89/1.95 c trivial : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c setppc : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c and : 0.04 0 0 0 0 0 0 0 0 0
1.89/1.95 c linear : 0.00 0 0 0 0 0 0 0 0 0
1.89/1.95 c root node : - 0 - - 0 - - - - -
1.89/1.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.89/1.95 c integral : 0 0 0 33 0 3 0 0 7 0 0 52
1.89/1.95 c knapsack : 1 5 69 1 0 0 0 0 0 0 0 0
1.89/1.95 c setppc : 300 5 69 1 0 0 0 0 90 0 0 0
1.89/1.95 c and : 1258 31 69 1 0 0 0 0 1022 127 0 0
1.89/1.95 c linear : 1+ 6 69 1 0 0 0 0 1 0 0 0
1.89/1.95 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
1.89/1.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.89/1.95 c integral : 0.68 0.00 0.00 0.68 0.00 0.00 0.00
1.89/1.95 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.89/1.95 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.89/1.95 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.89/1.95 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.89/1.95 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.89/1.95 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.89/1.95 c vbounds : 0 0 0 0
1.89/1.95 c rootredcost : 0 0 0 0
1.89/1.95 c pseudoobj : 0 0 0 0
1.89/1.95 c Propagator Timings : TotalTime Propagate Resprop
1.89/1.95 c vbounds : 0.00 0.00 0.00
1.89/1.95 c rootredcost : 0.00 0.00 0.00
1.89/1.95 c pseudoobj : 0.00 0.00 0.00
1.89/1.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.95 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.95 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.95 c applied globally : - - - 0 0.0 - - -
1.89/1.95 c applied locally : - - - 0 0.0 - - -
1.89/1.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.95 c cut pool : 0.00 4 - - 25 - (maximal pool size: 407)
1.89/1.95 c redcost : 0.00 31 0 0 0 0
1.89/1.95 c impliedbounds : 0.00 5 0 0 27 0
1.89/1.95 c intobj : 0.00 0 0 0 0 0
1.89/1.95 c gomory : 0.70 5 0 0 23 0
1.89/1.95 c cgmip : 0.00 0 0 0 0 0
1.89/1.95 c closecuts : 0.00 0 0 0 0 0
1.89/1.95 c strongcg : 0.31 5 0 0 2500 0
1.89/1.95 c cmir : 0.00 0 0 0 0 0
1.89/1.95 c flowcover : 0.00 0 0 0 0 0
1.89/1.95 c clique : 0.01 5 0 0 26 0
1.89/1.95 c zerohalf : 0.00 0 0 0 0 0
1.89/1.95 c mcf : 0.00 1 0 0 0 0
1.89/1.95 c oddcycle : 0.00 0 0 0 0 0
1.89/1.95 c rapidlearning : 0.05 1 0 0 0 10
1.89/1.95 c Pricers : Time Calls Vars
1.89/1.95 c problem variables: 0.00 0 0
1.89/1.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.95 c relpscost : 0.68 32 0 7 0 0 52
1.89/1.95 c pscost : 0.00 0 0 0 0 0 0
1.89/1.95 c inference : 0.00 0 0 0 0 0 0
1.89/1.95 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.95 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.95 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.95 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.95 c random : 0.00 0 0 0 0 0 0
1.89/1.95 c Primal Heuristics : Time Calls Found
1.89/1.95 c LP solutions : 0.00 - 1
1.89/1.95 c pseudo solutions : 0.00 - 0
1.89/1.95 c trivial : 0.00 1 0
1.89/1.95 c shiftandpropagate: 0.00 0 0
1.89/1.95 c simplerounding : 0.00 0 0
1.89/1.95 c zirounding : 0.00 0 0
1.89/1.95 c rounding : 0.00 0 0
1.89/1.95 c shifting : 0.00 0 0
1.89/1.95 c intshifting : 0.00 0 0
1.89/1.95 c oneopt : 0.00 0 0
1.89/1.95 c twoopt : 0.00 0 0
1.89/1.95 c fixandinfer : 0.00 0 0
1.89/1.95 c feaspump : 0.00 0 0
1.89/1.95 c clique : 0.00 0 0
1.89/1.95 c coefdiving : 0.00 0 0
1.89/1.95 c pscostdiving : 0.00 0 0
1.89/1.95 c fracdiving : 0.00 0 0
1.89/1.95 c veclendiving : 0.00 0 0
1.89/1.95 c intdiving : 0.00 0 0
1.89/1.95 c actconsdiving : 0.00 0 0
1.89/1.95 c objpscostdiving : 0.00 0 0
1.89/1.95 c rootsoldiving : 0.00 0 0
1.89/1.95 c linesearchdiving : 0.00 0 0
1.89/1.95 c guideddiving : 0.00 0 0
1.89/1.95 c octane : 0.00 0 0
1.89/1.95 c rens : 0.00 0 0
1.89/1.95 c rins : 0.00 0 0
1.89/1.95 c localbranching : 0.00 0 0
1.89/1.95 c mutation : 0.00 0 0
1.89/1.95 c crossover : 0.00 0 0
1.89/1.95 c dins : 0.00 0 0
1.89/1.95 c vbounds : 0.00 0 0
1.89/1.95 c undercover : 0.00 0 0
1.89/1.95 c subnlp : 0.00 0 0
1.89/1.95 c trysol : 0.00 0 0
1.89/1.95 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.95 c primal LP : 0.00 0 0 0.00 -
1.89/1.95 c dual LP : 0.09 63 914 14.51 10713.74
1.89/1.95 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.95 c barrier LP : 0.00 0 0 0.00 -
1.89/1.95 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.95 c strong branching : 0.67 282 7213 25.58 10709.80
1.89/1.95 c (at root node) : - 9 1759 195.44 -
1.89/1.95 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.95 c B&B Tree :
1.89/1.95 c number of runs : 1
1.89/1.95 c nodes : 27
1.89/1.95 c nodes (total) : 27
1.89/1.95 c nodes left : 0
1.89/1.95 c max depth : 26
1.89/1.95 c max depth (total): 26
1.89/1.95 c backtracks : 0 (0.0%)
1.89/1.95 c delayed cutoffs : 0
1.89/1.95 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.89/1.95 c avg switch length: 2.00
1.89/1.95 c switching time : 0.01
1.89/1.95 c Solution :
1.89/1.95 c Solutions found : 1 (1 improvements)
1.89/1.95 c First Solution : +0.00000000000000e+00 (in run 1, after 27 nodes, 1.95 seconds, depth 26, found by <relaxation>)
1.89/1.95 c Primal Bound : +0.00000000000000e+00 (in run 1, after 27 nodes, 1.95 seconds, depth 26, found by <relaxation>)
1.89/1.95 c Dual Bound : +0.00000000000000e+00
1.89/1.95 c Gap : 0.00 %
1.89/1.95 c Root Dual Bound : +0.00000000000000e+00
1.89/1.95 c Root Iterations : 415
1.89/1.96 c Time complete: 1.95.