0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666507-1276649249.opb>
0.00/0.01 c original problem has 704 variables (704 bin, 0 int, 0 impl, 0 cont) and 529 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.09/0.14 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 0 upgd conss, 3056 impls, 0 clqs
0.09/0.14 c (round 2) 24 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 9 upgd conss, 4624 impls, 0 clqs
0.09/0.15 c (round 3) 40 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 82 chg coeffs, 9 upgd conss, 5968 impls, 0 clqs
0.09/0.15 c (round 4) 56 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 96 chg coeffs, 9 upgd conss, 7088 impls, 0 clqs
0.09/0.16 c (round 5) 72 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 110 chg coeffs, 9 upgd conss, 7984 impls, 0 clqs
0.09/0.16 c (round 6) 88 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 124 chg coeffs, 9 upgd conss, 8656 impls, 0 clqs
0.09/0.17 c (round 7) 104 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 138 chg coeffs, 9 upgd conss, 9104 impls, 0 clqs
0.09/0.17 c (round 8) 120 del vars, 98 del conss, 0 chg bounds, 0 chg sides, 152 chg coeffs, 9 upgd conss, 9328 impls, 0 clqs
0.09/0.18 c (round 9) 136 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 166 chg coeffs, 9 upgd conss, 9328 impls, 0 clqs
0.19/0.21 c (0.1s) probing: 207/568 (36.4%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.19/0.21 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.19/0.21 c presolving (10 rounds):
0.19/0.21 c 136 deleted vars, 112 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 166 changed coefficients
0.19/0.21 c 9360 implications, 0 cliques
0.19/0.21 c presolved problem has 568 variables (568 bin, 0 int, 0 impl, 0 cont) and 409 constraints
0.19/0.21 c 392 constraints of type <and>
0.19/0.21 c 8 constraints of type <linear>
0.19/0.21 c 9 constraints of type <logicor>
0.19/0.21 c transformed objective value is always integral (scale: 2)
0.19/0.21 c Presolving Time: 0.11
0.19/0.21 c - non default parameters ----------------------------------------------------------------------
0.19/0.21 c # SCIP version 1.2.1.2
0.19/0.21 c
0.19/0.21 c # frequency for displaying node information lines
0.19/0.21 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.21 c display/freq = 10000
0.19/0.21 c
0.19/0.21 c # maximal time in seconds to run
0.19/0.21 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.21 c limits/time = 1800
0.19/0.21 c
0.19/0.21 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.21 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.21 c limits/memory = 1620
0.19/0.21 c
0.19/0.21 c # should presolving try to simplify inequalities
0.19/0.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.21 c constraints/linear/simplifyinequalities = TRUE
0.19/0.21 c
0.19/0.21 c # should presolving try to simplify knapsacks
0.19/0.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.21 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.21 c
0.19/0.21 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.19/0.21 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.21 c heuristics/undercover/freq = 0
0.19/0.21 c
0.19/0.21 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.19/0.21 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.21 c separating/rapidlearning/freq = 0
0.19/0.21 c
0.19/0.21 c -----------------------------------------------------------------------------------------------
0.19/0.21 c start solving
0.19/0.21 c
0.19/0.22 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.22 c 0.1s| 1 | 0 | 20 | - |2666k| 0 | 11 | 568 | 409 | 568 | 801 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.17 c 0.8s| 1 | 2 | 542 | - |2697k| 0 | 11 | 568 | 409 | 568 | 801 | 0 | 0 | 11 | 3.000000e+00 | -- | Inf
2.39/2.41 o 9
2.39/2.41 c * 2.0s| 245 | 232 | 3085 | 10.4 |3156k| 82 | - | 568 | 618 | 568 | 122 | 505 | 211 | 865 | 3.000000e+00 | 9.000000e+00 | 200.00%
2.39/2.45 o 3
2.39/2.45 c * 2.1s| 263 | 0 | 3168 | 10.0 |2960k| 83 | - | 568 | 586 | 568 | 115 | 563 | 217 | 894 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.39/2.45 c
2.39/2.45 c SCIP Status : problem is solved [optimal solution found]
2.39/2.45 c Solving Time (sec) : 2.08
2.39/2.45 c Solving Nodes : 263
2.39/2.45 c Primal Bound : +3.00000000000000e+00 (2 solutions)
2.39/2.45 c Dual Bound : +3.00000000000000e+00
2.39/2.45 c Gap : 0.00 %
2.39/2.45 s OPTIMUM FOUND
2.39/2.45 v -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 x178 -x177 -x128 -x127 -x126 -x125 -x124 -x123
2.39/2.45 v x122 x121 -x176 -x175 -x174 -x173 -x172 -x171 x170 x169 -x120 x119 x118 -x117 -x116 x115 x114 x113 -x168 -x167 -x166 -x165
2.39/2.45 v x164 -x163 -x162 -x161 -x112 -x111 -x110 -x109 x108 x107 -x106 x105 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x104 x103
2.39/2.45 v x102 -x101 -x100 x99 -x98 x97 -x152 -x151 -x150 -x149 -x148 -x147 x146 -x145 -x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x144
2.39/2.45 v -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x88 -x87 -x86 -x85 -x84 -x83 x82 x81 -x136 -x135 -x134 -x133 -x132 -x131 x130 -x129
2.39/2.45 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
2.39/2.45 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 x28 -x27
2.39/2.45 v 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
2.39/2.45 c SCIP Status : problem is solved [optimal solution found]
2.39/2.45 c Solving Time : 2.08
2.39/2.45 c Original Problem :
2.39/2.45 c Problem name : HOME/instance-2666507-1276649249.opb
2.39/2.45 c Variables : 704 (704 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 529 initial, 529 maximal
2.39/2.45 c Presolved Problem :
2.39/2.45 c Problem name : t_HOME/instance-2666507-1276649249.opb
2.39/2.45 c Variables : 568 (568 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 409 initial, 618 maximal
2.39/2.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.45 c trivial : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c probing : 0.03 0 0 0 0 0 0 0 0
2.39/2.45 c and : 0.07 16 112 0 0 0 112 0 112
2.39/2.45 c linear : 0.00 1 7 0 0 0 0 0 54
2.39/2.45 c logicor : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c root node : - 45 - - 45 - - - -
2.39/2.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.45 c integral : 0 0 0 260 0 0 5 0 0 506
2.39/2.45 c and : 392 525 1750 2 0 7 1114 563 0 0
2.39/2.45 c linear : 8 1 1743 2 0 27 517 0 0 0
2.39/2.45 c logicor : 9+ 1 286 2 0 2 17 0 0 0
2.39/2.45 c countsols : 0 0 0 2 0 0 0 0 0 0
2.39/2.45 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.45 c integral : 0.46 0.00 0.00 0.46 0.00
2.39/2.45 c and : 0.06 0.06 0.00 0.00 0.00
2.39/2.45 c linear : 0.05 0.00 0.05 0.00 0.00
2.39/2.45 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c Propagators : Time Calls Cutoffs DomReds
2.39/2.45 c vbounds : 0.00 2 0 0
2.39/2.45 c rootredcost : 0.00 1 0 5
2.39/2.45 c pseudoobj : 0.01 1323 0 0
2.39/2.45 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.45 c propagation : 0.02 36 36 440 51.9 18 14.1 -
2.39/2.45 c infeasible LP : 0.03 110 109 156 26.5 21 7.3 0
2.39/2.45 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.45 c applied globally : - - - 215 17.4 - - -
2.39/2.45 c applied locally : - - - 2 61.0 - - -
2.39/2.45 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.45 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.39/2.45 c redcost : 0.02 525 0 0 0 0
2.39/2.45 c impliedbounds : 0.00 1 0 0 0 0
2.39/2.45 c intobj : 0.00 0 0 0 0 0
2.39/2.45 c cgmip : 0.00 0 0 0 0 0
2.39/2.45 c gomory : 0.00 1 0 0 0 0
2.39/2.45 c strongcg : 0.00 1 0 0 0 0
2.39/2.45 c cmir : 0.00 1 0 0 0 0
2.39/2.45 c flowcover : 0.02 1 0 0 0 0
2.39/2.45 c clique : 0.00 1 0 0 0 0
2.39/2.45 c zerohalf : 0.00 0 0 0 0 0
2.39/2.45 c mcf : 0.00 1 0 0 0 0
2.39/2.45 c rapidlearning : 0.06 1 0 0 0 0
2.39/2.45 c Pricers : Time Calls Vars
2.39/2.45 c problem variables: 0.00 0 0
2.39/2.45 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.45 c relpscost : 0.46 258 0 5 0 0 506
2.39/2.45 c pscost : 0.00 0 0 0 0 0 0
2.39/2.45 c inference : 0.00 0 0 0 0 0 0
2.39/2.46 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.46 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.46 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.46 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.46 c random : 0.00 0 0 0 0 0 0
2.39/2.46 c Primal Heuristics : Time Calls Found
2.39/2.46 c LP solutions : 0.00 - 2
2.39/2.46 c pseudo solutions : 0.00 - 0
2.39/2.46 c crossover : 0.00 0 0
2.39/2.46 c guideddiving : 0.00 0 0
2.39/2.46 c intshifting : 0.00 0 0
2.39/2.46 c oneopt : 0.00 1 0
2.39/2.46 c veclendiving : 0.01 1 0
2.39/2.46 c linesearchdiving : 0.01 1 0
2.39/2.46 c feaspump : 0.02 1 0
2.39/2.46 c objpscostdiving : 0.01 1 0
2.39/2.46 c rootsoldiving : 0.20 1 0
2.39/2.46 c coefdiving : 0.02 2 0
2.39/2.46 c pscostdiving : 0.05 2 0
2.39/2.46 c fracdiving : 0.02 2 0
2.39/2.46 c trivial : 0.00 2 0
2.39/2.46 c simplerounding : 0.00 0 0
2.39/2.46 c zirounding : 0.00 245 0
2.39/2.46 c rounding : 0.00 284 0
2.39/2.46 c shifting : 0.16 60 0
2.39/2.46 c twoopt : 0.00 0 0
2.39/2.46 c fixandinfer : 0.00 0 0
2.39/2.46 c intdiving : 0.00 0 0
2.39/2.46 c actconsdiving : 0.00 0 0
2.39/2.46 c octane : 0.00 0 0
2.39/2.46 c rens : 0.02 1 0
2.39/2.46 c rins : 0.00 0 0
2.39/2.46 c localbranching : 0.00 0 0
2.39/2.46 c mutation : 0.00 0 0
2.39/2.46 c dins : 0.00 0 0
2.39/2.46 c undercover : 0.58 1 0
2.39/2.46 c nlp : 0.00 0 0
2.39/2.46 c trysol : 0.00 0 0
2.39/2.46 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.46 c primal LP : 0.01 0 0 0.00 0.00
2.39/2.46 c dual LP : 0.13 539 913 1.69 7023.08
2.39/2.46 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.46 c barrier LP : 0.00 0 0 0.00 -
2.39/2.46 c diving/probing LP: 0.14 648 2255 3.48 16107.14
2.39/2.46 c strong branching : 0.46 894 3236 3.62 7034.78
2.39/2.46 c (at root node) : - 11 173 15.73 -
2.39/2.46 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.46 c B&B Tree :
2.39/2.46 c number of runs : 1
2.39/2.46 c nodes : 263
2.39/2.46 c nodes (total) : 263
2.39/2.46 c nodes left : 0
2.39/2.46 c max depth : 83
2.39/2.46 c max depth (total): 83
2.39/2.46 c backtracks : 13 (4.9%)
2.39/2.46 c delayed cutoffs : 1
2.39/2.46 c repropagations : 89 (52 domain reductions, 1 cutoffs)
2.39/2.46 c avg switch length: 2.92
2.39/2.46 c switching time : 0.01
2.39/2.46 c Solution :
2.39/2.46 c Solutions found : 2 (2 improvements)
2.39/2.46 c First Solution : +9.00000000000000e+00 (in run 1, after 245 nodes, 2.03 seconds, depth 82, found by <relaxation>)
2.39/2.46 c Primal Bound : +3.00000000000000e+00 (in run 1, after 263 nodes, 2.08 seconds, depth 77, found by <relaxation>)
2.39/2.46 c Dual Bound : +3.00000000000000e+00
2.39/2.46 c Gap : 0.00 %
2.39/2.46 c Root Dual Bound : +3.00000000000000e+00
2.39/2.46 c Root Iterations : 542
2.39/2.47 c Time complete: 2.46.