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-3450370-1307100814.opb>
0.00/0.00 c original problem has 630 variables (630 bin, 0 int, 0 impl, 0 cont) and 469 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 9 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 0 upgd conss, 2884 impls, 0 clqs
0.00/0.02 c (round 2) 23 del vars, 25 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 10 upgd conss, 4228 impls, 0 clqs
0.00/0.02 c (round 3) 37 del vars, 50 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 10 upgd conss, 5404 impls, 0 clqs
0.00/0.02 c (round 4) 51 del vars, 75 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 10 upgd conss, 6412 impls, 0 clqs
0.00/0.02 c (round 5) 65 del vars, 100 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 98 chg coeffs, 10 upgd conss, 7252 impls, 0 clqs
0.02/0.02 c (round 6) 79 del vars, 125 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 110 chg coeffs, 10 upgd conss, 7924 impls, 0 clqs
0.02/0.03 c (round 7) 93 del vars, 150 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 122 chg coeffs, 10 upgd conss, 8428 impls, 0 clqs
0.02/0.03 c (round 8) 107 del vars, 175 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 134 chg coeffs, 10 upgd conss, 8764 impls, 0 clqs
0.02/0.03 c (round 9) 121 del vars, 200 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 146 chg coeffs, 10 upgd conss, 8932 impls, 0 clqs
0.02/0.03 c (round 10) 135 del vars, 225 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 10 upgd conss, 8932 impls, 0 clqs
0.02/0.04 c (0.0s) probing: 204/495 (41.2%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.02/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.04 c presolving (11 rounds):
0.02/0.04 c 135 deleted vars, 225 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 158 changed coefficients
0.02/0.04 c 8968 implications, 0 cliques
0.02/0.04 c presolved problem has 495 variables (495 bin, 0 int, 0 impl, 0 cont) and 352 constraints
0.02/0.04 c 324 constraints of type <and>
0.02/0.04 c 9 constraints of type <linear>
0.02/0.04 c 10 constraints of type <logicor>
0.02/0.04 c 9 constraints of type <pseudoboolean>
0.02/0.04 c transformed objective value is always integral (scale: 2)
0.02/0.04 c Presolving Time: 0.03
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 2.0.1.5
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1800
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 13950
0.02/0.04 c
0.02/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.04 c # [type: int, range: [1,2], default: 1]
0.02/0.04 c timing/clocktype = 2
0.02/0.04 c
0.02/0.04 c # belongs reading time to solving time?
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c timing/reading = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/indicator/addCouplingCons = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.05 c 0.1s| 1 | 0 | 22 | - |2633k| 0 | 12 | 495 | 352 | 495 | 667 | 0 | 8 | 0 | 3.000000e+00 | -- | Inf
0.08/0.16 o 3
0.08/0.16 c U 0.2s| 1 | 0 | 572 | - |2672k| 0 | - | 495 | 352 | 495 | 667 | 0 | 8 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.08/0.16 c 0.2s| 1 | 0 | 572 | - |2666k| 0 | - | 495 | 353 | 495 | 667 | 0 | 8 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.08/0.16 c
0.08/0.16 c SCIP Status : problem is solved [optimal solution found]
0.08/0.16 c Solving Time (sec) : 0.16
0.08/0.16 c Solving Nodes : 1
0.08/0.16 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.08/0.16 c Dual Bound : +3.00000000000000e+00
0.08/0.16 c Gap : 0.00 %
0.08/0.16 s OPTIMUM FOUND
0.08/0.16 v x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 x126 x125 x124 x123 -x122 x121 x120 -x175 -x174
0.08/0.16 v -x173 -x172 -x171 x170 -x169 -x119 x118 -x117 x116 -x115 -x114 x113 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x112 x111 -x110
0.08/0.16 v -x109 -x108 x107 x106 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x105 x104 -x103 -x102 -x101 -x100 x99 -x154 -x153 -x152
0.08/0.16 v -x151 -x150 x149 -x148 -x98 -x97 -x96 x95 -x94 x93 x92 -x147 -x146 -x145 -x144 -x143 x142 -x141 x91 -x90 x89 x88 -x87 -x86 x85
0.08/0.16 v -x140 -x139 -x138 -x137 -x136 -x135 x134 x84 x83 x82 -x81 -x80 x79 x78 -x133 -x132 -x131 -x130 -x129 -x128 -x127 x77 -x76
0.08/0.16 v x75 -x74 -x73 -x72 x71 x70 -x69 -x68 -x67 -x66 x65 x64 -x63 -x62 -x61 -x60 -x59 x58 x57 -x56 -x55 -x54 -x53 -x52 x51 x50 -x49
0.08/0.16 v -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 -x31 x30 x29 -x28 -x27 -x26 -x25 -x24 x23 x22
0.08/0.16 v -x21 -x20 -x19 -x18 -x17 x16 x15 -x14 -x13 x12 x11 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.08/0.16 c SCIP Status : problem is solved [optimal solution found]
0.08/0.16 c Total Time : 0.16
0.08/0.16 c solving : 0.16
0.08/0.16 c presolving : 0.03 (included in solving)
0.08/0.16 c reading : 0.00 (included in solving)
0.08/0.16 c Original Problem :
0.08/0.16 c Problem name : HOME/instance-3450370-1307100814.opb
0.08/0.16 c Variables : 630 (630 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.16 c Constraints : 469 initial, 469 maximal
0.08/0.16 c Presolved Problem :
0.08/0.16 c Problem name : t_HOME/instance-3450370-1307100814.opb
0.08/0.16 c Variables : 495 (495 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.16 c Constraints : 352 initial, 353 maximal
0.08/0.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.08/0.16 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.08/0.16 c and : 0.01 18 108 0 0 0 108 0 0 108
0.08/0.16 c linear : 0.00 1 8 0 0 0 0 0 0 50
0.08/0.16 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.08/0.16 c pseudoboolean : 0.00 0 0 0 0 0 117 0 0 0
0.08/0.16 c root node : - 0 - - 0 - - - - -
0.08/0.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.08/0.16 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.08/0.16 c and : 324 0 661 0 0 0 1776 0 0 0 0 0
0.08/0.16 c linear : 9 0 661 0 0 4 593 7 0 0 0 0
0.08/0.16 c logicor : 10+ 0 107 0 0 1 64 8 0 0 0 0
0.08/0.16 c pseudoboolean : 9 0 0 0 0 1 0 0 0 0 0 0
0.08/0.16 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.08/0.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.08/0.16 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.08/0.16 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.08/0.16 c linear : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.08/0.16 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.08/0.16 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.08/0.16 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.08/0.16 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.08/0.16 c vbounds : 0 0 0 0
0.08/0.16 c rootredcost : 0 0 0 0
0.08/0.16 c pseudoobj : 238 0 0 0
0.08/0.16 c Propagator Timings : TotalTime Propagate Resprop
0.08/0.16 c vbounds : 0.00 0.00 0.00
0.08/0.16 c rootredcost : 0.00 0.00 0.00
0.08/0.16 c pseudoobj : 0.00 0.00 0.00
0.08/0.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.08/0.16 c propagation : 0.01 15 8 277 178.9 0 0.0 -
0.08/0.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.08/0.16 c applied globally : - - - 0 0.0 - - -
0.08/0.16 c applied locally : - - - 8 50.8 - - -
0.08/0.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.08/0.16 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.08/0.16 c redcost : 0.00 0 0 0 0 0
0.08/0.16 c impliedbounds : 0.00 0 0 0 0 0
0.08/0.16 c intobj : 0.00 0 0 0 0 0
0.08/0.16 c gomory : 0.00 0 0 0 0 0
0.08/0.16 c cgmip : 0.00 0 0 0 0 0
0.08/0.16 c closecuts : 0.00 0 0 0 0 0
0.08/0.16 c strongcg : 0.00 0 0 0 0 0
0.08/0.16 c cmir : 0.00 0 0 0 0 0
0.08/0.16 c flowcover : 0.00 0 0 0 0 0
0.08/0.16 c clique : 0.00 0 0 0 0 0
0.08/0.16 c zerohalf : 0.00 0 0 0 0 0
0.08/0.16 c mcf : 0.00 0 0 0 0 0
0.08/0.16 c oddcycle : 0.00 0 0 0 0 0
0.08/0.16 c rapidlearning : 0.00 0 0 0 0 0
0.08/0.16 c Pricers : Time Calls Vars
0.08/0.16 c problem variables: 0.00 0 0
0.08/0.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.08/0.16 c pscost : 0.00 0 0 0 0 0 0
0.08/0.16 c inference : 0.00 0 0 0 0 0 0
0.08/0.16 c mostinf : 0.00 0 0 0 0 0 0
0.08/0.16 c leastinf : 0.00 0 0 0 0 0 0
0.08/0.16 c fullstrong : 0.00 0 0 0 0 0 0
0.08/0.16 c allfullstrong : 0.00 0 0 0 0 0 0
0.08/0.16 c random : 0.00 0 0 0 0 0 0
0.08/0.16 c relpscost : 0.00 0 0 0 0 0 0
0.08/0.16 c Primal Heuristics : Time Calls Found
0.08/0.16 c LP solutions : 0.00 - 0
0.08/0.16 c pseudo solutions : 0.00 - 0
0.08/0.16 c oneopt : 0.00 0 0
0.08/0.16 c trivial : 0.00 2 0
0.08/0.16 c shiftandpropagate: 0.01 1 0
0.08/0.16 c simplerounding : 0.00 0 0
0.08/0.16 c zirounding : 0.00 0 0
0.08/0.16 c rounding : 0.00 1 0
0.08/0.16 c shifting : 0.00 1 0
0.08/0.16 c intshifting : 0.00 0 0
0.08/0.16 c twoopt : 0.00 0 0
0.08/0.16 c fixandinfer : 0.00 0 0
0.08/0.16 c feaspump : 0.01 1 0
0.08/0.16 c clique : 0.00 0 0
0.08/0.16 c coefdiving : 0.00 0 0
0.08/0.16 c pscostdiving : 0.00 0 0
0.08/0.16 c fracdiving : 0.00 0 0
0.08/0.16 c veclendiving : 0.00 0 0
0.08/0.16 c intdiving : 0.00 0 0
0.08/0.16 c actconsdiving : 0.00 0 0
0.08/0.16 c objpscostdiving : 0.00 0 0
0.08/0.16 c rootsoldiving : 0.00 0 0
0.08/0.16 c linesearchdiving : 0.00 0 0
0.08/0.16 c guideddiving : 0.00 0 0
0.08/0.16 c octane : 0.00 0 0
0.08/0.16 c rens : 0.00 0 0
0.08/0.16 c rins : 0.00 0 0
0.08/0.16 c localbranching : 0.00 0 0
0.08/0.16 c mutation : 0.00 0 0
0.08/0.16 c crossover : 0.00 0 0
0.08/0.16 c dins : 0.00 0 0
0.08/0.16 c vbounds : 0.00 0 0
0.08/0.16 c undercover : 0.10 1 1
0.08/0.16 c subnlp : 0.00 0 0
0.08/0.16 c trysol : 0.00 0 0
0.08/0.16 c LP : Time Calls Iterations Iter/call Iter/sec
0.08/0.16 c primal LP : 0.00 0 0 0.00 -
0.08/0.16 c dual LP : 0.00 1 22 22.00 -
0.08/0.16 c lex dual LP : 0.00 0 0 0.00 -
0.08/0.16 c barrier LP : 0.00 0 0 0.00 -
0.08/0.16 c diving/probing LP: 0.01 16 550 34.38 -
0.08/0.16 c strong branching : 0.00 0 0 0.00 -
0.08/0.16 c (at root node) : - 0 0 0.00 -
0.08/0.16 c conflict analysis: 0.00 0 0 0.00 -
0.08/0.16 c B&B Tree :
0.08/0.16 c number of runs : 1
0.08/0.16 c nodes : 1
0.08/0.16 c nodes (total) : 1
0.08/0.16 c nodes left : 0
0.08/0.16 c max depth : 0
0.08/0.16 c max depth (total): 0
0.08/0.16 c backtracks : 0 (0.0%)
0.08/0.16 c delayed cutoffs : 0
0.08/0.16 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.08/0.16 c avg switch length: 2.00
0.08/0.16 c switching time : 0.00
0.08/0.16 c Solution :
0.08/0.16 c Solutions found : 1 (1 improvements)
0.08/0.17 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.16 seconds, depth 0, found by <undercover>)
0.08/0.17 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.16 seconds, depth 0, found by <undercover>)
0.08/0.17 c Dual Bound : +3.00000000000000e+00
0.08/0.17 c Gap : 0.00 %
0.08/0.17 c Root Dual Bound : +3.00000000000000e+00
0.08/0.17 c Root Iterations : 572
0.08/0.17 c Time complete: 0.17.