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-2703066-1278564438.opb>
0.00/0.01 c original problem has 616 variables (616 bin, 0 int, 0 impl, 0 cont) and 463 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.03/0.05 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 0 upgd conss, 2548 impls, 0 clqs
0.03/0.06 c (round 2) 23 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 3892 impls, 0 clqs
0.03/0.06 c (round 3) 39 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 8 upgd conss, 5012 impls, 0 clqs
0.03/0.06 c (round 4) 55 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 8 upgd conss, 5908 impls, 0 clqs
0.03/0.07 c (round 5) 71 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 104 chg coeffs, 8 upgd conss, 6580 impls, 0 clqs
0.03/0.07 c (round 6) 87 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 118 chg coeffs, 8 upgd conss, 7028 impls, 0 clqs
0.03/0.07 c (round 7) 103 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 132 chg coeffs, 8 upgd conss, 7252 impls, 0 clqs
0.03/0.07 c (round 8) 119 del vars, 98 del conss, 0 chg bounds, 0 chg sides, 146 chg coeffs, 8 upgd conss, 7252 impls, 0 clqs
0.09/0.10 c (0.1s) probing: 193/497 (38.8%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.09/0.10 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.10 c presolving (9 rounds):
0.09/0.10 c 119 deleted vars, 98 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 146 changed coefficients
0.09/0.10 c 7280 implications, 0 cliques
0.09/0.10 c presolved problem has 497 variables (497 bin, 0 int, 0 impl, 0 cont) and 358 constraints
0.09/0.10 c 343 constraints of type <and>
0.09/0.10 c 7 constraints of type <linear>
0.09/0.10 c 8 constraints of type <logicor>
0.09/0.10 c transformed objective value is always integral (scale: 2)
0.09/0.10 c Presolving Time: 0.08
0.09/0.10 c - non default parameters ----------------------------------------------------------------------
0.09/0.10 c # SCIP version 1.2.1.3
0.09/0.10 c
0.09/0.10 c # frequency for displaying node information lines
0.09/0.10 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.10 c display/freq = 10000
0.09/0.10 c
0.09/0.10 c # maximal time in seconds to run
0.09/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10 c limits/time = 1790
0.09/0.10 c
0.09/0.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10 c limits/memory = 1620
0.09/0.10 c
0.09/0.10 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.10 c # [type: int, range: [1,2], default: 1]
0.09/0.10 c timing/clocktype = 2
0.09/0.10 c
0.09/0.10 c # should presolving try to simplify inequalities
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/linear/simplifyinequalities = TRUE
0.09/0.10 c
0.09/0.10 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/indicator/addCouplingCons = TRUE
0.09/0.10 c
0.09/0.10 c # should presolving try to simplify knapsacks
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.10 c
0.09/0.10 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10 c heuristics/undercover/freq = 0
0.09/0.10 c
0.09/0.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10 c separating/rapidlearning/freq = 0
0.09/0.10 c
0.09/0.10 c -----------------------------------------------------------------------------------------------
0.09/0.10 c start solving
0.09/0.10 c
0.09/0.10 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.10 c 0.1s| 1 | 0 | 18 | - |2338k| 0 | 10 | 497 | 358 | 497 | 701 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 478 | - |2371k| 0 | 15 | 497 | 358 | 497 | 703 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.88 c 0.9s| 1 | 0 | 486 | - |2388k| 0 | 21 | 497 | 358 | 497 | 708 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 494 | - |2409k| 0 | 28 | 497 | 358 | 497 | 712 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 502 | - |2425k| 0 | 30 | 497 | 358 | 497 | 717 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.03 c 1.0s| 1 | 0 | 509 | - |2452k| 0 | 30 | 497 | 358 | 497 | 721 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 514 | - |2473k| 0 | 34 | 497 | 358 | 497 | 726 | 25 | 0 | 0 | 3.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 2 | 514 | - |2473k| 0 | 34 | 497 | 358 | 497 | 726 | 25 | 0 | 16 | 3.000000e+00 | -- | Inf
4.69/4.71 o 139
4.69/4.71 c * 4.7s| 1274 | 698 | 6494 | 4.7 |3588k| 72 | - | 497 | 897 | 497 | 154 |2757 | 543 |2519 | 3.000000e+00 | 1.390000e+02 |4533.33%
4.99/5.04 o 3
4.99/5.04 c * 5.0s| 1450 | 0 | 7340 | 4.7 |2970k| 72 | - | 497 | 969 | 497 | 103 |3220 | 615 |2683 | 3.000000e+00 | 3.000000e+00 | 0.00%
4.99/5.04 c
4.99/5.04 c SCIP Status : problem is solved [optimal solution found]
4.99/5.04 c Solving Time (sec) : 5.03
4.99/5.04 c Solving Nodes : 1450
4.99/5.04 c Primal Bound : +3.00000000000000e+00 (2 solutions)
4.99/5.04 c Dual Bound : +3.00000000000000e+00
4.99/5.04 c Gap : 0.00 %
4.99/5.04 s OPTIMUM FOUND
4.99/5.04 v -x168 -x167 -x166 x165 x164 -x163 x162 -x161 -x160 -x159 x158 -x157 -x156 -x155 -x154 x153 x112 x111 -x110 -x109 -x108 x107 -x106
4.99/5.04 v x105 -x152 x151 x150 -x149 -x148 x147 -x146 x145 -x104 x103 -x102 -x101 -x100 -x99 -x98 x97 -x144 -x143 -x142 -x141 -x140
4.99/5.04 v -x139 -x138 x137 x96 -x95 x94 -x93 -x92 -x91 -x90 x89 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 x88 -x87 -x86 -x85 x84
4.99/5.04 v -x83 x82 x81 -x128 -x127 -x126 -x125 -x124 -x123 x122 -x121 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x120 -x119 -x118 -x117 -x116
4.99/5.04 v -x115 -x114 -x113 -x72 -x71 -x70 -x69 x68 -x67 -x66 x65 -x64 -x63 x62 -x61 -x60 -x59 x58 x57 x56 -x55 -x54 -x53 -x52 x51
4.99/5.04 v -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 x25 -x24
4.99/5.04 v -x23 x22 x21 x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
4.99/5.04 c SCIP Status : problem is solved [optimal solution found]
4.99/5.04 c Solving Time : 5.03
4.99/5.04 c Original Problem :
4.99/5.04 c Problem name : HOME/instance-2703066-1278564438.opb
4.99/5.04 c Variables : 616 (616 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.04 c Constraints : 463 initial, 463 maximal
4.99/5.04 c Presolved Problem :
4.99/5.04 c Problem name : t_HOME/instance-2703066-1278564438.opb
4.99/5.04 c Variables : 497 (497 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.04 c Constraints : 358 initial, 969 maximal
4.99/5.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.99/5.04 c trivial : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c implics : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c probing : 0.02 0 0 0 0 0 0 0 0
4.99/5.04 c and : 0.04 14 98 0 0 0 98 0 98
4.99/5.04 c linear : 0.01 1 6 0 0 0 0 0 48
4.99/5.04 c logicor : 0.00 0 0 0 0 0 0 0 0
4.99/5.04 c root node : - 0 - - 0 - - - -
4.99/5.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.99/5.04 c integral : 0 0 0 1254 0 1 52 0 0 2416
4.99/5.04 c and : 343 2585 4909 1 0 57 7328 3200 0 0
4.99/5.04 c linear : 7 6 4851 1 0 314 2798 0 0 0
4.99/5.04 c logicor : 8+ 6 1313 2 0 4 354 0 0 0
4.99/5.04 c countsols : 0 0 0 2 0 0 0 0 0 0
4.99/5.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.99/5.04 c integral : 1.75 0.00 0.00 1.75 0.00
4.99/5.04 c and : 0.20 0.14 0.06 0.00 0.00
4.99/5.04 c linear : 0.20 0.00 0.20 0.00 0.00
4.99/5.04 c logicor : 0.01 0.00 0.01 0.00 0.00
4.99/5.04 c countsols : 0.00 0.00 0.00 0.00 0.00
4.99/5.04 c Propagators : Time Calls Cutoffs DomReds
4.99/5.04 c vbounds : 0.00 2 0 0
4.99/5.04 c rootredcost : 0.00 1 0 0
4.99/5.04 c pseudoobj : 0.01 4512 0 10
4.99/5.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.99/5.04 c propagation : 0.13 375 374 5624 54.1 39 26.4 -
4.99/5.04 c infeasible LP : 0.00 2 2 12 28.4 2 12.0 0
4.99/5.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.99/5.04 c applied globally : - - - 611 24.4 - - -
4.99/5.04 c applied locally : - - - 4 51.5 - - -
4.99/5.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.99/5.04 c cut pool : 0.00 5 - - 7 - (maximal pool size: 53)
4.99/5.04 c redcost : 0.04 2588 0 2 0 0
4.99/5.04 c impliedbounds : 0.00 6 0 0 4 0
4.99/5.04 c intobj : 0.00 0 0 0 0 0
4.99/5.04 c cgmip : 0.00 0 0 0 0 0
4.99/5.04 c gomory : 0.04 6 0 0 0 0
4.99/5.04 c strongcg : 0.03 6 0 0 9 0
4.99/5.04 c cmir : 0.03 6 0 0 22 0
4.99/5.04 c flowcover : 0.11 6 0 0 31 0
4.99/5.04 c clique : 0.00 1 0 0 0 0
4.99/5.04 c zerohalf : 0.00 0 0 0 0 0
4.99/5.04 c mcf : 0.00 1 0 0 0 0
4.99/5.04 c rapidlearning : 0.08 1 0 0 0 0
4.99/5.04 c Pricers : Time Calls Vars
4.99/5.04 c problem variables: 0.00 0 0
4.99/5.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.99/5.04 c relpscost : 1.75 1252 1 52 0 0 2416
4.99/5.04 c pscost : 0.00 0 0 0 0 0 0
4.99/5.04 c inference : 0.00 0 0 0 0 0 0
4.99/5.04 c mostinf : 0.00 0 0 0 0 0 0
4.99/5.04 c leastinf : 0.00 0 0 0 0 0 0
4.99/5.04 c fullstrong : 0.00 0 0 0 0 0 0
4.99/5.04 c allfullstrong : 0.00 0 0 0 0 0 0
4.99/5.04 c random : 0.00 0 0 0 0 0 0
4.99/5.04 c Primal Heuristics : Time Calls Found
4.99/5.04 c LP solutions : 0.00 - 2
4.99/5.04 c pseudo solutions : 0.00 - 0
4.99/5.04 c crossover : 0.00 0 0
4.99/5.04 c intshifting : 0.00 0 0
4.99/5.04 c oneopt : 0.00 1 0
4.99/5.04 c linesearchdiving : 0.01 1 0
4.99/5.04 c guideddiving : 0.00 1 0
4.99/5.04 c feaspump : 0.02 1 0
4.99/5.04 c objpscostdiving : 0.00 1 0
4.99/5.04 c rootsoldiving : 0.01 1 0
4.99/5.04 c coefdiving : 0.02 2 0
4.99/5.04 c pscostdiving : 0.01 2 0
4.99/5.04 c fracdiving : 0.01 2 0
4.99/5.04 c veclendiving : 0.01 2 0
4.99/5.04 c trivial : 0.00 2 0
4.99/5.04 c simplerounding : 0.00 0 0
4.99/5.04 c zirounding : 0.01 1000 0
4.99/5.04 c rounding : 0.02 681 0
4.99/5.04 c shifting : 0.38 201 0
4.99/5.04 c twoopt : 0.00 0 0
4.99/5.04 c fixandinfer : 0.00 0 0
4.99/5.04 c intdiving : 0.00 0 0
4.99/5.04 c actconsdiving : 0.00 0 0
4.99/5.04 c octane : 0.00 0 0
4.99/5.04 c rens : 0.02 1 0
4.99/5.04 c rins : 0.00 0 0
4.99/5.04 c localbranching : 0.00 0 0
4.99/5.04 c mutation : 0.00 0 0
4.99/5.04 c dins : 0.00 0 0
4.99/5.04 c undercover : 0.63 1 0
4.99/5.04 c nlp : 0.00 0 0
4.99/5.04 c trysol : 0.00 0 0
4.99/5.04 c LP : Time Calls Iterations Iter/call Iter/sec
4.99/5.04 c primal LP : 0.03 0 0 0.00 0.00
4.99/5.04 c dual LP : 0.79 2657 6527 2.46 8220.57
4.99/5.04 c lex dual LP : 0.00 0 0 0.00 -
4.99/5.04 c barrier LP : 0.00 0 0 0.00 -
4.99/5.04 c diving/probing LP: 0.06 158 813 5.15 14517.86
4.99/5.04 c strong branching : 1.73 2683 15223 5.67 8820.01
4.99/5.04 c (at root node) : - 16 698 43.62 -
4.99/5.04 c conflict analysis: 0.00 0 0 0.00 -
4.99/5.04 c B&B Tree :
4.99/5.04 c number of runs : 1
4.99/5.04 c nodes : 1450
4.99/5.04 c nodes (total) : 1450
4.99/5.04 c nodes left : 0
4.99/5.04 c max depth : 72
4.99/5.04 c max depth (total): 72
4.99/5.04 c backtracks : 150 (10.3%)
4.99/5.04 c delayed cutoffs : 129
4.99/5.04 c repropagations : 424 (1555 domain reductions, 112 cutoffs)
4.99/5.04 c avg switch length: 3.31
4.99/5.04 c switching time : 0.10
4.99/5.04 c Solution :
4.99/5.04 c Solutions found : 2 (2 improvements)
4.99/5.04 c First Solution : +1.39000000000000e+02 (in run 1, after 1274 nodes, 4.69 seconds, depth 64, found by <relaxation>)
4.99/5.04 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1450 nodes, 5.02 seconds, depth 58, found by <relaxation>)
4.99/5.04 c Dual Bound : +3.00000000000000e+00
4.99/5.04 c Gap : 0.00 %
4.99/5.04 c Root Dual Bound : +3.00000000000000e+00
4.99/5.04 c Root Iterations : 514
4.99/5.05 c Time complete: 5.04.