0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3731986-1338704210.opb>
0.00/0.01 c original problem has 232 variables (232 bin, 0 int, 0 impl, 0 cont) and 527 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 9275
0.00/0.01 c feasible solution found by trivial heuristic, objective value 9.275000e+03
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 342 impls, 0 clqs
0.00/0.02 c (round 2) 1 del vars, 10 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 522 upgd conss, 342 impls, 0 clqs
0.00/0.02 c (round 3) 2 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 522 upgd conss, 342 impls, 0 clqs
0.00/0.02 c (round 4) 2 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 523 upgd conss, 342 impls, 0 clqs
0.00/0.02 c (round 5) 2 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 524 upgd conss, 342 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 105/230 (45.7%) - 2 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c (round 6) 4 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 524 upgd conss, 358 impls, 0 clqs
0.00/0.03 c (round 7) 4 del vars, 37 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 524 upgd conss, 358 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 115/230 (50.0%) - 2 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (8 rounds):
0.00/0.03 c 4 deleted vars, 37 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 358 implications, 0 cliques
0.00/0.03 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 490 constraints
0.00/0.03 c 111 constraints of type <setppc>
0.00/0.03 c 379 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.5
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 o 9166
0.00/0.03 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.03 c t 0.0s| 1 | 0 | 0 | - |1113k| 0 | - | 228 | 490 | 0 | 0 | 0 | 0 | 0 | -- | 9.166000e+03 | Inf
0.00/0.03 o 1985
0.00/0.03 c b 0.0s| 1 | 0 | 0 | - |1462k| 0 | - | 228 | 490 | 228 | 490 | 0 | 0 | 0 | -- | 1.985000e+03 | Inf
0.00/0.03 o 872
0.00/0.03 c * 0.0s| 1 | 0 | 51 | - |1460k| 0 | - | 228 | 490 | 228 | 490 | 0 | 0 | 0 | 8.400000e+01 | 8.720000e+02 | 938.10%
0.00/0.03 c 0.0s| 1 | 0 | 51 | - |1460k| 0 | - | 228 | 490 | 228 | 490 | 0 | 0 | 0 | 8.720000e+02 | 8.720000e+02 | 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 : +8.72000000000000e+02 (4 solutions)
0.00/0.03 c Dual Bound : +8.72000000000000e+02
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211
0.00/0.03 v -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191
0.00/0.03 v -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170
0.00/0.03 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 x159 x158 x157 x156 x155 x154 x153 x152 -x151 -x150 -x149 -x148
0.00/0.03 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.00/0.03 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.00/0.03 v -x105 -x104 -x103 x102 x101 x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 x84 x83 x82 -x81
0.00/0.03 v -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 x64 -x63 x62 x61 -x60 -x59 -x58 -x57 -x56 -x55
0.00/0.03 v -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30
0.00/0.03 v -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3
0.00/0.03 v -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.02 (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-3731986-1338704210.opb
0.00/0.03 c Variables : 232 (232 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 527 initial, 527 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3731986-1338704210.opb
0.00/0.03 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 490 initial, 490 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 pseudoobj : 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 2 0 0 0 0 0 0 0 0
0.00/0.03 c setppc : 0.00 0 0 0 0 0 24 0 0 0
0.00/0.03 c linear : 0.01 0 2 0 0 0 3 0 0 0
0.00/0.03 c logicor : 0.00 0 0 0 0 0 10 0 0 0
0.00/0.03 c root node : - 0 - - 0 - - - - -
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 0 0 8 0 0 0 0 0 0
0.00/0.03 c setppc : 111 0 227 0 0 5 0 0 0 0 0 0
0.00/0.03 c logicor : 379 0 161 0 0 4 0 2 0 0 0 0
0.00/0.03 c countsols : 0 0 0 0 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 setppc : 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 : 0 0 0 0
0.00/0.03 c rootredcost : 0 0 0 0
0.00/0.03 c pseudoobj : 1 0 0 0
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 0 - - 0 - (maximal pool size: 0)
0.00/0.03 c redcost : 0.00 0 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 0 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 0 0 0 0 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 0 0 0 0 0
0.00/0.03 c cmir : 0.00 0 0 0 0 0
0.00/0.03 c flowcover : 0.00 0 0 0 0 0
0.00/0.03 c clique : 0.00 0 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 0 0 0 0 0
0.00/0.03 c oddcycle : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.00 0 0 0 0 0
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 - 0
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c trivial : 0.00 2 2
0.00/0.03 c shiftandpropagate: 0.00 0 0
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 0 0
0.00/0.03 c shifting : 0.00 0 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c oneopt : 0.00 1 1
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 crossover : 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 0 0
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 1 51 51.00 -
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 0 0 0.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 : 4 (4 improvements)
0.00/0.03 c First Solution : +9.27500000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +8.72000000000000e+02 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.00/0.03 c Dual Bound : +8.72000000000000e+02
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +8.72000000000000e+02
0.00/0.03 c Root Iterations : 51
0.00/0.04 c Time complete: 0.03.