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-2703154-1278564511.opb>
0.00/0.01 c original problem has 756 variables (756 bin, 0 int, 0 impl, 0 cont) and 582 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) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 0 upgd conss, 3108 impls, 0 clqs
0.00/0.07 c (round 2) 25 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 4836 impls, 0 clqs
0.00/0.08 c (round 3) 43 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 8 upgd conss, 6276 impls, 0 clqs
0.00/0.08 c (round 4) 61 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 104 chg coeffs, 8 upgd conss, 7428 impls, 0 clqs
0.08/0.09 c (round 5) 79 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 120 chg coeffs, 8 upgd conss, 8292 impls, 0 clqs
0.08/0.09 c (round 6) 97 del vars, 80 del conss, 0 chg bounds, 0 chg sides, 136 chg coeffs, 8 upgd conss, 8868 impls, 0 clqs
0.08/0.09 c (round 7) 115 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 152 chg coeffs, 8 upgd conss, 9156 impls, 0 clqs
0.08/0.10 c (round 8) 133 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 168 chg coeffs, 8 upgd conss, 9156 impls, 0 clqs
0.09/0.12 c (0.1s) probing: 206/623 (33.1%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.09/0.12 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.12 c presolving (9 rounds):
0.09/0.12 c 133 deleted vars, 112 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 168 changed coefficients
0.09/0.12 c 9184 implications, 0 cliques
0.09/0.12 c presolved problem has 623 variables (623 bin, 0 int, 0 impl, 0 cont) and 463 constraints
0.09/0.12 c 448 constraints of type <and>
0.09/0.12 c 7 constraints of type <linear>
0.09/0.12 c 8 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 2)
0.09/0.12 c Presolving Time: 0.10
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.3
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1789.99
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.12 c # [type: int, range: [1,2], default: 1]
0.09/0.12 c timing/clocktype = 2
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/indicator/addCouplingCons = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c heuristics/undercover/freq = 0
0.09/0.12 c
0.09/0.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/rapidlearning/freq = 0
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.09/0.13 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.13 c 0.1s| 1 | 0 | 18 | - |2908k| 0 | 10 | 623 | 463 | 623 | 911 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.90/0.95 c 0.9s| 1 | 0 | 566 | - |2957k| 0 | 14 | 623 | 463 | 623 | 913 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.90/1.00 c 1.0s| 1 | 0 | 575 | - |2984k| 0 | 23 | 623 | 463 | 623 | 918 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.07 c 1.1s| 1 | 0 | 585 | - |3017k| 0 | 30 | 623 | 463 | 623 | 924 | 13 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.16 c [src/scip/misc.c:392] Warning: hashkey with same value exists multiple times (i.e. duplicate constraint/variable names), so the return value is maybe not correct
1.10/1.17 c 1.2s| 1 | 0 | 594 | - |3034k| 0 | 36 | 623 | 463 | 623 | 930 | 19 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.29 c 1.3s| 1 | 0 | 601 | - |3057k| 0 | 39 | 623 | 463 | 623 | 936 | 25 | 0 | 0 | 3.000000e+00 | -- | Inf
1.39/1.41 c 1.4s| 1 | 0 | 606 | - |3073k| 0 | 42 | 623 | 463 | 623 | 940 | 29 | 0 | 0 | 3.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 2 | 606 | - |3073k| 0 | 42 | 623 | 463 | 623 | 940 | 29 | 0 | 17 | 3.000000e+00 | -- | Inf
8.59/8.64 o 9
8.59/8.64 c * 8.6s| 2146 | 828 | 13626 | 6.1 |4762k| 91 | - | 623 |1595 | 623 | 194 |5295 |1132 |3210 | 3.000000e+00 | 9.000000e+00 | 200.00%
8.99/9.01 o 3
8.99/9.01 c * 9.0s| 2271 | 0 | 14163 | 6.0 |3823k| 91 | - | 623 |1566 | 623 | 193 |5572 |1178 |3367 | 3.000000e+00 | 3.000000e+00 | 0.00%
8.99/9.01 c
8.99/9.01 c SCIP Status : problem is solved [optimal solution found]
8.99/9.01 c Solving Time (sec) : 8.99
8.99/9.01 c Solving Nodes : 2271
8.99/9.01 c Primal Bound : +3.00000000000000e+00 (2 solutions)
8.99/9.01 c Dual Bound : +3.00000000000000e+00
8.99/9.01 c Gap : 0.00 %
8.99/9.01 s OPTIMUM FOUND
8.99/9.01 v -x189 -x188 -x187 -x186 -x185 -x184 x183 -x182 x181 -x180 -x179 -x178 -x177 -x176 x175 -x174 x173 x172 -x126 -x125 -x124 -x123
8.99/9.01 v -x122 x121 -x120 x119 x118 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 x117 -x116 -x115 x114 -x113 x112 -x111 -x110
8.99/9.01 v x109 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x108 -x107 -x106 -x105 -x104 x103 -x102 -x101 x100 x153 x152 x151
8.99/9.01 v x150 x149 x148 x147 -x146 -x145 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 x91 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137
8.99/9.01 v -x136 x90 x89 x88 x87 x86 x85 x84 x83 x82 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x81 -x80 -x79 -x78 -x77 -x76
8.99/9.01 v -x75 -x74 x73 -x72 x71 x70 x69 x68 x67 -x66 x65 x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 x56 x55 -x54 -x53 -x52 x51 -x50 -x49 -x48
8.99/9.01 v -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 x37 x36 x35 x34 x33 x32 x31 x30 -x29 x28 x27 x26 x25 x24 x23 x22 x21 x20 x19
8.99/9.01 v -x18 x17 -x16 x15 -x14 x13 -x12 x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
8.99/9.01 c SCIP Status : problem is solved [optimal solution found]
8.99/9.01 c Solving Time : 8.99
8.99/9.01 c Original Problem :
8.99/9.01 c Problem name : HOME/instance-2703154-1278564511.opb
8.99/9.01 c Variables : 756 (756 binary, 0 integer, 0 implicit integer, 0 continuous)
8.99/9.01 c Constraints : 582 initial, 582 maximal
8.99/9.01 c Presolved Problem :
8.99/9.01 c Problem name : t_HOME/instance-2703154-1278564511.opb
8.99/9.01 c Variables : 623 (623 binary, 0 integer, 0 implicit integer, 0 continuous)
8.99/9.01 c Constraints : 463 initial, 1595 maximal
8.99/9.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.99/9.01 c trivial : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c implics : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c probing : 0.03 0 0 0 0 0 0 0 0
8.99/9.01 c and : 0.05 14 112 0 0 0 112 0 112
8.99/9.01 c linear : 0.01 1 6 0 0 0 0 0 56
8.99/9.01 c logicor : 0.00 0 0 0 0 0 0 0 0
8.99/9.01 c root node : - 60 - - 60 - - - -
8.99/9.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.99/9.01 c integral : 0 0 0 1831 0 0 72 0 0 3540
8.99/9.01 c and : 448 3990 8164 6 0 130 14204 5548 0 0
8.99/9.01 c linear : 7 6 8033 1 0 657 4627 0 0 0
8.99/9.01 c logicor : 8+ 6 2717 2 0 8 771 0 0 0
8.99/9.01 c countsols : 0 0 0 2 0 0 0 0 0 0
8.99/9.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.99/9.01 c integral : 3.16 0.00 0.00 3.16 0.00
8.99/9.01 c and : 0.50 0.35 0.15 0.00 0.00
8.99/9.01 c linear : 0.38 0.00 0.38 0.00 0.00
8.99/9.01 c logicor : 0.04 0.00 0.04 0.00 0.00
8.99/9.01 c countsols : 0.00 0.00 0.00 0.00 0.00
8.99/9.01 c Propagators : Time Calls Cutoffs DomReds
8.99/9.01 c vbounds : 0.00 2 0 0
8.99/9.01 c rootredcost : 0.00 1 0 6
8.99/9.01 c pseudoobj : 0.01 7744 0 0
8.99/9.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.99/9.01 c propagation : 0.24 795 791 8433 56.6 134 17.4 -
8.99/9.01 c infeasible LP : 0.00 9 9 33 30.6 1 9.0 0
8.99/9.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.99/9.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.99/9.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.99/9.01 c applied globally : - - - 1178 21.8 - - -
8.99/9.01 c applied locally : - - - 0 0.0 - - -
8.99/9.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.99/9.01 c cut pool : 0.00 5 - - 13 - (maximal pool size: 54)
8.99/9.01 c redcost : 0.07 3991 0 0 0 0
8.99/9.01 c impliedbounds : 0.00 6 0 0 4 0
8.99/9.01 c intobj : 0.00 0 0 0 0 0
8.99/9.01 c cgmip : 0.00 0 0 0 0 0
8.99/9.01 c gomory : 0.07 6 0 0 0 0
8.99/9.01 c strongcg : 0.06 6 0 0 15 0
8.99/9.01 c cmir : 0.05 6 0 0 26 0
8.99/9.01 c flowcover : 0.28 6 0 0 38 0
8.99/9.01 c clique : 0.00 1 0 0 0 0
8.99/9.01 c zerohalf : 0.00 0 0 0 0 0
8.99/9.01 c mcf : 0.00 1 0 0 0 0
8.99/9.01 c rapidlearning : 0.12 1 0 0 0 0
8.99/9.01 c Pricers : Time Calls Vars
8.99/9.01 c problem variables: 0.00 0 0
8.99/9.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.99/9.01 c relpscost : 3.16 1824 0 72 0 0 3540
8.99/9.01 c pscost : 0.00 0 0 0 0 0 0
8.99/9.01 c inference : 0.00 0 0 0 0 0 0
8.99/9.01 c mostinf : 0.00 0 0 0 0 0 0
8.99/9.01 c leastinf : 0.00 0 0 0 0 0 0
8.99/9.01 c fullstrong : 0.00 0 0 0 0 0 0
8.99/9.01 c allfullstrong : 0.00 0 0 0 0 0 0
8.99/9.01 c random : 0.00 0 0 0 0 0 0
8.99/9.01 c Primal Heuristics : Time Calls Found
8.99/9.01 c LP solutions : 0.00 - 2
8.99/9.01 c pseudo solutions : 0.00 - 0
8.99/9.01 c crossover : 0.00 0 0
8.99/9.01 c guideddiving : 0.00 0 0
8.99/9.01 c intshifting : 0.00 0 0
8.99/9.01 c oneopt : 0.00 1 0
8.99/9.01 c rootsoldiving : 0.07 1 0
8.99/9.01 c coefdiving : 0.02 2 0
8.99/9.01 c pscostdiving : 0.08 2 0
8.99/9.01 c linesearchdiving : 0.01 2 0
8.99/9.01 c fracdiving : 0.02 2 0
8.99/9.01 c veclendiving : 0.01 2 0
8.99/9.01 c objpscostdiving : 0.02 2 0
8.99/9.01 c feaspump : 0.04 2 0
8.99/9.01 c trivial : 0.00 2 0
8.99/9.01 c simplerounding : 0.00 0 0
8.99/9.01 c zirounding : 0.01 1000 0
8.99/9.01 c rounding : 0.05 866 0
8.99/9.01 c shifting : 0.47 230 0
8.99/9.01 c twoopt : 0.00 0 0
8.99/9.01 c fixandinfer : 0.00 0 0
8.99/9.01 c intdiving : 0.00 0 0
8.99/9.01 c actconsdiving : 0.00 0 0
8.99/9.01 c octane : 0.00 0 0
8.99/9.01 c rens : 0.02 1 0
8.99/9.01 c rins : 0.00 0 0
8.99/9.01 c localbranching : 0.00 0 0
8.99/9.01 c mutation : 0.00 0 0
8.99/9.01 c dins : 0.00 0 0
8.99/9.01 c undercover : 0.63 1 0
8.99/9.01 c nlp : 0.00 0 0
8.99/9.01 c trysol : 0.01 0 0
8.99/9.01 c LP : Time Calls Iterations Iter/call Iter/sec
8.99/9.01 c primal LP : 0.06 0 0 0.00 0.00
8.99/9.01 c dual LP : 1.68 4093 12454 3.04 7430.99
8.99/9.01 c lex dual LP : 0.00 0 0 0.00 -
8.99/9.01 c barrier LP : 0.00 0 0 0.00 -
8.99/9.01 c diving/probing LP: 0.17 434 1709 3.94 9994.56
8.99/9.01 c strong branching : 3.11 3367 25481 7.57 8185.56
8.99/9.01 c (at root node) : - 17 919 54.06 -
8.99/9.01 c conflict analysis: 0.00 0 0 0.00 -
8.99/9.01 c B&B Tree :
8.99/9.01 c number of runs : 1
8.99/9.01 c nodes : 2271
8.99/9.01 c nodes (total) : 2271
8.99/9.01 c nodes left : 0
8.99/9.01 c max depth : 91
8.99/9.01 c max depth (total): 91
8.99/9.01 c backtracks : 333 (14.7%)
8.99/9.01 c delayed cutoffs : 284
8.99/9.01 c repropagations : 1302 (4330 domain reductions, 276 cutoffs)
8.99/9.01 c avg switch length: 4.16
8.99/9.01 c switching time : 0.19
8.99/9.01 c Solution :
8.99/9.01 c Solutions found : 2 (2 improvements)
8.99/9.01 c First Solution : +9.00000000000000e+00 (in run 1, after 2146 nodes, 8.62 seconds, depth 80, found by <relaxation>)
8.99/9.01 c Primal Bound : +3.00000000000000e+00 (in run 1, after 2271 nodes, 8.99 seconds, depth 82, found by <relaxation>)
8.99/9.01 c Dual Bound : +3.00000000000000e+00
8.99/9.01 c Gap : 0.00 %
8.99/9.01 c Root Dual Bound : +3.00000000000000e+00
8.99/9.01 c Root Iterations : 606
8.99/9.02 c Time complete: 9.01.