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-2702959-1278564330.opb>
0.00/0.01 c original problem has 972 variables (972 bin, 0 int, 0 impl, 0 cont) and 748 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.02/0.09 c (round 1) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 0 upgd conss, 4356 impls, 0 clqs
0.02/0.09 c (round 2) 27 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 10 upgd conss, 6660 impls, 0 clqs
0.02/0.10 c (round 3) 45 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 10 upgd conss, 8676 impls, 0 clqs
0.09/0.10 c (round 4) 63 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 118 chg coeffs, 10 upgd conss, 10404 impls, 0 clqs
0.09/0.10 c (round 5) 81 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 134 chg coeffs, 10 upgd conss, 11844 impls, 0 clqs
0.09/0.11 c (round 6) 99 del vars, 80 del conss, 0 chg bounds, 0 chg sides, 150 chg coeffs, 10 upgd conss, 12996 impls, 0 clqs
0.09/0.11 c (round 7) 117 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 166 chg coeffs, 10 upgd conss, 13860 impls, 0 clqs
0.09/0.12 c (round 8) 135 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 182 chg coeffs, 10 upgd conss, 14436 impls, 0 clqs
0.09/0.12 c (round 9) 153 del vars, 128 del conss, 0 chg bounds, 0 chg sides, 198 chg coeffs, 10 upgd conss, 14724 impls, 0 clqs
0.09/0.12 c (round 10) 171 del vars, 144 del conss, 0 chg bounds, 0 chg sides, 214 chg coeffs, 10 upgd conss, 14724 impls, 0 clqs
0.19/0.20 c (0.2s) probing: 238/801 (29.7%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.19/0.20 c (0.2s) probing aborted: 100/100 successive totally useless probings
0.19/0.20 c presolving (11 rounds):
0.19/0.20 c 171 deleted vars, 144 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 214 changed coefficients
0.19/0.20 c 14760 implications, 0 cliques
0.19/0.20 c presolved problem has 801 variables (801 bin, 0 int, 0 impl, 0 cont) and 595 constraints
0.19/0.20 c 576 constraints of type <and>
0.19/0.20 c 9 constraints of type <linear>
0.19/0.20 c 10 constraints of type <logicor>
0.19/0.20 c transformed objective value is always integral (scale: 2)
0.19/0.20 c Presolving Time: 0.18
0.19/0.20 c - non default parameters ----------------------------------------------------------------------
0.19/0.20 c # SCIP version 1.2.1.3
0.19/0.20 c
0.19/0.20 c # frequency for displaying node information lines
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.20 c display/freq = 10000
0.19/0.20 c
0.19/0.20 c # maximal time in seconds to run
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.20 c limits/time = 1789.99
0.19/0.20 c
0.19/0.20 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.20 c limits/memory = 1620
0.19/0.20 c
0.19/0.20 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.19/0.20 c # [type: int, range: [1,2], default: 1]
0.19/0.20 c timing/clocktype = 2
0.19/0.20 c
0.19/0.20 c # should presolving try to simplify inequalities
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/linear/simplifyinequalities = TRUE
0.19/0.20 c
0.19/0.20 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/indicator/addCouplingCons = TRUE
0.19/0.20 c
0.19/0.20 c # should presolving try to simplify knapsacks
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.20 c
0.19/0.20 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c heuristics/undercover/freq = 0
0.19/0.20 c
0.19/0.20 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c separating/rapidlearning/freq = 0
0.19/0.20 c
0.19/0.20 c -----------------------------------------------------------------------------------------------
0.19/0.20 c start solving
0.19/0.20 c
0.19/0.21 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.21 c 0.2s| 1 | 0 | 22 | - |3737k| 0 | 12 | 801 | 595 | 801 |1171 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.31 c 1.3s| 1 | 0 | 402 | - |3786k| 0 | 16 | 801 | 595 | 801 |1173 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 411 | - |3823k| 0 | 25 | 801 | 595 | 801 |1178 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 433 | - |3857k| 0 | 30 | 801 | 595 | 801 |1187 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 444 | - |3870k| 0 | 39 | 801 | 595 | 801 |1194 | 23 | 0 | 0 | 3.000000e+00 | -- | Inf
1.59/1.68 c 1.7s| 1 | 0 | 470 | - |3882k| 0 | 40 | 801 | 595 | 801 |1203 | 32 | 0 | 0 | 3.000000e+00 | -- | Inf
1.79/1.80 c 1.8s| 1 | 0 | 473 | - |3885k| 0 | 44 | 801 | 595 | 801 |1208 | 37 | 0 | 0 | 3.000000e+00 | -- | Inf
1.99/2.06 c 2.0s| 1 | 2 | 473 | - |3886k| 0 | 44 | 801 | 595 | 801 |1208 | 37 | 0 | 17 | 3.000000e+00 | -- | Inf
7.18/7.28 o 3
7.18/7.28 c * 7.3s| 845 | 0 | 5903 | 6.4 |4227k| 111 | - | 801 | 930 | 801 | 280 |2819 | 335 |2516 | 3.000000e+00 | 3.000000e+00 | 0.00%
7.18/7.28 c
7.18/7.28 c SCIP Status : problem is solved [optimal solution found]
7.18/7.28 c Solving Time (sec) : 7.27
7.18/7.28 c Solving Nodes : 845
7.18/7.28 c Primal Bound : +3.00000000000000e+00 (1 solutions)
7.18/7.28 c Dual Bound : +3.00000000000000e+00
7.18/7.28 c Gap : 0.00 %
7.18/7.28 s OPTIMUM FOUND
7.18/7.28 v -x243 x242 -x241 -x240 -x239 x238 x237 -x236 x235 -x234 -x233 -x232 -x231 -x230 x229 -x228 x227 x226 x162 -x161 -x160 -x159 -x158
7.18/7.28 v x157 x156 -x155 x154 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x153 -x152 -x151 -x150 x149 -x148 x147 -x146 x145
7.18/7.28 v -x216 -x215 -x214 -x213 x212 x211 x210 x209 x208 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x207 -x206 x205 -x204
7.18/7.28 v x203 x202 -x201 -x200 -x199 x135 x134 x133 x132 -x131 -x130 -x129 -x128 x127 -x198 -x197 -x196 x195 -x194 x193 x192 -x191
7.18/7.28 v x190 x126 -x125 x124 x123 -x122 -x121 -x120 -x119 x118 x189 -x188 -x187 x186 -x185 -x184 -x183 x182 -x181 -x117 x116 -x115 -x114
7.18/7.28 v x113 -x112 x111 -x110 x109 -x180 -x179 x178 x177 -x176 -x175 x174 x173 -x172 x108 -x107 -x106 x105 x104 -x103 x102 -x101
7.18/7.28 v x100 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x99 -x98 x97 x96 x95 -x94 x93 -x92 x91 x90 -x89 -x88 -x87 -x86 x85
7.18/7.28 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
7.18/7.28 v -x57 -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
7.18/7.28 v -x30 -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
7.18/7.28 v x2 x1
7.18/7.28 c SCIP Status : problem is solved [optimal solution found]
7.18/7.28 c Solving Time : 7.27
7.18/7.28 c Original Problem :
7.18/7.28 c Problem name : HOME/instance-2702959-1278564330.opb
7.18/7.28 c Variables : 972 (972 binary, 0 integer, 0 implicit integer, 0 continuous)
7.18/7.28 c Constraints : 748 initial, 748 maximal
7.18/7.28 c Presolved Problem :
7.18/7.28 c Problem name : t_HOME/instance-2702959-1278564330.opb
7.18/7.28 c Variables : 801 (801 binary, 0 integer, 0 implicit integer, 0 continuous)
7.18/7.28 c Constraints : 595 initial, 930 maximal
7.18/7.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.18/7.28 c trivial : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c implics : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c probing : 0.03 0 0 0 0 0 0 0 0
7.18/7.28 c and : 0.12 18 144 0 0 0 144 0 144
7.18/7.28 c linear : 0.01 1 8 0 0 0 0 0 70
7.18/7.28 c logicor : 0.00 0 0 0 0 0 0 0 0
7.18/7.28 c root node : - 0 - - 0 - - - -
7.18/7.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.18/7.28 c integral : 0 0 0 767 0 0 39 0 0 1470
7.18/7.28 c and : 576 1721 3069 0 0 28 4473 2800 0 0
7.18/7.28 c linear : 9 6 3041 0 0 136 1542 0 0 0
7.18/7.28 c logicor : 10+ 6 575 1 0 4 126 0 0 0
7.18/7.28 c countsols : 0 0 0 1 0 0 0 0 0 0
7.18/7.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.18/7.28 c integral : 2.78 0.00 0.00 2.78 0.00
7.18/7.28 c and : 0.42 0.36 0.07 0.00 0.00
7.18/7.28 c linear : 0.13 0.00 0.13 0.00 0.00
7.18/7.28 c logicor : 0.00 0.00 0.00 0.00 0.00
7.18/7.28 c countsols : 0.00 0.00 0.00 0.00 0.00
7.18/7.28 c Propagators : Time Calls Cutoffs DomReds
7.18/7.28 c vbounds : 0.00 2 0 0
7.18/7.28 c rootredcost : 0.00 0 0 0
7.18/7.28 c pseudoobj : 0.00 2579 0 0
7.18/7.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.18/7.28 c propagation : 0.08 168 166 2141 70.0 61 19.0 -
7.18/7.28 c infeasible LP : 0.01 18 18 71 31.5 2 6.5 0
7.18/7.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.18/7.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.18/7.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.18/7.28 c applied globally : - - - 335 24.1 - - -
7.18/7.28 c applied locally : - - - 0 0.0 - - -
7.18/7.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.18/7.28 c cut pool : 0.00 5 - - 3 - (maximal pool size: 52)
7.18/7.28 c redcost : 0.04 1722 0 0 0 0
7.18/7.28 c impliedbounds : 0.00 6 0 0 7 0
7.18/7.28 c intobj : 0.00 0 0 0 0 0
7.18/7.28 c cgmip : 0.00 0 0 0 0 0
7.18/7.28 c gomory : 0.05 6 0 0 0 0
7.18/7.28 c strongcg : 0.05 6 0 0 61 0
7.18/7.28 c cmir : 0.06 6 0 0 25 0
7.18/7.28 c flowcover : 0.31 6 0 0 39 0
7.18/7.28 c clique : 0.00 1 0 0 0 0
7.18/7.28 c zerohalf : 0.00 0 0 0 0 0
7.18/7.28 c mcf : 0.00 1 0 0 0 0
7.18/7.28 c rapidlearning : 0.18 1 0 0 0 0
7.18/7.28 c Pricers : Time Calls Vars
7.18/7.28 c problem variables: 0.00 0 0
7.18/7.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.18/7.28 c relpscost : 2.77 766 0 39 0 0 1470
7.18/7.28 c pscost : 0.00 0 0 0 0 0 0
7.18/7.28 c inference : 0.00 0 0 0 0 0 0
7.18/7.28 c mostinf : 0.00 0 0 0 0 0 0
7.18/7.28 c leastinf : 0.00 0 0 0 0 0 0
7.18/7.28 c fullstrong : 0.00 0 0 0 0 0 0
7.18/7.28 c allfullstrong : 0.00 0 0 0 0 0 0
7.18/7.28 c random : 0.00 0 0 0 0 0 0
7.18/7.28 c Primal Heuristics : Time Calls Found
7.18/7.28 c LP solutions : 0.00 - 1
7.18/7.28 c pseudo solutions : 0.00 - 0
7.18/7.28 c oneopt : 0.00 0 0
7.18/7.28 c crossover : 0.00 0 0
7.18/7.28 c linesearchdiving : 0.00 0 0
7.18/7.28 c guideddiving : 0.00 0 0
7.18/7.28 c intshifting : 0.00 0 0
7.18/7.28 c coefdiving : 0.01 1 0
7.18/7.28 c pscostdiving : 0.05 1 0
7.18/7.28 c fracdiving : 0.02 1 0
7.18/7.28 c veclendiving : 0.01 1 0
7.18/7.28 c feaspump : 0.03 1 0
7.18/7.28 c objpscostdiving : 0.02 1 0
7.18/7.28 c rootsoldiving : 0.04 1 0
7.18/7.28 c trivial : 0.00 2 0
7.18/7.28 c simplerounding : 0.00 0 0
7.18/7.28 c zirounding : 0.02 734 0
7.18/7.28 c rounding : 0.02 549 0
7.18/7.28 c shifting : 0.58 138 0
7.18/7.28 c twoopt : 0.00 0 0
7.18/7.28 c fixandinfer : 0.00 0 0
7.18/7.28 c intdiving : 0.00 0 0
7.18/7.28 c actconsdiving : 0.00 0 0
7.18/7.28 c octane : 0.00 0 0
7.18/7.28 c rens : 0.03 1 0
7.18/7.28 c rins : 0.00 0 0
7.18/7.28 c localbranching : 0.00 0 0
7.18/7.28 c mutation : 0.00 0 0
7.18/7.28 c dins : 0.00 0 0
7.18/7.28 c undercover : 0.85 1 0
7.18/7.28 c nlp : 0.00 0 0
7.18/7.28 c trysol : 0.00 0 0
7.18/7.28 c LP : Time Calls Iterations Iter/call Iter/sec
7.18/7.28 c primal LP : 0.05 0 0 0.00 0.00
7.18/7.28 c dual LP : 0.85 1829 4955 2.71 5822.58
7.18/7.28 c lex dual LP : 0.00 0 0 0.00 -
7.18/7.28 c barrier LP : 0.00 0 0 0.00 -
7.18/7.28 c diving/probing LP: 0.09 243 948 3.90 10304.57
7.18/7.28 c strong branching : 2.74 2516 18691 7.43 6814.11
7.18/7.28 c (at root node) : - 17 1137 66.88 -
7.18/7.28 c conflict analysis: 0.00 0 0 0.00 -
7.18/7.28 c B&B Tree :
7.18/7.28 c number of runs : 1
7.18/7.28 c nodes : 845
7.18/7.28 c nodes (total) : 845
7.18/7.28 c nodes left : 0
7.18/7.28 c max depth : 111
7.18/7.28 c max depth (total): 111
7.18/7.28 c backtracks : 69 (8.2%)
7.18/7.28 c delayed cutoffs : 54
7.18/7.28 c repropagations : 179 (623 domain reductions, 52 cutoffs)
7.18/7.28 c avg switch length: 2.70
7.18/7.28 c switching time : 0.11
7.18/7.28 c Solution :
7.18/7.28 c Solutions found : 1 (1 improvements)
7.18/7.28 c First Solution : +3.00000000000000e+00 (in run 1, after 845 nodes, 7.26 seconds, depth 107, found by <relaxation>)
7.18/7.28 c Primal Bound : +3.00000000000000e+00 (in run 1, after 845 nodes, 7.26 seconds, depth 107, found by <relaxation>)
7.18/7.28 c Dual Bound : +3.00000000000000e+00
7.18/7.28 c Gap : 0.00 %
7.18/7.28 c Root Dual Bound : +3.00000000000000e+00
7.18/7.28 c Root Iterations : 473
7.29/7.30 c Time complete: 7.29.