0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666236-1276620906.opb>
0.00/0.02 c original problem has 139 variables (139 bin, 0 int, 0 impl, 0 cont) and 216 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 1 del vars, 1 del conss, 1 chg bounds, 14 chg sides, 41 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 2) 1 del vars, 82 del conss, 1 chg bounds, 14 chg sides, 41 chg coeffs, 29 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 3) 1 del vars, 82 del conss, 1 chg bounds, 24 chg sides, 99 chg coeffs, 53 upgd conss, 98 impls, 1 clqs
0.00/0.04 c (round 4) 1 del vars, 82 del conss, 1 chg bounds, 24 chg sides, 106 chg coeffs, 53 upgd conss, 98 impls, 1 clqs
0.00/0.07 c (0.1s) probing: 135/138 (97.8%) - 0 fixings, 0 aggregations, 43 implications, 0 bound changes
0.00/0.07 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (5 rounds):
0.00/0.07 c 1 deleted vars, 82 deleted constraints, 1 tightened bounds, 0 added holes, 24 changed sides, 106 changed coefficients
0.00/0.07 c 184 implications, 1 cliques
0.00/0.07 c presolved problem has 138 variables (138 bin, 0 int, 0 impl, 0 cont) and 134 constraints
0.00/0.07 c 53 constraints of type <knapsack>
0.00/0.07 c 81 constraints of type <linear>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.05
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1799.99
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.08 c 0.1s| 1 | 0 | 87 | - |1016k| 0 | 67 | 138 | 134 | 138 | 134 | 0 | 0 | 0 | 1.500000e+01 | -- | Inf
0.29/0.38 o 19
0.29/0.38 c y 0.3s| 1 | 0 | 87 | - |1245k| 0 | 67 | 138 | 134 | 138 | 134 | 0 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.39/0.40 c 0.3s| 1 | 0 | 178 | - |1464k| 0 | 48 | 138 | 372 | 138 | 147 | 28 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.39/0.43 c 0.4s| 1 | 0 | 212 | - |1532k| 0 | 51 | 138 | 372 | 138 | 166 | 47 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.39/0.46 c 0.4s| 1 | 0 | 259 | - |1634k| 0 | 60 | 138 | 372 | 138 | 184 | 65 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.49/0.51 c 0.5s| 1 | 0 | 300 | - |1690k| 0 | 64 | 138 | 372 | 138 | 201 | 82 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.49/0.56 c 0.5s| 1 | 0 | 359 | - |1755k| 0 | 64 | 138 | 372 | 138 | 217 | 98 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.59/0.61 c 0.6s| 1 | 0 | 368 | - |1784k| 0 | 67 | 138 | 372 | 138 | 230 | 111 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.69/0.79 c 0.7s| 1 | 2 | 368 | - |1784k| 0 | 67 | 138 | 372 | 138 | 230 | 111 | 0 | 10 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.69/0.79 c (run 1, node 1) restarting after 10 global fixings of integer variables
0.69/0.79 c
0.69/0.79 c (restart) converted 25 cuts from the global cut pool into linear constraints
0.69/0.79 c
0.69/0.80 c presolving:
0.79/0.81 c (round 1) 11 del vars, 2 del conss, 1 chg bounds, 100 chg sides, 130 chg coeffs, 0 upgd conss, 360 impls, 0 clqs
0.79/0.82 c (round 2) 11 del vars, 29 del conss, 1 chg bounds, 136 chg sides, 164 chg coeffs, 0 upgd conss, 360 impls, 1 clqs
0.79/0.83 c (round 3) 11 del vars, 43 del conss, 1 chg bounds, 144 chg sides, 187 chg coeffs, 236 upgd conss, 360 impls, 5 clqs
0.79/0.83 c (round 4) 11 del vars, 43 del conss, 1 chg bounds, 150 chg sides, 198 chg coeffs, 236 upgd conss, 360 impls, 5 clqs
0.79/0.83 c presolving (5 rounds):
0.79/0.83 c 11 deleted vars, 43 deleted constraints, 1 tightened bounds, 0 added holes, 150 changed sides, 198 changed coefficients
0.79/0.83 c 360 implications, 5 cliques
0.79/0.83 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 383 constraints
0.79/0.83 c 58 constraints of type <knapsack>
0.79/0.83 c 29 constraints of type <setppc>
0.79/0.83 c 81 constraints of type <linear>
0.79/0.83 c 215 constraints of type <logicor>
0.79/0.83 c transformed objective value is always integral (scale: 1)
0.79/0.83 c Presolving Time: 0.08
0.79/0.83 c
0.79/0.84 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.84 c 0.7s| 1 | 0 | 466 | - |1164k| 0 | 58 | 127 | 383 | 127 | 185 | 0 | 0 | 10 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.79/0.87 c 0.7s| 1 | 0 | 502 | - |1257k| 0 | 60 | 127 | 383 | 127 | 240 | 55 | 0 | 10 | 1.500000e+01 | 1.900000e+01 | 26.67%
0.89/0.91 c 0.8s| 1 | 2 | 502 | - |1257k| 0 | 60 | 127 | 383 | 127 | 240 | 55 | 0 | 27 | 1.500000e+01 | 1.900000e+01 | 26.67%
1.29/1.32 o 17
1.29/1.32 c * 1.1s| 26 | 4 | 917 | 16.6 |1276k| 13 | - | 127 | 388 | 127 | 183 | 55 | 5 | 397 | 1.500000e+01 | 1.700000e+01 | 13.33%
2.69/2.75 c
2.69/2.75 c SCIP Status : problem is solved [optimal solution found]
2.69/2.75 c Solving Time (sec) : 2.48
2.69/2.75 c Solving Nodes : 507 (total of 508 nodes in 2 runs)
2.69/2.75 c Primal Bound : +1.70000000000000e+01 (2 solutions)
2.69/2.75 c Dual Bound : +1.70000000000000e+01
2.69/2.75 c Gap : 0.00 %
2.69/2.75 s OPTIMUM FOUND
2.69/2.75 v x34 x35 x36 x37 x38 x39 x40 x41 x42 x43 x44 x45 x46 x47 x48 x49 x50 x51 x52 x53 x54 x55 x56 x57 x58 x59 x60 x61 x62 x63 x64 x65
2.69/2.75 v x66 x67 x68 x69 x70 x71 x72 x73 -x74 x75 x76 x77 x78 x79 x80 -x81 -x82 -x83 x84 x85 -x86 -x87 -x88 x89 x90 x91 x92 x93 x94 x95
2.69/2.75 v x96 x97 x98 x99 x100 x101 x102 x103 x104 x105 x106 -x107 x108 x109 x110 x111 -x112 -x113 -x114 x115 -x116 -x117 -x118 -x17
2.69/2.75 v -x16 -x15 -x14 -x13 -x12 x119 x120 x121 x122 x123 -x124 x125 x126 -x127 -x128 -x129 -x130 -x131 -x132 -x11 -x10 -x9 -x8 -x7
2.69/2.75 v -x6 -x133 x134 -x135 -x136 -x137 -x23 -x22 -x21 -x20 -x19 x18 -x138 -x33 -x32 x31 -x30 x29 -x28 -x27 x26 -x25 -x24 x139 -x5 -x4
2.69/2.75 v -x3 x2 -x1
2.69/2.75 c SCIP Status : problem is solved [optimal solution found]
2.69/2.75 c Solving Time : 2.48
2.69/2.75 c Original Problem :
2.69/2.75 c Problem name : HOME/instance-2666236-1276620906.opb
2.69/2.75 c Variables : 139 (139 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.75 c Constraints : 216 initial, 216 maximal
2.69/2.75 c Presolved Problem :
2.69/2.75 c Problem name : t_HOME/instance-2666236-1276620906.opb
2.69/2.75 c Variables : 127 (127 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.75 c Constraints : 383 initial, 753 maximal
2.69/2.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.75 c trivial : 0.00 10 0 0 0 0 0 0 0
2.69/2.75 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.69/2.75 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.75 c implics : 0.00 0 0 0 0 0 0 0 0
2.69/2.75 c probing : 0.04 0 0 0 0 0 0 0 0
2.69/2.75 c knapsack : 0.02 0 0 0 1 0 2 115 237
2.69/2.75 c setppc : 0.00 0 0 0 0 0 0 0 0
2.69/2.75 c linear : 0.02 2 0 0 1 0 109 59 67
2.69/2.75 c logicor : 0.00 0 0 0 0 0 14 0 0
2.69/2.75 c root node : - 15 - - 15 - - - -
2.69/2.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.75 c integral : 0 0 0 414 0 8 255 0 0 620
2.69/2.75 c knapsack : 58 8 1932 1 0 41 1927 196 0 0
2.69/2.75 c setppc : 29 1 365 0 0 0 46 0 0 0
2.69/2.75 c linear : 81 8 1890 0 0 171 6415 25 0 0
2.69/2.75 c logicor : 215+ 1 811 0 0 19 542 2 0 0
2.69/2.75 c countsols : 0 0 0 1 0 0 0 0 0 0
2.69/2.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.75 c integral : 1.13 0.00 0.00 1.13 0.00
2.69/2.75 c knapsack : 0.05 0.00 0.05 0.00 0.00
2.69/2.75 c setppc : 0.00 0.00 0.00 0.00 0.00
2.69/2.75 c linear : 0.16 0.00 0.16 0.00 0.00
2.69/2.75 c logicor : 0.02 0.00 0.02 0.00 0.00
2.69/2.75 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.75 c Propagators : Time Calls Cutoffs DomReds
2.69/2.75 c vbounds : 0.00 3 0 0
2.69/2.75 c rootredcost : 0.00 1 0 1
2.69/2.75 c pseudoobj : 0.01 1660 0 0
2.69/2.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.75 c propagation : 0.02 231 218 753 10.9 5 11.0 -
2.69/2.75 c infeasible LP : 0.00 14 14 46 10.4 1 6.0 0
2.69/2.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.75 c applied globally : - - - 384 9.7 - - -
2.69/2.75 c applied locally : - - - 0 0.0 - - -
2.69/2.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 154)
2.69/2.75 c redcost : 0.00 430 0 17 0 0
2.69/2.75 c impliedbounds : 0.00 7 0 0 14 0
2.69/2.75 c intobj : 0.00 0 0 0 0 0
2.69/2.75 c cgmip : 0.00 0 0 0 0 0
2.69/2.75 c gomory : 0.04 7 0 0 68 0
2.69/2.75 c strongcg : 0.01 7 0 0 76 0
2.69/2.75 c cmir : 0.07 7 0 0 392 0
2.69/2.75 c flowcover : 0.10 7 0 0 555 0
2.69/2.75 c clique : 0.00 7 0 0 0 0
2.69/2.75 c zerohalf : 0.00 0 0 0 0 0
2.69/2.75 c mcf : 0.00 2 0 0 0 0
2.69/2.75 c rapidlearning : 0.26 1 0 10 0 261
2.69/2.75 c Pricers : Time Calls Vars
2.69/2.75 c problem variables: 0.00 0 0
2.69/2.75 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.75 c relpscost : 1.13 413 8 255 0 0 620
2.69/2.75 c pscost : 0.00 0 0 0 0 0 0
2.69/2.75 c inference : 0.00 0 0 0 0 0 0
2.69/2.75 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.75 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.75 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.75 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.75 c random : 0.00 0 0 0 0 0 0
2.69/2.75 c Primal Heuristics : Time Calls Found
2.69/2.75 c LP solutions : 0.00 - 1
2.69/2.75 c pseudo solutions : 0.00 - 0
2.69/2.75 c crossover : 0.00 0 0
2.69/2.75 c veclendiving : 0.00 0 0
2.69/2.75 c objpscostdiving : 0.00 0 0
2.69/2.75 c rootsoldiving : 0.00 0 0
2.69/2.75 c linesearchdiving : 0.00 0 0
2.69/2.75 c guideddiving : 0.00 0 0
2.69/2.75 c oneopt : 0.00 2 0
2.69/2.75 c coefdiving : 0.00 1 0
2.69/2.75 c pscostdiving : 0.00 1 0
2.69/2.75 c fracdiving : 0.00 1 0
2.69/2.75 c trivial : 0.00 2 0
2.69/2.75 c simplerounding : 0.00 0 0
2.69/2.75 c zirounding : 0.00 318 0
2.69/2.75 c rounding : 0.01 251 0
2.69/2.75 c shifting : 0.08 56 0
2.69/2.75 c intshifting : 0.00 0 0
2.69/2.75 c twoopt : 0.00 0 0
2.69/2.75 c fixandinfer : 0.00 0 0
2.69/2.75 c feaspump : 0.00 1 0
2.69/2.75 c intdiving : 0.00 0 0
2.69/2.75 c actconsdiving : 0.00 0 0
2.69/2.75 c octane : 0.00 0 0
2.69/2.75 c rens : 0.07 1 0
2.69/2.75 c rins : 0.00 0 0
2.69/2.75 c localbranching : 0.00 0 0
2.69/2.75 c mutation : 0.00 0 0
2.69/2.75 c dins : 0.00 0 0
2.69/2.75 c undercover : 0.00 0 0
2.69/2.75 c nlp : 0.00 0 0
2.69/2.75 c trysol : 0.00 0 0
2.69/2.75 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.75 c primal LP : 0.00 0 0 0.00 -
2.69/2.75 c dual LP : 0.29 463 6053 13.07 20872.41
2.69/2.75 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.75 c barrier LP : 0.00 0 0 0.00 -
2.69/2.75 c diving/probing LP: 0.00 4 37 9.25 -
2.69/2.75 c strong branching : 1.13 1206 20405 16.92 18057.52
2.69/2.75 c (at root node) : - 27 1142 42.30 -
2.69/2.75 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.75 c B&B Tree :
2.69/2.75 c number of runs : 2
2.69/2.75 c nodes : 507
2.69/2.75 c nodes (total) : 508
2.69/2.75 c nodes left : 0
2.69/2.75 c max depth : 20
2.69/2.75 c max depth (total): 20
2.69/2.75 c backtracks : 142 (28.0%)
2.69/2.75 c delayed cutoffs : 101
2.69/2.75 c repropagations : 342 (3050 domain reductions, 71 cutoffs)
2.69/2.75 c avg switch length: 3.39
2.69/2.75 c switching time : 0.04
2.69/2.75 c Solution :
2.69/2.75 c Solutions found : 2 (2 improvements)
2.69/2.75 c First Solution : +1.90000000000000e+01 (in run 1, after 1 nodes, 0.33 seconds, depth 0, found by <trysol>)
2.69/2.75 c Primal Bound : +1.70000000000000e+01 (in run 2, after 26 nodes, 1.14 seconds, depth 13, found by <relaxation>)
2.69/2.75 c Dual Bound : +1.70000000000000e+01
2.69/2.75 c Gap : 0.00 %
2.69/2.75 c Root Dual Bound : +1.50000000000000e+01
2.69/2.75 c Root Iterations : 502
2.69/2.76 c Time complete: 2.76.