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: a3bf3a4-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-3691144-1338020675.opb>
0.00/0.00 c original problem has 256 variables (256 bin, 0 int, 0 impl, 0 cont) and 351 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 o 235098
0.00/0.00 c feasible solution found by trivial heuristic, objective value 2.350980e+05
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 90 del vars, 168 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 490 impls, 0 clqs
0.00/0.01 c (round 2) 91 del vars, 175 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 490 impls, 0 clqs
0.00/0.01 c (round 3) 100 del vars, 176 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 142 upgd conss, 490 impls, 0 clqs
0.00/0.01 c (round 4) 112 del vars, 176 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 176 upgd conss, 490 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/144 (35.4%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c (round 5) 112 del vars, 179 del conss, 1 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 176 upgd conss, 494 impls, 0 clqs
0.00/0.02 c presolving (6 rounds):
0.00/0.02 c 112 deleted vars, 179 deleted constraints, 1 added constraints, 4 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 494 implications, 0 cliques
0.00/0.02 c presolved problem has 144 variables (144 bin, 0 int, 0 impl, 0 cont) and 173 constraints
0.00/0.02 c 150 constraints of type <setppc>
0.00/0.02 c 1 constraints of type <and>
0.00/0.02 c 22 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 o 201873
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 0 | - | 828k| 0 | - | 144 | 173 | 0 | 0 | 0 | 0 | 0 | -- | 2.018730e+05 | Inf
0.00/0.02 o 49797
0.00/0.02 c b 0.0s| 1 | 0 | 0 | - | 963k| 0 | - | 144 | 173 | 144 | 174 | 0 | 0 | 0 | -- | 4.979700e+04 | Inf
0.00/0.02 o 13949
0.00/0.02 c * 0.0s| 1 | 0 | 10 | - | 962k| 0 | - | 144 | 173 | 144 | 174 | 0 | 0 | 0 | 1.394900e+04 | 1.394900e+04 | 0.00%
0.00/0.02 c 0.0s| 1 | 0 | 10 | - | 962k| 0 | - | 144 | 173 | 144 | 174 | 0 | 0 | 0 | 1.394900e+04 | 1.394900e+04 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.02
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : +1.39490000000000e+04 (4 solutions)
0.00/0.02 c Dual Bound : +1.39490000000000e+04
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v -x237 -x26 -x232 -x25 -x224 -x24 -x222 -x220 -x218 -x23 -x22 -x21 -x210 -x208 -x206 -x20 -x19 -x201 -x198 -x196 -x194 -x18 -x191
0.00/0.02 v -x189 -x17 -x185 -x183 -x181 -x179 -x177 -x174 -x171 -x168 -x166 -x164 -x162 -x158 -x156 -x154 -x151 -x149 -x16 -x145 -x142
0.00/0.02 v -x15 -x138 -x14 -x13 -x12 -x133 -x130 -x128 -x11 -x126 -x10 -x123 -x120 -x9 -x118 -x116 -x114 -x112 -x109 -x106 -x104 -x102
0.00/0.02 v -x100 -x98 -x96 -x93 -x91 -x89 -x86 -x84 -x8 -x82 -x79 -x7 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x54 -x51 -x48 -x6
0.00/0.02 v -x5 -x43 -x41 -x38 -x36 -x4 -x34 -x3 -x2 -x30 -x1 -x27 -x256 x255 x254 x253 x252 -x251 -x250 x249 -x248 -x247 -x246 -x245
0.00/0.02 v x244 -x243 -x242 -x241 -x240 -x239 -x238 x236 -x235 -x234 -x233 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x223 -x221 -x219 -x217
0.00/0.02 v -x216 -x215 -x214 -x213 -x212 -x211 -x209 -x207 -x205 -x204 -x203 -x202 -x200 -x199 -x197 -x195 -x193 -x192 -x190 -x188
0.00/0.02 v -x187 -x186 -x184 -x182 -x180 -x178 -x176 -x175 -x173 -x172 -x170 -x169 -x167 -x165 -x163 -x161 x160 -x159 -x157 -x155 -x153
0.00/0.02 v -x152 -x150 -x148 -x147 -x146 -x144 -x143 -x141 -x140 -x139 -x137 -x136 -x135 -x134 -x132 -x131 -x129 -x127 -x125 -x124 -x122
0.00/0.02 v -x121 -x119 -x117 -x115 -x113 -x111 -x110 -x108 -x107 -x105 -x103 -x101 -x99 -x97 x95 -x94 -x92 -x90 -x88 -x87 -x85 -x83 -x81
0.00/0.02 v -x80 -x78 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63 -x61 -x59 -x57 x56 -x55 -x53 -x52 -x50 -x49 -x47 -x46 -x45 -x44 -x42 -x40
0.00/0.02 v -x39 -x37 -x35 -x33 -x32 -x31 -x29 -x28
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Total Time : 0.02
0.00/0.02 c solving : 0.02
0.00/0.02 c presolving : 0.01 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c copying : 0.00 (0 times copied the problem)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-3691144-1338020675.opb
0.00/0.02 c Variables : 256 (256 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 351 initial, 351 maximal
0.00/0.02 c Objective sense : minimize
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-3691144-1338020675.opb
0.00/0.02 c Variables : 144 (144 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 173 initial, 173 maximal
0.00/0.02 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.02 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c gateextraction : 0.00 0.00 0 0 0 0 0 3 1 0 0
0.00/0.02 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c and : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 0.00 4 86 0 4 0 175 0 0 0
0.00/0.02 c logicor : 0.00 0.00 21 0 0 0 0 1 0 0 0
0.00/0.02 c root node : - - 0 - - 0 - - - - -
0.00/0.02 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 0 0 0 8 0 0 0 0 0 0
0.00/0.02 c setppc : 150 150 0 97 0 0 5 0 0 0 0 0 0
0.00/0.02 c and : 1 1 0 97 0 0 5 0 0 0 0 0 0
0.00/0.02 c logicor : 22 22 0 55 0 0 4 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 6 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.02 c rootredcost : 0 0 0 0
0.00/0.02 c pseudoobj : 1 0 0 0
0.00/0.02 c vbounds : 0 0 0 0
0.00/0.02 c redcost : 0 0 0 0
0.00/0.02 c probing : 0 0 0 0
0.00/0.02 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.02 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.02 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.02 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.02 c problem variables: 0.00 - 0 0
0.00/0.02 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.02 c LP solutions : 0.00 - - 0
0.00/0.02 c pseudo solutions : 0.00 - - 0
0.00/0.02 c smallcard : 0.00 0.00 0 0
0.00/0.02 c trivial : 0.00 0.00 2 2
0.00/0.02 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.02 c simplerounding : 0.00 0.00 0 0
0.00/0.02 c zirounding : 0.00 0.00 0 0
0.00/0.02 c rounding : 0.00 0.00 0 0
0.00/0.02 c shifting : 0.00 0.00 0 0
0.00/0.02 c intshifting : 0.00 0.00 0 0
0.00/0.02 c oneopt : 0.00 0.00 1 1
0.00/0.02 c twoopt : 0.00 0.00 0 0
0.00/0.02 c indtwoopt : 0.00 0.00 0 0
0.00/0.02 c indoneopt : 0.00 0.00 0 0
0.00/0.02 c fixandinfer : 0.00 0.00 0 0
0.00/0.02 c feaspump : 0.00 0.00 0 0
0.00/0.02 c clique : 0.00 0.00 0 0
0.00/0.02 c indrounding : 0.00 0.00 0 0
0.00/0.02 c indcoefdiving : 0.00 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0.00 0 0
0.00/0.02 c nlpdiving : 0.00 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0.00 0 0
0.00/0.02 c intdiving : 0.00 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0.00 0 0
0.00/0.02 c octane : 0.00 0.00 0 0
0.00/0.02 c rens : 0.00 0.00 0 0
0.00/0.02 c rins : 0.00 0.00 0 0
0.00/0.02 c localbranching : 0.00 0.00 0 0
0.00/0.02 c mutation : 0.00 0.00 0 0
0.00/0.02 c crossover : 0.00 0.00 0 0
0.00/0.02 c dins : 0.00 0.00 0 0
0.00/0.02 c vbounds : 0.00 0.00 0 0
0.00/0.02 c undercover : 0.00 0.00 0 0
0.00/0.02 c subnlp : 0.00 0.00 0 0
0.00/0.02 c trysol : 0.00 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.02 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c dual LP : 0.00 1 10 10.00 - 0.00 0
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1
0.00/0.02 c nodes (total) : 1
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 4 (4 improvements)
0.00/0.02 c First Solution : +2.35098000000000e+05 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.02 c Primal Bound : +1.39490000000000e+04 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Dual Bound : +1.39490000000000e+04
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : +1.39490000000000e+04
0.00/0.02 c Root Iterations : 10
0.00/0.02 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 /tmp/evaluation-result-3691144-1338020675/watcher-3691144-1338020675 -o /tmp/evaluation-result-3691144-1338020675/solver-3691144-1338020675 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691144-1338020675.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/176 6247
/proc/meminfo: memFree=29083716/32873844 swapFree=7616/7616
[pid=6247] ppid=6245 vsize=12536 CPUtime=0 cores=0,2,4,6
/proc/6247/stat : 6247 (scip-2.1.1.4fix) R 6245 6247 5654 0 -1 4202496 1851 0 0 0 0 0 0 0 20 0 1 0 268193131 12836864 1806 33554432000 4194304 10173063 140737166111616 140733237575992 8846909 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/6247/statm: 3134 1817 464 1460 0 1665 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.027568
CPU time (s): 0.027995
CPU user time (s): 0.015997
CPU system time (s): 0.011998
CPU usage (%): 101.549
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.015997
system time used= 0.011998
maximum resident set size= 15580
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4216
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= 1
runsolver used 0.003999 second user time and 0.002999 second system time
The end