0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703031-1278564404.opb>
0.00/0.01 c original problem has 864 variables (864 bin, 0 int, 0 impl, 0 cont) and 665 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.08 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 0 upgd conss, 3712 impls, 0 clqs
0.08/0.09 c (round 2) 26 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 9 upgd conss, 5728 impls, 0 clqs
0.08/0.09 c (round 3) 44 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 9 upgd conss, 7456 impls, 0 clqs
0.08/0.10 c (round 4) 62 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 111 chg coeffs, 9 upgd conss, 8896 impls, 0 clqs
0.09/0.10 c (round 5) 80 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 127 chg coeffs, 9 upgd conss, 10048 impls, 0 clqs
0.09/0.10 c (round 6) 98 del vars, 80 del conss, 0 chg bounds, 0 chg sides, 143 chg coeffs, 9 upgd conss, 10912 impls, 0 clqs
0.09/0.11 c (round 7) 116 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 159 chg coeffs, 9 upgd conss, 11488 impls, 0 clqs
0.09/0.11 c (round 8) 134 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 175 chg coeffs, 9 upgd conss, 11776 impls, 0 clqs
0.09/0.11 c (round 9) 152 del vars, 128 del conss, 0 chg bounds, 0 chg sides, 191 chg coeffs, 9 upgd conss, 11776 impls, 0 clqs
0.09/0.16 c (0.1s) probing: 222/712 (31.2%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.09/0.16 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.16 c presolving (10 rounds):
0.09/0.16 c 152 deleted vars, 128 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 191 changed coefficients
0.09/0.16 c 11808 implications, 0 cliques
0.09/0.16 c presolved problem has 712 variables (712 bin, 0 int, 0 impl, 0 cont) and 529 constraints
0.09/0.16 c 512 constraints of type <and>
0.09/0.16 c 8 constraints of type <linear>
0.09/0.16 c 9 constraints of type <logicor>
0.09/0.16 c transformed objective value is always integral (scale: 2)
0.09/0.16 c Presolving Time: 0.13
0.09/0.16 c - non default parameters ----------------------------------------------------------------------
0.09/0.16 c # SCIP version 1.2.1.3
0.09/0.16 c
0.09/0.16 c # frequency for displaying node information lines
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.16 c display/freq = 10000
0.09/0.16 c
0.09/0.16 c # maximal time in seconds to run
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/time = 1789.99
0.09/0.16 c
0.09/0.16 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/memory = 1620
0.09/0.16 c
0.09/0.16 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.16 c # [type: int, range: [1,2], default: 1]
0.09/0.16 c timing/clocktype = 2
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify inequalities
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/linear/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/indicator/addCouplingCons = TRUE
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify knapsacks
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c heuristics/undercover/freq = 0
0.09/0.16 c
0.09/0.16 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c separating/rapidlearning/freq = 0
0.09/0.16 c
0.09/0.16 c -----------------------------------------------------------------------------------------------
0.09/0.16 c start solving
0.09/0.16 c
0.09/0.17 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.17 c 0.2s| 1 | 0 | 20 | - |3322k| 0 | 11 | 712 | 529 | 712 |1041 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.87 o 3
0.79/0.87 c u 0.9s| 1 | 0 | 659 | - |3381k| 0 | - | 712 | 529 | 712 |1041 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.88 c 0.9s| 1 | 0 | 659 | - |3370k| 0 | - | 712 | 529 | 712 |1041 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.88 c
0.79/0.88 c SCIP Status : problem is solved [optimal solution found]
0.79/0.88 c Solving Time (sec) : 0.87
0.79/0.88 c Solving Nodes : 1
0.79/0.88 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.79/0.88 c Dual Bound : +3.00000000000000e+00
0.79/0.88 c Gap : 0.00 %
0.79/0.88 s OPTIMUM FOUND
0.79/0.88 v -x216 -x215 -x214 -x213 x212 x211 -x210 -x209 x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x144 -x143 -x142 x141
0.79/0.88 v x140 -x139 -x138 x137 x136 -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 -x190 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128
0.79/0.88 v x127 -x189 -x188 -x187 -x186 -x185 -x184 -x183 x182 -x181 x126 -x125 x124 -x123 x122 x121 -x120 x119 x118 -x180 -x179 -x178
0.79/0.88 v -x177 -x176 -x175 -x174 -x173 x172 x117 x116 x115 -x114 -x113 x112 -x111 -x110 x109 -x171 -x170 -x169 -x168 -x167 -x166 -x165
0.79/0.88 v x164 -x163 x108 -x107 x106 -x105 -x104 -x103 -x102 x101 x100 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 x99 x98
0.79/0.88 v x97 -x96 -x95 -x94 -x93 -x92 x91 -x153 -x152 -x151 -x150 -x149 -x148 -x147 x146 -x145 x90 x89 x88 x87 -x86 x85 -x84 x83 x82 x81
0.79/0.88 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.79/0.88 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 x29
0.79/0.88 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.79/0.88 c SCIP Status : problem is solved [optimal solution found]
0.79/0.88 c Solving Time : 0.87
0.79/0.88 c Original Problem :
0.79/0.88 c Problem name : HOME/instance-2703031-1278564404.opb
0.79/0.88 c Variables : 864 (864 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 665 initial, 665 maximal
0.79/0.88 c Presolved Problem :
0.79/0.88 c Problem name : t_HOME/instance-2703031-1278564404.opb
0.79/0.88 c Variables : 712 (712 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 529 initial, 529 maximal
0.79/0.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.88 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c probing : 0.03 0 0 0 0 0 0 0 0
0.79/0.88 c and : 0.08 16 128 0 0 0 128 0 128
0.79/0.88 c linear : 0.01 1 7 0 0 0 0 0 63
0.79/0.88 c logicor : 0.00 0 0 0 0 0 0 0 0
0.79/0.88 c root node : - 0 - - 0 - - - -
0.79/0.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.88 c integral : 0 0 0 0 0 0 0 0 0 0
0.79/0.88 c and : 512 0 571 0 0 0 0 0 0 0
0.79/0.88 c linear : 8 0 571 0 0 0 0 0 0 0
0.79/0.88 c logicor : 9 0 76 0 0 0 0 0 0 0
0.79/0.88 c countsols : 0 0 0 0 0 0 0 0 0 0
0.79/0.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.88 c integral : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c and : 0.01 0.00 0.01 0.00 0.00
0.79/0.88 c linear : 0.01 0.00 0.01 0.00 0.00
0.79/0.88 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c Propagators : Time Calls Cutoffs DomReds
0.79/0.88 c vbounds : 0.00 2 0 0
0.79/0.88 c rootredcost : 0.00 0 0 0
0.79/0.88 c pseudoobj : 0.00 114 0 0
0.79/0.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.88 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c applied globally : - - - 0 0.0 - - -
0.79/0.88 c applied locally : - - - 0 0.0 - - -
0.79/0.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.88 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.88 c redcost : 0.00 0 0 0 0 0
0.79/0.88 c impliedbounds : 0.00 0 0 0 0 0
0.79/0.88 c intobj : 0.00 0 0 0 0 0
0.79/0.88 c cgmip : 0.00 0 0 0 0 0
0.79/0.88 c gomory : 0.00 0 0 0 0 0
0.79/0.88 c strongcg : 0.00 0 0 0 0 0
0.79/0.88 c cmir : 0.00 0 0 0 0 0
0.79/0.88 c flowcover : 0.00 0 0 0 0 0
0.79/0.88 c clique : 0.00 0 0 0 0 0
0.79/0.88 c zerohalf : 0.00 0 0 0 0 0
0.79/0.88 c mcf : 0.00 0 0 0 0 0
0.79/0.88 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.88 c Pricers : Time Calls Vars
0.79/0.88 c problem variables: 0.00 0 0
0.79/0.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.88 c pscost : 0.00 0 0 0 0 0 0
0.79/0.88 c inference : 0.00 0 0 0 0 0 0
0.79/0.88 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.88 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.88 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c random : 0.00 0 0 0 0 0 0
0.79/0.88 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.88 c Primal Heuristics : Time Calls Found
0.79/0.88 c LP solutions : 0.00 - 0
0.79/0.88 c pseudo solutions : 0.00 - 0
0.79/0.88 c oneopt : 0.00 0 0
0.79/0.88 c trivial : 0.00 2 0
0.79/0.88 c simplerounding : 0.00 0 0
0.79/0.88 c zirounding : 0.00 0 0
0.79/0.88 c rounding : 0.00 1 0
0.79/0.88 c shifting : 0.00 1 0
0.79/0.88 c intshifting : 0.00 0 0
0.79/0.88 c twoopt : 0.00 0 0
0.79/0.88 c fixandinfer : 0.00 0 0
0.79/0.88 c feaspump : 0.04 1 0
0.79/0.88 c coefdiving : 0.00 0 0
0.79/0.88 c pscostdiving : 0.00 0 0
0.79/0.88 c fracdiving : 0.00 0 0
0.79/0.88 c veclendiving : 0.00 0 0
0.79/0.88 c intdiving : 0.00 0 0
0.79/0.88 c actconsdiving : 0.00 0 0
0.79/0.88 c objpscostdiving : 0.00 0 0
0.79/0.88 c rootsoldiving : 0.00 0 0
0.79/0.88 c linesearchdiving : 0.00 0 0
0.79/0.88 c guideddiving : 0.00 0 0
0.79/0.88 c octane : 0.00 0 0
0.79/0.88 c rens : 0.00 0 0
0.79/0.88 c rins : 0.00 0 0
0.79/0.88 c localbranching : 0.00 0 0
0.79/0.88 c mutation : 0.00 0 0
0.79/0.88 c crossover : 0.00 0 0
0.79/0.88 c dins : 0.00 0 0
0.79/0.88 c undercover : 0.67 1 1
0.79/0.88 c nlp : 0.00 0 0
0.79/0.88 c trysol : 0.00 0 0
0.79/0.88 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.88 c primal LP : 0.00 0 0 0.00 -
0.79/0.88 c dual LP : 0.00 1 20 20.00 -
0.79/0.88 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.88 c barrier LP : 0.00 0 0 0.00 -
0.79/0.88 c diving/probing LP: 0.03 11 639 58.09 22822.24
0.79/0.88 c strong branching : 0.00 0 0 0.00 -
0.79/0.88 c (at root node) : - 0 0 0.00 -
0.79/0.88 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.88 c B&B Tree :
0.79/0.88 c number of runs : 1
0.79/0.88 c nodes : 1
0.79/0.88 c nodes (total) : 1
0.79/0.88 c nodes left : 0
0.79/0.88 c max depth : 0
0.79/0.88 c max depth (total): 0
0.79/0.88 c backtracks : 0 (0.0%)
0.79/0.88 c delayed cutoffs : 0
0.79/0.88 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.88 c avg switch length: 2.00
0.79/0.88 c switching time : 0.00
0.79/0.88 c Solution :
0.79/0.88 c Solutions found : 1 (1 improvements)
0.79/0.88 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.86 seconds, depth 0, found by <undercover>)
0.79/0.88 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.86 seconds, depth 0, found by <undercover>)
0.79/0.88 c Dual Bound : +3.00000000000000e+00
0.79/0.88 c Gap : 0.00 %
0.79/0.88 c Root Dual Bound : +3.00000000000000e+00
0.79/0.88 c Root Iterations : 659
0.79/0.90 c Time complete: 0.89.