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-2667523-1276430140.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 440 upgd conss, 200 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 200 implications, 0 cliques
0.00/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.04 c 440 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 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.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.09/0.11 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.11 c 0.1s| 1 | 0 | 626 | - |1163k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.666667e+01 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 3499 | - |2631k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.709906e+01 | -- | Inf
1.00/1.04 c 1.0s| 1 | 0 | 3652 | - |4035k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.720000e+01 | -- | Inf
1.10/1.18 c 1.1s| 1 | 0 | 3844 | - |5257k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.728857e+01 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 4029 | - |6638k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.733333e+01 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 4196 | - |8130k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.737778e+01 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 4388 | - |9547k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.740278e+01 | -- | Inf
1.79/1.81 c 1.7s| 1 | 0 | 4598 | - | 10M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.743077e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 4737 | - | 11M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.743602e+01 | -- | Inf
2.10/2.16 c 2.1s| 1 | 0 | 4926 | - | 12M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.745445e+01 | -- | Inf
2.29/2.33 c 2.2s| 1 | 0 | 5100 | - | 12M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.746034e+01 | -- | Inf
2.39/2.49 c 2.4s| 1 | 0 | 5286 | - | 12M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.746662e+01 | -- | Inf
2.58/2.66 c 2.6s| 1 | 0 | 5523 | - | 13M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.747617e+01 | -- | Inf
2.79/2.83 c 2.7s| 1 | 0 | 5732 | - | 13M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 0 | 6.748560e+01 | -- | Inf
2.89/2.96 c 2.9s| 1 | 0 | 5796 | - | 13M| 0 | 200 | 200 | 440 | 200 | 454 | 14 | 0 | 0 | 6.748661e+01 | -- | Inf
3.09/3.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.09/3.14 c 3.0s| 1 | 0 | 5980 | - | 13M| 0 | 200 | 200 | 440 | 200 | 455 | 15 | 0 | 0 | 6.749625e+01 | -- | Inf
3.19/3.27 c 3.2s| 1 | 0 | 6053 | - | 13M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 0 | 6.749794e+01 | -- | Inf
3.39/3.40 c 3.3s| 1 | 0 | 6113 | - | 13M| 0 | 200 | 200 | 440 | 200 | 457 | 17 | 0 | 0 | 6.749870e+01 | -- | Inf
3.49/3.53 c 3.4s| 1 | 0 | 6174 | - | 13M| 0 | 200 | 200 | 440 | 200 | 458 | 18 | 0 | 0 | 6.749959e+01 | -- | Inf
9.29/9.31 c 9.1s| 1 | 2 | 6174 | - | 13M| 0 | 200 | 200 | 440 | 200 | 458 | 18 | 0 | 23 | 6.749959e+01 | -- | Inf
9.38/9.45 o 100
9.38/9.45 c * 9.2s| 400 | 5 | 6174 | 0.0 | 13M| 23 | - | 200 | 439 | 0 | 0 | 18 | 319 | 23 | 6.866667e+01 | 1.000000e+02 | 45.63%
9.38/9.49 c
9.38/9.49 c SCIP Status : problem is solved [optimal solution found]
9.38/9.49 c Solving Time (sec) : 9.27
9.38/9.49 c Solving Nodes : 485
9.38/9.49 c Primal Bound : +1.00000000000000e+02 (1 solutions)
9.38/9.49 c Dual Bound : +1.00000000000000e+02
9.38/9.49 c Gap : 0.00 %
9.38/9.49 s OPTIMUM FOUND
9.38/9.49 v x200 -x199 -x198 x197 -x196 x195 -x194 x193 -x192 x191 x190 -x189 x188 -x187 -x186 x185 -x184 x183 -x182 x181 x180 -x179 -x178
9.38/9.49 v x177 x176 -x175 -x174 x173 x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 x158 -x157 x156 -x155
9.38/9.49 v x154 -x153 -x152 x151 x150 -x149 x148 -x147 -x146 x145 -x144 x143 -x142 x141 x140 -x139 -x138 x137 x136 -x135 x134 -x133 -x132
9.38/9.49 v x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 -x116 x115 x114 -x113 x112 -x111 -x110 x109
9.38/9.49 v -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
9.38/9.49 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 -x56
9.38/9.49 v 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 -x28
9.38/9.49 v 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
9.38/9.49 c SCIP Status : problem is solved [optimal solution found]
9.38/9.49 c Solving Time : 9.27
9.38/9.49 c Original Problem :
9.38/9.49 c Problem name : HOME/instance-2667523-1276430140.opb
9.38/9.49 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.38/9.49 c Constraints : 440 initial, 440 maximal
9.38/9.49 c Presolved Problem :
9.38/9.49 c Problem name : t_HOME/instance-2667523-1276430140.opb
9.38/9.49 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.38/9.49 c Constraints : 440 initial, 465 maximal
9.38/9.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.38/9.49 c trivial : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c implics : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c probing : 0.01 0 0 0 0 0 0 0 0
9.38/9.49 c logicor : 0.00 0 0 0 0 0 0 0 0
9.38/9.49 c root node : - 117 - - 117 - - - -
9.38/9.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.38/9.49 c integral : 0 0 0 1 0 0 0 0 0 2
9.38/9.49 c logicor : 440+ 19 4309 0 1 261 8093 0 0 0
9.38/9.49 c countsols : 0 0 0 0 1 0 0 0 0 0
9.38/9.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.38/9.49 c integral : 5.58 0.00 0.00 5.58 0.00
9.38/9.49 c logicor : 0.00 0.00 0.00 0.00 0.00
9.38/9.49 c countsols : 0.00 0.00 0.00 0.00 0.00
9.38/9.49 c Propagators : Time Calls Cutoffs DomReds
9.38/9.49 c vbounds : 0.00 2 0 0
9.38/9.49 c rootredcost : 0.03 1 0 0
9.38/9.49 c pseudoobj : 0.05 4614 0 0
9.38/9.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.38/9.49 c propagation : 0.00 261 252 252 3.3 133 3.5 -
9.38/9.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.38/9.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.38/9.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.38/9.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.38/9.49 c applied globally : - - - 385 3.4 - - -
9.38/9.49 c applied locally : - - - 0 0.0 - - -
9.38/9.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.38/9.49 c cut pool : 0.03 18 - - 1468 - (maximal pool size: 2476)
9.38/9.49 c redcost : 0.00 19 0 0 0 0
9.38/9.49 c impliedbounds : 0.00 19 0 0 0 0
9.38/9.49 c intobj : 0.00 0 0 0 0 0
9.38/9.49 c cgmip : 0.00 0 0 0 0 0
9.38/9.49 c gomory : 0.96 19 0 0 0 0
9.38/9.49 c strongcg : 0.91 19 0 0 2813 0
9.38/9.49 c cmir : 0.04 10 0 0 0 0
9.38/9.49 c flowcover : 0.07 10 0 0 0 0
9.38/9.49 c clique : 0.00 1 0 0 0 0
9.38/9.49 c zerohalf : 0.00 0 0 0 0 0
9.38/9.49 c mcf : 0.00 1 0 0 0 0
9.38/9.49 c rapidlearning : 0.00 0 0 0 0 0
9.38/9.49 c Pricers : Time Calls Vars
9.38/9.49 c problem variables: 0.00 0 0
9.38/9.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.38/9.49 c relpscost : 5.58 1 0 0 0 0 2
9.38/9.49 c pscost : 0.00 0 0 0 0 0 0
9.38/9.49 c inference : 0.01 324 0 0 0 0 648
9.38/9.49 c mostinf : 0.00 0 0 0 0 0 0
9.38/9.49 c leastinf : 0.00 0 0 0 0 0 0
9.38/9.49 c fullstrong : 0.00 0 0 0 0 0 0
9.38/9.49 c allfullstrong : 0.00 0 0 0 0 0 0
9.38/9.49 c random : 0.00 0 0 0 0 0 0
9.38/9.49 c Primal Heuristics : Time Calls Found
9.38/9.49 c LP solutions : 0.00 - 0
9.38/9.49 c pseudo solutions : 0.00 - 1
9.38/9.49 c oneopt : 0.00 0 0
9.38/9.49 c crossover : 0.00 0 0
9.38/9.49 c trivial : 0.00 2 0
9.38/9.49 c simplerounding : 0.00 0 0
9.38/9.49 c zirounding : 0.00 1 0
9.38/9.49 c rounding : 0.01 19 0
9.38/9.49 c shifting : 0.01 19 0
9.38/9.49 c intshifting : 0.00 0 0
9.38/9.49 c twoopt : 0.00 0 0
9.38/9.49 c fixandinfer : 0.00 0 0
9.38/9.49 c feaspump : 0.61 1 0
9.38/9.49 c coefdiving : 0.00 0 0
9.38/9.49 c pscostdiving : 0.00 0 0
9.38/9.49 c fracdiving : 0.00 0 0
9.38/9.49 c veclendiving : 0.00 0 0
9.38/9.49 c intdiving : 0.00 0 0
9.38/9.49 c actconsdiving : 0.00 0 0
9.38/9.49 c objpscostdiving : 0.00 0 0
9.38/9.49 c rootsoldiving : 0.00 0 0
9.38/9.49 c linesearchdiving : 0.00 0 0
9.38/9.49 c guideddiving : 0.00 0 0
9.38/9.49 c octane : 0.00 0 0
9.38/9.49 c rens : 0.00 0 0
9.38/9.49 c rins : 0.00 0 0
9.38/9.49 c localbranching : 0.00 0 0
9.38/9.49 c mutation : 0.00 0 0
9.38/9.49 c dins : 0.00 0 0
9.38/9.49 c undercover : 0.00 0 0
9.38/9.49 c nlp : 0.00 0 0
9.38/9.49 c trysol : 0.00 0 0
9.38/9.49 c LP : Time Calls Iterations Iter/call Iter/sec
9.38/9.49 c primal LP : 0.00 0 0 0.00 -
9.38/9.49 c dual LP : 0.85 19 3634 191.26 4275.29
9.38/9.49 c lex dual LP : 0.00 0 0 0.00 -
9.38/9.49 c barrier LP : 0.00 0 0 0.00 -
9.38/9.49 c diving/probing LP: 0.57 34 2540 74.71 4456.14
9.38/9.49 c strong branching : 5.58 23 15211 661.35 2725.99
9.38/9.49 c (at root node) : - 23 15211 661.35 -
9.38/9.49 c conflict analysis: 0.00 0 0 0.00 -
9.38/9.49 c B&B Tree :
9.38/9.49 c number of runs : 1
9.38/9.49 c nodes : 485
9.38/9.49 c nodes (total) : 485
9.38/9.49 c nodes left : 0
9.38/9.49 c max depth : 23
9.38/9.49 c max depth (total): 23
9.38/9.49 c backtracks : 116 (23.9%)
9.38/9.49 c delayed cutoffs : 166
9.38/9.49 c repropagations : 634 (4339 domain reductions, 102 cutoffs)
9.38/9.49 c avg switch length: 3.68
9.38/9.49 c switching time : 0.04
9.38/9.49 c Solution :
9.38/9.49 c Solutions found : 1 (1 improvements)
9.38/9.49 c First Solution : +1.00000000000000e+02 (in run 1, after 400 nodes, 9.24 seconds, depth 13, found by <relaxation>)
9.38/9.49 c Primal Bound : +1.00000000000000e+02 (in run 1, after 400 nodes, 9.24 seconds, depth 13, found by <relaxation>)
9.38/9.49 c Dual Bound : +1.00000000000000e+02
9.38/9.49 c Gap : 0.00 %
9.38/9.49 c Root Dual Bound : +6.74995891951996e+01
9.38/9.49 c Root Iterations : 6174
9.49/9.50 c Time complete: 9.49.