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-2667501-1276421524.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 208 impls, 0 clqs
0.00/0.04 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 440 upgd conss, 208 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.05 c 208 implications, 0 cliques
0.00/0.05 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.05 c 440 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
0.00/0.05 c
0.00/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c conflict/interconss = 0
0.00/0.05 c
0.00/0.05 c # should binary conflicts be preferred?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c conflict/preferbinary = TRUE
0.00/0.05 c
0.00/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c constraints/agelimit = 1
0.00/0.05 c
0.00/0.05 c # should enforcement of pseudo solution be disabled?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/disableenfops = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1799.99
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c lp/solvefreq = 0
0.00/0.05 c
0.00/0.05 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.05 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.05 c lp/pricing = a
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # priority of node selection rule <dfs> in standard mode
0.00/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.05 c nodeselection/dfs/stdpriority = 1000000
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 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 | 620 | - |1164k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.700000e+01 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 2946 | - |2654k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.733333e+01 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 3092 | - |4138k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.750000e+01 | -- | Inf
0.99/1.06 c 1.0s| 1 | 0 | 3307 | - |5381k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.760606e+01 | -- | Inf
1.09/1.18 c 1.1s| 1 | 0 | 3374 | - |6893k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.766667e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 3585 | - |8307k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.771795e+01 | -- | Inf
1.49/1.52 c 1.5s| 1 | 0 | 3776 | - |9880k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.774955e+01 | -- | Inf
1.68/1.70 c 1.6s| 1 | 0 | 3975 | - | 11M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.777289e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 4179 | - | 11M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.778687e+01 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 4394 | - | 11M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.779887e+01 | -- | Inf
2.19/2.24 c 2.2s| 1 | 0 | 4584 | - | 11M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.780469e+01 | -- | Inf
2.30/2.36 c 2.3s| 1 | 0 | 4670 | - | 11M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.780532e+01 | -- | Inf
2.49/2.54 c 2.5s| 1 | 0 | 4887 | - | 11M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.781172e+01 | -- | Inf
7.99/8.01 c 7.9s| 1 | 2 | 4887 | - | 11M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 25 | 6.781172e+01 | -- | Inf
8.39/8.46 o 100
8.39/8.46 c * 8.3s| 1187 | 7 | 4887 | 0.0 | 11M| 19 | - | 200 | 453 | 0 | 0 | 12 | 854 | 25 | 6.833333e+01 | 1.000000e+02 | 46.34%
8.49/8.53 c
8.49/8.53 c SCIP Status : problem is solved [optimal solution found]
8.49/8.53 c Solving Time (sec) : 8.33
8.49/8.53 c Solving Nodes : 1377
8.49/8.53 c Primal Bound : +1.00000000000000e+02 (1 solutions)
8.49/8.53 c Dual Bound : +1.00000000000000e+02
8.49/8.53 c Gap : 0.00 %
8.49/8.53 s OPTIMUM FOUND
8.49/8.53 v x200 -x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 x188 -x187 -x186 x185 -x184 x183 x182 -x181 x180 -x179 -x178
8.49/8.53 v x177 -x176 x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 -x158 x157 x156 -x155
8.49/8.53 v x154 -x153 -x152 x151 x150 -x149 -x148 x147 x146 -x145 x144 -x143 -x142 x141 -x140 x139 x138 -x137 x136 -x135 x134 -x133 x132
8.49/8.53 v -x131 -x130 x129 x128 -x127 x126 -x125 -x124 x123 -x122 x121 x120 -x119 -x118 x117 x116 -x115 x114 -x113 -x112 x111 -x110 x109
8.49/8.53 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
8.49/8.53 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
8.49/8.53 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
8.49/8.53 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
8.49/8.53 c SCIP Status : problem is solved [optimal solution found]
8.49/8.53 c Solving Time : 8.33
8.49/8.53 c Original Problem :
8.49/8.53 c Problem name : HOME/instance-2667501-1276421524.opb
8.49/8.53 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
8.49/8.53 c Constraints : 440 initial, 440 maximal
8.49/8.53 c Presolved Problem :
8.49/8.53 c Problem name : t_HOME/instance-2667501-1276421524.opb
8.49/8.53 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
8.49/8.53 c Constraints : 440 initial, 473 maximal
8.49/8.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.49/8.53 c trivial : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c implics : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c probing : 0.01 0 0 0 0 0 0 0 0
8.49/8.53 c linear : 0.01 0 0 0 0 0 0 0 1
8.49/8.53 c logicor : 0.00 0 0 0 0 0 0 0 0
8.49/8.53 c root node : - 93 - - 93 - - - -
8.49/8.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.49/8.53 c integral : 0 0 0 1 0 0 0 0 0 2
8.49/8.53 c logicor : 440+ 13 12202 0 1 739 28047 0 0 0
8.49/8.53 c countsols : 0 0 0 0 1 0 0 0 0 0
8.49/8.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.49/8.53 c integral : 5.30 0.00 0.00 5.30 0.00
8.49/8.53 c logicor : 0.07 0.00 0.07 0.00 0.00
8.49/8.53 c countsols : 0.00 0.00 0.00 0.00 0.00
8.49/8.53 c Propagators : Time Calls Cutoffs DomReds
8.49/8.53 c vbounds : 0.01 2 0 0
8.49/8.53 c rootredcost : 0.00 1 0 0
8.49/8.53 c pseudoobj : 0.18 12995 0 3
8.49/8.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.49/8.53 c propagation : 0.02 739 718 718 4.7 259 4.1 -
8.49/8.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
8.49/8.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.49/8.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.49/8.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.49/8.53 c applied globally : - - - 977 4.5 - - -
8.49/8.53 c applied locally : - - - 0 0.0 - - -
8.49/8.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.49/8.53 c cut pool : 0.05 12 - - 1034 - (maximal pool size: 2029)
8.49/8.53 c redcost : 0.00 13 0 0 0 0
8.49/8.53 c impliedbounds : 0.00 13 0 0 0 0
8.49/8.53 c intobj : 0.00 0 0 0 0 0
8.49/8.53 c cgmip : 0.00 0 0 0 0 0
8.49/8.53 c gomory : 0.60 13 0 0 0 0
8.49/8.53 c strongcg : 0.62 13 0 0 2278 0
8.49/8.53 c cmir : 0.04 10 0 0 0 0
8.49/8.53 c flowcover : 0.06 10 0 0 0 0
8.49/8.53 c clique : 0.00 1 0 0 0 0
8.49/8.53 c zerohalf : 0.00 0 0 0 0 0
8.49/8.53 c mcf : 0.00 1 0 0 0 0
8.49/8.53 c rapidlearning : 0.00 0 0 0 0 0
8.49/8.53 c Pricers : Time Calls Vars
8.49/8.53 c problem variables: 0.00 0 0
8.49/8.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.49/8.53 c relpscost : 5.30 1 0 0 0 0 2
8.49/8.53 c pscost : 0.00 0 0 0 0 0 0
8.49/8.53 c inference : 0.07 960 0 0 0 0 1920
8.49/8.53 c mostinf : 0.00 0 0 0 0 0 0
8.49/8.53 c leastinf : 0.00 0 0 0 0 0 0
8.49/8.53 c fullstrong : 0.00 0 0 0 0 0 0
8.49/8.53 c allfullstrong : 0.00 0 0 0 0 0 0
8.49/8.53 c random : 0.00 0 0 0 0 0 0
8.49/8.53 c Primal Heuristics : Time Calls Found
8.49/8.53 c LP solutions : 0.00 - 0
8.49/8.53 c pseudo solutions : 0.00 - 1
8.49/8.53 c oneopt : 0.00 0 0
8.49/8.53 c crossover : 0.00 0 0
8.49/8.53 c trivial : 0.00 2 0
8.49/8.53 c simplerounding : 0.00 0 0
8.49/8.53 c zirounding : 0.00 1 0
8.49/8.53 c rounding : 0.00 13 0
8.49/8.53 c shifting : 0.00 13 0
8.49/8.53 c intshifting : 0.00 0 0
8.49/8.53 c twoopt : 0.00 0 0
8.49/8.53 c fixandinfer : 0.00 0 0
8.49/8.53 c feaspump : 0.53 1 0
8.49/8.53 c coefdiving : 0.00 0 0
8.49/8.53 c pscostdiving : 0.00 0 0
8.49/8.53 c fracdiving : 0.00 0 0
8.49/8.53 c veclendiving : 0.00 0 0
8.49/8.53 c intdiving : 0.00 0 0
8.49/8.53 c actconsdiving : 0.00 0 0
8.49/8.53 c objpscostdiving : 0.00 0 0
8.49/8.53 c rootsoldiving : 0.00 0 0
8.49/8.53 c linesearchdiving : 0.00 0 0
8.49/8.53 c guideddiving : 0.00 0 0
8.49/8.53 c octane : 0.00 0 0
8.49/8.53 c rens : 0.01 0 0
8.49/8.53 c rins : 0.00 0 0
8.49/8.53 c localbranching : 0.00 0 0
8.49/8.53 c mutation : 0.00 0 0
8.49/8.53 c dins : 0.00 0 0
8.49/8.53 c undercover : 0.00 0 0
8.49/8.53 c nlp : 0.00 0 0
8.49/8.53 c trysol : 0.00 0 0
8.49/8.53 c LP : Time Calls Iterations Iter/call Iter/sec
8.49/8.53 c primal LP : 0.00 0 0 0.00 -
8.49/8.53 c dual LP : 0.62 13 2673 205.62 4311.29
8.49/8.53 c lex dual LP : 0.00 0 0 0.00 -
8.49/8.53 c barrier LP : 0.00 0 0 0.00 -
8.49/8.53 c diving/probing LP: 0.52 34 2214 65.12 4257.69
8.49/8.53 c strong branching : 5.30 25 16682 667.28 3147.55
8.49/8.53 c (at root node) : - 25 16682 667.28 -
8.49/8.53 c conflict analysis: 0.00 0 0 0.00 -
8.49/8.53 c B&B Tree :
8.49/8.53 c number of runs : 1
8.49/8.53 c nodes : 1377
8.49/8.53 c nodes (total) : 1377
8.49/8.53 c nodes left : 0
8.49/8.53 c max depth : 19
8.49/8.53 c max depth (total): 19
8.49/8.53 c backtracks : 368 (26.7%)
8.49/8.53 c delayed cutoffs : 546
8.49/8.53 c repropagations : 1383 (13504 domain reductions, 324 cutoffs)
8.49/8.53 c avg switch length: 3.05
8.49/8.53 c switching time : 0.02
8.49/8.53 c Solution :
8.49/8.53 c Solutions found : 1 (1 improvements)
8.49/8.53 c First Solution : +1.00000000000000e+02 (in run 1, after 1187 nodes, 8.27 seconds, depth 13, found by <relaxation>)
8.49/8.53 c Primal Bound : +1.00000000000000e+02 (in run 1, after 1187 nodes, 8.27 seconds, depth 13, found by <relaxation>)
8.49/8.53 c Dual Bound : +1.00000000000000e+02
8.49/8.53 c Gap : 0.00 %
8.49/8.53 c Root Dual Bound : +6.78117230044305e+01
8.49/8.53 c Root Iterations : 4887
8.49/8.54 c Time complete: 8.53.