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-2704372-1278553923.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.07 c (round 1) 0 del vars, 24 del conss, 0 chg bounds, 24 chg sides, 0 chg coeffs, 876 upgd conss, 680 impls, 0 clqs
0.09/0.10 c (round 2) 2 del vars, 24 del conss, 0 chg bounds, 24 chg sides, 0 chg coeffs, 876 upgd conss, 2006 impls, 0 clqs
0.09/0.10 c (round 3) 2 del vars, 51 del conss, 0 chg bounds, 24 chg sides, 0 chg coeffs, 876 upgd conss, 2006 impls, 0 clqs
0.09/0.11 c presolving (4 rounds):
0.09/0.11 c 2 deleted vars, 51 deleted constraints, 0 tightened bounds, 0 added holes, 24 changed sides, 0 changed coefficients
0.09/0.11 c 2006 implications, 0 cliques
0.09/0.11 c presolved problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 849 constraints
0.09/0.11 c 157 constraints of type <setppc>
0.09/0.11 c 692 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.08
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 = 1789.98
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 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.19/0.28 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.28 c 0.3s| 1 | 0 | 1084 | - |1756k| 0 | 178 | 198 | 849 | 198 | 849 | 0 | 0 | 0 | 6.859930e+01 | -- | Inf
1.20/1.22 o 93
1.20/1.22 c y 1.2s| 1 | 0 | 2643 | - |4071k| 0 | 178 | 198 | 849 | 198 | 849 | 0 | 0 | 0 | 6.859930e+01 | 9.300000e+01 | 35.57%
1.20/1.28 c 1.3s| 1 | 0 | 2794 | - |3963k| 0 | - | 198 | 872 | 198 | 849 | 0 | 0 | 0 | 9.300000e+01 | 9.300000e+01 | 0.00%
1.20/1.28 c 1.3s| 1 | 0 | 2794 | - |3963k| 0 | - | 198 | 872 | 198 | 849 | 0 | 0 | 0 | 9.300000e+01 | 9.300000e+01 | 0.00%
1.20/1.28 c
1.20/1.28 c SCIP Status : problem is solved [optimal solution found]
1.20/1.28 c Solving Time (sec) : 1.25
1.20/1.28 c Solving Nodes : 1
1.20/1.28 c Primal Bound : +9.30000000000000e+01 (1 solutions)
1.20/1.28 c Dual Bound : +9.30000000000000e+01
1.20/1.28 c Gap : 0.00 %
1.20/1.28 s OPTIMUM FOUND
1.20/1.28 v -x200 -x199 -x198 x197 -x196 x195 x194 -x193 -x192 x191 -x190 x189 -x188 x187 x186 -x185 -x184 x183 -x182 x181 x180 -x179 -x178
1.20/1.28 v x177 x176 -x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 x162 -x161 -x160 x159 -x158 x157 x156 -x155
1.20/1.28 v -x154 x153 x152 -x151 -x150 x149 x148 -x147 -x146 x145 x144 -x143 x142 -x141 -x140 x139 -x138 x137 x136 -x135 -x134 -x133 -x132
1.20/1.28 v x131 x130 -x129 -x128 x127 -x126 x125 -x124 -x123 x122 -x121 -x120 x119 -x118 x117 x116 -x115 x114 -x113 x112 -x111 x110
1.20/1.28 v -x109 -x108 x107 -x106 x105 x104 -x103 x102 -x101 -x100 x99 -x98 x97 x96 -x95 -x94 x93 x92 -x91 -x90 x89 -x88 x87 -x86 x85 -x84
1.20/1.28 v x83 x82 -x81 x80 -x79 -x78 x77 -x76 x75 x74 -x73 x72 -x71 -x70 x69 -x68 x67 -x66 -x65 x64 -x63 x62 -x61 -x60 x59 -x58 x57
1.20/1.28 v -x56 x55 -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
1.20/1.28 v -x28 x27 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
1.20/1.28 c SCIP Status : problem is solved [optimal solution found]
1.20/1.28 c Solving Time : 1.25
1.20/1.28 c Original Problem :
1.20/1.28 c Problem name : HOME/instance-2704372-1278553923.opb
1.20/1.28 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.28 c Constraints : 900 initial, 900 maximal
1.20/1.28 c Presolved Problem :
1.20/1.28 c Problem name : t_HOME/instance-2704372-1278553923.opb
1.20/1.28 c Variables : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.28 c Constraints : 849 initial, 872 maximal
1.20/1.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.20/1.28 c trivial : 0.00 0 0 0 0 0 0 0 0
1.20/1.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.20/1.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.20/1.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.20/1.28 c implics : 0.00 0 0 0 0 0 0 0 0
1.20/1.28 c probing : 0.02 2 0 0 0 0 0 0 0
1.20/1.28 c setppc : 0.00 0 0 0 0 0 3 0 0
1.20/1.28 c linear : 0.03 0 0 0 0 0 24 24 0
1.20/1.28 c logicor : 0.03 0 0 0 0 0 24 0 0
1.20/1.28 c root node : - 103 - - 103 - - - -
1.20/1.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.20/1.28 c integral : 0 0 0 0 0 0 0 0 0 0
1.20/1.28 c setppc : 157 1 595 0 0 1 0 0 0 0
1.20/1.28 c linear : 0+ 0 0 0 0 0 0 0 0 0
1.20/1.28 c logicor : 692 1 510 0 0 0 0 0 0 0
1.20/1.28 c countsols : 0 0 0 0 0 0 0 0 0 0
1.20/1.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.20/1.28 c integral : 0.00 0.00 0.00 0.00 0.00
1.20/1.28 c setppc : 0.00 0.00 0.00 0.00 0.00
1.20/1.28 c linear : 0.00 0.00 0.00 0.00 0.00
1.20/1.28 c logicor : 0.01 0.00 0.01 0.00 0.00
1.20/1.28 c countsols : 0.00 0.00 0.00 0.00 0.00
1.20/1.28 c Propagators : Time Calls Cutoffs DomReds
1.20/1.28 c vbounds : 0.00 2 0 0
1.20/1.28 c rootredcost : 0.00 0 0 0
1.20/1.28 c pseudoobj : 0.00 3 1 0
1.20/1.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.20/1.28 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.20/1.28 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.20/1.28 c applied globally : - - - 0 0.0 - - -
1.20/1.28 c applied locally : - - - 0 0.0 - - -
1.20/1.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.20/1.28 c cut pool : 0.00 0 - - 0 - (maximal pool size: 616)
1.20/1.28 c redcost : 0.00 1 0 0 0 0
1.20/1.28 c impliedbounds : 0.00 1 0 0 223 0
1.20/1.28 c intobj : 0.00 0 0 0 0 0
1.20/1.28 c cgmip : 0.00 0 0 0 0 0
1.20/1.28 c gomory : 0.10 1 0 0 0 0
1.20/1.28 c strongcg : 0.08 1 0 0 500 0
1.20/1.28 c cmir : 0.01 1 0 0 0 0
1.20/1.28 c flowcover : 0.01 1 0 0 0 0
1.20/1.28 c clique : 0.00 1 0 0 7 0
1.20/1.28 c zerohalf : 0.00 0 0 0 0 0
1.20/1.28 c mcf : 0.00 1 0 0 0 0
1.20/1.28 c rapidlearning : 0.25 1 0 103 0 23
1.20/1.28 c Pricers : Time Calls Vars
1.20/1.28 c problem variables: 0.00 0 0
1.20/1.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.20/1.28 c pscost : 0.00 0 0 0 0 0 0
1.20/1.28 c inference : 0.00 0 0 0 0 0 0
1.20/1.28 c mostinf : 0.00 0 0 0 0 0 0
1.20/1.28 c leastinf : 0.00 0 0 0 0 0 0
1.20/1.28 c fullstrong : 0.00 0 0 0 0 0 0
1.20/1.28 c allfullstrong : 0.00 0 0 0 0 0 0
1.20/1.28 c random : 0.00 0 0 0 0 0 0
1.20/1.28 c relpscost : 0.00 0 0 0 0 0 0
1.20/1.28 c Primal Heuristics : Time Calls Found
1.20/1.28 c LP solutions : 0.00 - 0
1.20/1.28 c pseudo solutions : 0.00 - 0
1.20/1.28 c oneopt : 0.00 0 0
1.20/1.28 c trivial : 0.00 2 0
1.20/1.28 c simplerounding : 0.00 0 0
1.20/1.28 c zirounding : 0.00 0 0
1.20/1.28 c rounding : 0.00 1 0
1.20/1.28 c shifting : 0.00 1 0
1.20/1.28 c intshifting : 0.00 0 0
1.20/1.28 c twoopt : 0.00 0 0
1.20/1.28 c fixandinfer : 0.00 0 0
1.20/1.28 c feaspump : 0.51 1 0
1.20/1.28 c coefdiving : 0.00 0 0
1.20/1.28 c pscostdiving : 0.00 0 0
1.20/1.28 c fracdiving : 0.00 0 0
1.20/1.28 c veclendiving : 0.00 0 0
1.20/1.28 c intdiving : 0.00 0 0
1.20/1.28 c actconsdiving : 0.00 0 0
1.20/1.28 c objpscostdiving : 0.00 0 0
1.20/1.28 c rootsoldiving : 0.00 0 0
1.20/1.28 c linesearchdiving : 0.00 0 0
1.20/1.28 c guideddiving : 0.00 0 0
1.20/1.28 c octane : 0.00 0 0
1.20/1.28 c rens : 0.00 0 0
1.20/1.28 c rins : 0.00 0 0
1.20/1.28 c localbranching : 0.00 0 0
1.20/1.28 c mutation : 0.00 0 0
1.20/1.28 c crossover : 0.00 0 0
1.20/1.28 c dins : 0.00 0 0
1.20/1.28 c undercover : 0.00 0 0
1.20/1.28 c nlp : 0.00 0 0
1.20/1.28 c trysol : 0.00 0 0
1.20/1.28 c LP : Time Calls Iterations Iter/call Iter/sec
1.20/1.28 c primal LP : 0.00 0 0 0.00 -
1.20/1.28 c dual LP : 0.21 2 1235 617.50 5995.26
1.20/1.28 c lex dual LP : 0.00 0 0 0.00 -
1.20/1.28 c barrier LP : 0.00 0 0 0.00 -
1.20/1.28 c diving/probing LP: 0.50 33 1559 47.24 3099.45
1.20/1.28 c strong branching : 0.00 0 0 0.00 -
1.20/1.28 c (at root node) : - 0 0 0.00 -
1.20/1.28 c conflict analysis: 0.00 0 0 0.00 -
1.20/1.28 c B&B Tree :
1.20/1.28 c number of runs : 1
1.20/1.28 c nodes : 1
1.20/1.28 c nodes (total) : 1
1.20/1.28 c nodes left : 0
1.20/1.28 c max depth : 0
1.20/1.28 c max depth (total): 0
1.20/1.28 c backtracks : 0 (0.0%)
1.20/1.28 c delayed cutoffs : 0
1.20/1.28 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.20/1.28 c avg switch length: 2.00
1.20/1.28 c switching time : 0.00
1.20/1.28 c Solution :
1.20/1.28 c Solutions found : 1 (1 improvements)
1.20/1.28 c First Solution : +9.30000000000000e+01 (in run 1, after 1 nodes, 1.20 seconds, depth 0, found by <trysol>)
1.20/1.28 c Primal Bound : +9.30000000000000e+01 (in run 1, after 1 nodes, 1.20 seconds, depth 0, found by <trysol>)
1.20/1.28 c Dual Bound : +9.30000000000000e+01
1.20/1.28 c Gap : 0.00 %
1.20/1.28 c Root Dual Bound : +9.30000000000000e+01
1.20/1.28 c Root Iterations : 2794
1.20/1.29 c Time complete: 1.28.