0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702852-1278574882.opb>
0.00/0.03 c original problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 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.04/0.04 c presolving:
0.09/0.12 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10264 impls, 200 clqs
0.09/0.18 c presolving (2 rounds):
0.09/0.18 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.18 c 10264 implications, 200 cliques
0.09/0.18 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.09/0.18 c 1 constraints of type <knapsack>
0.09/0.18 c 300 constraints of type <setppc>
0.09/0.18 c 1258 constraints of type <and>
0.09/0.18 c 1 constraints of type <linear>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.14
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.3
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1789.98
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c limits/solutions = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.18 c separating/maxrounds = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/maxroundsroot = 5
0.09/0.18 c
0.09/0.18 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.18 c # [type: int, range: [1,2], default: 1]
0.09/0.18 c timing/clocktype = 2
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/indicator/addCouplingCons = TRUE
0.09/0.18 c
0.09/0.18 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.18 c constraints/knapsack/disaggregation = FALSE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c presolving/probing/maxrounds = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/coefdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.18 c heuristics/crossover/freq = -1
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/crossover/nodesofs = 750
0.09/0.18 c
0.09/0.18 c # number of nodes without incumbent change that heuristic should wait
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.18 c heuristics/crossover/nwaitingnodes = 100
0.09/0.18 c
0.09/0.18 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.18 c # [type: real, range: [0,1], default: 0.1]
0.09/0.18 c heuristics/crossover/nodesquot = 0.15
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixed
0.09/0.18 c # [type: real, range: [0,1], default: 0.666]
0.09/0.18 c heuristics/crossover/minfixingrate = 0.5
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/feaspump/freq = -1
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/fracdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/guideddiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/intshifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/linesearchdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/nlp/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/objpscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.18 c # [type: real, range: [0,1], default: 0.01]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/oneopt/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/pscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/rens/freq = -1
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixable
0.09/0.18 c # [type: real, range: [0,1], default: 0.5]
0.09/0.18 c heuristics/rens/minfixingrate = 0.3
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/rens/nodesofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/rootsoldiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/rounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/shifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/simplerounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/trivial/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/trysol/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/veclendiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/zirounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/cmir/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/flowcover/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.19/0.25 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.25 c 0.2s| 1 | 0 | 212 | - |6577k| 0 | 100 |1458 |1560 |1458 |2818 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 272 | - |6923k| 0 | 114 |1458 |1560 |1458 |2832 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.75 c 1.7s| 1 | 0 | 389 | - |7180k| 0 | 105 |1458 |1560 |1458 |2847 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.30 c 2.3s| 1 | 0 | 529 | - |7310k| 0 | 97 |1458 |1560 |1458 |2856 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.85 c 2.8s| 1 | 0 | 652 | - |7509k| 0 | 100 |1458 |1560 |1458 |2866 | 48 | 0 | 0 | 0.000000e+00 | -- | Inf
3.39/3.44 c 3.4s| 1 | 0 | 761 | - |7517k| 0 | 98 |1458 |1560 |1458 |2873 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
5.79/5.89 c 5.9s| 1 | 2 | 761 | - |7518k| 0 | 98 |1458 |1560 |1458 |2873 | 55 | 0 | 12 | 0.000000e+00 | -- | Inf
7.19/7.22 c * 7.2s| 23 | 0 | 1488 | 33.0 |7476k| 21 | - |1458 |1561 |1458 | 505 | 185 | 1 | 229 | 0.000000e+00 | 0.000000e+00 | 0.00%
7.19/7.22 c
7.19/7.22 c SCIP Status : problem is solved [optimal solution found]
7.19/7.22 c Solving Time (sec) : 7.19
7.19/7.22 c Solving Nodes : 23
7.19/7.22 c Primal Bound : +0.00000000000000e+00 (1 solutions)
7.19/7.22 c Dual Bound : +0.00000000000000e+00
7.19/7.22 c Gap : 0.00 %
7.19/7.22 s SATISFIABLE
7.19/7.22 v -x128 -x141 -x182 -x146 -x136 x166 -x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 -x124 -x133 -x188 x189 -x147 -x139 -x197 -x191
7.19/7.22 v -x163 -x130 -x192 -x194 -x106 -x170 -x140 -x109 -x117 x107 -x196 -x187 -x168 -x190 -x148 -x171 -x161 -x160 x158 -x154 x151
7.19/7.22 v -x114 x173 -x199 x176 -x177 -x193 -x172 -x143 -x135 -x162 -x125 -x195 -x120 -x200 -x157 -x167 -x134 x113 -x111 -x131 -x121 -x183
7.19/7.22 v -x123 -x174 -x180 -x169 -x198 -x159 -x137 -x132 -x122 -x119 -x112 x105 -x118 -x150 -x142 -x103 -x104 -x165 -x115 -x155 -x101
7.19/7.22 v -x144 x116 -x110 x108 -x145 -x186 x129 -x126 -x138 x164 -x127 x175 x184 -x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
7.19/7.22 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
7.19/7.22 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
7.19/7.22 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
7.19/7.22 v x15 -x14 -x13 x12 x11 x10 -x9 -x8 -x7 -x6 -x5 x4 -x3 x2 -x1
7.19/7.22 c SCIP Status : problem is solved [optimal solution found]
7.19/7.22 c Solving Time : 7.19
7.19/7.22 c Original Problem :
7.19/7.22 c Problem name : HOME/instance-2702852-1278574882.opb
7.19/7.22 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.22 c Constraints : 1560 initial, 1560 maximal
7.19/7.22 c Presolved Problem :
7.19/7.22 c Problem name : t_HOME/instance-2702852-1278574882.opb
7.19/7.22 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.22 c Constraints : 1560 initial, 1561 maximal
7.19/7.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.19/7.22 c trivial : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c implics : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c probing : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c knapsack : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c setppc : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c and : 0.12 0 0 0 0 0 0 0 0
7.19/7.22 c linear : 0.01 0 0 0 0 0 0 0 0
7.19/7.22 c logicor : 0.00 0 0 0 0 0 0 0 0
7.19/7.22 c root node : - 0 - - 0 - - - -
7.19/7.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.19/7.22 c integral : 0 0 0 26 0 0 6 0 0 42
7.19/7.22 c knapsack : 1 5 61 1 0 0 0 0 0 0
7.19/7.22 c setppc : 300 5 61 1 0 1 128 0 0 0
7.19/7.22 c and : 1258 26 60 1 0 0 1101 143 0 0
7.19/7.22 c linear : 1 5 60 1 0 0 0 0 0 0
7.19/7.22 c logicor : 0+ 0 1 0 0 0 1 0 0 0
7.19/7.22 c countsols : 0 0 0 1 0 0 0 0 0 0
7.19/7.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.19/7.22 c integral : 3.58 0.00 0.00 3.58 0.00
7.19/7.22 c knapsack : 0.01 0.01 0.00 0.00 0.00
7.19/7.22 c setppc : 0.00 0.00 0.00 0.00 0.00
7.19/7.22 c and : 0.02 0.02 0.00 0.00 0.00
7.19/7.22 c linear : 0.00 0.00 0.00 0.00 0.00
7.19/7.22 c logicor : 0.00 0.00 0.00 0.00 0.00
7.19/7.22 c countsols : 0.00 0.00 0.00 0.00 0.00
7.19/7.22 c Propagators : Time Calls Cutoffs DomReds
7.19/7.22 c vbounds : 0.00 1 0 0
7.19/7.22 c rootredcost : 0.00 0 0 0
7.19/7.22 c pseudoobj : 0.00 0 0 0
7.19/7.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.19/7.22 c propagation : 0.00 1 1 1 3.0 0 0.0 -
7.19/7.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.19/7.22 c applied globally : - - - 1 3.0 - - -
7.19/7.22 c applied locally : - - - 0 0.0 - - -
7.19/7.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.19/7.22 c cut pool : 0.00 4 - - 7 - (maximal pool size: 227)
7.19/7.22 c redcost : 0.00 26 0 0 0 0
7.19/7.22 c impliedbounds : 0.00 5 0 0 28 0
7.19/7.22 c intobj : 0.00 0 0 0 0 0
7.19/7.22 c cgmip : 0.00 0 0 0 0 0
7.19/7.22 c gomory : 1.41 5 0 0 162 0
7.19/7.22 c strongcg : 1.08 5 0 0 2000 0
7.19/7.22 c cmir : 0.00 0 0 0 0 0
7.19/7.22 c flowcover : 0.00 0 0 0 0 0
7.19/7.22 c clique : 0.01 5 0 0 32 0
7.19/7.22 c zerohalf : 0.00 0 0 0 0 0
7.19/7.22 c mcf : 0.00 1 0 0 0 0
7.19/7.22 c rapidlearning : 0.43 1 0 0 0 0
7.19/7.22 c Pricers : Time Calls Vars
7.19/7.22 c problem variables: 0.00 0 0
7.19/7.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.19/7.22 c relpscost : 3.58 25 0 6 0 0 42
7.19/7.22 c pscost : 0.00 0 0 0 0 0 0
7.19/7.22 c inference : 0.00 0 0 0 0 0 0
7.19/7.22 c mostinf : 0.00 0 0 0 0 0 0
7.19/7.22 c leastinf : 0.00 0 0 0 0 0 0
7.19/7.22 c fullstrong : 0.00 0 0 0 0 0 0
7.19/7.22 c allfullstrong : 0.00 0 0 0 0 0 0
7.19/7.22 c random : 0.00 0 0 0 0 0 0
7.19/7.22 c Primal Heuristics : Time Calls Found
7.19/7.22 c LP solutions : 0.00 - 1
7.19/7.22 c pseudo solutions : 0.00 - 0
7.19/7.22 c trivial : 0.00 1 0
7.19/7.22 c simplerounding : 0.00 0 0
7.19/7.22 c zirounding : 0.00 0 0
7.19/7.22 c rounding : 0.00 0 0
7.19/7.22 c shifting : 0.00 0 0
7.19/7.22 c intshifting : 0.00 0 0
7.19/7.22 c oneopt : 0.00 0 0
7.19/7.22 c twoopt : 0.00 0 0
7.19/7.22 c fixandinfer : 0.00 0 0
7.19/7.22 c feaspump : 0.00 0 0
7.19/7.22 c coefdiving : 0.00 0 0
7.19/7.22 c pscostdiving : 0.00 0 0
7.19/7.22 c fracdiving : 0.00 0 0
7.19/7.22 c veclendiving : 0.00 0 0
7.19/7.22 c intdiving : 0.00 0 0
7.19/7.22 c actconsdiving : 0.00 0 0
7.19/7.22 c objpscostdiving : 0.00 0 0
7.19/7.22 c rootsoldiving : 0.00 0 0
7.19/7.22 c linesearchdiving : 0.00 0 0
7.19/7.22 c guideddiving : 0.00 0 0
7.19/7.22 c octane : 0.00 0 0
7.19/7.22 c rens : 0.00 0 0
7.19/7.22 c rins : 0.00 0 0
7.19/7.22 c localbranching : 0.00 0 0
7.19/7.22 c mutation : 0.00 0 0
7.19/7.22 c crossover : 0.00 0 0
7.19/7.22 c dins : 0.00 0 0
7.19/7.22 c undercover : 0.00 0 0
7.19/7.22 c nlp : 0.00 0 0
7.19/7.22 c trysol : 0.00 0 0
7.19/7.22 c LP : Time Calls Iterations Iter/call Iter/sec
7.19/7.22 c primal LP : 0.01 0 0 0.00 -
7.19/7.22 c dual LP : 0.40 49 1488 30.37 3738.74
7.19/7.22 c lex dual LP : 0.00 0 0 0.00 -
7.19/7.22 c barrier LP : 0.00 0 0 0.00 -
7.19/7.22 c diving/probing LP: 0.00 0 0 0.00 -
7.19/7.22 c strong branching : 3.58 229 11118 48.55 3105.62
7.19/7.22 c (at root node) : - 12 5278 439.83 -
7.19/7.22 c conflict analysis: 0.00 0 0 0.00 -
7.19/7.22 c B&B Tree :
7.19/7.22 c number of runs : 1
7.19/7.22 c nodes : 23
7.19/7.22 c nodes (total) : 23
7.19/7.22 c nodes left : 0
7.19/7.22 c max depth : 21
7.19/7.22 c max depth (total): 21
7.19/7.22 c backtracks : 0 (0.0%)
7.19/7.22 c delayed cutoffs : 0
7.19/7.22 c repropagations : 2 (12 domain reductions, 0 cutoffs)
7.19/7.22 c avg switch length: 2.09
7.19/7.22 c switching time : 0.02
7.19/7.22 c Solution :
7.19/7.22 c Solutions found : 1 (1 improvements)
7.19/7.22 c First Solution : +0.00000000000000e+00 (in run 1, after 23 nodes, 7.19 seconds, depth 21, found by <relaxation>)
7.19/7.22 c Primal Bound : +0.00000000000000e+00 (in run 1, after 23 nodes, 7.19 seconds, depth 21, found by <relaxation>)
7.19/7.22 c Dual Bound : +0.00000000000000e+00
7.19/7.22 c Gap : 0.00 %
7.19/7.22 c Root Dual Bound : +0.00000000000000e+00
7.19/7.22 c Root Iterations : 761
7.19/7.24 c Time complete: 7.24.