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-3737730-1338717696.opb>
0.00/0.01 c original problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.00/0.01 c problem read
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, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10264 impls, 200 clqs
0.05/0.06 c presolving (2 rounds):
0.05/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.05/0.06 c 10264 implications, 200 cliques
0.05/0.06 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.05/0.06 c 1 constraints of type <knapsack>
0.05/0.06 c 300 constraints of type <setppc>
0.05/0.06 c 1258 constraints of type <and>
0.05/0.06 c 1 constraints of type <linear>
0.05/0.06 c transformed objective value is always integral (scale: 1)
0.05/0.06 c Presolving Time: 0.05
0.05/0.06 c - non default parameters ----------------------------------------------------------------------
0.05/0.06 c # SCIP version 1.2.1.3
0.05/0.06 c
0.05/0.06 c # frequency for displaying node information lines
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.05/0.06 c display/freq = 10000
0.05/0.06 c
0.05/0.06 c # maximal time in seconds to run
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.06 c limits/time = 1789.99
0.05/0.06 c
0.05/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.06 c limits/memory = 13950
0.05/0.06 c
0.05/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c limits/solutions = 1
0.05/0.06 c
0.05/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.05/0.06 c separating/maxrounds = 1
0.05/0.06 c
0.05/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c separating/maxroundsroot = 5
0.05/0.06 c
0.05/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.05/0.06 c # [type: int, range: [1,2], default: 1]
0.05/0.06 c timing/clocktype = 2
0.05/0.06 c
0.05/0.06 c # should presolving try to simplify inequalities
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.06 c constraints/linear/simplifyinequalities = TRUE
0.05/0.06 c
0.05/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.06 c constraints/indicator/addCouplingCons = TRUE
0.05/0.06 c
0.05/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.05/0.06 c constraints/knapsack/disaggregation = FALSE
0.05/0.06 c
0.05/0.06 c # should presolving try to simplify knapsacks
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.05/0.06 c
0.05/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c presolving/probing/maxrounds = 0
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/coefdiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.05/0.06 c heuristics/crossover/freq = -1
0.05/0.06 c
0.05/0.06 c # number of nodes added to the contingent of the total nodes
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.06 c heuristics/crossover/nodesofs = 750
0.05/0.06 c
0.05/0.06 c # number of nodes without incumbent change that heuristic should wait
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.05/0.06 c heuristics/crossover/nwaitingnodes = 100
0.05/0.06 c
0.05/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.05/0.06 c # [type: real, range: [0,1], default: 0.1]
0.05/0.06 c heuristics/crossover/nodesquot = 0.15
0.05/0.06 c
0.05/0.06 c # minimum percentage of integer variables that have to be fixed
0.05/0.06 c # [type: real, range: [0,1], default: 0.666]
0.05/0.06 c heuristics/crossover/minfixingrate = 0.5
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/feaspump/freq = -1
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/fracdiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/guideddiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/intshifting/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/linesearchdiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/nlp/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/objpscostdiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.05/0.06 c # [type: real, range: [0,1], default: 0.01]
0.05/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/oneopt/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/pscostdiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c heuristics/rens/freq = -1
0.05/0.06 c
0.05/0.06 c # minimum percentage of integer variables that have to be fixable
0.05/0.06 c # [type: real, range: [0,1], default: 0.5]
0.05/0.06 c heuristics/rens/minfixingrate = 0.3
0.05/0.06 c
0.05/0.06 c # number of nodes added to the contingent of the total nodes
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.06 c heuristics/rens/nodesofs = 2000
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/rootsoldiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.05/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/rounding/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/shifting/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/simplerounding/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c heuristics/trivial/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/trysol/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/veclendiving/freq = -1
0.05/0.06 c
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.05/0.06 c
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.05/0.06 c
0.05/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/zirounding/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c separating/cmir/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c separating/flowcover/freq = -1
0.05/0.06 c
0.05/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c separating/rapidlearning/freq = 0
0.05/0.06 c
0.05/0.06 c -----------------------------------------------------------------------------------------------
0.05/0.06 c start solving
0.05/0.06 c
0.05/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.05/0.09 c 0.1s| 1 | 0 | 212 | - |6577k| 0 | 100 |1458 |1560 |1458 |2818 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 272 | - |6923k| 0 | 114 |1458 |1560 |1458 |2832 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 389 | - |7180k| 0 | 105 |1458 |1560 |1458 |2847 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.88/0.90 c 0.9s| 1 | 0 | 529 | - |7310k| 0 | 97 |1458 |1560 |1458 |2856 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.12 c 1.1s| 1 | 0 | 652 | - |7509k| 0 | 100 |1458 |1560 |1458 |2866 | 48 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 761 | - |7517k| 0 | 98 |1458 |1560 |1458 |2873 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
2.38/2.47 c 2.5s| 1 | 2 | 761 | - |7518k| 0 | 98 |1458 |1560 |1458 |2873 | 55 | 0 | 12 | 0.000000e+00 | -- | Inf
2.99/3.06 c * 3.1s| 23 | 0 | 1488 | 33.0 |7476k| 21 | - |1458 |1561 |1458 | 505 | 185 | 1 | 229 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.99/3.07 c
2.99/3.07 c SCIP Status : problem is solved [optimal solution found]
2.99/3.07 c Solving Time (sec) : 3.06
2.99/3.07 c Solving Nodes : 23
2.99/3.07 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.99/3.07 c Dual Bound : +0.00000000000000e+00
2.99/3.07 c Gap : 0.00 %
2.99/3.07 s SATISFIABLE
2.99/3.07 v -x128 -x141 -x182 -x146 -x136 x166 -x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 -x124 -x133 -x188 x189 -x147 -x139 -x197 -x191
2.99/3.07 v -x163 -x130 -x192 -x194 -x106 -x170 -x140 -x109 -x117 x107 -x196 -x187 -x168 -x190 -x148 -x171 -x161 -x160 x158 -x154 x151
2.99/3.07 v -x114 x173 -x199 x176 -x177 -x193 -x172 -x143 -x135 -x162 -x125 -x195 -x120 -x200 -x157 -x167 -x134 x113 -x111 -x131 -x121 -x183
2.99/3.07 v -x123 -x174 -x180 -x169 -x198 -x159 -x137 -x132 -x122 -x119 -x112 x105 -x118 -x150 -x142 -x103 -x104 -x165 -x115 -x155 -x101
2.99/3.07 v -x144 x116 -x110 x108 -x145 -x186 x129 -x126 -x138 x164 -x127 x175 x184 -x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
2.99/3.07 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
2.99/3.07 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
2.99/3.07 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
2.99/3.07 v x15 -x14 -x13 x12 x11 x10 -x9 -x8 -x7 -x6 -x5 x4 -x3 x2 -x1
2.99/3.07 c SCIP Status : problem is solved [optimal solution found]
2.99/3.07 c Solving Time : 3.06
2.99/3.07 c Original Problem :
2.99/3.07 c Problem name : HOME/instance-3737730-1338717696.opb
2.99/3.07 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.07 c Constraints : 1560 initial, 1560 maximal
2.99/3.07 c Presolved Problem :
2.99/3.07 c Problem name : t_HOME/instance-3737730-1338717696.opb
2.99/3.07 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.07 c Constraints : 1560 initial, 1561 maximal
2.99/3.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.07 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c probing : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c setppc : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c and : 0.04 0 0 0 0 0 0 0 0
2.99/3.07 c linear : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c root node : - 0 - - 0 - - - -
2.99/3.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.07 c integral : 0 0 0 26 0 0 6 0 0 42
2.99/3.07 c knapsack : 1 5 61 1 0 0 0 0 0 0
2.99/3.07 c setppc : 300 5 61 1 0 1 128 0 0 0
2.99/3.07 c and : 1258 26 60 1 0 0 1101 143 0 0
2.99/3.07 c linear : 1 5 60 1 0 0 0 0 0 0
2.99/3.07 c logicor : 0+ 0 1 0 0 0 1 0 0 0
2.99/3.07 c countsols : 0 0 0 1 0 0 0 0 0 0
2.99/3.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.07 c integral : 1.62 0.00 0.00 1.62 0.00
2.99/3.07 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c setppc : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c and : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c linear : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c logicor : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c Propagators : Time Calls Cutoffs DomReds
2.99/3.07 c vbounds : 0.00 1 0 0
2.99/3.07 c rootredcost : 0.00 0 0 0
2.99/3.07 c pseudoobj : 0.00 0 0 0
2.99/3.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.07 c propagation : 0.00 1 1 1 3.0 0 0.0 -
2.99/3.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.07 c applied globally : - - - 1 3.0 - - -
2.99/3.07 c applied locally : - - - 0 0.0 - - -
2.99/3.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.07 c cut pool : 0.00 4 - - 7 - (maximal pool size: 227)
2.99/3.07 c redcost : 0.00 26 0 0 0 0
2.99/3.07 c impliedbounds : 0.00 5 0 0 28 0
2.99/3.07 c intobj : 0.00 0 0 0 0 0
2.99/3.07 c cgmip : 0.00 0 0 0 0 0
2.99/3.07 c gomory : 0.58 5 0 0 162 0
2.99/3.07 c strongcg : 0.45 5 0 0 2000 0
2.99/3.07 c cmir : 0.00 0 0 0 0 0
2.99/3.07 c flowcover : 0.00 0 0 0 0 0
2.99/3.07 c clique : 0.01 5 0 0 32 0
2.99/3.07 c zerohalf : 0.00 0 0 0 0 0
2.99/3.07 c mcf : 0.00 1 0 0 0 0
2.99/3.07 c rapidlearning : 0.13 1 0 0 0 0
2.99/3.07 c Pricers : Time Calls Vars
2.99/3.07 c problem variables: 0.00 0 0
2.99/3.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.07 c relpscost : 1.62 25 0 6 0 0 42
2.99/3.07 c pscost : 0.00 0 0 0 0 0 0
2.99/3.07 c inference : 0.00 0 0 0 0 0 0
2.99/3.07 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.07 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.07 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.07 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.07 c random : 0.00 0 0 0 0 0 0
2.99/3.07 c Primal Heuristics : Time Calls Found
2.99/3.07 c LP solutions : 0.00 - 1
2.99/3.07 c pseudo solutions : 0.00 - 0
2.99/3.07 c trivial : 0.00 1 0
2.99/3.07 c simplerounding : 0.00 0 0
2.99/3.07 c zirounding : 0.00 0 0
2.99/3.07 c rounding : 0.00 0 0
2.99/3.07 c shifting : 0.00 0 0
2.99/3.07 c intshifting : 0.00 0 0
2.99/3.07 c oneopt : 0.00 0 0
2.99/3.07 c twoopt : 0.00 0 0
2.99/3.07 c fixandinfer : 0.00 0 0
2.99/3.07 c feaspump : 0.00 0 0
2.99/3.07 c coefdiving : 0.00 0 0
2.99/3.07 c pscostdiving : 0.00 0 0
2.99/3.07 c fracdiving : 0.00 0 0
2.99/3.07 c veclendiving : 0.00 0 0
2.99/3.07 c intdiving : 0.00 0 0
2.99/3.07 c actconsdiving : 0.00 0 0
2.99/3.07 c objpscostdiving : 0.00 0 0
2.99/3.07 c rootsoldiving : 0.00 0 0
2.99/3.07 c linesearchdiving : 0.00 0 0
2.99/3.07 c guideddiving : 0.00 0 0
2.99/3.07 c octane : 0.00 0 0
2.99/3.07 c rens : 0.00 0 0
2.99/3.07 c rins : 0.00 0 0
2.99/3.07 c localbranching : 0.00 0 0
2.99/3.07 c mutation : 0.00 0 0
2.99/3.07 c crossover : 0.00 0 0
2.99/3.07 c dins : 0.00 0 0
2.99/3.07 c undercover : 0.00 0 0
2.99/3.07 c nlp : 0.00 0 0
2.99/3.07 c trysol : 0.00 0 0
2.99/3.07 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.07 c primal LP : 0.00 0 0 0.00 -
2.99/3.07 c dual LP : 0.18 49 1488 30.37 8399.47
2.99/3.07 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.07 c barrier LP : 0.00 0 0 0.00 -
2.99/3.07 c diving/probing LP: 0.00 0 0 0.00 -
2.99/3.07 c strong branching : 1.62 229 11118 48.55 6879.29
2.99/3.07 c (at root node) : - 12 5278 439.83 -
2.99/3.07 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.07 c B&B Tree :
2.99/3.07 c number of runs : 1
2.99/3.07 c nodes : 23
2.99/3.07 c nodes (total) : 23
2.99/3.07 c nodes left : 0
2.99/3.07 c max depth : 21
2.99/3.07 c max depth (total): 21
2.99/3.07 c backtracks : 0 (0.0%)
2.99/3.07 c delayed cutoffs : 0
2.99/3.07 c repropagations : 2 (12 domain reductions, 0 cutoffs)
2.99/3.07 c avg switch length: 2.09
2.99/3.07 c switching time : 0.01
2.99/3.07 c Solution :
2.99/3.07 c Solutions found : 1 (1 improvements)
2.99/3.07 c First Solution : +0.00000000000000e+00 (in run 1, after 23 nodes, 3.05 seconds, depth 21, found by <relaxation>)
2.99/3.07 c Primal Bound : +0.00000000000000e+00 (in run 1, after 23 nodes, 3.05 seconds, depth 21, found by <relaxation>)
2.99/3.07 c Dual Bound : +0.00000000000000e+00
2.99/3.07 c Gap : 0.00 %
2.99/3.07 c Root Dual Bound : +0.00000000000000e+00
2.99/3.07 c Root Iterations : 761
2.99/3.07 c Time complete: 3.07.
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-3737730-1338717696/watcher-3737730-1338717696 -o /tmp/evaluation-result-3737730-1338717696/solver-3737730-1338717696 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3737730-1338717696.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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.00 2.00 1.93 3/177 2709
/proc/meminfo: memFree=28338864/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=9972 CPUtime=0 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 1713 0 0 0 0 0 0 0 20 0 1 0 337895238 10211328 1659 33554432000 4194304 8395647 140737060084736 140737060083688 7382157 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 2493 1670 374 1026 0 1463 0
[startup+0.0590761 s]
/proc/loadavg: 2.00 2.00 1.93 3/177 2709
/proc/meminfo: memFree=28338864/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=20584 CPUtime=0.05 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 4508 0 0 0 5 0 0 0 20 0 1 0 337895238 21078016 4100 33554432000 4194304 8395647 140737060084736 140737060083688 6016680 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 5146 4100 483 1026 0 4116 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 20584
[startup+0.100293 s]
/proc/loadavg: 2.00 2.00 1.93 3/177 2709
/proc/meminfo: memFree=28338864/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=25376 CPUtime=0.09 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 5890 0 0 0 9 0 0 0 20 0 1 0 337895238 25985024 5414 33554432000 4194304 8395647 140737060084736 140737060083688 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 6344 5414 590 1026 0 5314 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 25376
[startup+0.300225 s]
/proc/loadavg: 2.00 2.00 1.93 3/177 2709
/proc/meminfo: memFree=28338864/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=42776 CPUtime=0.29 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 9928 0 0 0 25 4 0 0 20 0 1 0 337895238 43802624 9453 33554432000 4194304 8395647 140737060084736 140737060083688 7382132 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 10694 9469 605 1026 0 9664 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 42776
[startup+0.700227 s]
/proc/loadavg: 2.00 2.00 1.93 3/177 2709
/proc/meminfo: memFree=28338864/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=33308 CPUtime=0.69 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 11134 0 0 0 62 7 0 0 20 0 1 0 337895238 34107392 7484 33554432000 4194304 8395647 140737060084736 140737060080008 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 8327 7484 620 1026 0 7297 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 33308
[startup+1.50023 s]
/proc/loadavg: 2.00 2.00 1.93 3/178 2710
/proc/meminfo: memFree=28308956/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=37152 CPUtime=1.49 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 12021 0 0 0 141 8 0 0 20 0 1 0 337895238 38043648 8371 33554432000 4194304 8395647 140737060084736 140737060080024 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 9288 8371 620 1026 0 8258 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 37152
Solver just ended. Dumping a history of the last processes samples
[startup+2.30022 s]
/proc/loadavg: 2.00 2.00 1.93 3/178 2786
/proc/meminfo: memFree=28584500/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=37152 CPUtime=2.28 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 12102 0 0 0 220 8 0 0 20 0 1 0 337895238 38043648 8452 33554432000 4194304 8395647 140737060084736 140737060080024 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 9288 8452 620 1026 0 8258 0
Current children cumulated CPU time (s) 2.28
Current children cumulated vsize (KiB) 37152
[startup+2.70023 s]
/proc/loadavg: 2.00 2.00 1.93 3/178 2786
/proc/meminfo: memFree=28584500/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=37152 CPUtime=2.69 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 12125 0 0 0 260 9 0 0 20 0 1 0 337895238 38043648 8475 33554432000 4194304 8395647 140737060084736 140737060079608 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 9288 8475 621 1026 0 8258 0
Current children cumulated CPU time (s) 2.69
Current children cumulated vsize (KiB) 37152
[startup+2.90023 s]
/proc/loadavg: 2.00 2.00 1.93 3/178 2786
/proc/meminfo: memFree=28584500/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=37152 CPUtime=2.88 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 12125 0 0 0 279 9 0 0 20 0 1 0 337895238 38043648 8475 33554432000 4194304 8395647 140737060084736 140737060079608 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 9288 8475 621 1026 0 8258 0
Current children cumulated CPU time (s) 2.88
Current children cumulated vsize (KiB) 37152
[startup+3.00023 s]
/proc/loadavg: 2.00 2.00 1.93 3/178 2786
/proc/meminfo: memFree=28584500/32873844 swapFree=7112/7112
[pid=2709] ppid=2707 vsize=37152 CPUtime=2.99 cores=0,2,4,6
/proc/2709/stat : 2709 (pbscip.linux.x8) R 2707 2709 2459 0 -1 4202496 12129 0 0 0 289 10 0 0 20 0 1 0 337895238 38043648 8479 33554432000 4194304 8395647 140737060084736 140737060079608 7428202 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/2709/statm: 9288 8479 625 1026 0 8258 0
Current children cumulated CPU time (s) 2.99
Current children cumulated vsize (KiB) 37152
Child status: 0
Real time (s): 3.0798
CPU time (s): 3.07753
CPU user time (s): 2.97355
CPU system time (s): 0.103984
CPU usage (%): 99.9263
Max. virtual memory (cumulated for all children) (KiB): 42776
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.97355
system time used= 0.103984
maximum resident set size= 38960
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 12135
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= 5
runsolver used 0.005999 second user time and 0.012998 second system time
The end