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-2666100-1276447997.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) 3 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 782 impls, 0 clqs
0.00/0.04 c (round 2) 9 del vars, 52 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.05 c (round 3) 13 del vars, 68 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 4) 17 del vars, 103 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 5) 18 del vars, 127 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.05 c (round 6) 20 del vars, 143 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.05 c (round 7) 20 del vars, 145 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.06/0.07 c (round 8) 20 del vars, 165 del conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.09/0.10 c (round 9) 20 del vars, 167 del conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 872 impls, 0 clqs
0.09/0.13 c (round 10) 42 del vars, 167 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4299 impls, 0 clqs
0.09/0.13 c (round 11) 42 del vars, 316 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4391 impls, 0 clqs
0.09/0.15 c (round 12) 42 del vars, 321 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4391 impls, 0 clqs
0.09/0.15 c presolving (13 rounds):
0.09/0.15 c 42 deleted vars, 321 deleted constraints, 15 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.09/0.15 c 4391 implications, 0 cliques
0.09/0.15 c presolved problem has 158 variables (158 bin, 0 int, 0 impl, 0 cont) and 579 constraints
0.09/0.15 c 579 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.09
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c conflict/interconss = 0
0.09/0.15 c
0.09/0.15 c # should binary conflicts be preferred?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c conflict/preferbinary = TRUE
0.09/0.15 c
0.09/0.15 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c constraints/agelimit = 1
0.09/0.15 c
0.09/0.15 c # should enforcement of pseudo solution be disabled?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/disableenfops = TRUE
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.98
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = 0
0.09/0.15 c
0.09/0.15 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.15 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.15 c lp/pricing = a
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # priority of node selection rule <dfs> in standard mode
0.09/0.15 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.15 c nodeselection/dfs/stdpriority = 1000000
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.19/0.21 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.21 c 0.1s| 1 | 0 | 430 | - |1623k| 0 | 140 | 158 | 579 | 158 | 578 | 0 | 0 | 0 | 7.739583e+01 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 629 | - |2674k| 0 | 137 | 158 | 579 | 158 | 657 | 79 | 0 | 0 | 7.944098e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 717 | - |4482k| 0 | 140 | 158 | 579 | 158 | 671 | 93 | 0 | 0 | 7.970252e+01 | -- | Inf
0.69/0.71 c 0.6s| 1 | 0 | 820 | - |6094k| 0 | 139 | 158 | 579 | 158 | 681 | 103 | 0 | 0 | 7.986337e+01 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 879 | - |6800k| 0 | 139 | 158 | 579 | 158 | 688 | 110 | 0 | 0 | 7.991218e+01 | -- | Inf
1.00/1.04 c 1.0s| 1 | 0 | 950 | - |6997k| 0 | 144 | 158 | 579 | 158 | 692 | 114 | 0 | 0 | 8.000235e+01 | -- | Inf
1.19/1.22 c 1.1s| 1 | 0 | 1012 | - |7583k| 0 | 143 | 158 | 579 | 158 | 698 | 120 | 0 | 0 | 8.009619e+01 | -- | Inf
1.39/1.40 c 1.3s| 1 | 0 | 1132 | - |7772k| 0 | 141 | 158 | 579 | 158 | 700 | 122 | 0 | 0 | 8.016700e+01 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 1198 | - |8425k| 0 | 140 | 158 | 579 | 158 | 703 | 125 | 0 | 0 | 8.020385e+01 | -- | Inf
1.69/1.78 c 1.7s| 1 | 0 | 1274 | - |9159k| 0 | 143 | 158 | 579 | 158 | 704 | 126 | 0 | 0 | 8.024714e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 1329 | - |9876k| 0 | 146 | 158 | 579 | 158 | 706 | 128 | 0 | 0 | 8.026947e+01 | -- | Inf
2.10/2.16 c 2.1s| 1 | 0 | 1385 | - | 10M| 0 | 144 | 158 | 579 | 158 | 644 | 129 | 0 | 0 | 8.029289e+01 | -- | Inf
2.29/2.32 c 2.2s| 1 | 0 | 1411 | - | 11M| 0 | 145 | 158 | 579 | 158 | 646 | 131 | 0 | 0 | 8.029933e+01 | -- | Inf
2.49/2.51 c 2.4s| 1 | 0 | 1470 | - | 12M| 0 | 143 | 158 | 579 | 158 | 647 | 132 | 0 | 0 | 8.031548e+01 | -- | Inf
2.59/2.70 c 2.6s| 1 | 0 | 1527 | - | 13M| 0 | 142 | 158 | 579 | 158 | 648 | 133 | 0 | 0 | 8.032657e+01 | -- | Inf
2.80/2.85 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.80/2.85 c 2.7s| 1 | 0 | 1579 | - | 13M| 0 | 143 | 158 | 579 | 158 | 649 | 134 | 0 | 0 | 8.033461e+01 | -- | Inf
2.99/3.02 c 2.9s| 1 | 0 | 1660 | - | 13M| 0 | 145 | 158 | 579 | 158 | 650 | 135 | 0 | 0 | 8.033873e+01 | -- | Inf
3.09/3.19 c 3.1s| 1 | 0 | 1680 | - | 13M| 0 | 144 | 158 | 579 | 158 | 626 | 136 | 0 | 0 | 8.034000e+01 | -- | Inf
3.30/3.34 c 3.2s| 1 | 0 | 1704 | - | 13M| 0 | 145 | 158 | 579 | 158 | 627 | 137 | 0 | 0 | 8.034208e+01 | -- | Inf
3.39/3.50 c 3.4s| 1 | 0 | 1717 | - | 13M| 0 | 145 | 158 | 579 | 158 | 629 | 139 | 0 | 0 | 8.034220e+01 | -- | Inf
5.09/5.14 c 5.0s| 1 | 2 | 1717 | - | 13M| 0 | 145 | 158 | 579 | 158 | 629 | 139 | 0 | 17 | 8.034220e+01 | -- | Inf
5.09/5.16 o 95
5.09/5.16 c * 5.0s| 50 | 4 | 1717 | 0.0 | 13M| 14 | - | 158 | 532 | 0 | 0 | 139 | 19 | 17 | 9.340000e+01 | 9.500000e+01 | 1.71%
5.09/5.16 o 94
5.09/5.16 c * 5.0s| 72 | 0 | 1717 | 0.0 | 13M| 14 | - | 158 | 450 | 0 | 0 | 139 | 30 | 17 | 9.400000e+01 | 9.400000e+01 | 0.00%
5.09/5.16 c
5.09/5.16 c SCIP Status : problem is solved [optimal solution found]
5.09/5.16 c Solving Time (sec) : 5.00
5.09/5.16 c Solving Nodes : 72
5.09/5.16 c Primal Bound : +9.40000000000000e+01 (2 solutions)
5.09/5.16 c Dual Bound : +9.40000000000000e+01
5.09/5.16 c Gap : 0.00 %
5.09/5.17 s OPTIMUM FOUND
5.09/5.17 v x200 -x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 x190 -x189 x188 -x187 -x186 x185 -x184 x183 -x182 x181 -x180 x179 -x178
5.09/5.17 v x177 x176 -x175 -x174 x173 -x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 -x162 x161 x160 -x159 -x158 -x157 -x156 x155
5.09/5.17 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 -x146 x145 -x144 -x143 -x142 x141 x140 -x139 -x138 x137 -x136 -x135 x134 -x133
5.09/5.17 v -x132 x131 -x130 x129 -x128 x127 -x126 x125 x124 -x123 x122 -x121 -x120 x119 x118 -x117 -x116 x115 x114 -x113 x112 -x111 -x110
5.09/5.17 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
5.09/5.17 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 -x57
5.09/5.17 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
5.09/5.17 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
5.09/5.17 c SCIP Status : problem is solved [optimal solution found]
5.09/5.17 c Solving Time : 5.00
5.09/5.17 c Original Problem :
5.09/5.17 c Problem name : HOME/instance-2666100-1276447997.opb
5.09/5.17 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
5.09/5.17 c Constraints : 900 initial, 900 maximal
5.09/5.17 c Presolved Problem :
5.09/5.17 c Problem name : t_HOME/instance-2666100-1276447997.opb
5.09/5.17 c Variables : 158 (158 binary, 0 integer, 0 implicit integer, 0 continuous)
5.09/5.17 c Constraints : 579 initial, 585 maximal
5.09/5.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.09/5.17 c trivial : 0.00 4 0 0 0 0 0 0 0
5.09/5.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.09/5.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.09/5.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.09/5.17 c implics : 0.00 0 6 0 0 0 0 0 0
5.09/5.17 c probing : 0.03 21 1 0 1 0 0 0 0
5.09/5.17 c linear : 0.02 10 0 0 14 0 165 20 0
5.09/5.17 c logicor : 0.03 0 0 0 0 0 156 0 0
5.09/5.17 c root node : - 108 - - 108 - - - -
5.09/5.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.09/5.17 c integral : 0 0 0 1 0 0 0 0 0 2
5.09/5.17 c logicor : 579+ 20 1413 0 2 39 1150 0 0 0
5.09/5.17 c countsols : 0 0 0 0 2 0 0 0 0 0
5.09/5.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.09/5.17 c integral : 1.44 0.00 0.00 1.44 0.00
5.09/5.17 c logicor : 0.02 0.01 0.01 0.00 0.00
5.09/5.17 c countsols : 0.00 0.00 0.00 0.00 0.00
5.09/5.17 c Propagators : Time Calls Cutoffs DomReds
5.09/5.17 c vbounds : 0.00 2 0 0
5.09/5.17 c rootredcost : 0.00 1 0 0
5.09/5.17 c pseudoobj : 0.00 594 2 59
5.09/5.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.09/5.17 c propagation : 0.00 34 28 28 3.6 2 3.5 -
5.09/5.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.09/5.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.09/5.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.09/5.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.09/5.17 c applied globally : - - - 30 3.6 - - -
5.09/5.17 c applied locally : - - - 0 0.0 - - -
5.09/5.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.09/5.17 c cut pool : 0.06 19 - - 471 - (maximal pool size: 3697)
5.09/5.17 c redcost : 0.00 20 0 0 0 0
5.09/5.17 c impliedbounds : 0.00 20 0 0 170 0
5.09/5.17 c intobj : 0.00 0 0 0 0 0
5.09/5.17 c cgmip : 0.00 0 0 0 0 0
5.09/5.17 c gomory : 1.46 20 0 0 1170 0
5.09/5.17 c strongcg : 1.35 20 0 0 4169 0
5.09/5.17 c cmir : 0.05 10 0 0 0 0
5.09/5.17 c flowcover : 0.08 10 0 0 0 0
5.09/5.17 c clique : 0.01 20 0 0 54 0
5.09/5.17 c zerohalf : 0.00 0 0 0 0 0
5.09/5.17 c mcf : 0.00 1 0 0 0 0
5.09/5.17 c rapidlearning : 0.00 0 0 0 0 0
5.09/5.17 c Pricers : Time Calls Vars
5.09/5.17 c problem variables: 0.00 0 0
5.09/5.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.09/5.17 c relpscost : 1.44 1 0 0 0 0 2
5.09/5.17 c pscost : 0.00 0 0 0 0 0 0
5.09/5.17 c inference : 0.00 49 0 0 0 0 98
5.09/5.17 c mostinf : 0.00 0 0 0 0 0 0
5.09/5.17 c leastinf : 0.00 0 0 0 0 0 0
5.09/5.17 c fullstrong : 0.00 0 0 0 0 0 0
5.09/5.17 c allfullstrong : 0.00 0 0 0 0 0 0
5.09/5.17 c random : 0.00 0 0 0 0 0 0
5.09/5.17 c Primal Heuristics : Time Calls Found
5.09/5.17 c LP solutions : 0.00 - 0
5.09/5.17 c pseudo solutions : 0.00 - 2
5.09/5.17 c oneopt : 0.00 0 0
5.09/5.17 c crossover : 0.00 0 0
5.09/5.17 c trivial : 0.00 2 0
5.09/5.17 c simplerounding : 0.00 0 0
5.09/5.17 c zirounding : 0.00 1 0
5.09/5.17 c rounding : 0.01 20 0
5.09/5.17 c shifting : 0.02 20 0
5.09/5.17 c intshifting : 0.00 0 0
5.09/5.17 c twoopt : 0.00 0 0
5.09/5.17 c fixandinfer : 0.00 0 0
5.09/5.17 c feaspump : 0.00 1 0
5.09/5.17 c coefdiving : 0.00 0 0
5.09/5.17 c pscostdiving : 0.00 0 0
5.09/5.17 c fracdiving : 0.00 0 0
5.09/5.17 c veclendiving : 0.00 0 0
5.09/5.17 c intdiving : 0.00 0 0
5.09/5.17 c actconsdiving : 0.00 0 0
5.09/5.17 c objpscostdiving : 0.00 0 0
5.09/5.17 c rootsoldiving : 0.00 0 0
5.09/5.17 c linesearchdiving : 0.00 0 0
5.09/5.17 c guideddiving : 0.00 0 0
5.09/5.17 c octane : 0.00 0 0
5.09/5.17 c rens : 0.01 0 0
5.09/5.17 c rins : 0.00 0 0
5.09/5.17 c localbranching : 0.00 0 0
5.09/5.17 c mutation : 0.00 0 0
5.09/5.17 c dins : 0.00 0 0
5.09/5.17 c undercover : 0.00 0 0
5.09/5.17 c nlp : 0.00 0 0
5.09/5.17 c trysol : 0.00 0 0
5.09/5.17 c LP : Time Calls Iterations Iter/call Iter/sec
5.09/5.17 c primal LP : 0.00 0 0 0.00 -
5.09/5.17 c dual LP : 0.36 20 1717 85.85 4769.44
5.09/5.17 c lex dual LP : 0.00 0 0 0.00 -
5.09/5.17 c barrier LP : 0.00 0 0 0.00 -
5.09/5.17 c diving/probing LP: 0.00 0 0 0.00 -
5.09/5.17 c strong branching : 1.44 17 8732 513.65 6063.89
5.09/5.17 c (at root node) : - 17 8732 513.65 -
5.09/5.17 c conflict analysis: 0.00 0 0 0.00 -
5.09/5.17 c B&B Tree :
5.09/5.17 c number of runs : 1
5.09/5.17 c nodes : 72
5.09/5.17 c nodes (total) : 72
5.09/5.17 c nodes left : 0
5.09/5.17 c max depth : 14
5.09/5.17 c max depth (total): 14
5.09/5.17 c backtracks : 16 (22.2%)
5.09/5.17 c delayed cutoffs : 16
5.09/5.17 c repropagations : 42 (435 domain reductions, 14 cutoffs)
5.09/5.17 c avg switch length: 2.39
5.09/5.17 c switching time : 0.02
5.09/5.17 c Solution :
5.09/5.17 c Solutions found : 2 (2 improvements)
5.09/5.17 c First Solution : +9.50000000000000e+01 (in run 1, after 50 nodes, 4.99 seconds, depth 14, found by <relaxation>)
5.09/5.17 c Primal Bound : +9.40000000000000e+01 (in run 1, after 72 nodes, 5.00 seconds, depth 12, found by <relaxation>)
5.09/5.17 c Dual Bound : +9.40000000000000e+01
5.09/5.17 c Gap : 0.00 %
5.09/5.17 c Root Dual Bound : +8.03421972717871e+01
5.09/5.17 c Root Iterations : 1717
5.09/5.18 c Time complete: 5.18.