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-2666080-1276426821.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 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.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.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 300 upgd conss, 208 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.03 c 208 implications, 0 cliques
0.00/0.03 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 constraints
0.00/0.03 c 300 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 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.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/0.06 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.06 c 0.0s| 1 | 0 | 336 | - |1001k| 0 | 200 | 200 | 300 | 200 | 300 | 0 | 0 | 0 | 6.688658e+01 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 390 | - |2415k| 0 | 198 | 200 | 300 | 200 | 301 | 1 | 0 | 0 | 6.704610e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 410 | - |3780k| 0 | 199 | 200 | 300 | 200 | 302 | 2 | 0 | 0 | 6.707951e+01 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 430 | - |5177k| 0 | 199 | 200 | 300 | 200 | 303 | 3 | 0 | 0 | 6.711595e+01 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 447 | - |6574k| 0 | 199 | 200 | 300 | 200 | 305 | 5 | 0 | 0 | 6.715094e+01 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 474 | - |8018k| 0 | 199 | 200 | 300 | 200 | 306 | 6 | 0 | 0 | 6.718074e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 509 | - |9190k| 0 | 197 | 200 | 300 | 200 | 307 | 7 | 0 | 0 | 6.721964e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 550 | - | 10M| 0 | 199 | 200 | 300 | 200 | 308 | 8 | 0 | 0 | 6.725060e+01 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 590 | - | 11M| 0 | 200 | 200 | 300 | 200 | 309 | 9 | 0 | 0 | 6.728463e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 622 | - | 11M| 0 | 199 | 200 | 300 | 200 | 311 | 11 | 0 | 0 | 6.735542e+01 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 666 | - | 12M| 0 | 200 | 200 | 300 | 200 | 312 | 12 | 0 | 0 | 6.738762e+01 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 694 | - | 14M| 0 | 200 | 200 | 300 | 200 | 313 | 13 | 0 | 0 | 6.739867e+01 | -- | Inf
1.39/1.48 c 1.4s| 1 | 0 | 728 | - | 14M| 0 | 198 | 200 | 300 | 200 | 314 | 14 | 0 | 0 | 6.741212e+01 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 753 | - | 14M| 0 | 200 | 200 | 300 | 200 | 315 | 15 | 0 | 0 | 6.742799e+01 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 803 | - | 15M| 0 | 199 | 200 | 300 | 200 | 316 | 16 | 0 | 0 | 6.744562e+01 | -- | Inf
1.69/1.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.78 c 1.7s| 1 | 0 | 848 | - | 15M| 0 | 199 | 200 | 300 | 200 | 317 | 17 | 0 | 0 | 6.745968e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 902 | - | 15M| 0 | 198 | 200 | 300 | 200 | 318 | 18 | 0 | 0 | 6.747315e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 927 | - | 15M| 0 | 198 | 200 | 300 | 200 | 317 | 19 | 0 | 0 | 6.747486e+01 | -- | Inf
1.99/2.08 c 2.0s| 1 | 0 | 953 | - | 15M| 0 | 200 | 200 | 300 | 200 | 318 | 20 | 0 | 0 | 6.747860e+01 | -- | Inf
2.09/2.17 c 2.1s| 1 | 0 | 967 | - | 15M| 0 | 199 | 200 | 300 | 200 | 319 | 21 | 0 | 0 | 6.747952e+01 | -- | Inf
3.09/3.18 c 3.1s| 1 | 2 | 967 | - | 15M| 0 | 199 | 200 | 300 | 200 | 319 | 21 | 0 | 36 | 6.747952e+01 | -- | Inf
3.20/3.24 o 100
3.20/3.24 c * 3.1s| 184 | 6 | 967 | 0.0 | 15M| 32 | - | 200 | 310 | 0 | 0 | 21 | 151 | 36 | 6.771685e+01 | 1.000000e+02 | 47.67%
3.20/3.26 c
3.20/3.26 c SCIP Status : problem is solved [optimal solution found]
3.20/3.26 c Solving Time (sec) : 3.14
3.20/3.26 c Solving Nodes : 244
3.20/3.26 c Primal Bound : +1.00000000000000e+02 (1 solutions)
3.20/3.26 c Dual Bound : +1.00000000000000e+02
3.20/3.26 c Gap : 0.00 %
3.20/3.26 s OPTIMUM FOUND
3.20/3.26 v -x200 x199 -x198 x197 -x196 x195 x194 -x193 -x192 x191 x190 -x189 -x188 x187 x186 -x185 -x184 x183 x182 -x181 -x180 x179 x178 -x177
3.20/3.26 v -x176 x175 x174 -x173 -x172 x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 -x162 x161 x160 -x159 x158 -x157 x156 -x155
3.20/3.26 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 x145 -x144 x143 -x142 x141 x140 -x139 x138 -x137 -x136 x135 x134 -x133 -x132
3.20/3.26 v x131 -x130 x129 x128 -x127 -x126 x125 x124 -x123 -x122 x121 -x120 x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 x110 -x109
3.20/3.26 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
3.20/3.26 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
3.20/3.26 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
3.20/3.26 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
3.20/3.26 c SCIP Status : problem is solved [optimal solution found]
3.20/3.26 c Solving Time : 3.14
3.20/3.26 c Original Problem :
3.20/3.26 c Problem name : HOME/instance-2666080-1276426821.opb
3.20/3.26 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.26 c Constraints : 300 initial, 300 maximal
3.20/3.26 c Presolved Problem :
3.20/3.26 c Problem name : t_HOME/instance-2666080-1276426821.opb
3.20/3.26 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.20/3.26 c Constraints : 300 initial, 330 maximal
3.20/3.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.20/3.26 c trivial : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c implics : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c probing : 0.00 0 0 0 0 0 0 0 0
3.20/3.26 c linear : 0.00 0 0 0 0 0 0 0 1
3.20/3.26 c logicor : 0.01 0 0 0 0 0 0 0 0
3.20/3.26 c root node : - 13 - - 13 - - - -
3.20/3.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.20/3.26 c integral : 0 0 0 1 0 0 0 0 0 2
3.20/3.26 c logicor : 300+ 20 1986 0 1 90 2589 0 0 0
3.20/3.26 c countsols : 0 0 0 0 1 0 0 0 0 0
3.20/3.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.20/3.26 c integral : 0.86 0.00 0.00 0.86 0.00
3.20/3.26 c logicor : 0.03 0.00 0.03 0.00 0.00
3.20/3.26 c countsols : 0.00 0.00 0.00 0.00 0.00
3.20/3.26 c Propagators : Time Calls Cutoffs DomReds
3.20/3.26 c vbounds : 0.00 2 0 0
3.20/3.26 c rootredcost : 0.00 1 0 0
3.20/3.26 c pseudoobj : 0.02 2016 1 0
3.20/3.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.20/3.26 c propagation : 0.00 90 89 89 3.7 86 3.8 -
3.20/3.26 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.20/3.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.20/3.26 c applied globally : - - - 175 3.7 - - -
3.20/3.26 c applied locally : - - - 0 0.0 - - -
3.20/3.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.20/3.26 c cut pool : 0.09 19 - - 592 - (maximal pool size: 2645)
3.20/3.26 c redcost : 0.00 20 0 0 0 0
3.20/3.26 c impliedbounds : 0.00 20 0 0 0 0
3.20/3.26 c intobj : 0.00 0 0 0 0 0
3.20/3.26 c cgmip : 0.00 0 0 0 0 0
3.20/3.26 c gomory : 0.87 20 0 0 5 0
3.20/3.26 c strongcg : 0.94 20 0 0 2922 0
3.20/3.26 c cmir : 0.02 10 0 0 0 0
3.20/3.26 c flowcover : 0.05 10 0 0 0 0
3.20/3.26 c clique : 0.00 1 0 0 0 0
3.20/3.26 c zerohalf : 0.00 0 0 0 0 0
3.20/3.26 c mcf : 0.00 1 0 0 0 0
3.20/3.26 c rapidlearning : 0.00 0 0 0 0 0
3.20/3.26 c Pricers : Time Calls Vars
3.20/3.26 c problem variables: 0.00 0 0
3.20/3.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.20/3.26 c relpscost : 0.86 1 0 0 0 0 2
3.20/3.26 c pscost : 0.00 0 0 0 0 0 0
3.20/3.26 c inference : 0.00 190 0 0 0 0 380
3.20/3.26 c mostinf : 0.00 0 0 0 0 0 0
3.20/3.26 c leastinf : 0.00 0 0 0 0 0 0
3.20/3.26 c fullstrong : 0.00 0 0 0 0 0 0
3.20/3.26 c allfullstrong : 0.00 0 0 0 0 0 0
3.20/3.26 c random : 0.00 0 0 0 0 0 0
3.20/3.26 c Primal Heuristics : Time Calls Found
3.20/3.26 c LP solutions : 0.00 - 0
3.20/3.26 c pseudo solutions : 0.00 - 1
3.20/3.26 c oneopt : 0.00 0 0
3.20/3.26 c crossover : 0.00 0 0
3.20/3.26 c trivial : 0.00 2 0
3.20/3.26 c simplerounding : 0.00 0 0
3.20/3.26 c zirounding : 0.00 1 0
3.20/3.26 c rounding : 0.00 20 0
3.20/3.26 c shifting : 0.02 20 0
3.20/3.26 c intshifting : 0.00 0 0
3.20/3.26 c twoopt : 0.00 0 0
3.20/3.26 c fixandinfer : 0.00 0 0
3.20/3.26 c feaspump : 0.01 1 0
3.20/3.26 c coefdiving : 0.00 0 0
3.20/3.26 c pscostdiving : 0.00 0 0
3.20/3.26 c fracdiving : 0.00 0 0
3.20/3.26 c veclendiving : 0.00 0 0
3.20/3.26 c intdiving : 0.00 0 0
3.20/3.26 c actconsdiving : 0.00 0 0
3.20/3.26 c objpscostdiving : 0.00 0 0
3.20/3.26 c rootsoldiving : 0.00 0 0
3.20/3.26 c linesearchdiving : 0.00 0 0
3.20/3.26 c guideddiving : 0.00 0 0
3.20/3.26 c octane : 0.00 0 0
3.20/3.26 c rens : 0.01 0 0
3.20/3.26 c rins : 0.00 0 0
3.20/3.26 c localbranching : 0.00 0 0
3.20/3.26 c mutation : 0.00 0 0
3.20/3.26 c dins : 0.00 0 0
3.20/3.26 c undercover : 0.00 0 0
3.20/3.26 c nlp : 0.00 0 0
3.20/3.26 c trysol : 0.00 0 0
3.20/3.26 c LP : Time Calls Iterations Iter/call Iter/sec
3.20/3.26 c primal LP : 0.01 0 0 0.00 0.00
3.20/3.26 c dual LP : 0.15 20 967 48.35 6446.67
3.20/3.26 c lex dual LP : 0.00 0 0 0.00 -
3.20/3.26 c barrier LP : 0.00 0 0 0.00 -
3.20/3.26 c diving/probing LP: 0.00 0 0 0.00 -
3.20/3.26 c strong branching : 0.86 36 5937 164.92 6903.49
3.20/3.26 c (at root node) : - 36 5937 164.92 -
3.20/3.26 c conflict analysis: 0.00 0 0 0.00 -
3.20/3.26 c B&B Tree :
3.20/3.26 c number of runs : 1
3.20/3.26 c nodes : 244
3.20/3.26 c nodes (total) : 244
3.20/3.26 c nodes left : 0
3.20/3.26 c max depth : 32
3.20/3.26 c max depth (total): 32
3.20/3.26 c backtracks : 47 (19.3%)
3.20/3.26 c delayed cutoffs : 139
3.20/3.26 c repropagations : 289 (1260 domain reductions, 39 cutoffs)
3.20/3.26 c avg switch length: 3.67
3.20/3.26 c switching time : 0.01
3.20/3.26 c Solution :
3.20/3.26 c Solutions found : 1 (1 improvements)
3.20/3.26 c First Solution : +1.00000000000000e+02 (in run 1, after 184 nodes, 3.12 seconds, depth 9, found by <relaxation>)
3.20/3.26 c Primal Bound : +1.00000000000000e+02 (in run 1, after 184 nodes, 3.12 seconds, depth 9, found by <relaxation>)
3.20/3.26 c Dual Bound : +1.00000000000000e+02
3.20/3.26 c Gap : 0.00 %
3.20/3.26 c Root Dual Bound : +6.74795179320374e+01
3.20/3.26 c Root Iterations : 967
3.20/3.27 c Time complete: 3.27.