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-2666096-1276447838.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.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 (3 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.04 c 208 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.00/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.08 c 0.1s| 1 | 0 | 313 | - |1164k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.700000e+01 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 454 | - |2622k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.733333e+01 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 523 | - |4149k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.744444e+01 | -- | Inf
0.39/0.48 c 0.4s| 1 | 0 | 646 | - |5644k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.751852e+01 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 832 | - |7006k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.758667e+01 | -- | Inf
0.69/0.79 c 0.7s| 1 | 0 | 1064 | - |8494k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.764793e+01 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 1273 | - |9832k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.769106e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 1515 | - | 10M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.773485e+01 | -- | Inf
1.19/1.28 c 1.2s| 1 | 0 | 1637 | - | 11M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.774076e+01 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 1849 | - | 12M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.777334e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 2043 | - | 12M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.779460e+01 | -- | Inf
1.69/1.80 c 1.7s| 1 | 0 | 2252 | - | 12M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.780478e+01 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 2441 | - | 12M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.781169e+01 | -- | Inf
5.89/5.92 c 5.8s| 1 | 2 | 2441 | - | 12M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 23 | 6.781169e+01 | -- | Inf
5.98/6.05 o 100
5.98/6.05 c * 5.9s| 311 | 6 | 2441 | 0.0 | 12M| 16 | - | 200 | 448 | 0 | 0 | 12 | 228 | 23 | 6.895728e+01 | 1.000000e+02 | 45.02%
5.98/6.08 c
5.98/6.08 c SCIP Status : problem is solved [optimal solution found]
5.98/6.08 c Solving Time (sec) : 5.89
5.98/6.08 c Solving Nodes : 401
5.98/6.08 c Primal Bound : +1.00000000000000e+02 (1 solutions)
5.98/6.08 c Dual Bound : +1.00000000000000e+02
5.98/6.08 c Gap : 0.00 %
5.98/6.08 s OPTIMUM FOUND
5.98/6.08 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.98/6.08 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.98/6.08 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 -x140 x139 x138 -x137 -x136 x135 x134 -x133 -x132
5.98/6.08 v x131 -x130 x129 -x128 x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 x116 -x115 -x114 x113 -x112 x111 x110 -x109
5.98/6.08 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
5.98/6.08 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
5.98/6.08 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
5.98/6.08 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
5.98/6.08 c SCIP Status : problem is solved [optimal solution found]
5.98/6.08 c Solving Time : 5.89
5.98/6.08 c Original Problem :
5.98/6.08 c Problem name : HOME/instance-2666096-1276447838.opb
5.98/6.08 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
5.98/6.08 c Constraints : 440 initial, 440 maximal
5.98/6.08 c Presolved Problem :
5.98/6.08 c Problem name : t_HOME/instance-2666096-1276447838.opb
5.98/6.08 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
5.98/6.08 c Constraints : 440 initial, 469 maximal
5.98/6.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.98/6.08 c trivial : 0.00 0 0 0 0 0 0 0 0
5.98/6.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.98/6.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.98/6.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.98/6.09 c implics : 0.00 0 0 0 0 0 0 0 0
5.98/6.09 c probing : 0.01 0 0 0 0 0 0 0 0
5.98/6.09 c linear : 0.01 0 0 0 0 0 0 0 1
5.98/6.09 c logicor : 0.00 0 0 0 0 0 0 0 0
5.98/6.09 c root node : - 12 - - 12 - - - -
5.98/6.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.98/6.09 c integral : 0 0 0 1 0 0 0 0 0 2
5.98/6.09 c logicor : 440+ 13 3982 0 1 217 8686 0 0 0
5.98/6.09 c countsols : 0 0 0 0 1 0 0 0 0 0
5.98/6.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.98/6.09 c integral : 3.76 0.00 0.00 3.76 0.00
5.98/6.09 c logicor : 0.04 0.00 0.04 0.00 0.00
5.98/6.09 c countsols : 0.00 0.00 0.00 0.00 0.00
5.98/6.09 c Propagators : Time Calls Cutoffs DomReds
5.98/6.09 c vbounds : 0.01 2 0 0
5.98/6.09 c rootredcost : 0.01 1 0 0
5.98/6.09 c pseudoobj : 0.01 4069 0 3
5.98/6.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.98/6.09 c propagation : 0.02 217 206 206 4.5 87 3.8 -
5.98/6.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.98/6.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.98/6.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.98/6.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.98/6.09 c applied globally : - - - 293 4.3 - - -
5.98/6.09 c applied locally : - - - 0 0.0 - - -
5.98/6.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.98/6.09 c cut pool : 0.04 12 - - 909 - (maximal pool size: 2210)
5.98/6.09 c redcost : 0.00 13 0 0 0 0
5.98/6.09 c impliedbounds : 0.00 13 0 0 0 0
5.98/6.09 c intobj : 0.00 0 0 0 0 0
5.98/6.09 c cgmip : 0.00 0 0 0 0 0
5.98/6.09 c gomory : 0.65 13 0 0 0 0
5.98/6.09 c strongcg : 0.68 13 0 0 2439 0
5.98/6.09 c cmir : 0.04 10 0 0 0 0
5.98/6.09 c flowcover : 0.08 10 0 0 0 0
5.98/6.09 c clique : 0.00 1 0 0 0 0
5.98/6.09 c zerohalf : 0.00 0 0 0 0 0
5.98/6.09 c mcf : 0.00 1 0 0 0 0
5.98/6.09 c rapidlearning : 0.00 0 0 0 0 0
5.98/6.09 c Pricers : Time Calls Vars
5.98/6.09 c problem variables: 0.00 0 0
5.98/6.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.98/6.09 c relpscost : 3.76 1 0 0 0 0 2
5.98/6.09 c pscost : 0.00 0 0 0 0 0 0
5.98/6.09 c inference : 0.01 274 0 0 0 0 548
5.98/6.09 c mostinf : 0.00 0 0 0 0 0 0
5.98/6.09 c leastinf : 0.00 0 0 0 0 0 0
5.98/6.09 c fullstrong : 0.00 0 0 0 0 0 0
5.98/6.09 c allfullstrong : 0.00 0 0 0 0 0 0
5.98/6.09 c random : 0.00 0 0 0 0 0 0
5.98/6.09 c Primal Heuristics : Time Calls Found
5.98/6.09 c LP solutions : 0.00 - 0
5.98/6.09 c pseudo solutions : 0.00 - 1
5.98/6.09 c oneopt : 0.00 0 0
5.98/6.09 c crossover : 0.00 0 0
5.98/6.09 c trivial : 0.00 2 0
5.98/6.09 c simplerounding : 0.00 0 0
5.98/6.09 c zirounding : 0.00 1 0
5.98/6.09 c rounding : 0.00 13 0
5.98/6.09 c shifting : 0.00 13 0
5.98/6.09 c intshifting : 0.00 0 0
5.98/6.09 c twoopt : 0.00 0 0
5.98/6.09 c fixandinfer : 0.00 0 0
5.98/6.09 c feaspump : 0.00 1 0
5.98/6.09 c coefdiving : 0.00 0 0
5.98/6.09 c pscostdiving : 0.00 0 0
5.98/6.09 c fracdiving : 0.00 0 0
5.98/6.09 c veclendiving : 0.00 0 0
5.98/6.09 c intdiving : 0.00 0 0
5.98/6.09 c actconsdiving : 0.00 0 0
5.98/6.09 c objpscostdiving : 0.00 0 0
5.98/6.09 c rootsoldiving : 0.00 0 0
5.98/6.09 c linesearchdiving : 0.00 0 0
5.98/6.09 c guideddiving : 0.00 0 0
5.98/6.09 c octane : 0.00 0 0
5.98/6.09 c rens : 0.00 0 0
5.98/6.09 c rins : 0.00 0 0
5.98/6.09 c localbranching : 0.00 0 0
5.98/6.09 c mutation : 0.00 0 0
5.98/6.09 c dins : 0.00 0 0
5.98/6.09 c undercover : 0.00 0 0
5.98/6.09 c nlp : 0.00 0 0
5.98/6.09 c trysol : 0.00 0 0
5.98/6.09 c LP : Time Calls Iterations Iter/call Iter/sec
5.98/6.09 c primal LP : 0.01 0 0 0.00 0.00
5.98/6.09 c dual LP : 0.48 13 2441 187.77 5085.42
5.98/6.09 c lex dual LP : 0.00 0 0 0.00 -
5.98/6.09 c barrier LP : 0.00 0 0 0.00 -
5.98/6.09 c diving/probing LP: 0.00 0 0 0.00 -
5.98/6.09 c strong branching : 3.76 23 20083 873.17 5341.22
5.98/6.09 c (at root node) : - 23 20083 873.17 -
5.98/6.09 c conflict analysis: 0.00 0 0 0.00 -
5.98/6.09 c B&B Tree :
5.98/6.09 c number of runs : 1
5.98/6.09 c nodes : 401
5.98/6.09 c nodes (total) : 401
5.98/6.09 c nodes left : 0
5.98/6.09 c max depth : 17
5.98/6.09 c max depth (total): 17
5.98/6.09 c backtracks : 100 (24.9%)
5.98/6.09 c delayed cutoffs : 150
5.98/6.09 c repropagations : 380 (3798 domain reductions, 92 cutoffs)
5.98/6.09 c avg switch length: 2.93
5.98/6.09 c switching time : 0.02
5.98/6.09 c Solution :
5.98/6.09 c Solutions found : 1 (1 improvements)
5.98/6.09 c First Solution : +1.00000000000000e+02 (in run 1, after 311 nodes, 5.86 seconds, depth 12, found by <relaxation>)
5.98/6.09 c Primal Bound : +1.00000000000000e+02 (in run 1, after 311 nodes, 5.86 seconds, depth 12, found by <relaxation>)
5.98/6.09 c Dual Bound : +1.00000000000000e+02
5.98/6.09 c Gap : 0.00 %
5.98/6.09 c Root Dual Bound : +6.78116911246162e+01
5.98/6.09 c Root Iterations : 2441
6.09/6.10 c Time complete: 6.09.