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-2702987-1278564373.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.01/0.02 c presolving:
0.01/0.06 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.01/0.07 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.01/0.07 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.01/0.07 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.01/0.08 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.01/0.08 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.01/0.08 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.01/0.09 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.01/0.09 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.09/0.11 c (0.1s) probing: 207/568 (36.4%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.09/0.11 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.11 c presolving (10 rounds):
0.09/0.11 c 136 deleted vars, 112 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 166 changed coefficients
0.09/0.11 c 9360 implications, 0 cliques
0.09/0.11 c presolved problem has 568 variables (568 bin, 0 int, 0 impl, 0 cont) and 409 constraints
0.09/0.11 c 392 constraints of type <and>
0.09/0.11 c 8 constraints of type <linear>
0.09/0.11 c 9 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 2)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1790
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c heuristics/undercover/freq = 0
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/rapidlearning/freq = 0
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.12 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.12 c 0.1s| 1 | 0 | 20 | - |2667k| 0 | 11 | 568 | 409 | 568 | 801 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.03 c 1.0s| 1 | 0 | 602 | - |2705k| 0 | 15 | 568 | 409 | 568 | 802 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 609 | - |2724k| 0 | 21 | 568 | 409 | 568 | 806 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.10 c 1.1s| 1 | 0 | 620 | - |2741k| 0 | 26 | 568 | 409 | 568 | 811 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.15 c 1.1s| 1 | 0 | 624 | - |2766k| 0 | 27 | 568 | 409 | 568 | 815 | 14 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 629 | - |2785k| 0 | 30 | 568 | 409 | 568 | 820 | 19 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.28 c 1.3s| 1 | 0 | 639 | - |2793k| 0 | 35 | 568 | 409 | 568 | 825 | 24 | 0 | 0 | 3.000000e+00 | -- | Inf
1.39/1.41 c 1.4s| 1 | 2 | 639 | - |2793k| 0 | 35 | 568 | 409 | 568 | 825 | 24 | 0 | 19 | 3.000000e+00 | -- | Inf
3.30/3.35 o 51
3.30/3.35 c * 3.3s| 512 | 257 | 3394 | 5.4 |3195k| 80 | - | 568 | 644 | 568 | 172 |1210 | 235 |1457 | 3.000000e+00 | 5.100000e+01 |1600.00%
10.59/10.66 o 3
10.59/10.66 c *10.6s| 4328 | 0 | 18224 | 4.1 |3904k| 88 | - | 568 |1938 | 568 | 161 |8675 |1550 |3781 | 3.000000e+00 | 3.000000e+00 | 0.00%
10.59/10.66 c
10.59/10.66 c SCIP Status : problem is solved [optimal solution found]
10.59/10.66 c Solving Time (sec) : 10.65
10.59/10.66 c Solving Nodes : 4328
10.59/10.66 c Primal Bound : +3.00000000000000e+00 (2 solutions)
10.59/10.66 c Dual Bound : +3.00000000000000e+00
10.59/10.66 c Gap : 0.00 %
10.59/10.66 s OPTIMUM FOUND
10.59/10.66 v -x192 x191 x190 x189 x188 x187 -x186 -x185 -x184 -x183 -x182 x181 -x180 x179 -x178 -x177 -x128 x127 x126 x125 x124 x123 x122 x121
10.59/10.66 v -x176 x175 x174 -x173 -x172 -x171 -x170 x169 -x120 x119 x118 -x117 -x116 -x115 x114 x113 -x168 -x167 x166 x165 -x164 x163
10.59/10.66 v -x162 -x161 x112 x111 x110 -x109 x108 -x107 -x106 x105 -x160 x159 x158 x157 -x156 x155 -x154 x153 -x104 x103 x102 -x101 x100
10.59/10.66 v -x99 -x98 x97 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x144 -x143 -x142 x141 x140
10.59/10.66 v x139 -x138 x137 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x80 x79 x78 -x77 -x76
10.59/10.66 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
10.59/10.66 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
10.59/10.66 v x20 -x19 x18 x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
10.59/10.66 c SCIP Status : problem is solved [optimal solution found]
10.59/10.66 c Solving Time : 10.65
10.59/10.66 c Original Problem :
10.59/10.66 c Problem name : HOME/instance-2702987-1278564373.opb
10.59/10.66 c Variables : 704 (704 binary, 0 integer, 0 implicit integer, 0 continuous)
10.59/10.66 c Constraints : 529 initial, 529 maximal
10.59/10.66 c Presolved Problem :
10.59/10.66 c Problem name : t_HOME/instance-2702987-1278564373.opb
10.59/10.66 c Variables : 568 (568 binary, 0 integer, 0 implicit integer, 0 continuous)
10.59/10.66 c Constraints : 409 initial, 1938 maximal
10.59/10.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
10.59/10.66 c trivial : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c dualfix : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c boundshift : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c implics : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c probing : 0.02 0 0 0 0 0 0 0 0
10.59/10.66 c and : 0.04 16 112 0 0 0 112 0 112
10.59/10.66 c linear : 0.01 1 7 0 0 0 0 0 54
10.59/10.66 c logicor : 0.00 0 0 0 0 0 0 0 0
10.59/10.66 c root node : - 18 - - 18 - - - -
10.59/10.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
10.59/10.66 c integral : 0 0 0 3865 0 1 168 0 0 7474
10.59/10.66 c and : 392 7899 12402 0 0 129 19186 8656 0 0
10.59/10.66 c linear : 8 6 12273 0 0 731 9288 0 0 0
10.59/10.66 c logicor : 9+ 6 4924 0 0 25 973 0 0 0
10.59/10.66 c countsols : 0 0 0 2 0 0 0 0 0 0
10.59/10.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
10.59/10.66 c integral : 2.81 0.00 0.00 2.81 0.00
10.59/10.66 c and : 0.55 0.40 0.15 0.00 0.00
10.59/10.66 c linear : 0.50 0.00 0.50 0.00 0.00
10.59/10.66 c logicor : 0.09 0.00 0.09 0.00 0.00
10.59/10.66 c countsols : 0.00 0.00 0.00 0.00 0.00
10.59/10.66 c Propagators : Time Calls Cutoffs DomReds
10.59/10.66 c vbounds : 0.01 2 0 0
10.59/10.66 c rootredcost : 0.01 1 0 2
10.59/10.66 c pseudoobj : 0.02 11979 0 0
10.59/10.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.59/10.66 c propagation : 0.30 885 878 13482 56.3 115 24.7 -
10.59/10.66 c infeasible LP : 0.00 6 6 48 37.2 0 0.0 0
10.59/10.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.59/10.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.59/10.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.59/10.66 c applied globally : - - - 1550 26.4 - - -
10.59/10.66 c applied locally : - - - 0 0.0 - - -
10.59/10.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
10.59/10.66 c cut pool : 0.00 5 - - 11 - (maximal pool size: 41)
10.59/10.66 c redcost : 0.12 7901 0 0 0 0
10.59/10.66 c impliedbounds : 0.00 6 0 0 6 0
10.59/10.66 c intobj : 0.00 0 0 0 0 0
10.59/10.66 c cgmip : 0.00 0 0 0 0 0
10.59/10.66 c gomory : 0.05 6 0 0 2 0
10.59/10.66 c strongcg : 0.03 6 0 0 16 0
10.59/10.66 c cmir : 0.03 6 0 0 25 0
10.59/10.66 c flowcover : 0.12 6 0 0 22 0
10.59/10.66 c clique : 0.00 1 0 0 0 0
10.59/10.66 c zerohalf : 0.00 0 0 0 0 0
10.59/10.66 c mcf : 0.00 1 0 0 0 0
10.59/10.66 c rapidlearning : 0.10 1 0 0 0 0
10.59/10.66 c Pricers : Time Calls Vars
10.59/10.66 c problem variables: 0.00 0 0
10.59/10.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
10.59/10.66 c relpscost : 2.80 3863 1 168 0 0 7474
10.59/10.66 c pscost : 0.00 0 0 0 0 0 0
10.59/10.66 c inference : 0.00 0 0 0 0 0 0
10.59/10.66 c mostinf : 0.00 0 0 0 0 0 0
10.59/10.66 c leastinf : 0.00 0 0 0 0 0 0
10.59/10.66 c fullstrong : 0.00 0 0 0 0 0 0
10.59/10.66 c allfullstrong : 0.00 0 0 0 0 0 0
10.59/10.66 c random : 0.00 0 0 0 0 0 0
10.59/10.66 c Primal Heuristics : Time Calls Found
10.59/10.66 c LP solutions : 0.01 - 2
10.59/10.66 c pseudo solutions : 0.00 - 0
10.59/10.66 c crossover : 0.00 0 0
10.59/10.66 c intshifting : 0.00 0 0
10.59/10.66 c oneopt : 0.01 1 0
10.59/10.66 c rootsoldiving : 0.01 1 0
10.59/10.66 c coefdiving : 0.01 2 0
10.59/10.66 c pscostdiving : 0.01 2 0
10.59/10.66 c fracdiving : 0.03 2 0
10.59/10.66 c veclendiving : 0.01 2 0
10.59/10.66 c linesearchdiving : 0.01 2 0
10.59/10.66 c guideddiving : 0.01 2 0
10.59/10.66 c feaspump : 0.04 2 0
10.59/10.66 c objpscostdiving : 0.01 2 0
10.59/10.66 c trivial : 0.00 2 0
10.59/10.66 c simplerounding : 0.01 0 0
10.59/10.66 c zirounding : 0.01 1000 0
10.59/10.66 c rounding : 0.06 1256 0
10.59/10.66 c shifting : 0.74 339 0
10.59/10.66 c twoopt : 0.00 0 0
10.59/10.66 c fixandinfer : 0.00 0 0
10.59/10.66 c intdiving : 0.00 0 0
10.59/10.66 c actconsdiving : 0.00 0 0
10.59/10.66 c octane : 0.00 0 0
10.59/10.66 c rens : 0.02 1 0
10.59/10.66 c rins : 0.00 0 0
10.59/10.66 c localbranching : 0.00 0 0
10.59/10.66 c mutation : 0.00 0 0
10.59/10.66 c dins : 0.00 0 0
10.59/10.66 c undercover : 0.76 1 0
10.59/10.66 c nlp : 0.00 0 0
10.59/10.66 c trysol : 0.00 0 0
10.59/10.66 c LP : Time Calls Iterations Iter/call Iter/sec
10.59/10.66 c primal LP : 0.11 0 0 0.00 0.00
10.59/10.66 c dual LP : 2.58 8076 17212 2.13 6681.77
10.59/10.66 c lex dual LP : 0.00 0 0 0.00 -
10.59/10.66 c barrier LP : 0.00 0 0 0.00 -
10.59/10.66 c diving/probing LP: 0.07 202 1012 5.01 14457.35
10.59/10.66 c strong branching : 2.73 3781 20146 5.33 7371.47
10.59/10.66 c (at root node) : - 19 726 38.21 -
10.59/10.66 c conflict analysis: 0.00 0 0 0.00 -
10.59/10.66 c B&B Tree :
10.59/10.66 c number of runs : 1
10.59/10.66 c nodes : 4328
10.59/10.66 c nodes (total) : 4328
10.59/10.66 c nodes left : 0
10.59/10.66 c max depth : 88
10.59/10.66 c max depth (total): 88
10.59/10.66 c backtracks : 344 (7.9%)
10.59/10.66 c delayed cutoffs : 285
10.59/10.66 c repropagations : 1141 (3831 domain reductions, 277 cutoffs)
10.59/10.66 c avg switch length: 3.68
10.59/10.66 c switching time : 0.42
10.59/10.66 c Solution :
10.59/10.66 c Solutions found : 2 (2 improvements)
10.59/10.66 c First Solution : +5.10000000000000e+01 (in run 1, after 512 nodes, 3.33 seconds, depth 80, found by <relaxation>)
10.59/10.66 c Primal Bound : +3.00000000000000e+00 (in run 1, after 4328 nodes, 10.64 seconds, depth 81, found by <relaxation>)
10.59/10.66 c Dual Bound : +3.00000000000000e+00
10.59/10.66 c Gap : 0.00 %
10.59/10.66 c Root Dual Bound : +3.00000000000000e+00
10.59/10.66 c Root Iterations : 639
10.59/10.68 c Time complete: 10.67.