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-2666141-1276471279.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 788 impls, 0 clqs
0.00/0.04 c (round 2) 8 del vars, 71 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.04 c (round 3) 13 del vars, 94 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 838 impls, 0 clqs
0.00/0.05 c (round 4) 22 del vars, 161 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.05 c (round 5) 25 del vars, 197 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 962 impls, 0 clqs
0.05/0.07 c (round 6) 25 del vars, 215 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 984 impls, 0 clqs
0.05/0.09 c (round 7) 25 del vars, 217 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 984 impls, 0 clqs
0.09/0.11 c (round 8) 48 del vars, 217 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2166 impls, 0 clqs
0.09/0.11 c (round 9) 48 del vars, 402 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2168 impls, 0 clqs
0.09/0.12 c (round 10) 48 del vars, 405 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2168 impls, 0 clqs
0.09/0.12 c presolving (11 rounds):
0.09/0.12 c 48 deleted vars, 405 deleted constraints, 22 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.12 c 2168 implications, 0 cliques
0.09/0.12 c presolved problem has 152 variables (152 bin, 0 int, 0 impl, 0 cont) and 495 constraints
0.09/0.12 c 495 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.07
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.2
0.09/0.12 c
0.09/0.12 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c conflict/interconss = 0
0.09/0.12 c
0.09/0.12 c # should binary conflicts be preferred?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c conflict/preferbinary = TRUE
0.09/0.12 c
0.09/0.12 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c constraints/agelimit = 1
0.09/0.12 c
0.09/0.12 c # should enforcement of pseudo solution be disabled?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/disableenfops = TRUE
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 = 1799.98
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = 0
0.09/0.12 c
0.09/0.12 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.12 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.12 c lp/pricing = a
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 # 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 # priority of node selection rule <dfs> in standard mode
0.09/0.12 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.12 c nodeselection/dfs/stdpriority = 1000000
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.13 c
0.09/0.17 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.17 c 0.1s| 1 | 0 | 374 | - |1514k| 0 | 134 | 152 | 495 | 152 | 495 | 0 | 0 | 0 | 7.897148e+01 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 583 | - |3197k| 0 | 132 | 152 | 495 | 152 | 524 | 29 | 0 | 0 | 7.974113e+01 | -- | Inf
0.39/0.47 c 0.4s| 1 | 0 | 682 | - |4696k| 0 | 136 | 152 | 495 | 152 | 532 | 37 | 0 | 0 | 8.001405e+01 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 790 | - |6732k| 0 | 136 | 152 | 495 | 152 | 535 | 40 | 0 | 0 | 8.036620e+01 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 851 | - |7231k| 0 | 135 | 152 | 495 | 152 | 537 | 42 | 0 | 0 | 8.043379e+01 | -- | Inf
0.89/0.91 c 0.8s| 1 | 0 | 979 | - |7688k| 0 | 133 | 152 | 495 | 152 | 538 | 43 | 0 | 0 | 8.049045e+01 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 1059 | - |8143k| 0 | 136 | 152 | 495 | 152 | 539 | 44 | 0 | 0 | 8.049997e+01 | -- | Inf
1.09/1.18 c 1.1s| 1 | 0 | 1106 | - |8333k| 0 | 137 | 152 | 495 | 152 | 540 | 45 | 0 | 0 | 8.050800e+01 | -- | Inf
1.29/1.32 c 1.2s| 1 | 0 | 1191 | - |8678k| 0 | 134 | 152 | 495 | 152 | 541 | 46 | 0 | 0 | 8.051321e+01 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 1277 | - |8860k| 0 | 135 | 152 | 495 | 152 | 542 | 47 | 0 | 0 | 8.051622e+01 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 1330 | - |8900k| 0 | 139 | 152 | 495 | 152 | 543 | 48 | 0 | 0 | 8.051954e+01 | -- | Inf
1.69/1.71 c 1.6s| 1 | 0 | 1389 | - |8940k| 0 | 137 | 152 | 495 | 152 | 531 | 49 | 0 | 0 | 8.052508e+01 | -- | Inf
1.79/1.82 c 1.7s| 1 | 0 | 1411 | - |8946k| 0 | 139 | 152 | 495 | 152 | 532 | 50 | 0 | 0 | 8.052573e+01 | -- | Inf
1.89/1.93 c 1.9s| 1 | 0 | 1435 | - |8950k| 0 | 137 | 152 | 495 | 152 | 533 | 51 | 0 | 0 | 8.052724e+01 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 1458 | - |8953k| 0 | 137 | 152 | 495 | 152 | 535 | 53 | 0 | 0 | 8.052826e+01 | -- | Inf
2.09/2.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.09/2.17 c 2.1s| 1 | 0 | 1479 | - |8955k| 0 | 138 | 152 | 495 | 152 | 536 | 54 | 0 | 0 | 8.053123e+01 | -- | Inf
2.19/2.29 c 2.2s| 1 | 0 | 1505 | - |8958k| 0 | 138 | 152 | 495 | 152 | 537 | 55 | 0 | 0 | 8.053267e+01 | -- | Inf
3.29/3.38 c 3.3s| 1 | 2 | 1505 | - |8959k| 0 | 138 | 152 | 495 | 152 | 537 | 55 | 0 | 17 | 8.053267e+01 | -- | Inf
3.29/3.39 o 96
3.29/3.39 c * 3.3s| 33 | 12 | 1505 | 0.0 |8980k| 23 | - | 152 | 501 | 0 | 0 | 55 | 7 | 17 | 8.100000e+01 | 9.600000e+01 | 18.52%
3.29/3.39 o 95
3.29/3.39 c * 3.3s| 60 | 10 | 1505 | 0.0 |8983k| 23 | - | 152 | 502 | 0 | 0 | 55 | 15 | 17 | 8.100000e+01 | 9.500000e+01 | 17.28%
3.39/3.44 o 94
3.39/3.44 c * 3.3s| 224 | 8 | 1505 | 0.0 |8982k| 23 | - | 152 | 503 | 0 | 0 | 55 | 83 | 17 | 8.100000e+01 | 9.400000e+01 | 16.05%
3.39/3.45 o 90
3.39/3.45 c * 3.3s| 266 | 14 | 1505 | 0.0 |8986k| 36 | - | 152 | 496 | 0 | 0 | 55 | 90 | 17 | 8.100000e+01 | 9.000000e+01 | 11.11%
3.49/3.54 c
3.49/3.54 c SCIP Status : problem is solved [optimal solution found]
3.49/3.54 c Solving Time (sec) : 3.39
3.49/3.54 c Solving Nodes : 651
3.49/3.54 c Primal Bound : +9.00000000000000e+01 (4 solutions)
3.49/3.54 c Dual Bound : +9.00000000000000e+01
3.49/3.54 c Gap : 0.00 %
3.49/3.54 s OPTIMUM FOUND
3.49/3.54 v -x200 x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 -x190 -x189 -x188 x187 -x186 x185 -x184 x183 -x182 x181 x180 -x179 -x178
3.49/3.54 v x177 -x176 x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 x157 -x156 x155
3.49/3.54 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 -x145 x144 -x143 -x142 x141 -x140 x139 -x138 x137 -x136 x135 x134 -x133
3.49/3.54 v -x132 x131 -x130 x129 x128 -x127 -x126 x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 -x116 -x115 -x114 x113 -x112 x111 -x110
3.49/3.54 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
3.49/3.54 v -x84 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
3.49/3.54 v x57 -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
3.49/3.54 v -x29 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
3.49/3.54 c SCIP Status : problem is solved [optimal solution found]
3.49/3.54 c Solving Time : 3.39
3.49/3.54 c Original Problem :
3.49/3.54 c Problem name : HOME/instance-2666141-1276471279.opb
3.49/3.54 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.49/3.54 c Constraints : 900 initial, 900 maximal
3.49/3.54 c Presolved Problem :
3.49/3.54 c Problem name : t_HOME/instance-2666141-1276471279.opb
3.49/3.54 c Variables : 152 (152 binary, 0 integer, 0 implicit integer, 0 continuous)
3.49/3.54 c Constraints : 495 initial, 513 maximal
3.49/3.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.49/3.54 c trivial : 0.00 4 0 0 0 0 0 0 0
3.49/3.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.49/3.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.49/3.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.49/3.54 c implics : 0.00 0 3 0 0 0 0 0 0
3.49/3.54 c probing : 0.02 23 0 0 0 0 0 0 0
3.49/3.54 c linear : 0.02 18 0 0 22 0 215 17 0
3.49/3.54 c logicor : 0.03 0 0 0 0 0 190 0 0
3.49/3.54 c root node : - 149 - - 149 - - - -
3.49/3.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.49/3.54 c integral : 0 0 0 1 0 0 0 0 0 2
3.49/3.54 c logicor : 495+ 17 3726 0 4 230 7469 0 0 0
3.49/3.54 c countsols : 0 0 0 0 4 0 0 0 0 0
3.49/3.54 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.49/3.54 c integral : 0.93 0.00 0.00 0.93 0.00
3.49/3.54 c logicor : 0.04 0.00 0.04 0.00 0.00
3.49/3.54 c countsols : 0.00 0.00 0.00 0.00 0.00
3.49/3.54 c Propagators : Time Calls Cutoffs DomReds
3.49/3.54 c vbounds : 0.00 2 0 0
3.49/3.54 c rootredcost : 0.00 4 0 0
3.49/3.54 c pseudoobj : 0.06 3706 113 1938
3.49/3.54 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.49/3.54 c propagation : 0.02 240 236 236 6.0 12 4.1 -
3.49/3.54 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.54 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.54 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.54 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
3.49/3.54 c applied globally : - - - 248 5.9 - - -
3.49/3.54 c applied locally : - - - 0 0.0 - - -
3.49/3.54 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.49/3.54 c cut pool : 0.02 16 - - 325 - (maximal pool size: 2227)
3.49/3.54 c redcost : 0.01 17 0 0 0 0
3.49/3.54 c impliedbounds : 0.00 17 0 0 61 0
3.49/3.54 c intobj : 0.00 0 0 0 0 0
3.49/3.54 c cgmip : 0.00 0 0 0 0 0
3.49/3.54 c gomory : 0.96 17 0 0 974 0
3.49/3.54 c strongcg : 0.87 17 0 0 2214 0
3.49/3.54 c cmir : 0.02 10 0 0 0 0
3.49/3.54 c flowcover : 0.07 10 0 0 0 0
3.49/3.54 c clique : 0.01 17 0 0 11 0
3.49/3.54 c zerohalf : 0.00 0 0 0 0 0
3.49/3.54 c mcf : 0.00 1 0 0 0 0
3.49/3.54 c rapidlearning : 0.00 0 0 0 0 0
3.49/3.54 c Pricers : Time Calls Vars
3.49/3.54 c problem variables: 0.00 0 0
3.49/3.54 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.49/3.54 c relpscost : 0.93 1 0 0 0 0 2
3.49/3.54 c pscost : 0.00 0 0 0 0 0 0
3.49/3.54 c inference : 0.01 394 0 0 0 0 788
3.49/3.54 c mostinf : 0.00 0 0 0 0 0 0
3.49/3.54 c leastinf : 0.00 0 0 0 0 0 0
3.49/3.54 c fullstrong : 0.00 0 0 0 0 0 0
3.49/3.54 c allfullstrong : 0.00 0 0 0 0 0 0
3.49/3.54 c random : 0.00 0 0 0 0 0 0
3.49/3.54 c Primal Heuristics : Time Calls Found
3.49/3.54 c LP solutions : 0.00 - 0
3.49/3.54 c pseudo solutions : 0.00 - 4
3.49/3.54 c oneopt : 0.00 0 0
3.49/3.54 c crossover : 0.00 0 0
3.49/3.54 c trivial : 0.00 2 0
3.49/3.54 c simplerounding : 0.00 0 0
3.49/3.54 c zirounding : 0.00 1 0
3.49/3.54 c rounding : 0.00 17 0
3.49/3.54 c shifting : 0.01 17 0
3.49/3.54 c intshifting : 0.00 0 0
3.49/3.54 c twoopt : 0.00 0 0
3.49/3.54 c fixandinfer : 0.00 0 0
3.49/3.54 c feaspump : 0.00 1 0
3.49/3.54 c coefdiving : 0.00 0 0
3.49/3.54 c pscostdiving : 0.00 0 0
3.49/3.54 c fracdiving : 0.00 0 0
3.49/3.54 c veclendiving : 0.00 0 0
3.49/3.54 c intdiving : 0.00 0 0
3.49/3.54 c actconsdiving : 0.00 0 0
3.49/3.54 c objpscostdiving : 0.00 0 0
3.49/3.54 c rootsoldiving : 0.00 0 0
3.49/3.54 c linesearchdiving : 0.00 0 0
3.49/3.54 c guideddiving : 0.00 0 0
3.49/3.54 c octane : 0.00 0 0
3.49/3.54 c rens : 0.00 0 0
3.49/3.54 c rins : 0.00 0 0
3.49/3.54 c localbranching : 0.00 0 0
3.49/3.54 c mutation : 0.00 0 0
3.49/3.54 c dins : 0.00 0 0
3.49/3.54 c undercover : 0.00 0 0
3.49/3.54 c nlp : 0.00 0 0
3.49/3.54 c trysol : 0.00 0 0
3.49/3.54 c LP : Time Calls Iterations Iter/call Iter/sec
3.49/3.54 c primal LP : 0.00 0 0 0.00 -
3.49/3.54 c dual LP : 0.28 17 1505 88.53 5375.00
3.49/3.54 c lex dual LP : 0.00 0 0 0.00 -
3.49/3.54 c barrier LP : 0.00 0 0 0.00 -
3.49/3.54 c diving/probing LP: 0.00 0 0 0.00 -
3.49/3.54 c strong branching : 0.93 17 5811 341.82 6248.39
3.49/3.54 c (at root node) : - 17 5811 341.82 -
3.49/3.54 c conflict analysis: 0.00 0 0 0.00 -
3.49/3.54 c B&B Tree :
3.49/3.54 c number of runs : 1
3.49/3.54 c nodes : 651
3.49/3.54 c nodes (total) : 651
3.49/3.54 c nodes left : 0
3.49/3.54 c max depth : 36
3.49/3.54 c max depth (total): 36
3.49/3.54 c backtracks : 161 (24.7%)
3.49/3.54 c delayed cutoffs : 123
3.49/3.54 c repropagations : 388 (3453 domain reductions, 87 cutoffs)
3.49/3.54 c avg switch length: 2.66
3.49/3.54 c switching time : 0.01
3.49/3.54 c Solution :
3.49/3.54 c Solutions found : 4 (4 improvements)
3.49/3.54 c First Solution : +9.60000000000000e+01 (in run 1, after 33 nodes, 3.27 seconds, depth 23, found by <relaxation>)
3.49/3.54 c Primal Bound : +9.00000000000000e+01 (in run 1, after 266 nodes, 3.31 seconds, depth 36, found by <relaxation>)
3.49/3.54 c Dual Bound : +9.00000000000000e+01
3.49/3.54 c Gap : 0.00 %
3.49/3.54 c Root Dual Bound : +8.05326730053882e+01
3.49/3.54 c Root Iterations : 1505
3.49/3.56 c Time complete: 3.55.