0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691600-1338021305.opb>
0.00/0.01 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.01 c problem read in 0.01
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 presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.04 c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.06 c presolving (4 rounds):
0.00/0.06 c 0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 242 implications, 22 cliques
0.00/0.06 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 22 constraints of type <setppc>
0.00/0.06 c 2420 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.05
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.1.1.4
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1797
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c propagating/probing/maxprerounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/indoneopt/freq = -1
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.07/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.07 c 0.1s| 1 | 0 | 76 | - |4259k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 90 | - |4696k| 0 | 39 | 231 |2726 | 231 |2451 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 105 | - |5018k| 0 | 45 | 231 |2726 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 120 | - |5461k| 0 | 46 | 231 |2726 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 140 | - |5904k| 0 | 50 | 231 |2726 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 152 | - |6354k| 0 | 49 | 231 |2726 | 231 |2461 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.68/0.72 c 0.7s| 1 | 2 | 152 | - |6355k| 0 | 49 | 231 |2726 | 231 |2461 | 18 | 0 | 10 | 0.000000e+00 | -- | Inf
9.48/9.53 c 9.5s| 100 | 15 | 5227 | 51.3 |6504k| 15 | 32 | 231 |2745 | 231 |2455 | 18 | 20 |1781 | 0.000000e+00 | -- | Inf
10.19/10.20 c *10.2s| 183 | 0 | 6796 | 36.5 |6500k| 21 | - | 231 |2793 | 231 |2455 | 18 | 68 |1899 | 0.000000e+00 | 0.000000e+00 | 0.00%
10.19/10.20 c
10.19/10.20 c SCIP Status : problem is solved [optimal solution found]
10.19/10.20 c Solving Time (sec) : 10.20
10.19/10.20 c Solving Nodes : 183
10.19/10.20 c Primal Bound : +0.00000000000000e+00 (1 solutions)
10.19/10.20 c Dual Bound : +0.00000000000000e+00
10.19/10.20 c Gap : 0.00 %
10.19/10.20 s SATISFIABLE
10.19/10.20 v x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 x170 -x160 -x150 -x140 -x130 -x230 -x220
10.19/10.20 v -x199 -x189 x179 -x169 -x159 -x149 -x139 -x129 x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
10.19/10.20 v -x198 -x177 -x167 x157 -x147 -x137 -x127 -x227 -x217 -x207 x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
10.19/10.20 v -x186 -x176 -x155 -x145 x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 x184 -x174
10.19/10.20 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
10.19/10.20 v -x152 x142 -x132 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104
10.19/10.20 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80
10.19/10.20 v -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 x69 -x68 -x67 -x66 -x65 -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
10.19/10.20 v -x53 -x52 -x51 -x50 -x49 x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29
10.19/10.20 v x28 -x27 -x26 -x25 -x24 -x23 -x22 x11 -x21 -x10 -x20 -x9 x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12
10.19/10.20 v -x1
10.19/10.20 c SCIP Status : problem is solved [optimal solution found]
10.19/10.20 c Total Time : 10.20
10.19/10.20 c solving : 10.20
10.19/10.20 c presolving : 0.05 (included in solving)
10.19/10.20 c reading : 0.01 (included in solving)
10.19/10.20 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
10.19/10.20 c Original Problem :
10.19/10.20 c Problem name : HOME/instance-3691600-1338021305.opb
10.19/10.20 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
10.19/10.20 c Constraints : 2707 initial, 2707 maximal
10.19/10.20 c Objective sense : minimize
10.19/10.20 c Presolved Problem :
10.19/10.20 c Problem name : t_HOME/instance-3691600-1338021305.opb
10.19/10.20 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
10.19/10.20 c Constraints : 2443 initial, 2793 maximal
10.19/10.20 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
10.19/10.20 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c setppc : 0.00 0.00 0 0 0 0 0 121 0 0 0
10.19/10.20 c linear : 0.02 0.00 0 0 0 0 0 143 0 0 0
10.19/10.20 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
10.19/10.20 c root node : - - 0 - - 0 - - - - -
10.19/10.20 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
10.19/10.20 c integral : 0 0 0 0 383 0 3 0 25 849 0 0 206
10.19/10.20 c knapsack : 1 1 5 859 1 0 0 27 1 185 0 0 0
10.19/10.20 c setppc : 22 22 5 858 1 0 0 1342 4 1352 0 0 0
10.19/10.20 c linear : 0+ 283 5 853 0 0 0 2 0 38 1 0 0
10.19/10.20 c logicor : 2420+ 2487 5 693 1 0 0 339 1 1509 0 0 0
10.19/10.20 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
10.19/10.20 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
10.19/10.20 c integral : 8.79 0.00 0.00 0.00 8.79 0.00 0.00 0.00
10.19/10.20 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
10.19/10.20 c logicor : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
10.19/10.20 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c Propagators : #Propagate #ResProp Cutoffs DomReds
10.19/10.20 c rootredcost : 0 0 0 0
10.19/10.20 c pseudoobj : 0 0 0 0
10.19/10.20 c vbounds : 0 0 0 0
10.19/10.20 c redcost : 388 0 0 0
10.19/10.20 c probing : 0 0 0 0
10.19/10.20 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
10.19/10.20 c rootredcost : 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c vbounds : 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c redcost : 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c probing : 0.00 0.00 0.00 0.00 0.00
10.19/10.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.19/10.20 c propagation : 0.00 6 6 30 24.1 0 0.0 -
10.19/10.20 c infeasible LP : 0.00 50 46 281 29.3 0 0.0 0
10.19/10.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.19/10.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.19/10.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.19/10.20 c applied globally : - - - 67 16.5 - - -
10.19/10.20 c applied locally : - - - 1 31.0 - - -
10.19/10.20 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
10.19/10.20 c cut pool : 0.00 4 - - 302 - (maximal pool size: 535)
10.19/10.20 c closecuts : 0.00 0.00 0 0 0 0 0
10.19/10.20 c impliedbounds : 0.00 0.00 5 0 0 0 0
10.19/10.20 c intobj : 0.00 0.00 0 0 0 0 0
10.19/10.20 c gomory : 0.10 0.00 5 0 0 201 0
10.19/10.20 c cgmip : 0.00 0.00 0 0 0 0 0
10.19/10.20 c strongcg : 0.19 0.00 5 0 0 2500 0
10.19/10.20 c cmir : 0.00 0.00 0 0 0 0 0
10.19/10.20 c flowcover : 0.00 0.00 0 0 0 0 0
10.19/10.20 c clique : 0.00 0.00 5 0 0 0 0
10.19/10.20 c zerohalf : 0.00 0.00 0 0 0 0 0
10.19/10.20 c mcf : 0.00 0.00 1 0 0 0 0
10.19/10.20 c oddcycle : 0.00 0.00 0 0 0 0 0
10.19/10.20 c rapidlearning : 0.10 0.00 1 0 0 0 283
10.19/10.20 c Pricers : ExecTime SetupTime Calls Vars
10.19/10.20 c problem variables: 0.00 - 0 0
10.19/10.20 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
10.19/10.20 c relpscost : 8.79 0.00 382 25 849 0 0 206
10.19/10.20 c pscost : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c inference : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c mostinf : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c leastinf : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c fullstrong : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c random : 0.00 0.00 0 0 0 0 0 0
10.19/10.20 c Primal Heuristics : ExecTime SetupTime Calls Found
10.19/10.20 c LP solutions : 0.00 - - 1
10.19/10.20 c pseudo solutions : 0.00 - - 0
10.19/10.20 c smallcard : 0.00 0.00 0 0
10.19/10.20 c trivial : 0.00 0.00 1 0
10.19/10.20 c shiftandpropagate: 0.00 0.00 0 0
10.19/10.20 c simplerounding : 0.00 0.00 0 0
10.19/10.20 c zirounding : 0.00 0.00 0 0
10.19/10.20 c rounding : 0.00 0.00 0 0
10.19/10.20 c shifting : 0.00 0.00 0 0
10.19/10.20 c intshifting : 0.00 0.00 0 0
10.19/10.20 c oneopt : 0.00 0.00 0 0
10.19/10.20 c twoopt : 0.00 0.00 0 0
10.19/10.20 c indtwoopt : 0.00 0.00 0 0
10.19/10.20 c indoneopt : 0.00 0.00 0 0
10.19/10.20 c fixandinfer : 0.00 0.00 0 0
10.19/10.20 c feaspump : 0.00 0.00 0 0
10.19/10.20 c clique : 0.00 0.00 0 0
10.19/10.20 c indrounding : 0.00 0.00 0 0
10.19/10.20 c indcoefdiving : 0.00 0.00 0 0
10.19/10.20 c coefdiving : 0.00 0.00 0 0
10.19/10.20 c pscostdiving : 0.00 0.00 0 0
10.19/10.20 c nlpdiving : 0.00 0.00 0 0
10.19/10.20 c fracdiving : 0.00 0.00 0 0
10.19/10.20 c veclendiving : 0.00 0.00 0 0
10.19/10.20 c intdiving : 0.00 0.00 0 0
10.19/10.20 c actconsdiving : 0.00 0.00 0 0
10.19/10.20 c objpscostdiving : 0.00 0.00 0 0
10.19/10.20 c rootsoldiving : 0.00 0.00 0 0
10.19/10.20 c linesearchdiving : 0.00 0.00 0 0
10.19/10.20 c guideddiving : 0.00 0.00 0 0
10.19/10.20 c octane : 0.00 0.00 0 0
10.19/10.20 c rens : 0.00 0.00 0 0
10.19/10.20 c rins : 0.00 0.00 0 0
10.19/10.20 c localbranching : 0.00 0.00 0 0
10.19/10.20 c mutation : 0.00 0.00 0 0
10.19/10.20 c crossover : 0.00 0.00 0 0
10.19/10.20 c dins : 0.00 0.00 0 0
10.19/10.20 c vbounds : 0.00 0.00 0 0
10.19/10.20 c undercover : 0.00 0.00 0 0
10.19/10.20 c subnlp : 0.00 0.00 0 0
10.19/10.20 c trysol : 0.00 0.00 0 0
10.19/10.20 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
10.19/10.20 c primal LP : 0.00 1 0 0.00 - 0.00 1
10.19/10.20 c dual LP : 0.82 438 6796 15.52 8277.44 0.00 0
10.19/10.20 c lex dual LP : 0.00 0 0 0.00 -
10.19/10.20 c barrier LP : 0.00 0 0 0.00 - 0.00 0
10.19/10.20 c diving/probing LP: 0.00 0 0 0.00 -
10.19/10.20 c strong branching : 8.75 1899 75899 39.97 8672.82
10.19/10.20 c (at root node) : - 10 2314 231.40 -
10.19/10.20 c conflict analysis: 0.00 0 0 0.00 -
10.19/10.20 c B&B Tree :
10.19/10.20 c number of runs : 1
10.19/10.20 c nodes : 183
10.19/10.20 c nodes (total) : 183
10.19/10.20 c nodes left : 0
10.19/10.20 c max depth : 21
10.19/10.20 c max depth (total): 21
10.19/10.20 c backtracks : 13 (7.1%)
10.19/10.20 c delayed cutoffs : 2
10.19/10.20 c repropagations : 73 (170 domain reductions, 2 cutoffs)
10.19/10.20 c avg switch length: 2.60
10.19/10.20 c switching time : 0.02
10.19/10.20 c Solution :
10.19/10.20 c Solutions found : 1 (1 improvements)
10.19/10.20 c First Solution : +0.00000000000000e+00 (in run 1, after 183 nodes, 10.20 seconds, depth 14, found by <relaxation>)
10.19/10.20 c Primal Bound : +0.00000000000000e+00 (in run 1, after 183 nodes, 10.20 seconds, depth 14, found by <relaxation>)
10.19/10.20 c Dual Bound : +0.00000000000000e+00
10.19/10.20 c Gap : 0.00 %
10.19/10.20 c Root Dual Bound : +0.00000000000000e+00
10.19/10.20 c Root Iterations : 152
10.19/10.21 c Time complete: 10.2.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3691600-1338021305/watcher-3691600-1338021305 -o /tmp/evaluation-result-3691600-1338021305/solver-3691600-1338021305 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691600-1338021305.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.02 2.02 2.00 3/174 2617
/proc/meminfo: memFree=29506460/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=12028 CPUtime=0 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 1812 0 0 0 0 0 0 0 20 0 1 0 268255958 12316672 1766 33554432000 4194304 10219143 140736811472688 140733254638680 8891101 0 0 4096 0 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 3007 1773 398 1471 0 1527 0
[startup+0.0761369 s]
/proc/loadavg: 2.02 2.02 2.00 3/174 2617
/proc/meminfo: memFree=29506460/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=30176 CPUtime=0.07 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 6571 0 0 0 6 1 0 0 20 0 1 0 268255958 30900224 6223 33554432000 4194304 10219143 140736811472688 140733254638680 7732960 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 7544 6223 742 1471 0 6064 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 30176
[startup+0.100327 s]
/proc/loadavg: 2.02 2.02 2.00 3/174 2617
/proc/meminfo: memFree=29506460/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=30608 CPUtime=0.09 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 6800 0 0 0 8 1 0 0 20 0 1 0 268255958 31342592 6452 33554432000 4194304 10219143 140736811472688 140733254638680 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 7652 6452 761 1471 0 6172 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 30608
[startup+0.300299 s]
/proc/loadavg: 2.02 2.02 2.00 3/174 2617
/proc/meminfo: memFree=29506460/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48376 CPUtime=0.29 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11693 0 0 0 26 3 0 0 20 0 1 0 268255958 49537024 10637 33554432000 4194304 10219143 140736811472688 140736811467832 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12094 10637 814 1471 0 10614 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 48376
[startup+0.700223 s]
/proc/loadavg: 2.02 2.02 2.00 3/174 2617
/proc/meminfo: memFree=29506460/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=0.68 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11810 0 0 0 65 3 0 0 20 0 1 0 268255958 49709056 10754 33554432000 4194304 10219143 140736811472688 140736811467576 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12136 10754 817 1471 0 10656 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 48544
[startup+1.50023 s]
/proc/loadavg: 2.02 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29466516/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=1.49 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11815 0 0 0 144 5 0 0 20 0 1 0 268255958 49709056 10759 33554432000 4194304 10219143 140736811472688 140736811466136 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12136 10759 822 1471 0 10656 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 48544
[startup+3.10022 s]
/proc/loadavg: 2.02 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465648/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=3.09 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11816 0 0 0 303 6 0 0 20 0 1 0 268255958 49709056 10760 33554432000 4194304 10219143 140736811472688 140736811466136 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12136 10760 823 1471 0 10656 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 48544
[startup+6.30022 s]
/proc/loadavg: 2.02 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465896/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=6.29 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11816 0 0 0 620 9 0 0 20 0 1 0 268255958 49709056 10760 33554432000 4194304 10219143 140736811472688 140736811466552 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12136 10760 823 1471 0 10656 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 48544
Solver just ended. Dumping a history of the last processes samples
[startup+7.90022 s]
/proc/loadavg: 2.01 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465896/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=7.89 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11816 0 0 0 778 11 0 0 20 0 1 0 268255958 49709056 10760 33554432000 4194304 10219143 140736811472688 140736811465816 9026266 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2617/statm: 12136 10760 823 1471 0 10656 0
Current children cumulated CPU time (s) 7.89
Current children cumulated vsize (KiB) 48544
[startup+9.50022 s]
/proc/loadavg: 2.01 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465912/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=9.48 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11816 0 0 0 936 12 0 0 20 0 1 0 268255958 49709056 10760 33554432000 4194304 10219143 140736811472688 140736811466136 9026266 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/2617/statm: 12136 10760 823 1471 0 10656 0
Current children cumulated CPU time (s) 9.48
Current children cumulated vsize (KiB) 48544
[startup+9.90647 s]
/proc/loadavg: 2.01 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465912/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=9.89 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11817 0 0 0 977 12 0 0 20 0 1 0 268255958 49709056 10761 33554432000 4194304 10219143 140736811472688 140736811466504 9026266 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/2617/statm: 12136 10761 824 1471 0 10656 0
Current children cumulated CPU time (s) 9.89
Current children cumulated vsize (KiB) 48544
[startup+10.1002 s]
/proc/loadavg: 2.01 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465912/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=10.09 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11817 0 0 0 996 13 0 0 20 0 1 0 268255958 49709056 10761 33554432000 4194304 10219143 140736811472688 140736811466504 9026266 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/2617/statm: 12136 10761 824 1471 0 10656 0
Current children cumulated CPU time (s) 10.09
Current children cumulated vsize (KiB) 48544
[startup+10.2002 s]
/proc/loadavg: 2.01 2.02 2.00 3/175 2618
/proc/meminfo: memFree=29465912/32873852 swapFree=7616/7616
[pid=2617] ppid=2615 vsize=48544 CPUtime=10.19 cores=1,3,5,7
/proc/2617/stat : 2617 (scip-2.1.1.4exp) R 2615 2617 403 0 -1 4202496 11817 0 0 0 1006 13 0 0 20 0 1 0 268255958 49709056 10761 33554432000 4194304 10219143 140736811472688 140736811465944 9026266 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/2617/statm: 12136 10761 824 1471 0 10656 0
Current children cumulated CPU time (s) 10.19
Current children cumulated vsize (KiB) 48544
Child status: 0
Real time (s): 10.2164
CPU time (s): 10.2104
CPU user time (s): 10.0745
CPU system time (s): 0.135979
CPU usage (%): 99.9421
Max. virtual memory (cumulated for all children) (KiB): 50968
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 10.0745
system time used= 0.135979
maximum resident set size= 45004
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11823
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 26
runsolver used 0.015997 second user time and 0.045993 second system time
The end