0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665042-1276648173.opb>
0.00/0.01 c original problem has 792 variables (792 bin, 0 int, 0 impl, 0 cont) and 595 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.10/0.17 c (round 1) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 0 upgd conss, 3600 impls, 0 clqs
0.10/0.18 c (round 2) 25 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 10 upgd conss, 5392 impls, 0 clqs
0.10/0.18 c (round 3) 41 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 10 upgd conss, 6960 impls, 0 clqs
0.10/0.19 c (round 4) 57 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 10 upgd conss, 8304 impls, 0 clqs
0.10/0.19 c (round 5) 73 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 116 chg coeffs, 10 upgd conss, 9424 impls, 0 clqs
0.19/0.20 c (round 6) 89 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 130 chg coeffs, 10 upgd conss, 10320 impls, 0 clqs
0.19/0.20 c (round 7) 105 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 144 chg coeffs, 10 upgd conss, 10992 impls, 0 clqs
0.19/0.21 c (round 8) 121 del vars, 98 del conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 10 upgd conss, 11440 impls, 0 clqs
0.19/0.21 c (round 9) 137 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 172 chg coeffs, 10 upgd conss, 11664 impls, 0 clqs
0.19/0.22 c (round 10) 153 del vars, 126 del conss, 0 chg bounds, 0 chg sides, 186 chg coeffs, 10 upgd conss, 11664 impls, 0 clqs
0.19/0.25 c (0.1s) probing: 221/639 (34.6%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.19/0.25 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.19/0.25 c presolving (11 rounds):
0.19/0.25 c 153 deleted vars, 126 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 186 changed coefficients
0.19/0.25 c 11700 implications, 0 cliques
0.19/0.25 c presolved problem has 639 variables (639 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.19/0.25 c 441 constraints of type <and>
0.19/0.25 c 9 constraints of type <linear>
0.19/0.25 c 10 constraints of type <logicor>
0.19/0.25 c transformed objective value is always integral (scale: 2)
0.19/0.25 c Presolving Time: 0.13
0.19/0.25 c - non default parameters ----------------------------------------------------------------------
0.19/0.25 c # SCIP version 1.2.1.2
0.19/0.25 c
0.19/0.25 c # frequency for displaying node information lines
0.19/0.25 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.25 c display/freq = 10000
0.19/0.25 c
0.19/0.25 c # maximal time in seconds to run
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25 c limits/time = 1799.99
0.19/0.25 c
0.19/0.25 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.25 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25 c limits/memory = 1620
0.19/0.25 c
0.19/0.25 c # should presolving try to simplify inequalities
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c constraints/linear/simplifyinequalities = TRUE
0.19/0.25 c
0.19/0.25 c # should presolving try to simplify knapsacks
0.19/0.25 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.25 c
0.19/0.25 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c heuristics/undercover/freq = 0
0.19/0.25 c
0.19/0.25 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.25 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25 c separating/rapidlearning/freq = 0
0.19/0.25 c
0.19/0.25 c -----------------------------------------------------------------------------------------------
0.19/0.25 c start solving
0.19/0.25 c
0.19/0.26 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.26 c 0.1s| 1 | 0 | 23 | - |2996k| 0 | 12 | 639 | 460 | 639 | 901 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.01 o 3
0.99/1.01 c u 0.7s| 1 | 0 | 23 | - |3045k| 0 | - | 639 | 460 | 639 | 901 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.99/1.02 c 0.7s| 1 | 0 | 23 | - |3035k| 0 | - | 639 | 460 | 639 | 901 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.99/1.02 c
0.99/1.02 c SCIP Status : problem is solved [optimal solution found]
0.99/1.02 c Solving Time (sec) : 0.68
0.99/1.02 c Solving Nodes : 1
0.99/1.02 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.99/1.02 c Dual Bound : +3.00000000000000e+00
0.99/1.02 c Gap : 0.00 %
0.99/1.02 s OPTIMUM FOUND
0.99/1.02 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 x202 -x201 -x144 -x143 x142 x141 x140 x139
0.99/1.02 v -x138 x137 -x200 -x199 -x198 -x197 -x196 -x195 -x194 x193 x136 -x135 x134 x133 x132 x131 x130 x129 -x192 -x191 -x190 -x189 -x188
0.99/1.02 v -x187 -x186 x185 x128 -x127 -x126 x125 -x124 x123 -x122 x121 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 x120 -x119 -x118
0.99/1.02 v -x117 -x116 x115 x114 x113 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x112 -x111 x110 -x109 x108 x107 -x106 x105 -x168
0.99/1.02 v -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x104 -x103 -x102 -x101 x100 x99 x98 x97 -x160 -x159 -x158 -x157 -x156 -x155 -x154
0.99/1.02 v x153 -x96 -x95 -x94 -x93 -x92 x91 -x90 x89 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x88 x87 -x86 x85 -x84 x83 x82
0.99/1.02 v 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 -x56
0.99/1.02 v -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 -x29
0.99/1.02 v -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.99/1.02 c SCIP Status : problem is solved [optimal solution found]
0.99/1.02 c Solving Time : 0.68
0.99/1.02 c Original Problem :
0.99/1.02 c Problem name : HOME/instance-2665042-1276648173.opb
0.99/1.02 c Variables : 792 (792 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.02 c Constraints : 595 initial, 595 maximal
0.99/1.02 c Presolved Problem :
0.99/1.02 c Problem name : t_HOME/instance-2665042-1276648173.opb
0.99/1.02 c Variables : 639 (639 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.02 c Constraints : 460 initial, 460 maximal
0.99/1.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.02 c trivial : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c probing : 0.03 0 0 0 0 0 0 0 0
0.99/1.02 c and : 0.09 18 126 0 0 0 126 0 126
0.99/1.02 c linear : 0.00 1 8 0 0 0 0 0 60
0.99/1.02 c logicor : 0.00 0 0 0 0 0 0 0 0
0.99/1.02 c root node : - 0 - - 0 - - - -
0.99/1.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.02 c integral : 0 0 0 0 0 0 0 0 0 0
0.99/1.02 c and : 441 0 567 0 0 0 0 0 0 0
0.99/1.02 c linear : 9 0 567 0 0 0 0 0 0 0
0.99/1.02 c logicor : 10 0 81 0 0 0 0 0 0 0
0.99/1.02 c countsols : 0 0 0 0 0 0 0 0 0 0
0.99/1.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.02 c integral : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c and : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c linear : 0.01 0.00 0.01 0.00 0.00
0.99/1.02 c logicor : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.02 c Propagators : Time Calls Cutoffs DomReds
0.99/1.02 c vbounds : 0.00 2 0 0
0.99/1.02 c rootredcost : 0.00 0 0 0
0.99/1.02 c pseudoobj : 0.00 110 0 0
0.99/1.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.02 c applied globally : - - - 0 0.0 - - -
0.99/1.02 c applied locally : - - - 0 0.0 - - -
0.99/1.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.99/1.02 c redcost : 0.00 0 0 0 0 0
0.99/1.02 c impliedbounds : 0.00 0 0 0 0 0
0.99/1.02 c intobj : 0.00 0 0 0 0 0
0.99/1.02 c cgmip : 0.00 0 0 0 0 0
0.99/1.02 c gomory : 0.00 0 0 0 0 0
0.99/1.02 c strongcg : 0.00 0 0 0 0 0
0.99/1.02 c cmir : 0.00 0 0 0 0 0
0.99/1.02 c flowcover : 0.00 0 0 0 0 0
0.99/1.02 c clique : 0.00 0 0 0 0 0
0.99/1.02 c zerohalf : 0.00 0 0 0 0 0
0.99/1.02 c mcf : 0.00 0 0 0 0 0
0.99/1.02 c rapidlearning : 0.00 0 0 0 0 0
0.99/1.02 c Pricers : Time Calls Vars
0.99/1.02 c problem variables: 0.00 0 0
0.99/1.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.02 c pscost : 0.00 0 0 0 0 0 0
0.99/1.02 c inference : 0.00 0 0 0 0 0 0
0.99/1.02 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.02 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.02 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.02 c random : 0.00 0 0 0 0 0 0
0.99/1.02 c relpscost : 0.00 0 0 0 0 0 0
0.99/1.02 c Primal Heuristics : Time Calls Found
0.99/1.02 c LP solutions : 0.00 - 0
0.99/1.02 c pseudo solutions : 0.00 - 0
0.99/1.02 c oneopt : 0.00 0 0
0.99/1.02 c trivial : 0.00 2 0
0.99/1.02 c simplerounding : 0.00 0 0
0.99/1.02 c zirounding : 0.00 0 0
0.99/1.02 c rounding : 0.00 1 0
0.99/1.02 c shifting : 0.01 1 0
0.99/1.02 c intshifting : 0.00 0 0
0.99/1.02 c twoopt : 0.00 0 0
0.99/1.02 c fixandinfer : 0.00 0 0
0.99/1.02 c feaspump : 0.01 1 0
0.99/1.02 c coefdiving : 0.00 0 0
0.99/1.02 c pscostdiving : 0.00 0 0
0.99/1.02 c fracdiving : 0.00 0 0
0.99/1.02 c veclendiving : 0.00 0 0
0.99/1.02 c intdiving : 0.00 0 0
0.99/1.02 c actconsdiving : 0.00 0 0
0.99/1.02 c objpscostdiving : 0.00 0 0
0.99/1.02 c rootsoldiving : 0.00 0 0
0.99/1.02 c linesearchdiving : 0.00 0 0
0.99/1.02 c guideddiving : 0.00 0 0
0.99/1.02 c octane : 0.00 0 0
0.99/1.02 c rens : 0.00 0 0
0.99/1.02 c rins : 0.00 0 0
0.99/1.02 c localbranching : 0.00 0 0
0.99/1.02 c mutation : 0.00 0 0
0.99/1.02 c crossover : 0.00 0 0
0.99/1.02 c dins : 0.00 0 0
0.99/1.02 c undercover : 0.53 1 1
0.99/1.02 c nlp : 0.00 0 0
0.99/1.02 c trysol : 0.00 0 0
0.99/1.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.02 c primal LP : 0.00 0 0 0.00 -
0.99/1.02 c dual LP : 0.00 1 23 23.00 -
0.99/1.02 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.02 c barrier LP : 0.00 0 0 0.00 -
0.99/1.02 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.02 c strong branching : 0.00 0 0 0.00 -
0.99/1.02 c (at root node) : - 0 0 0.00 -
0.99/1.02 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.02 c B&B Tree :
0.99/1.02 c number of runs : 1
0.99/1.02 c nodes : 1
0.99/1.02 c nodes (total) : 1
0.99/1.02 c nodes left : 0
0.99/1.02 c max depth : 0
0.99/1.02 c max depth (total): 0
0.99/1.02 c backtracks : 0 (0.0%)
0.99/1.02 c delayed cutoffs : 0
0.99/1.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.02 c avg switch length: 2.00
0.99/1.02 c switching time : 0.00
0.99/1.02 c Solution :
0.99/1.02 c Solutions found : 1 (1 improvements)
0.99/1.02 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.68 seconds, depth 0, found by <undercover>)
0.99/1.02 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.68 seconds, depth 0, found by <undercover>)
0.99/1.02 c Dual Bound : +3.00000000000000e+00
0.99/1.02 c Gap : 0.00 %
0.99/1.02 c Root Dual Bound : +3.00000000000000e+00
0.99/1.02 c Root Iterations : 23
0.99/1.03 c Time complete: 1.02.