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-2703041-1278564414.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.00/0.07 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.00/0.08 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.00/0.08 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.00/0.08 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.08/0.09 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.08/0.09 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.08/0.10 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.09/0.10 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.09/0.10 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.09/0.10 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.09/0.13 c (0.1s) probing: 221/639 (34.6%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.09/0.13 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.13 c presolving (11 rounds):
0.09/0.13 c 153 deleted vars, 126 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 186 changed coefficients
0.09/0.13 c 11700 implications, 0 cliques
0.09/0.13 c presolved problem has 639 variables (639 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.09/0.13 c 441 constraints of type <and>
0.09/0.13 c 9 constraints of type <linear>
0.09/0.13 c 10 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 2)
0.09/0.13 c Presolving Time: 0.11
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.3
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1790
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.13 c # [type: int, range: [1,2], default: 1]
0.09/0.13 c timing/clocktype = 2
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/indicator/addCouplingCons = TRUE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c heuristics/undercover/freq = 0
0.09/0.13 c
0.09/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/rapidlearning/freq = 0
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.09/0.14 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.14 c 0.1s| 1 | 0 | 22 | - |2997k| 0 | 12 | 639 | 460 | 639 | 901 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 350 | - |3043k| 0 | 16 | 639 | 460 | 639 | 903 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 360 | - |3065k| 0 | 24 | 639 | 460 | 639 | 908 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.16 c 1.1s| 1 | 0 | 369 | - |3087k| 0 | 31 | 639 | 460 | 639 | 912 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 386 | - |3103k| 0 | 37 | 639 | 460 | 639 | 919 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.30 c 1.3s| 1 | 0 | 395 | - |3107k| 0 | 35 | 639 | 460 | 639 | 923 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 421 | - |3111k| 0 | 37 | 639 | 460 | 639 | 925 | 24 | 0 | 0 | 3.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 2 | 421 | - |3112k| 0 | 37 | 639 | 460 | 639 | 925 | 24 | 0 | 18 | 3.000000e+00 | -- | Inf
6.49/6.50 o 9
6.49/6.50 c * 6.5s| 1267 | 729 | 8596 | 6.5 |4274k| 104 | - | 639 |1063 | 639 | 211 |2533 | 604 |2267 | 3.000000e+00 | 9.000000e+00 | 200.00%
7.29/7.36 o 3
7.29/7.36 c * 7.3s| 1515 | 0 | 9875 | 6.2 |3703k| 104 | - | 639 |1134 | 639 | 207 |3088 | 716 |2800 | 3.000000e+00 | 3.000000e+00 | 0.00%
7.29/7.36 c
7.29/7.36 c SCIP Status : problem is solved [optimal solution found]
7.29/7.36 c Solving Time (sec) : 7.35
7.29/7.36 c Solving Nodes : 1515
7.29/7.36 c Primal Bound : +3.00000000000000e+00 (2 solutions)
7.29/7.36 c Dual Bound : +3.00000000000000e+00
7.29/7.36 c Gap : 0.00 %
7.29/7.37 s OPTIMUM FOUND
7.29/7.37 v -x216 -x215 -x214 x213 x212 -x211 -x210 x209 -x208 -x207 -x206 x205 x204 x203 x202 x201 -x144 -x143 -x142 x141 x140 x139 -x138
7.29/7.37 v x137 -x200 -x199 -x198 -x197 -x196 -x195 -x194 x193 -x136 -x135 x134 -x133 x132 x131 -x130 x129 -x192 -x191 -x190 -x189 -x188
7.29/7.37 v x187 -x186 x185 -x128 -x127 x126 -x125 x124 -x123 x122 x121 -x184 x183 -x182 -x181 -x180 -x179 x178 -x177 x120 -x119 x118 x117
7.29/7.37 v x116 x115 -x114 x113 -x176 -x175 -x174 -x173 -x172 -x171 x170 x169 -x112 x111 -x110 -x109 -x108 -x107 x106 x105 -x168 -x167
7.29/7.37 v -x166 -x165 x164 -x163 x162 -x161 -x104 -x103 -x102 -x101 -x100 x99 -x98 x97 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153
7.29/7.37 v -x96 -x95 -x94 x93 -x92 -x91 x90 x89 -x152 -x151 -x150 -x149 -x148 -x147 x146 -x145 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81
7.29/7.37 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 -x54 -x53
7.29/7.37 v -x52 x51 x50 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
7.29/7.37 v -x23 -x22 x21 -x20 -x19 x18 x17 x16 -x15 x14 -x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
7.29/7.37 c SCIP Status : problem is solved [optimal solution found]
7.29/7.37 c Solving Time : 7.35
7.29/7.37 c Original Problem :
7.29/7.37 c Problem name : HOME/instance-2703041-1278564414.opb
7.29/7.37 c Variables : 792 (792 binary, 0 integer, 0 implicit integer, 0 continuous)
7.29/7.37 c Constraints : 595 initial, 595 maximal
7.29/7.37 c Presolved Problem :
7.29/7.37 c Problem name : t_HOME/instance-2703041-1278564414.opb
7.29/7.37 c Variables : 639 (639 binary, 0 integer, 0 implicit integer, 0 continuous)
7.29/7.37 c Constraints : 460 initial, 1134 maximal
7.29/7.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.29/7.37 c trivial : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c implics : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c probing : 0.03 0 0 0 0 0 0 0 0
7.29/7.37 c and : 0.06 18 126 0 0 0 126 0 126
7.29/7.37 c linear : 0.01 1 8 0 0 0 0 0 60
7.29/7.37 c logicor : 0.00 0 0 0 0 0 0 0 0
7.29/7.37 c root node : - 45 - - 45 - - - -
7.29/7.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.29/7.37 c integral : 0 0 0 1352 0 1 89 0 0 2556
7.29/7.37 c and : 441 2715 5449 1 0 97 6520 3070 0 0
7.29/7.37 c linear : 9 6 5351 1 0 238 2604 0 0 0
7.29/7.37 c logicor : 10+ 6 1613 2 0 11 343 0 0 0
7.29/7.37 c countsols : 0 0 0 2 0 0 0 0 0 0
7.29/7.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.29/7.37 c integral : 2.52 0.00 0.00 2.52 0.00
7.29/7.37 c and : 0.46 0.37 0.10 0.00 0.00
7.29/7.37 c linear : 0.15 0.00 0.15 0.00 0.00
7.29/7.37 c logicor : 0.01 0.00 0.01 0.00 0.00
7.29/7.37 c countsols : 0.00 0.00 0.00 0.00 0.00
7.29/7.37 c Propagators : Time Calls Cutoffs DomReds
7.29/7.37 c vbounds : 0.00 2 0 0
7.29/7.37 c rootredcost : 0.00 1 0 5
7.29/7.37 c pseudoobj : 0.00 4992 0 0
7.29/7.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.29/7.37 c propagation : 0.08 346 344 3552 46.2 50 27.0 -
7.29/7.37 c infeasible LP : 0.02 110 109 177 49.5 56 6.3 0
7.29/7.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.29/7.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.29/7.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.29/7.37 c applied globally : - - - 715 22.4 - - -
7.29/7.37 c applied locally : - - - 1 64.0 - - -
7.29/7.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.29/7.37 c cut pool : 0.00 5 - - 2 - (maximal pool size: 35)
7.29/7.37 c redcost : 0.05 2716 0 0 0 0
7.29/7.37 c impliedbounds : 0.00 6 0 0 7 0
7.29/7.37 c intobj : 0.00 0 0 0 0 0
7.29/7.37 c cgmip : 0.00 0 0 0 0 0
7.29/7.37 c gomory : 0.05 6 0 0 14 0
7.29/7.37 c strongcg : 0.04 6 0 0 27 0
7.29/7.37 c cmir : 0.05 6 0 0 20 0
7.29/7.37 c flowcover : 0.14 6 0 0 20 0
7.29/7.37 c clique : 0.00 1 0 0 0 0
7.29/7.37 c zerohalf : 0.00 0 0 0 0 0
7.29/7.37 c mcf : 0.00 1 0 0 0 0
7.29/7.37 c rapidlearning : 0.12 1 0 0 0 0
7.29/7.37 c Pricers : Time Calls Vars
7.29/7.37 c problem variables: 0.00 0 0
7.29/7.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.29/7.37 c relpscost : 2.52 1350 1 89 0 0 2556
7.29/7.37 c pscost : 0.00 0 0 0 0 0 0
7.29/7.37 c inference : 0.00 0 0 0 0 0 0
7.29/7.37 c mostinf : 0.00 0 0 0 0 0 0
7.29/7.37 c leastinf : 0.00 0 0 0 0 0 0
7.29/7.37 c fullstrong : 0.00 0 0 0 0 0 0
7.29/7.37 c allfullstrong : 0.00 0 0 0 0 0 0
7.29/7.37 c random : 0.00 0 0 0 0 0 0
7.29/7.37 c Primal Heuristics : Time Calls Found
7.29/7.37 c LP solutions : 0.00 - 2
7.29/7.37 c pseudo solutions : 0.00 - 0
7.29/7.37 c crossover : 0.00 0 0
7.29/7.37 c guideddiving : 0.00 0 0
7.29/7.37 c intshifting : 0.00 0 0
7.29/7.37 c oneopt : 0.00 1 0
7.29/7.37 c coefdiving : 0.03 2 0
7.29/7.37 c pscostdiving : 0.07 2 0
7.29/7.37 c fracdiving : 0.01 2 0
7.29/7.37 c veclendiving : 0.01 2 0
7.29/7.37 c linesearchdiving : 0.03 2 0
7.29/7.37 c feaspump : 0.03 2 0
7.29/7.37 c objpscostdiving : 0.05 2 0
7.29/7.37 c rootsoldiving : 0.36 2 0
7.29/7.37 c trivial : 0.00 2 0
7.29/7.37 c simplerounding : 0.00 0 0
7.29/7.37 c zirounding : 0.01 1000 0
7.29/7.37 c rounding : 0.02 695 0
7.29/7.37 c shifting : 0.53 172 0
7.29/7.37 c twoopt : 0.00 0 0
7.29/7.37 c fixandinfer : 0.00 0 0
7.29/7.37 c intdiving : 0.00 0 0
7.29/7.37 c actconsdiving : 0.00 0 0
7.29/7.37 c octane : 0.00 0 0
7.29/7.37 c rens : 0.02 1 0
7.29/7.37 c rins : 0.00 0 0
7.29/7.37 c localbranching : 0.00 0 0
7.29/7.37 c mutation : 0.00 0 0
7.29/7.37 c dins : 0.00 0 0
7.29/7.37 c undercover : 0.77 1 0
7.29/7.37 c nlp : 0.00 0 0
7.29/7.37 c trysol : 0.00 0 0
7.29/7.37 c LP : Time Calls Iterations Iter/call Iter/sec
7.29/7.37 c primal LP : 0.04 0 0 0.00 0.00
7.29/7.37 c dual LP : 1.08 2782 7085 2.55 6554.03
7.29/7.37 c lex dual LP : 0.00 0 0 0.00 -
7.29/7.37 c barrier LP : 0.00 0 0 0.00 -
7.29/7.37 c diving/probing LP: 0.30 769 2790 3.63 9425.55
7.29/7.37 c strong branching : 2.49 2800 20221 7.22 8127.30
7.29/7.37 c (at root node) : - 18 1162 64.56 -
7.29/7.37 c conflict analysis: 0.00 0 0 0.00 -
7.29/7.37 c B&B Tree :
7.29/7.37 c number of runs : 1
7.29/7.37 c nodes : 1515
7.29/7.37 c nodes (total) : 1515
7.29/7.37 c nodes left : 0
7.29/7.37 c max depth : 104
7.29/7.37 c max depth (total): 104
7.29/7.37 c backtracks : 146 (9.6%)
7.29/7.37 c delayed cutoffs : 92
7.29/7.37 c repropagations : 563 (1348 domain reductions, 91 cutoffs)
7.29/7.37 c avg switch length: 3.50
7.29/7.37 c switching time : 0.15
7.29/7.37 c Solution :
7.29/7.37 c Solutions found : 2 (2 improvements)
7.29/7.37 c First Solution : +9.00000000000000e+00 (in run 1, after 1267 nodes, 6.49 seconds, depth 101, found by <relaxation>)
7.29/7.37 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1515 nodes, 7.35 seconds, depth 102, found by <relaxation>)
7.29/7.37 c Dual Bound : +3.00000000000000e+00
7.29/7.37 c Gap : 0.00 %
7.29/7.37 c Root Dual Bound : +3.00000000000000e+00
7.29/7.37 c Root Iterations : 421
7.29/7.38 c Time complete: 7.38.