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-3447396-1307897145.wbo>
0.00/0.00 c original problem has 234 variables (234 bin, 0 int, 0 impl, 0 cont) and 43 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs
0.00/0.00 c (round 3) 0 del vars, 1 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (round 4) 0 del vars, 1 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 28 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (0.0s) probing: 101/234 (43.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 14 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 14 implications, 13 cliques
0.00/0.01 c presolved problem has 248 variables (234 bin, 0 int, 14 impl, 0 cont) and 56 constraints
0.00/0.01 c 13 constraints of type <setppc>
0.00/0.01 c 14 constraints of type <linear>
0.00/0.01 c 14 constraints of type <indicator>
0.00/0.01 c 15 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 # 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 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 # 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 o 59
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 T 0.0s| 1 | 0 | 0 | - | 814k| 0 | - | 248 | 70 | 248 | 42 | 0 | 0 | 0 | -- | 5.900000e+01 | Inf
0.00/0.01 c 0.0s| 1 | 0 | 190 | - | 773k| 0 | 0 | 248 | 58 | 248 | 42 | 0 | 0 | 0 | 0.000000e+00 | 5.900000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 198 | - | 819k| 0 | 0 | 248 | 87 | 248 | 44 | 2 | 0 | 0 | 0.000000e+00 | 5.900000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 201 | - | 820k| 0 | 0 | 248 | 87 | 248 | 46 | 4 | 0 | 0 | 0.000000e+00 | 5.900000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 203 | - | 820k| 0 | 1 | 248 | 87 | 248 | 48 | 6 | 0 | 0 | 1.400000e+00 | 5.900000e+01 |4114.29%
0.00/0.03 c 0.0s| 1 | 0 | 206 | - | 859k| 0 | 0 | 248 | 87 | 248 | 51 | 9 | 0 | 0 | 1.400000e+01 | 5.900000e+01 | 321.43%
0.00/0.03 c 0.0s| 1 | 0 | 207 | - | 859k| 0 | 0 | 248 | 87 | 248 | 52 | 10 | 0 | 0 | 1.500000e+01 | 5.900000e+01 | 293.33%
0.00/0.03 o 15
0.00/0.03 c * 0.0s| 1 | 0 | 207 | - | 862k| 0 | - | 248 | 87 | 248 | 52 | 10 | 0 | 0 | 1.500000e+01 | 1.500000e+01 | 0.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.03
0.00/0.03 c Solving Nodes : 1
0.00/0.03 c Primal Bound : +1.50000000000000e+01 (5 solutions)
0.00/0.03 c Dual Bound : +1.50000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v -x220 -x219 -x218 x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 x201 -x200 -x199
0.00/0.03 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 x182 -x181 -x180 -x179 -x178
0.00/0.03 v -x177 -x176 -x175 -x174 -x173 x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157
0.00/0.03 v -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136
0.00/0.03 v -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114
0.00/0.03 v x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 x95 -x94 -x93 -x92
0.00/0.03 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 -x66
0.00/0.03 v -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41
0.00/0.03 v -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15
0.00/0.03 v -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Total Time : 0.03
0.00/0.03 c solving : 0.03
0.00/0.03 c presolving : 0.01 (included in solving)
0.00/0.03 c reading : 0.00 (included in solving)
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-3447396-1307897145.wbo
0.00/0.03 c Variables : 234 (234 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 43 initial, 43 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3447396-1307897145.wbo
0.00/0.03 c Variables : 248 (234 binary, 0 integer, 14 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 56 initial, 87 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c varbound : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c linear : 0.00 0 0 0 14 0 1 0 0 0
0.00/0.03 c indicator : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c root node : - 12 - - 12 - - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 1 0 15 0 0 0 0 0 0
0.00/0.03 c varbound : 0+ 6 146 1 0 0 0 0 6 8 0 0
0.00/0.03 c setppc : 13 6 239 1 0 13 0 0 0 0 0 0
0.00/0.03 c linear : 14+ 7 326 1 0 11 0 0 0 2 0 0
0.00/0.03 c indicator : 14 0 346 1 0 9 0 0 0 0 0 0
0.00/0.03 c logicor : 15 6 62 1 0 4 0 0 0 0 0 0
0.00/0.03 c countsols : 0 0 0 1 0 6 0 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c varbound : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c indicator : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.03 c vbounds : 14 0 0 0
0.00/0.03 c rootredcost : 0 0 0 0
0.00/0.03 c pseudoobj : 151 0 0 6
0.00/0.03 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.03 c vbounds : 0.00 0.00 0.00
0.00/0.03 c rootredcost : 0.00 0.00 0.00
0.00/0.03 c pseudoobj : 0.00 0.00 0.00
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 0 0.0 - - -
0.00/0.03 c applied locally : - - - 0 0.0 - - -
0.00/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.03 c cut pool : 0.00 2 - - 0 - (maximal pool size: 3)
0.00/0.03 c redcost : 0.00 6 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 1 0 0 1 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c closecuts : 0.00 0 0 0 0 0
0.00/0.03 c strongcg : 0.00 1 0 0 1 0
0.00/0.03 c cmir : 0.00 1 0 0 1 0
0.00/0.03 c flowcover : 0.00 1 0 0 0 0
0.00/0.03 c clique : 0.00 1 0 0 0 0
0.00/0.03 c zerohalf : 0.00 0 0 0 0 0
0.00/0.03 c mcf : 0.00 1 0 0 0 0
0.00/0.03 c oddcycle : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.02 1 0 0 0 29
0.00/0.03 c Pricers : Time Calls Vars
0.00/0.03 c problem variables: 0.00 0 0
0.00/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.03 c pscost : 0.00 0 0 0 0 0 0
0.00/0.03 c inference : 0.00 0 0 0 0 0 0
0.00/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c random : 0.00 0 0 0 0 0 0
0.00/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 1
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c oneopt : 0.00 1 0
0.00/0.03 c trivial : 0.00 2 0
0.00/0.03 c shiftandpropagate: 0.00 1 1
0.00/0.03 c simplerounding : 0.00 1 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 1 0
0.00/0.03 c shifting : 0.00 1 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c clique : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c vbounds : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c subnlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 3 3
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.00 6 202 33.67 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 1 5 5.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 0
0.00/0.03 c max depth (total): 0
0.00/0.03 c backtracks : 0 (0.0%)
0.00/0.03 c delayed cutoffs : 0
0.00/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.03 c avg switch length: 2.00
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 5 (2 improvements)
0.00/0.03 c First Solution : +5.90000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 91, found by <shiftandpropagate>)
0.00/0.03 c Primal Bound : +1.50000000000000e+01 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.00/0.03 c Dual Bound : +1.50000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +1.50000000000000e+01
0.00/0.03 c Root Iterations : 207
0.00/0.03 c Time complete: 0.02.
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 /var/tmp/evaluation-result-3447396-1307897145/watcher-3447396-1307897145 -o /var/tmp/evaluation-result-3447396-1307897145/solver-3447396-1307897145 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3447396-1307897145.wbo -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: 1.72 1.91 1.78 3/172 14831
/proc/meminfo: memFree=3388060/32950928 swapFree=67052124/67111528
[pid=14831] ppid=14829 vsize=12548 CPUtime=0 cores=1,3,5,7
/proc/14831/stat : 14831 (scip-2.0.1.4.li) R 14829 14831 14010 0 -1 4202496 1872 0 0 0 0 0 0 0 25 0 1 0 901313288 12849152 1826 33554432000 4194304 9128323 140736632145456 18446744073709551615 8009021 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14831/statm: 3137 1840 431 1205 0 1928 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.038743
CPU time (s): 0.038993
CPU user time (s): 0.029995
CPU system time (s): 0.008998
CPU usage (%): 100.645
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.029995
system time used= 0.008998
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6164
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= 2
involuntary context switches= 1
runsolver used 0.001999 second user time and 0.006998 second system time
The end