0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667525-1276430612.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.08 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.12 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.12 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.13 c presolving (4 rounds):
0.09/0.13 c 2 deleted vars, 51 deleted constraints, 0 tightened bounds, 0 added holes, 24 changed sides, 0 changed coefficients
0.09/0.13 c 2006 implications, 0 cliques
0.09/0.13 c presolved problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 849 constraints
0.09/0.13 c 849 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.09
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.2
0.09/0.13 c
0.09/0.13 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c conflict/interconss = 0
0.09/0.13 c
0.09/0.13 c # should binary conflicts be preferred?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c conflict/preferbinary = TRUE
0.09/0.13 c
0.09/0.13 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c constraints/agelimit = 1
0.09/0.13 c
0.09/0.13 c # should enforcement of pseudo solution be disabled?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/disableenfops = TRUE
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1799.98
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c lp/solvefreq = 0
0.09/0.13 c
0.09/0.13 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.13 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.13 c lp/pricing = a
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # priority of node selection rule <dfs> in standard mode
0.09/0.13 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.13 c nodeselection/dfs/stdpriority = 1000000
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.49/0.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.55 c 0.5s| 1 | 0 | 1735 | - |1846k| 0 | 177 | 198 | 849 | 198 | 849 | 0 | 0 | 0 | 6.859930e+01 | -- | Inf
1.29/1.38 c 1.3s| 1 | 0 | 3633 | - |4121k| 0 | 176 | 198 | 849 | 198 | 972 | 123 | 0 | 0 | 7.106742e+01 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 3858 | - |6027k| 0 | 181 | 198 | 849 | 198 | 976 | 127 | 0 | 0 | 7.122799e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 3945 | - |8214k| 0 | 177 | 198 | 849 | 198 | 979 | 130 | 0 | 0 | 7.126281e+01 | -- | Inf
2.10/2.14 c 2.0s| 1 | 0 | 4043 | - | 10M| 0 | 176 | 198 | 849 | 198 | 982 | 133 | 0 | 0 | 7.132698e+01 | -- | Inf
2.39/2.41 c 2.3s| 1 | 0 | 4209 | - | 12M| 0 | 182 | 198 | 849 | 198 | 984 | 135 | 0 | 0 | 7.143617e+01 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 4319 | - | 14M| 0 | 183 | 198 | 849 | 198 | 986 | 137 | 0 | 0 | 7.151995e+01 | -- | Inf
2.89/2.98 c 2.9s| 1 | 0 | 4461 | - | 16M| 0 | 181 | 198 | 849 | 198 | 987 | 138 | 0 | 0 | 7.161131e+01 | -- | Inf
3.20/3.26 c 3.1s| 1 | 0 | 4539 | - | 19M| 0 | 184 | 198 | 849 | 198 | 988 | 139 | 0 | 0 | 7.200000e+01 | -- | Inf
3.49/3.59 c 3.5s| 1 | 0 | 4695 | - | 21M| 0 | 182 | 198 | 849 | 198 | 989 | 140 | 0 | 0 | 7.200000e+01 | -- | Inf
3.89/3.96 c 3.8s| 1 | 0 | 4848 | - | 23M| 0 | 184 | 198 | 849 | 198 | 990 | 141 | 0 | 0 | 7.200000e+01 | -- | Inf
4.19/4.29 c 4.2s| 1 | 0 | 4966 | - | 25M| 0 | 183 | 198 | 849 | 198 | 902 | 142 | 0 | 0 | 7.200000e+01 | -- | Inf
4.49/4.57 c 4.4s| 1 | 0 | 5034 | - | 25M| 0 | 186 | 198 | 849 | 198 | 903 | 143 | 0 | 0 | 7.200000e+01 | -- | Inf
4.79/4.85 c 4.7s| 1 | 0 | 5125 | - | 26M| 0 | 183 | 198 | 849 | 198 | 904 | 144 | 0 | 0 | 7.200000e+01 | -- | Inf
10.39/10.49 c 10.3s| 1 | 2 | 5125 | - | 26M| 0 | 183 | 198 | 849 | 198 | 904 | 144 | 0 | 18 | 7.200000e+01 | -- | Inf
10.48/10.52 o 94
10.48/10.52 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
10.48/10.52 c *10.3s| 72 | 15 | 5125 | 0.0 | 26M| 26 | - | 198 | 862 | 0 | 0 | 144 | 29 | 18 | 7.257609e+01 | 9.400000e+01 | 29.52%
10.48/10.59 o 93
10.48/10.59 c *10.4s| 409 | 9 | 5125 | 0.0 | 26M| 32 | - | 198 | 872 | 0 | 0 | 144 | 125 | 18 | 7.257609e+01 | 9.300000e+01 | 28.14%
10.69/10.72 c
10.69/10.72 c SCIP Status : problem is solved [optimal solution found]
10.69/10.72 c Solving Time (sec) : 10.48
10.69/10.72 c Solving Nodes : 774
10.69/10.72 c Primal Bound : +9.30000000000000e+01 (2 solutions)
10.69/10.72 c Dual Bound : +9.30000000000000e+01
10.69/10.72 c Gap : 0.00 %
10.69/10.72 s OPTIMUM FOUND
10.69/10.72 v x200 -x199 -x198 x197 -x196 x195 -x194 -x193 -x192 x191 -x190 x189 -x188 x187 x186 -x185 -x184 x183 -x182 x181 x180 -x179 -x178
10.69/10.72 v x177 x176 -x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 x162 -x161 -x160 x159 -x158 x157 x156 -x155
10.69/10.72 v -x154 x153 -x152 -x151 -x150 x149 x148 -x147 -x146 x145 x144 -x143 x142 -x141 x140 -x139 -x138 x137 x136 -x135 -x134 -x133
10.69/10.72 v -x132 x131 x130 -x129 -x128 x127 -x126 x125 -x124 -x123 x122 -x121 -x120 x119 -x118 x117 x116 -x115 x114 -x113 x112 -x111 x110
10.69/10.72 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
10.69/10.72 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
10.69/10.72 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
10.69/10.72 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
10.69/10.72 c SCIP Status : problem is solved [optimal solution found]
10.69/10.72 c Solving Time : 10.48
10.69/10.72 c Original Problem :
10.69/10.72 c Problem name : HOME/instance-2667525-1276430612.opb
10.69/10.72 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
10.69/10.72 c Constraints : 900 initial, 900 maximal
10.69/10.72 c Presolved Problem :
10.69/10.72 c Problem name : t_HOME/instance-2667525-1276430612.opb
10.69/10.72 c Variables : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
10.69/10.72 c Constraints : 849 initial, 884 maximal
10.69/10.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
10.69/10.72 c trivial : 0.00 0 0 0 0 0 0 0 0
10.69/10.72 c dualfix : 0.00 0 0 0 0 0 0 0 0
10.69/10.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
10.69/10.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
10.69/10.72 c implics : 0.00 0 0 0 0 0 0 0 0
10.69/10.72 c probing : 0.02 2 0 0 0 0 0 0 0
10.69/10.72 c linear : 0.03 0 0 0 0 0 24 24 0
10.69/10.72 c logicor : 0.04 0 0 0 0 0 27 0 0
10.69/10.72 c root node : - 111 - - 111 - - - -
10.69/10.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
10.69/10.72 c integral : 0 0 0 1 0 0 0 0 0 2
10.69/10.72 c logicor : 849+ 13 4969 0 2 284 10093 0 0 0
10.69/10.72 c countsols : 0 0 0 0 2 0 0 0 0 0
10.69/10.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
10.69/10.72 c integral : 5.56 0.00 0.00 5.56 0.00
10.69/10.72 c logicor : 0.08 0.00 0.08 0.00 0.00
10.69/10.72 c countsols : 0.00 0.00 0.00 0.00 0.00
10.69/10.72 c Propagators : Time Calls Cutoffs DomReds
10.69/10.72 c vbounds : 0.02 2 0 0
10.69/10.72 c rootredcost : 0.00 2 0 0
10.69/10.72 c pseudoobj : 0.07 4853 147 1901
10.69/10.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.69/10.72 c propagation : 0.04 283 270 270 10.1 26 5.3 -
10.69/10.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
10.69/10.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.69/10.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.69/10.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.69/10.72 c applied globally : - - - 296 9.7 - - -
10.69/10.72 c applied locally : - - - 0 0.0 - - -
10.69/10.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
10.69/10.72 c cut pool : 0.06 12 - - 1030 - (maximal pool size: 5433)
10.69/10.72 c redcost : 0.00 13 0 0 0 0
10.69/10.72 c impliedbounds : 0.00 13 0 0 239 0
10.69/10.72 c intobj : 0.00 0 0 0 0 0
10.69/10.72 c cgmip : 0.00 0 0 0 0 0
10.69/10.72 c gomory : 1.62 13 0 0 200 0
10.69/10.72 c strongcg : 1.26 13 0 0 5485 0
10.69/10.72 c cmir : 0.05 10 0 0 0 0
10.69/10.72 c flowcover : 0.05 10 0 0 0 0
10.69/10.72 c clique : 0.00 13 0 0 22 0
10.69/10.72 c zerohalf : 0.00 0 0 0 0 0
10.69/10.72 c mcf : 0.01 1 0 0 0 0
10.69/10.72 c rapidlearning : 0.00 0 0 0 0 0
10.69/10.72 c Pricers : Time Calls Vars
10.69/10.72 c problem variables: 0.00 0 0
10.69/10.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
10.69/10.72 c relpscost : 5.56 1 0 0 0 0 2
10.69/10.72 c pscost : 0.00 0 0 0 0 0 0
10.69/10.72 c inference : 0.00 464 0 0 0 0 928
10.69/10.72 c mostinf : 0.00 0 0 0 0 0 0
10.69/10.72 c leastinf : 0.00 0 0 0 0 0 0
10.69/10.72 c fullstrong : 0.00 0 0 0 0 0 0
10.69/10.72 c allfullstrong : 0.00 0 0 0 0 0 0
10.69/10.72 c random : 0.00 0 0 0 0 0 0
10.69/10.72 c Primal Heuristics : Time Calls Found
10.69/10.72 c LP solutions : 0.00 - 0
10.69/10.72 c pseudo solutions : 0.00 - 2
10.69/10.72 c oneopt : 0.00 0 0
10.69/10.72 c crossover : 0.00 0 0
10.69/10.72 c trivial : 0.00 2 0
10.69/10.72 c simplerounding : 0.00 0 0
10.69/10.72 c zirounding : 0.00 1 0
10.69/10.72 c rounding : 0.01 14 0
10.69/10.72 c shifting : 0.02 14 0
10.69/10.72 c intshifting : 0.00 0 0
10.69/10.72 c twoopt : 0.00 0 0
10.69/10.72 c fixandinfer : 0.00 0 0
10.69/10.72 c feaspump : 0.52 1 0
10.69/10.72 c coefdiving : 0.00 0 0
10.69/10.72 c pscostdiving : 0.00 0 0
10.69/10.72 c fracdiving : 0.00 0 0
10.69/10.72 c veclendiving : 0.00 0 0
10.69/10.72 c intdiving : 0.00 0 0
10.69/10.72 c actconsdiving : 0.00 0 0
10.69/10.72 c objpscostdiving : 0.00 0 0
10.69/10.72 c rootsoldiving : 0.00 0 0
10.69/10.72 c linesearchdiving : 0.00 0 0
10.69/10.72 c guideddiving : 0.00 0 0
10.69/10.72 c octane : 0.00 0 0
10.69/10.72 c rens : 0.00 0 0
10.69/10.72 c rins : 0.00 0 0
10.69/10.72 c localbranching : 0.00 0 0
10.69/10.72 c mutation : 0.00 0 0
10.69/10.72 c dins : 0.00 0 0
10.69/10.72 c undercover : 0.00 0 0
10.69/10.72 c nlp : 0.00 0 0
10.69/10.72 c trysol : 0.01 0 0
10.69/10.72 c LP : Time Calls Iterations Iter/call Iter/sec
10.69/10.72 c primal LP : 0.01 0 0 0.00 0.00
10.69/10.72 c dual LP : 0.98 14 3546 253.29 3618.37
10.69/10.72 c lex dual LP : 0.00 0 0 0.00 -
10.69/10.72 c barrier LP : 0.00 0 0 0.00 -
10.69/10.72 c diving/probing LP: 0.52 30 1579 52.63 3036.54
10.69/10.72 c strong branching : 5.56 18 13533 751.83 2433.99
10.69/10.72 c (at root node) : - 18 13533 751.83 -
10.69/10.72 c conflict analysis: 0.00 0 0 0.00 -
10.69/10.72 c B&B Tree :
10.69/10.72 c number of runs : 1
10.69/10.72 c nodes : 774
10.69/10.72 c nodes (total) : 774
10.69/10.72 c nodes left : 0
10.69/10.72 c max depth : 32
10.69/10.72 c max depth (total): 32
10.69/10.72 c backtracks : 227 (29.3%)
10.69/10.72 c delayed cutoffs : 151
10.69/10.72 c repropagations : 359 (4944 domain reductions, 123 cutoffs)
10.69/10.72 c avg switch length: 2.34
10.69/10.72 c switching time : 0.02
10.69/10.72 c Solution :
10.69/10.72 c Solutions found : 2 (2 improvements)
10.69/10.72 c First Solution : +9.40000000000000e+01 (in run 1, after 72 nodes, 10.30 seconds, depth 26, found by <relaxation>)
10.69/10.72 c Primal Bound : +9.30000000000000e+01 (in run 1, after 409 nodes, 10.37 seconds, depth 21, found by <relaxation>)
10.69/10.72 c Dual Bound : +9.30000000000000e+01
10.69/10.72 c Gap : 0.00 %
10.69/10.72 c Root Dual Bound : +7.20000000000000e+01
10.69/10.72 c Root Iterations : 5125
10.69/10.74 c Time complete: 10.72.