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-2666093-1276430139.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.01/0.02 c presolving:
0.01/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.01/0.04 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.01/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.04 c presolving (2 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 200 implications, 0 cliques
0.01/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.01/0.04 c 440 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1799.99
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = 0
0.01/0.04 c
0.01/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.01/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.07 c 0.1s| 1 | 0 | 297 | - |1163k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.666667e+01 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 468 | - |2578k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.700000e+01 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 707 | - |4025k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.713333e+01 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 933 | - |5223k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.727778e+01 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 1062 | - |6764k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.733333e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 1064 | - |8294k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.733333e+01 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 1188 | - |8385k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.735043e+01 | -- | Inf
1.00/1.08 c 1.0s| 1 | 0 | 1407 | - |9902k| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.737740e+01 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 1578 | - | 10M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.739472e+01 | -- | Inf
1.39/1.40 c 1.3s| 1 | 0 | 1713 | - | 11M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.739929e+01 | -- | Inf
1.49/1.57 c 1.5s| 1 | 0 | 1909 | - | 11M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.742216e+01 | -- | Inf
1.69/1.70 c 1.6s| 1 | 0 | 2040 | - | 11M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.743250e+01 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 2287 | - | 12M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.744733e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 2395 | - | 12M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 0 | 6.744907e+01 | -- | Inf
2.09/2.15 c 2.1s| 1 | 0 | 2588 | - | 12M| 0 | 200 | 200 | 440 | 200 | 454 | 14 | 0 | 0 | 6.745870e+01 | -- | Inf
2.20/2.29 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.20/2.29 c 2.2s| 1 | 0 | 2706 | - | 12M| 0 | 200 | 200 | 440 | 200 | 455 | 15 | 0 | 0 | 6.746041e+01 | -- | Inf
2.39/2.42 c 2.4s| 1 | 0 | 2766 | - | 12M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 0 | 6.746103e+01 | -- | Inf
5.79/5.88 c 5.7s| 1 | 2 | 2766 | - | 12M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 19 | 6.746103e+01 | -- | Inf
6.09/6.19 o 100
6.09/6.19 c * 6.0s| 867 | 2 | 2766 | 0.0 | 12M| 24 | - | 200 | 451 | 0 | 0 | 16 | 680 | 19 | 6.800000e+01 | 1.000000e+02 | 47.06%
6.19/6.26 c
6.19/6.26 c SCIP Status : problem is solved [optimal solution found]
6.19/6.26 c Solving Time (sec) : 6.05
6.19/6.26 c Solving Nodes : 1043
6.19/6.26 c Primal Bound : +1.00000000000000e+02 (1 solutions)
6.19/6.26 c Dual Bound : +1.00000000000000e+02
6.19/6.26 c Gap : 0.00 %
6.19/6.26 s OPTIMUM FOUND
6.19/6.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
6.19/6.26 v x177 x176 -x175 -x174 x173 x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 x158 -x157 x156 -x155
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.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
6.19/6.26 c SCIP Status : problem is solved [optimal solution found]
6.19/6.26 c Solving Time : 6.05
6.19/6.26 c Original Problem :
6.19/6.26 c Problem name : HOME/instance-2666093-1276430139.opb
6.19/6.26 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
6.19/6.26 c Constraints : 440 initial, 440 maximal
6.19/6.26 c Presolved Problem :
6.19/6.26 c Problem name : t_HOME/instance-2666093-1276430139.opb
6.19/6.26 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
6.19/6.26 c Constraints : 440 initial, 474 maximal
6.19/6.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.19/6.26 c trivial : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c implics : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c probing : 0.00 0 0 0 0 0 0 0 0
6.19/6.26 c logicor : 0.01 0 0 0 0 0 0 0 0
6.19/6.26 c root node : - 105 - - 105 - - - -
6.19/6.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.19/6.26 c integral : 0 0 0 1 0 0 0 0 0 2
6.19/6.26 c logicor : 440+ 17 8991 0 1 560 19819 0 0 0
6.19/6.26 c countsols : 0 0 0 0 1 0 0 0 0 0
6.19/6.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.19/6.26 c integral : 3.25 0.00 0.00 3.25 0.00
6.19/6.26 c logicor : 0.07 0.00 0.07 0.00 0.00
6.19/6.26 c countsols : 0.00 0.00 0.00 0.00 0.00
6.19/6.26 c Propagators : Time Calls Cutoffs DomReds
6.19/6.26 c vbounds : 0.00 2 0 0
6.19/6.26 c rootredcost : 0.01 1 0 0
6.19/6.26 c pseudoobj : 0.11 9602 0 0
6.19/6.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.19/6.26 c propagation : 0.01 560 551 551 4.1 251 3.8 -
6.19/6.26 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.19/6.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.19/6.26 c applied globally : - - - 802 4.0 - - -
6.19/6.26 c applied locally : - - - 0 0.0 - - -
6.19/6.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.19/6.26 c cut pool : 0.03 16 - - 1757 - (maximal pool size: 2237)
6.19/6.26 c redcost : 0.00 17 0 0 0 0
6.19/6.26 c impliedbounds : 0.01 17 0 0 0 0
6.19/6.26 c intobj : 0.00 0 0 0 0 0
6.19/6.26 c cgmip : 0.00 0 0 0 0 0
6.19/6.26 c gomory : 0.85 17 0 0 0 0
6.19/6.26 c strongcg : 0.89 17 0 0 2777 0
6.19/6.26 c cmir : 0.04 10 0 0 0 0
6.19/6.26 c flowcover : 0.07 10 0 0 0 0
6.19/6.26 c clique : 0.00 1 0 0 0 0
6.19/6.26 c zerohalf : 0.00 0 0 0 0 0
6.19/6.26 c mcf : 0.00 1 0 0 0 0
6.19/6.26 c rapidlearning : 0.00 0 0 0 0 0
6.19/6.26 c Pricers : Time Calls Vars
6.19/6.26 c problem variables: 0.00 0 0
6.19/6.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.19/6.26 c relpscost : 3.25 1 0 0 0 0 2
6.19/6.26 c pscost : 0.00 0 0 0 0 0 0
6.19/6.26 c inference : 0.02 711 0 0 0 0 1422
6.19/6.26 c mostinf : 0.00 0 0 0 0 0 0
6.19/6.26 c leastinf : 0.00 0 0 0 0 0 0
6.19/6.26 c fullstrong : 0.00 0 0 0 0 0 0
6.19/6.26 c allfullstrong : 0.00 0 0 0 0 0 0
6.19/6.26 c random : 0.00 0 0 0 0 0 0
6.19/6.26 c Primal Heuristics : Time Calls Found
6.19/6.26 c LP solutions : 0.00 - 0
6.19/6.26 c pseudo solutions : 0.00 - 1
6.19/6.26 c oneopt : 0.00 0 0
6.19/6.26 c crossover : 0.00 0 0
6.19/6.26 c trivial : 0.00 2 0
6.19/6.26 c simplerounding : 0.00 0 0
6.19/6.26 c zirounding : 0.00 1 0
6.19/6.26 c rounding : 0.00 17 0
6.19/6.26 c shifting : 0.00 17 0
6.19/6.26 c intshifting : 0.00 0 0
6.19/6.26 c twoopt : 0.00 0 0
6.19/6.26 c fixandinfer : 0.00 0 0
6.19/6.26 c feaspump : 0.00 1 0
6.19/6.26 c coefdiving : 0.00 0 0
6.19/6.26 c pscostdiving : 0.00 0 0
6.19/6.26 c fracdiving : 0.00 0 0
6.19/6.26 c veclendiving : 0.00 0 0
6.19/6.26 c intdiving : 0.00 0 0
6.19/6.26 c actconsdiving : 0.00 0 0
6.19/6.26 c objpscostdiving : 0.00 0 0
6.19/6.26 c rootsoldiving : 0.00 0 0
6.19/6.26 c linesearchdiving : 0.00 0 0
6.19/6.26 c guideddiving : 0.00 0 0
6.19/6.26 c octane : 0.00 0 0
6.19/6.26 c rens : 0.00 0 0
6.19/6.26 c rins : 0.00 0 0
6.19/6.26 c localbranching : 0.00 0 0
6.19/6.26 c mutation : 0.00 0 0
6.19/6.26 c dins : 0.00 0 0
6.19/6.26 c undercover : 0.00 0 0
6.19/6.26 c nlp : 0.00 0 0
6.19/6.26 c trysol : 0.00 0 0
6.19/6.26 c LP : Time Calls Iterations Iter/call Iter/sec
6.19/6.26 c primal LP : 0.00 0 0 0.00 -
6.19/6.26 c dual LP : 0.55 17 2766 162.71 5029.09
6.19/6.26 c lex dual LP : 0.00 0 0 0.00 -
6.19/6.26 c barrier LP : 0.00 0 0 0.00 -
6.19/6.26 c diving/probing LP: 0.00 0 0 0.00 -
6.19/6.26 c strong branching : 3.25 19 15577 819.84 4792.92
6.19/6.26 c (at root node) : - 19 15577 819.84 -
6.19/6.26 c conflict analysis: 0.00 0 0 0.00 -
6.19/6.26 c B&B Tree :
6.19/6.26 c number of runs : 1
6.19/6.26 c nodes : 1043
6.19/6.26 c nodes (total) : 1043
6.19/6.26 c nodes left : 0
6.19/6.26 c max depth : 24
6.19/6.26 c max depth (total): 24
6.19/6.26 c backtracks : 262 (25.1%)
6.19/6.26 c delayed cutoffs : 382
6.19/6.26 c repropagations : 1091 (9723 domain reductions, 230 cutoffs)
6.19/6.26 c avg switch length: 3.14
6.19/6.26 c switching time : 0.05
6.19/6.26 c Solution :
6.19/6.26 c Solutions found : 1 (1 improvements)
6.19/6.26 c First Solution : +1.00000000000000e+02 (in run 1, after 867 nodes, 5.99 seconds, depth 7, found by <relaxation>)
6.19/6.26 c Primal Bound : +1.00000000000000e+02 (in run 1, after 867 nodes, 5.99 seconds, depth 7, found by <relaxation>)
6.19/6.26 c Dual Bound : +1.00000000000000e+02
6.19/6.26 c Gap : 0.00 %
6.19/6.26 c Root Dual Bound : +6.74610259082141e+01
6.19/6.26 c Root Iterations : 2766
6.19/6.27 c Time complete: 6.27.