0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2666559-1276650438.opb>
0.00/0.01 c original problem has 630 variables (630 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.09/0.11 c (round 1) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 0 upgd conss, 2916 impls, 0 clqs
0.09/0.12 c (round 2) 23 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 10 upgd conss, 4260 impls, 0 clqs
0.09/0.12 c (round 3) 37 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 10 upgd conss, 5436 impls, 0 clqs
0.09/0.12 c (round 4) 51 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 10 upgd conss, 6444 impls, 0 clqs
0.09/0.13 c (round 5) 65 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 98 chg coeffs, 10 upgd conss, 7284 impls, 0 clqs
0.09/0.13 c (round 6) 79 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 110 chg coeffs, 10 upgd conss, 7956 impls, 0 clqs
0.09/0.14 c (round 7) 93 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 122 chg coeffs, 10 upgd conss, 8460 impls, 0 clqs
0.09/0.14 c (round 8) 107 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 134 chg coeffs, 10 upgd conss, 8796 impls, 0 clqs
0.09/0.15 c (round 9) 121 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 146 chg coeffs, 10 upgd conss, 8964 impls, 0 clqs
0.09/0.15 c (round 10) 135 del vars, 108 del conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 10 upgd conss, 8964 impls, 0 clqs
0.09/0.18 c (0.1s) probing: 204/495 (41.2%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.09/0.18 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.18 c presolving (11 rounds):
0.09/0.18 c 135 deleted vars, 108 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 158 changed coefficients
0.09/0.18 c 9000 implications, 0 cliques
0.09/0.18 c presolved problem has 495 variables (495 bin, 0 int, 0 impl, 0 cont) and 343 constraints
0.09/0.18 c 324 constraints of type <and>
0.09/0.18 c 9 constraints of type <linear>
0.09/0.18 c 10 constraints of type <logicor>
0.09/0.18 c transformed objective value is always integral (scale: 2)
0.09/0.18 c Presolving Time: 0.10
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.2
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1799.99
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c heuristics/undercover/freq = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.09/0.18 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.18 c 0.1s| 1 | 0 | 22 | - |2357k| 0 | 12 | 495 | 343 | 495 | 667 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.73 o 3
0.69/0.73 c u 0.5s| 1 | 0 | 528 | - |2405k| 0 | - | 495 | 343 | 495 | 667 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.74 c 0.5s| 1 | 0 | 528 | - |2397k| 0 | - | 495 | 343 | 495 | 667 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.74 c
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Solving Time (sec) : 0.49
0.69/0.74 c Solving Nodes : 1
0.69/0.74 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.69/0.74 c Dual Bound : +3.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 s OPTIMUM FOUND
0.69/0.74 v -x189 -x188 -x187 -x186 -x185 -x184 x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x126 -x125 -x124 -x123 -x122 x121 x120 -x175
0.69/0.74 v -x174 -x173 -x172 -x171 -x170 x169 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x112
0.69/0.74 v x111 -x110 x109 -x108 x107 x106 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x105 -x104 -x103 -x102 -x101 -x100 x99 -x154 -x153
0.69/0.74 v -x152 -x151 -x150 -x149 x148 -x98 x97 -x96 x95 -x94 x93 x92 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x91 x90 x89 x88 -x87
0.69/0.74 v -x86 x85 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x84 -x83 x82 -x81 -x80 x79 x78 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x77
0.69/0.74 v x76 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
0.69/0.74 v -x49 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
0.69/0.74 v x23 x22 -x21 -x20 -x19 -x18 -x17 x16 x15 -x14 x13 x12 x11 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Solving Time : 0.49
0.69/0.74 c Original Problem :
0.69/0.74 c Problem name : HOME/instance-2666559-1276650438.opb
0.69/0.74 c Variables : 630 (630 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 460 initial, 460 maximal
0.69/0.74 c Presolved Problem :
0.69/0.74 c Problem name : t_HOME/instance-2666559-1276650438.opb
0.69/0.74 c Variables : 495 (495 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 343 initial, 343 maximal
0.69/0.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.74 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c probing : 0.03 0 0 0 0 0 0 0 0
0.69/0.74 c and : 0.04 18 108 0 0 0 108 0 108
0.69/0.74 c linear : 0.02 1 8 0 0 0 0 0 50
0.69/0.74 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.74 c root node : - 0 - - 0 - - - -
0.69/0.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.74 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.74 c and : 324 0 517 0 0 0 0 0 0 0
0.69/0.74 c linear : 9 0 517 0 0 0 0 0 0 0
0.69/0.74 c logicor : 10 0 72 0 0 0 0 0 0 0
0.69/0.74 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.74 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c and : 0.01 0.00 0.01 0.00 0.00
0.69/0.74 c linear : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Propagators : Time Calls Cutoffs DomReds
0.69/0.74 c vbounds : 0.00 2 0 0
0.69/0.74 c rootredcost : 0.00 0 0 0
0.69/0.74 c pseudoobj : 0.00 94 0 0
0.69/0.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c applied globally : - - - 0 0.0 - - -
0.69/0.74 c applied locally : - - - 0 0.0 - - -
0.69/0.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.74 c redcost : 0.00 0 0 0 0 0
0.69/0.74 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.74 c intobj : 0.00 0 0 0 0 0
0.69/0.74 c cgmip : 0.00 0 0 0 0 0
0.69/0.74 c gomory : 0.00 0 0 0 0 0
0.69/0.74 c strongcg : 0.00 0 0 0 0 0
0.69/0.74 c cmir : 0.00 0 0 0 0 0
0.69/0.74 c flowcover : 0.00 0 0 0 0 0
0.69/0.74 c clique : 0.00 0 0 0 0 0
0.69/0.74 c zerohalf : 0.00 0 0 0 0 0
0.69/0.74 c mcf : 0.00 0 0 0 0 0
0.69/0.74 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.74 c Pricers : Time Calls Vars
0.69/0.74 c problem variables: 0.00 0 0
0.69/0.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.74 c pscost : 0.00 0 0 0 0 0 0
0.69/0.74 c inference : 0.00 0 0 0 0 0 0
0.69/0.74 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.74 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.74 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c random : 0.00 0 0 0 0 0 0
0.69/0.74 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.74 c Primal Heuristics : Time Calls Found
0.69/0.74 c LP solutions : 0.00 - 0
0.69/0.74 c pseudo solutions : 0.00 - 0
0.69/0.74 c oneopt : 0.00 0 0
0.69/0.74 c trivial : 0.00 2 0
0.69/0.74 c simplerounding : 0.00 0 0
0.69/0.74 c zirounding : 0.00 0 0
0.69/0.74 c rounding : 0.00 1 0
0.69/0.74 c shifting : 0.00 1 0
0.69/0.74 c intshifting : 0.00 0 0
0.69/0.74 c twoopt : 0.00 0 0
0.69/0.74 c fixandinfer : 0.00 0 0
0.69/0.74 c feaspump : 0.03 1 0
0.69/0.74 c coefdiving : 0.00 0 0
0.69/0.74 c pscostdiving : 0.00 0 0
0.69/0.74 c fracdiving : 0.00 0 0
0.69/0.74 c veclendiving : 0.00 0 0
0.69/0.74 c intdiving : 0.00 0 0
0.69/0.74 c actconsdiving : 0.00 0 0
0.69/0.74 c objpscostdiving : 0.00 0 0
0.69/0.74 c rootsoldiving : 0.00 0 0
0.69/0.74 c linesearchdiving : 0.00 0 0
0.69/0.74 c guideddiving : 0.00 0 0
0.69/0.74 c octane : 0.00 0 0
0.69/0.74 c rens : 0.00 0 0
0.69/0.74 c rins : 0.00 0 0
0.69/0.74 c localbranching : 0.00 0 0
0.69/0.74 c mutation : 0.00 0 0
0.69/0.74 c crossover : 0.00 0 0
0.69/0.74 c dins : 0.00 0 0
0.69/0.74 c undercover : 0.36 1 1
0.69/0.74 c nlp : 0.00 0 0
0.69/0.74 c trysol : 0.00 0 0
0.69/0.74 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.74 c primal LP : 0.00 0 0 0.00 -
0.69/0.74 c dual LP : 0.00 1 22 22.00 -
0.69/0.74 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.74 c barrier LP : 0.00 0 0 0.00 -
0.69/0.74 c diving/probing LP: 0.02 13 506 38.92 25300.00
0.69/0.74 c strong branching : 0.00 0 0 0.00 -
0.69/0.74 c (at root node) : - 0 0 0.00 -
0.69/0.74 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.74 c B&B Tree :
0.69/0.74 c number of runs : 1
0.69/0.74 c nodes : 1
0.69/0.74 c nodes (total) : 1
0.69/0.74 c nodes left : 0
0.69/0.74 c max depth : 0
0.69/0.74 c max depth (total): 0
0.69/0.74 c backtracks : 0 (0.0%)
0.69/0.74 c delayed cutoffs : 0
0.69/0.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.74 c avg switch length: 2.00
0.69/0.74 c switching time : 0.00
0.69/0.74 c Solution :
0.69/0.74 c Solutions found : 1 (1 improvements)
0.69/0.74 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.49 seconds, depth 0, found by <undercover>)
0.69/0.74 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.49 seconds, depth 0, found by <undercover>)
0.69/0.74 c Dual Bound : +3.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 c Root Dual Bound : +3.00000000000000e+00
0.69/0.74 c Root Iterations : 528
0.69/0.75 c Time complete: 0.74.