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-3453000-1307071540.opb>
0.00/0.00 c original problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 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.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 206 upgd conss, 0 impls, 26 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 26 cliques
0.00/0.01 c presolved problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 constraints
0.00/0.01 c 26 constraints of type <setppc>
0.00/0.01 c 180 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.4
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1800
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/subnlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 74 | - |1031k| 0 | 50 | 252 | 206 | 252 | 206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 99 | - |1329k| 0 | 53 | 252 | 223 | 252 | 212 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.07 c 0.1s| 1 | 0 | 183 | - |1367k| 0 | 54 | 252 | 223 | 252 | 215 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.09 c 0.1s| 1 | 0 | 488 | - |1410k| 0 | 47 | 252 | 223 | 252 | 219 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 527 | - |1540k| 0 | 51 | 252 | 223 | 252 | 226 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 609 | - |1852k| 0 | 63 | 252 | 223 | 252 | 233 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 2 | 609 | - |1853k| 0 | 63 | 252 | 223 | 252 | 233 | 27 | 0 | 16 | 0.000000e+00 | -- | Inf
4.49/4.51 c 4.5s| 10000 | 50 | 67021 | 6.6 |3938k| 40 | 16 | 252 |4724 | 252 | 218 | 27 |6552 |1753 | 0.000000e+00 | -- | Inf
6.09/6.18 c * 6.2s| 14069 | 0 | 96918 | 6.8 |4319k| 40 | - | 252 |5518 | 252 | 218 | 27 |9004 |1882 | 0.000000e+00 | 0.000000e+00 | 0.00%
6.09/6.18 c
6.09/6.18 c SCIP Status : problem is solved [optimal solution found]
6.09/6.18 c Solving Time (sec) : 6.18
6.09/6.18 c Solving Nodes : 14069
6.09/6.18 c Primal Bound : +0.00000000000000e+00 (1 solutions)
6.09/6.18 c Dual Bound : +0.00000000000000e+00
6.09/6.18 c Gap : 0.00 %
6.09/6.18 s SATISFIABLE
6.09/6.18 v -x157 -x155 -x1 -x8 -x7 -x78 -x77 -x82 -x152 -x73 -x161 -x149 x162 -x6 -x5 -x79 -x163 -x14 -x153 -x167 -x10 -x141 -x41 -x31 -x30
6.09/6.18 v -x166 -x158 -x70 -x65 -x62 -x59 -x164 -x147 x80 -x126 -x119 x32 -x146 -x116 -x34 -x114 -x117 -x61 -x123 -x33 x63 -x121 -x120
6.09/6.18 v -x165 -x37 -x36 -x66 -x38 -x2 -x27 -x26 -x25 -x24 -x22 -x20 -x17 -x16 -x40 -x35 -x28 -x125 -x12 -x68 -x29 -x69 -x74 -x145 -x71
6.09/6.18 v -x11 -x154 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x89 -x88 -x87 -x86 -x75 -x85 -x122 -x42 -x151 -x90 -x57 -x113 -x115 -x83
6.09/6.18 v -x143 -x186 -x185 -x184 -x183 -x182 -x181 -x3 -x58 -x67 -x84 -x144 -x4 -x174 -x173 -x172 x171 -x170 -x169 x15 -x159 -x112
6.09/6.18 v -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x103 -x102 -x101 -x99 -x118 -x18 -x148 -x9 -x39 -x76 x56 -x55 -x53 -x52 -x51 -x49
6.09/6.18 v -x47 -x46 -x45 -x44 -x43 -x210 -x209 x208 -x207 -x206 -x205 -x21 -x50 -x246 -x245 x244 -x243 -x242 -x241 x13 -x252 -x251 -x250
6.09/6.18 v -x249 x248 -x247 -x168 -x72 -x156 -x48 x124 -x100 x104 -x140 -x139 -x138 -x137 -x136 -x134 -x133 -x132 -x131 -x130 -x129 -x128
6.09/6.18 v -x127 -x180 x179 -x178 -x177 -x176 -x175 x142 -x240 -x239 -x238 x237 -x236 -x235 -x54 -x228 -x227 -x226 -x225 -x224 x223
6.09/6.18 v -x150 -x204 -x203 -x202 -x201 -x200 x199 -x160 -x216 x215 -x214 -x213 -x212 -x211 -x64 -x23 -x192 -x191 -x190 -x189 x188 -x187
6.09/6.18 v -x60 -x234 -x233 -x232 -x231 -x230 -x229 -x81 x222 -x221 -x220 -x219 -x218 -x217 x135 x198 -x197 -x196 -x195 -x194 -x193 -x19
6.09/6.18 c SCIP Status : problem is solved [optimal solution found]
6.09/6.18 c Total Time : 6.18
6.09/6.18 c solving : 6.18
6.09/6.18 c presolving : 0.01 (included in solving)
6.09/6.18 c reading : 0.00 (included in solving)
6.09/6.18 c Original Problem :
6.09/6.18 c Problem name : HOME/instance-3453000-1307071540.opb
6.09/6.18 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
6.09/6.18 c Constraints : 206 initial, 206 maximal
6.09/6.18 c Presolved Problem :
6.09/6.18 c Problem name : t_HOME/instance-3453000-1307071540.opb
6.09/6.18 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
6.09/6.18 c Constraints : 206 initial, 5580 maximal
6.09/6.18 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
6.09/6.18 c trivial : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c implics : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c probing : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c setppc : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c linear : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c logicor : 0.00 0 0 0 0 0 0 0 0 0
6.09/6.18 c root node : - 0 - - 0 - - - - -
6.09/6.18 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
6.09/6.18 c integral : 0 0 0 7379 0 3 0 88 284 0 0 14158
6.09/6.18 c setppc : 26 5 48442 1 0 0 190353 20 99086 0 0 0
6.09/6.18 c linear : 0+ 5 41 0 0 0 0 0 0 0 0 0
6.09/6.18 c logicor : 180+ 5 17858 1 0 0 23589 62 11315 0 0 0
6.09/6.18 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
6.09/6.18 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
6.09/6.18 c integral : 0.94 0.00 0.00 0.94 0.00 0.00 0.00
6.09/6.18 c setppc : 0.15 0.00 0.11 0.00 0.00 0.00 0.03
6.09/6.18 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.18 c logicor : 0.32 0.00 0.29 0.00 0.00 0.00 0.02
6.09/6.18 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
6.09/6.18 c Propagators : #Propagate #Resprop Cutoffs DomReds
6.09/6.18 c vbounds : 0 0 0 0
6.09/6.18 c rootredcost : 0 0 0 0
6.09/6.18 c pseudoobj : 0 0 0 0
6.09/6.18 c Propagator Timings : TotalTime Propagate Resprop
6.09/6.18 c vbounds : 0.01 0.01 0.00
6.09/6.18 c rootredcost : 0.01 0.01 0.00
6.09/6.18 c pseudoobj : 0.00 0.00 0.00
6.09/6.18 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.09/6.18 c propagation : 0.00 82 79 654 26.3 0 0.0 -
6.09/6.18 c infeasible LP : 0.43 6840 6452 60983 31.4 41 26.3 0
6.09/6.18 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.09/6.18 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.09/6.18 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.09/6.18 c applied globally : - - - 9004 17.0 - - -
6.09/6.18 c applied locally : - - - 0 0.0 - - -
6.09/6.18 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.09/6.18 c cut pool : 0.00 4 - - 1 - (maximal pool size: 236)
6.09/6.18 c redcost : 0.03 7190 0 0 0 0
6.09/6.18 c impliedbounds : 0.00 5 0 0 0 0
6.09/6.18 c intobj : 0.00 0 0 0 0 0
6.09/6.18 c gomory : 0.04 5 0 0 640 0
6.09/6.18 c cgmip : 0.00 0 0 0 0 0
6.09/6.18 c closecuts : 0.00 0 0 0 0 0
6.09/6.18 c strongcg : 0.03 5 0 0 654 0
6.09/6.18 c cmir : 0.00 0 0 0 0 0
6.09/6.18 c flowcover : 0.00 0 0 0 0 0
6.09/6.18 c clique : 0.00 5 0 0 0 0
6.09/6.18 c zerohalf : 0.00 0 0 0 0 0
6.09/6.18 c mcf : 0.00 1 0 0 0 0
6.09/6.18 c oddcycle : 0.00 0 0 0 0 0
6.09/6.18 c rapidlearning : 0.02 1 0 0 0 17
6.09/6.18 c Pricers : Time Calls Vars
6.09/6.18 c problem variables: 0.00 0 0
6.09/6.18 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.09/6.18 c relpscost : 0.94 7378 88 284 0 0 14158
6.09/6.18 c pscost : 0.00 0 0 0 0 0 0
6.09/6.18 c inference : 0.00 0 0 0 0 0 0
6.09/6.18 c mostinf : 0.00 0 0 0 0 0 0
6.09/6.18 c leastinf : 0.00 0 0 0 0 0 0
6.09/6.18 c fullstrong : 0.00 0 0 0 0 0 0
6.09/6.18 c allfullstrong : 0.00 0 0 0 0 0 0
6.09/6.18 c random : 0.00 0 0 0 0 0 0
6.09/6.18 c Primal Heuristics : Time Calls Found
6.09/6.18 c LP solutions : 0.00 - 1
6.09/6.18 c pseudo solutions : 0.00 - 0
6.09/6.18 c trivial : 0.00 1 0
6.09/6.18 c shiftandpropagate: 0.00 0 0
6.09/6.18 c simplerounding : 0.00 0 0
6.09/6.18 c zirounding : 0.00 0 0
6.09/6.18 c rounding : 0.00 0 0
6.09/6.18 c shifting : 0.00 0 0
6.09/6.18 c intshifting : 0.00 0 0
6.09/6.18 c oneopt : 0.00 0 0
6.09/6.18 c twoopt : 0.00 0 0
6.09/6.18 c fixandinfer : 0.00 0 0
6.09/6.18 c feaspump : 0.00 0 0
6.09/6.18 c clique : 0.00 0 0
6.09/6.18 c coefdiving : 0.00 0 0
6.09/6.18 c pscostdiving : 0.00 0 0
6.09/6.18 c fracdiving : 0.00 0 0
6.09/6.18 c veclendiving : 0.00 0 0
6.09/6.18 c intdiving : 0.00 0 0
6.09/6.18 c actconsdiving : 0.00 0 0
6.09/6.18 c objpscostdiving : 0.00 0 0
6.09/6.18 c rootsoldiving : 0.00 0 0
6.09/6.18 c linesearchdiving : 0.00 0 0
6.09/6.18 c guideddiving : 0.00 0 0
6.09/6.18 c octane : 0.00 0 0
6.09/6.18 c rens : 0.00 0 0
6.09/6.18 c rins : 0.00 0 0
6.09/6.18 c localbranching : 0.00 0 0
6.09/6.18 c mutation : 0.00 0 0
6.09/6.18 c crossover : 0.00 0 0
6.09/6.18 c dins : 0.00 0 0
6.09/6.18 c vbounds : 0.00 0 0
6.09/6.18 c undercover : 0.00 0 0
6.09/6.18 c subnlp : 0.00 0 0
6.09/6.18 c trysol : 0.00 0 0
6.09/6.18 c LP : Time Calls Iterations Iter/call Iter/sec
6.09/6.18 c primal LP : 0.00 0 0 0.00 -
6.09/6.18 c dual LP : 3.09 14006 96918 6.92 31407.25
6.09/6.18 c lex dual LP : 0.00 0 0 0.00 -
6.09/6.18 c barrier LP : 0.00 0 0 0.00 -
6.09/6.18 c diving/probing LP: 0.00 0 0 0.00 -
6.09/6.18 c strong branching : 0.86 1882 23265 12.36 27096.25
6.09/6.18 c (at root node) : - 16 432 27.00 -
6.09/6.18 c conflict analysis: 0.00 0 0 0.00 -
6.09/6.18 c B&B Tree :
6.09/6.18 c number of runs : 1
6.09/6.18 c nodes : 14069
6.09/6.18 c nodes (total) : 14069
6.09/6.18 c nodes left : 0
6.09/6.18 c max depth : 40
6.09/6.18 c max depth (total): 40
6.09/6.18 c backtracks : 2282 (16.2%)
6.09/6.18 c delayed cutoffs : 43
6.09/6.18 c repropagations : 16999 (25141 domain reductions, 21 cutoffs)
6.09/6.18 c avg switch length: 4.16
6.09/6.18 c switching time : 0.43
6.09/6.18 c Solution :
6.09/6.18 c Solutions found : 1 (1 improvements)
6.09/6.18 c First Solution : +0.00000000000000e+00 (in run 1, after 14069 nodes, 6.18 seconds, depth 15, found by <relaxation>)
6.09/6.18 c Primal Bound : +0.00000000000000e+00 (in run 1, after 14069 nodes, 6.18 seconds, depth 15, found by <relaxation>)
6.09/6.18 c Dual Bound : +0.00000000000000e+00
6.09/6.18 c Gap : 0.00 %
6.09/6.18 c Root Dual Bound : +0.00000000000000e+00
6.09/6.18 c Root Iterations : 609
6.09/6.19 c Time complete: 6.18.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
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-3453000-1307071540/watcher-3453000-1307071540 -o /tmp/evaluation-result-3453000-1307071540/solver-3453000-1307071540 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453000-1307071540.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.17 2.08 2.01 2/515 6043
/proc/meminfo: memFree=17527504/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=14432 CPUtime=0 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 2599 0 0 0 0 0 0 0 25 0 1 0 897384667 14778368 2553 33554432000 4194304 9128323 140733253803440 18446744073709551615 4693424 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 3867 2561 461 1205 0 2658 0
[startup+0.022687 s]
/proc/loadavg: 2.17 2.08 2.01 2/515 6043
/proc/meminfo: memFree=17527504/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=18304 CPUtime=0.02 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 3740 0 0 0 2 0 0 0 25 0 1 0 897384667 18743296 3435 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 4576 3435 633 1205 0 3367 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 18304
[startup+0.100693 s]
/proc/loadavg: 2.17 2.08 2.01 2/515 6043
/proc/meminfo: memFree=17527504/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=0.09 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6503 0 0 0 9 0 0 0 25 0 1 0 897384667 29593600 5845 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 5845 691 1205 0 6016 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 28900
[startup+0.300654 s]
/proc/loadavg: 2.17 2.08 2.01 2/515 6043
/proc/meminfo: memFree=17527504/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=0.29 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6522 0 0 0 28 1 0 0 25 0 1 0 897384667 29593600 5864 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 5864 696 1205 0 6016 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 28900
[startup+0.70058 s]
/proc/loadavg: 2.17 2.08 2.01 2/515 6043
/proc/meminfo: memFree=17527504/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=0.69 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6522 0 0 0 67 2 0 0 25 0 1 0 897384667 29593600 5864 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 5864 696 1205 0 6016 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 28900
[startup+1.50043 s]
/proc/loadavg: 2.17 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17505664/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=1.49 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6523 0 0 0 144 5 0 0 25 0 1 0 897384667 29593600 5865 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 5865 696 1205 0 6016 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 28900
[startup+3.10113 s]
/proc/loadavg: 2.17 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17503680/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=3.09 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6523 0 0 0 300 9 0 0 25 0 1 0 897384667 29593600 5865 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 5865 696 1205 0 6016 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 28900
Solver just ended. Dumping a history of the last processes samples
[startup+4.70083 s]
/proc/loadavg: 2.16 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17504184/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=4.69 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6663 0 0 0 457 12 0 0 25 0 1 0 897384667 29593600 6005 33554432000 4194304 9128323 140733253803440 18446744073709551615 5332999 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 6005 696 1205 0 6016 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 28900
[startup+5.51967 s]
/proc/loadavg: 2.16 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17503812/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=5.51 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6742 0 0 0 537 14 0 0 25 0 1 0 897384667 29593600 6084 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 6084 696 1205 0 6016 0
Current children cumulated CPU time (s) 5.51
Current children cumulated vsize (KiB) 28900
[startup+5.90059 s]
/proc/loadavg: 2.16 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17503812/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=5.9 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6748 0 0 0 575 15 0 0 25 0 1 0 897384667 29593600 6090 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 6090 696 1205 0 6016 0
Current children cumulated CPU time (s) 5.9
Current children cumulated vsize (KiB) 28900
[startup+6.10056 s]
/proc/loadavg: 2.16 2.08 2.01 3/516 6044
/proc/meminfo: memFree=17503812/32950928 swapFree=58671692/67111528
[pid=6043] ppid=6041 vsize=28900 CPUtime=6.09 cores=0,2,4,6
/proc/6043/stat : 6043 (scip-2.0.1.4.li) R 6041 6043 1417 0 -1 4202496 6763 0 0 0 594 15 0 0 25 0 1 0 897384667 29593600 6105 33554432000 4194304 9128323 140733253803440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/6043/statm: 7225 6105 696 1205 0 6016 0
Current children cumulated CPU time (s) 6.09
Current children cumulated vsize (KiB) 28900
Child status: 0
Real time (s): 6.19096
CPU time (s): 6.19106
CPU user time (s): 6.03208
CPU system time (s): 0.158975
CPU usage (%): 100.002
Max. virtual memory (cumulated for all children) (KiB): 28900
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 6.03208
system time used= 0.158975
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6775
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= 5
involuntary context switches= 7
runsolver used 0.032994 second user time and 0.081987 second system time
The end