0.00/0.00 c SCIP version 2.0.1.5 [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-3451519-1307083627.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 3 del vars, 0 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 782 impls, 0 clqs
0.00/0.01 c (round 2) 9 del vars, 52 del conss, 0 add conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.01 c (round 3) 13 del vars, 68 del conss, 0 add conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.01 c (round 4) 17 del vars, 103 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.01 c (round 5) 18 del vars, 127 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.02 c (round 6) 20 del vars, 143 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.02 c (round 7) 20 del vars, 145 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.00/0.02 c (round 8) 20 del vars, 165 del conss, 0 add conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.00/0.03 c (round 9) 20 del vars, 165 del conss, 0 add conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 872 impls, 0 clqs
0.00/0.05 c (round 10) 44 del vars, 165 del conss, 0 add conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4348 impls, 0 clqs
0.00/0.05 c (round 11) 44 del vars, 316 del conss, 0 add conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4434 impls, 0 clqs
0.00/0.05 c (round 12) 44 del vars, 321 del conss, 0 add conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4434 impls, 0 clqs
0.00/0.05 c presolving (13 rounds):
0.00/0.05 c 44 deleted vars, 321 deleted constraints, 0 added constraints, 14 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.00/0.05 c 4434 implications, 0 cliques
0.00/0.05 c presolved problem has 156 variables (156 bin, 0 int, 0 impl, 0 cont) and 579 constraints
0.00/0.05 c 125 constraints of type <setppc>
0.00/0.05 c 454 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.05/0.07 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.07 c 0.1s| 1 | 0 | 440 | - |1656k| 0 | 136 | 156 | 601 | 156 | 578 | 0 | 22 | 0 | 7.741346e+01 | -- | Inf
0.09/0.14 o 99
0.09/0.14 c F 0.1s| 1 | 0 | 1875 | - |1674k| 0 | 0 | 156 | 601 | 156 | 578 | 0 | 22 | 0 | 7.741346e+01 | 9.900000e+01 | 27.88%
0.19/0.20 o 94
0.19/0.20 c y 0.2s| 1 | 0 | 1875 | - |3781k| 0 | 136 | 156 | 601 | 156 | 578 | 0 | 22 | 0 | 7.741346e+01 | 9.400000e+01 | 21.43%
0.19/0.21 c 0.2s| 1 | 0 | 1961 | - |2150k| 0 | - | 156 | 601 | 156 | 578 | 0 | 22 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.19/0.21 c 0.2s| 1 | 0 | 1961 | - |2150k| 0 | - | 156 | 601 | 156 | 578 | 0 | 22 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.19/0.21 c
0.19/0.21 c SCIP Status : problem is solved [optimal solution found]
0.19/0.21 c Solving Time (sec) : 0.21
0.19/0.21 c Solving Nodes : 1
0.19/0.21 c Primal Bound : +9.40000000000000e+01 (2 solutions)
0.19/0.21 c Dual Bound : +9.40000000000000e+01
0.19/0.21 c Gap : 0.00 %
0.19/0.21 s OPTIMUM FOUND
0.19/0.21 v x200 -x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 x190 -x189 x188 -x187 -x186 x185 -x184 x183 x182 -x181 -x180 x179 -x178
0.19/0.21 v x177 x176 -x175 -x174 x173 -x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 -x162 x161 x160 -x159 -x158 -x157 -x156 x155
0.19/0.21 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 -x146 x145 -x144 -x143 x142 -x141 x140 -x139 -x138 x137 -x136 -x135 x134 -x133
0.19/0.21 v -x132 -x131 -x130 x129 -x128 x127 -x126 x125 x124 -x123 x122 -x121 -x120 x119 x118 -x117 -x116 x115 x114 -x113 x112 -x111 -x110
0.19/0.21 v x109 -x108 x107 x106 -x105 -x104 x103 -x102 x101 -x100 x99 -x98 x97 -x96 -x95 -x94 x93 x92 -x91 -x90 x89 x88 -x87 -x86 x85
0.19/0.21 v -x84 x83 -x82 x81 x80 -x79 x78 -x77 -x76 x75 -x74 x73 x72 -x71 -x70 x69 -x68 x67 -x66 x65 -x64 x63 x62 -x61 -x60 x59 x58 -x57
0.19/0.21 v -x56 x55 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.19/0.21 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 x2 -x1
0.19/0.21 c SCIP Status : problem is solved [optimal solution found]
0.19/0.21 c Total Time : 0.21
0.19/0.21 c solving : 0.21
0.19/0.21 c presolving : 0.04 (included in solving)
0.19/0.21 c reading : 0.01 (included in solving)
0.19/0.21 c Original Problem :
0.19/0.21 c Problem name : HOME/instance-3451519-1307083627.opb
0.19/0.21 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.21 c Constraints : 900 initial, 900 maximal
0.19/0.21 c Presolved Problem :
0.19/0.21 c Problem name : t_HOME/instance-3451519-1307083627.opb
0.19/0.21 c Variables : 156 (156 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.21 c Constraints : 579 initial, 601 maximal
0.19/0.21 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.21 c trivial : 0.00 4 0 0 0 0 0 0 0 0
0.19/0.21 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.21 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.21 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.21 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.21 c implics : 0.00 0 6 0 0 0 0 0 0 0
0.19/0.21 c probing : 0.01 21 3 0 0 0 0 0 0 0
0.19/0.21 c setppc : 0.00 0 0 0 0 0 29 0 0 0
0.19/0.21 c linear : 0.01 10 0 0 14 0 165 0 20 0
0.19/0.21 c logicor : 0.01 0 0 0 0 0 127 0 0 0
0.19/0.21 c root node : - 93 - - 93 - - - - -
0.19/0.21 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.21 c integral : 0 0 0 0 0 8 0 0 0 0 0 0
0.19/0.21 c setppc : 125 1 808 0 0 5 170 10 0 0 0 0
0.19/0.21 c logicor : 454+ 1 631 0 0 2 73 13 0 0 0 0
0.19/0.21 c countsols : 0 0 0 0 0 4 0 0 0 0 0 0
0.19/0.21 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.21 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.21 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.21 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.21 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.21 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.21 c vbounds : 0 0 0 0
0.19/0.21 c rootredcost : 0 0 0 0
0.19/0.21 c pseudoobj : 65 0 0 0
0.19/0.21 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.21 c vbounds : 0.00 0.00 0.00
0.19/0.21 c rootredcost : 0.00 0.00 0.00
0.19/0.21 c pseudoobj : 0.00 0.00 0.00
0.19/0.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.21 c propagation : 0.00 15 15 29 6.8 0 0.0 -
0.19/0.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.21 c applied globally : - - - 22 6.3 - - -
0.19/0.21 c applied locally : - - - 0 0.0 - - -
0.19/0.21 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 314)
0.19/0.21 c redcost : 0.00 1 0 0 0 0
0.19/0.21 c impliedbounds : 0.00 1 0 0 156 0
0.19/0.21 c intobj : 0.00 0 0 0 0 0
0.19/0.21 c gomory : 0.02 1 0 0 500 0
0.19/0.21 c cgmip : 0.00 0 0 0 0 0
0.19/0.21 c closecuts : 0.00 0 0 0 0 0
0.19/0.21 c strongcg : 0.02 1 0 0 500 0
0.19/0.21 c cmir : 0.00 1 0 0 0 0
0.19/0.21 c flowcover : 0.00 1 0 0 0 0
0.19/0.21 c clique : 0.00 1 0 0 7 0
0.19/0.21 c zerohalf : 0.00 0 0 0 0 0
0.19/0.21 c mcf : 0.00 1 0 0 0 0
0.19/0.21 c oddcycle : 0.00 0 0 0 0 0
0.19/0.21 c rapidlearning : 0.02 1 0 93 0 0
0.19/0.21 c Pricers : Time Calls Vars
0.19/0.21 c problem variables: 0.00 0 0
0.19/0.21 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.21 c pscost : 0.00 0 0 0 0 0 0
0.19/0.21 c inference : 0.00 0 0 0 0 0 0
0.19/0.21 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.21 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.21 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.21 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.21 c random : 0.00 0 0 0 0 0 0
0.19/0.21 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.21 c Primal Heuristics : Time Calls Found
0.19/0.21 c LP solutions : 0.00 - 0
0.19/0.21 c pseudo solutions : 0.00 - 0
0.19/0.21 c oneopt : 0.00 0 0
0.19/0.21 c trivial : 0.00 2 0
0.19/0.21 c shiftandpropagate: 0.00 1 0
0.19/0.21 c simplerounding : 0.00 0 0
0.19/0.21 c zirounding : 0.00 0 0
0.19/0.21 c rounding : 0.00 1 0
0.19/0.21 c shifting : 0.00 1 0
0.19/0.21 c intshifting : 0.00 0 0
0.19/0.21 c twoopt : 0.00 0 0
0.19/0.21 c fixandinfer : 0.00 0 0
0.19/0.21 c feaspump : 0.07 1 1
0.19/0.21 c clique : 0.00 0 0
0.19/0.21 c coefdiving : 0.00 0 0
0.19/0.21 c pscostdiving : 0.00 0 0
0.19/0.21 c fracdiving : 0.00 0 0
0.19/0.21 c veclendiving : 0.00 0 0
0.19/0.21 c intdiving : 0.00 0 0
0.19/0.21 c actconsdiving : 0.00 0 0
0.19/0.21 c objpscostdiving : 0.00 0 0
0.19/0.21 c rootsoldiving : 0.00 0 0
0.19/0.21 c linesearchdiving : 0.00 0 0
0.19/0.21 c guideddiving : 0.00 0 0
0.19/0.21 c octane : 0.00 0 0
0.19/0.21 c rens : 0.00 0 0
0.19/0.21 c rins : 0.00 0 0
0.19/0.21 c localbranching : 0.00 0 0
0.19/0.21 c mutation : 0.00 0 0
0.19/0.21 c crossover : 0.00 0 0
0.19/0.21 c dins : 0.00 0 0
0.19/0.21 c vbounds : 0.00 0 0
0.19/0.21 c undercover : 0.00 0 0
0.19/0.21 c subnlp : 0.00 0 0
0.19/0.21 c trysol : 0.00 0 0
0.19/0.21 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.21 c primal LP : 0.00 0 0 0.00 -
0.19/0.21 c dual LP : 0.02 2 526 263.00 23424.63
0.19/0.21 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.21 c barrier LP : 0.00 0 0 0.00 -
0.19/0.21 c diving/probing LP: 0.07 20 1435 71.75 21722.68
0.19/0.21 c strong branching : 0.00 0 0 0.00 -
0.19/0.21 c (at root node) : - 0 0 0.00 -
0.19/0.21 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.21 c B&B Tree :
0.19/0.21 c number of runs : 1
0.19/0.21 c nodes : 1
0.19/0.21 c nodes (total) : 1
0.19/0.21 c nodes left : 0
0.19/0.21 c max depth : 0
0.19/0.21 c max depth (total): 0
0.19/0.21 c backtracks : 0 (0.0%)
0.19/0.21 c delayed cutoffs : 0
0.19/0.21 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.21 c avg switch length: 2.00
0.19/0.21 c switching time : 0.00
0.19/0.21 c Solution :
0.19/0.21 c Solutions found : 2 (2 improvements)
0.19/0.21 c First Solution : +9.90000000000000e+01 (in run 1, after 1 nodes, 0.14 seconds, depth 0, found by <feaspump>)
0.19/0.21 c Primal Bound : +9.40000000000000e+01 (in run 1, after 1 nodes, 0.20 seconds, depth 0, found by <trysol>)
0.19/0.21 c Dual Bound : +9.40000000000000e+01
0.19/0.21 c Gap : 0.00 %
0.19/0.21 c Root Dual Bound : +9.40000000000000e+01
0.19/0.21 c Root Iterations : 1961
0.19/0.21 c Time complete: 0.21.