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-2703050-1278564423.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.06/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.06/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.06/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.06/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.15 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
1.10/1.12 c 1.1s| 1 | 0 | 666 | - |3360k| 0 | 15 | 712 | 529 | 712 |1042 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.18 c 1.2s| 1 | 0 | 673 | - |3393k| 0 | 20 | 712 | 529 | 712 |1047 | 6 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 680 | - |3409k| 0 | 24 | 712 | 529 | 712 |1052 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 688 | - |3428k| 0 | 30 | 712 | 529 | 712 |1058 | 17 | 0 | 0 | 3.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 693 | - |3456k| 0 | 32 | 712 | 529 | 712 |1064 | 23 | 0 | 0 | 3.000000e+00 | -- | Inf
1.49/1.51 c 1.5s| 1 | 0 | 695 | - |3475k| 0 | 32 | 712 | 529 | 712 |1065 | 24 | 0 | 0 | 3.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 2 | 695 | - |3475k| 0 | 32 | 712 | 529 | 712 |1065 | 24 | 0 | 17 | 3.000000e+00 | -- | Inf
15.40/15.49 o 3
15.40/15.49 c *15.5s| 5182 | 0 | 21911 | 4.1 |5621k| 100 | - | 712 |3564 | 712 | 166 |9481 |3087 |4613 | 3.000000e+00 | 3.000000e+00 | 0.00%
15.40/15.49 c
15.40/15.49 c SCIP Status : problem is solved [optimal solution found]
15.40/15.49 c Solving Time (sec) : 15.48
15.40/15.49 c Solving Nodes : 5182
15.40/15.49 c Primal Bound : +3.00000000000000e+00 (1 solutions)
15.40/15.49 c Dual Bound : +3.00000000000000e+00
15.40/15.49 c Gap : 0.00 %
15.40/15.49 s OPTIMUM FOUND
15.40/15.49 v x216 -x215 -x214 -x213 -x212 -x211 x210 -x209 -x208 -x207 x206 -x205 x204 -x203 -x202 -x201 x200 x199 x144 x143 x142 -x141 x140
15.40/15.49 v x139 -x138 x137 x136 -x198 -x197 -x196 -x195 -x194 x193 -x192 x191 -x190 x135 -x134 -x133 x132 -x131 x130 x129 x128 x127 -x189
15.40/15.49 v -x188 x187 -x186 x185 x184 -x183 -x182 -x181 x126 -x125 -x124 x123 x122 x121 x120 x119 x118 -x180 -x179 -x178 -x177 -x176
15.40/15.49 v -x175 -x174 -x173 -x172 x117 -x116 -x115 -x114 x113 -x112 -x111 x110 x109 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 x163
15.40/15.49 v -x108 -x107 -x106 x105 x104 -x103 x102 x101 x100 -x162 -x161 -x160 -x159 -x158 -x157 x156 x155 x154 -x99 -x98 -x97 -x96 -x95
15.40/15.49 v -x94 x93 x92 x91 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 x82 x81 -x80
15.40/15.49 v -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
15.40/15.49 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
15.40/15.49 v -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
15.40/15.49 c SCIP Status : problem is solved [optimal solution found]
15.40/15.49 c Solving Time : 15.48
15.40/15.49 c Original Problem :
15.40/15.49 c Problem name : HOME/instance-2703050-1278564423.opb
15.40/15.49 c Variables : 864 (864 binary, 0 integer, 0 implicit integer, 0 continuous)
15.40/15.49 c Constraints : 665 initial, 665 maximal
15.40/15.49 c Presolved Problem :
15.40/15.49 c Problem name : t_HOME/instance-2703050-1278564423.opb
15.40/15.49 c Variables : 712 (712 binary, 0 integer, 0 implicit integer, 0 continuous)
15.40/15.49 c Constraints : 529 initial, 3564 maximal
15.40/15.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
15.40/15.49 c trivial : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c implics : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c probing : 0.03 0 0 0 0 0 0 0 0
15.40/15.49 c and : 0.08 16 128 0 0 0 128 0 128
15.40/15.49 c linear : 0.01 1 7 0 0 0 0 0 63
15.40/15.49 c logicor : 0.00 0 0 0 0 0 0 0 0
15.40/15.49 c root node : - 0 - - 0 - - - -
15.40/15.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
15.40/15.49 c integral : 0 0 0 4150 0 0 94 0 0 8150
15.40/15.49 c and : 512 8466 15854 1 0 219 26946 9460 0 0
15.40/15.49 c linear : 8 6 15635 1 0 1496 10618 0 0 0
15.40/15.49 c logicor : 9+ 6 5825 1 0 27 1757 0 0 0
15.40/15.49 c countsols : 0 0 0 1 0 0 0 0 0 0
15.40/15.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
15.40/15.49 c integral : 4.15 0.00 0.00 4.15 0.00
15.40/15.49 c and : 1.14 0.82 0.31 0.00 0.00
15.40/15.49 c linear : 1.21 0.00 1.21 0.00 0.00
15.40/15.49 c logicor : 0.15 0.00 0.15 0.00 0.00
15.40/15.49 c countsols : 0.00 0.00 0.00 0.00 0.00
15.40/15.49 c Propagators : Time Calls Cutoffs DomReds
15.40/15.49 c vbounds : 0.01 2 0 0
15.40/15.49 c rootredcost : 0.01 0 0 0
15.40/15.49 c pseudoobj : 0.01 15397 0 0
15.40/15.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
15.40/15.49 c propagation : 0.93 1742 1736 32638 68.1 205 48.8 -
15.40/15.49 c infeasible LP : 0.01 25 25 224 60.9 6 34.0 0
15.40/15.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
15.40/15.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
15.40/15.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
15.40/15.49 c applied globally : - - - 3087 31.8 - - -
15.40/15.49 c applied locally : - - - 0 0.0 - - -
15.40/15.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
15.40/15.49 c cut pool : 0.00 5 - - 0 - (maximal pool size: 37)
15.40/15.49 c redcost : 0.15 8466 0 0 0 0
15.40/15.49 c impliedbounds : 0.00 6 0 0 2 0
15.40/15.49 c intobj : 0.00 0 0 0 0 0
15.40/15.49 c cgmip : 0.00 0 0 0 0 0
15.40/15.49 c gomory : 0.06 6 0 0 3 0
15.40/15.49 c strongcg : 0.04 6 0 0 4 0
15.40/15.49 c cmir : 0.04 6 0 0 18 0
15.40/15.49 c flowcover : 0.24 6 0 0 17 0
15.40/15.49 c clique : 0.00 1 0 0 0 0
15.40/15.49 c zerohalf : 0.00 0 0 0 0 0
15.40/15.49 c mcf : 0.00 1 0 0 0 0
15.40/15.49 c rapidlearning : 0.15 1 0 0 0 0
15.40/15.49 c Pricers : Time Calls Vars
15.40/15.49 c problem variables: 0.00 0 0
15.40/15.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
15.40/15.49 c relpscost : 4.14 4149 0 94 0 0 8150
15.40/15.49 c pscost : 0.00 0 0 0 0 0 0
15.40/15.49 c inference : 0.00 0 0 0 0 0 0
15.40/15.49 c mostinf : 0.00 0 0 0 0 0 0
15.40/15.49 c leastinf : 0.00 0 0 0 0 0 0
15.40/15.49 c fullstrong : 0.00 0 0 0 0 0 0
15.40/15.49 c allfullstrong : 0.00 0 0 0 0 0 0
15.40/15.49 c random : 0.00 0 0 0 0 0 0
15.40/15.49 c Primal Heuristics : Time Calls Found
15.40/15.49 c LP solutions : 0.01 - 1
15.40/15.49 c pseudo solutions : 0.00 - 0
15.40/15.49 c oneopt : 0.01 0 0
15.40/15.49 c crossover : 0.00 0 0
15.40/15.49 c guideddiving : 0.00 0 0
15.40/15.49 c intshifting : 0.00 0 0
15.40/15.49 c veclendiving : 0.01 1 0
15.40/15.49 c linesearchdiving : 0.00 1 0
15.40/15.49 c feaspump : 0.04 1 0
15.40/15.49 c objpscostdiving : 0.02 1 0
15.40/15.49 c rootsoldiving : 0.05 1 0
15.40/15.49 c coefdiving : 0.01 2 0
15.40/15.49 c pscostdiving : 0.01 2 0
15.40/15.49 c fracdiving : 0.01 2 0
15.40/15.49 c trivial : 0.00 2 0
15.40/15.49 c simplerounding : 0.00 0 0
15.40/15.49 c zirounding : 0.02 1000 0
15.40/15.49 c rounding : 0.06 1285 0
15.40/15.49 c shifting : 1.07 374 0
15.40/15.49 c twoopt : 0.00 0 0
15.40/15.49 c fixandinfer : 0.00 0 0
15.40/15.49 c intdiving : 0.00 0 0
15.40/15.49 c actconsdiving : 0.00 0 0
15.40/15.49 c octane : 0.00 0 0
15.40/15.49 c rens : 0.03 1 0
15.40/15.49 c rins : 0.00 0 0
15.40/15.49 c localbranching : 0.00 0 0
15.40/15.49 c mutation : 0.00 0 0
15.40/15.49 c dins : 0.00 0 0
15.40/15.49 c undercover : 0.73 1 0
15.40/15.49 c nlp : 0.00 0 0
15.40/15.49 c trysol : 0.00 0 0
15.40/15.49 c LP : Time Calls Iterations Iter/call Iter/sec
15.40/15.49 c primal LP : 0.09 0 0 0.00 0.00
15.40/15.49 c dual LP : 3.49 8592 20683 2.41 5917.97
15.40/15.49 c lex dual LP : 0.00 0 0 0.00 -
15.40/15.49 c barrier LP : 0.00 0 0 0.00 -
15.40/15.49 c diving/probing LP: 0.10 147 1228 8.35 12530.74
15.40/15.49 c strong branching : 4.04 4613 27450 5.95 6794.65
15.40/15.49 c (at root node) : - 17 461 27.12 -
15.40/15.49 c conflict analysis: 0.00 0 0 0.00 -
15.40/15.49 c B&B Tree :
15.40/15.49 c number of runs : 1
15.40/15.49 c nodes : 5182
15.40/15.49 c nodes (total) : 5182
15.40/15.49 c nodes left : 0
15.40/15.49 c max depth : 100
15.40/15.49 c max depth (total): 100
15.40/15.49 c backtracks : 700 (13.5%)
15.40/15.49 c delayed cutoffs : 663
15.40/15.49 c repropagations : 2252 (7488 domain reductions, 624 cutoffs)
15.40/15.49 c avg switch length: 4.16
15.40/15.49 c switching time : 0.51
15.40/15.49 c Solution :
15.40/15.49 c Solutions found : 1 (1 improvements)
15.40/15.49 c First Solution : +3.00000000000000e+00 (in run 1, after 5182 nodes, 15.47 seconds, depth 94, found by <relaxation>)
15.40/15.49 c Primal Bound : +3.00000000000000e+00 (in run 1, after 5182 nodes, 15.47 seconds, depth 94, found by <relaxation>)
15.40/15.49 c Dual Bound : +3.00000000000000e+00
15.40/15.49 c Gap : 0.00 %
15.40/15.49 c Root Dual Bound : +3.00000000000000e+00
15.40/15.49 c Root Iterations : 695
15.49/15.51 c Time complete: 15.5.