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-2666062-1276418054.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, 3 chg coeffs, 0 upgd conss, 224 impls, 0 clqs
0.00/0.04 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 440 upgd conss, 224 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, 3 changed coefficients
0.00/0.04 c 224 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.07/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.09 c 0.1s| 1 | 0 | 363 | - |1164k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.766667e+01 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 602 | - |2692k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.808944e+01 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 832 | - |4181k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.822026e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 982 | - |5666k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.826190e+01 | -- | Inf
0.60/0.69 c 0.6s| 1 | 0 | 1193 | - |7041k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.830753e+01 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 1332 | - |8443k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.832164e+01 | -- | Inf
0.89/1.00 c 0.9s| 1 | 0 | 1481 | - |9829k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.833212e+01 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 1571 | - | 10M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.833716e+01 | -- | Inf
1.29/1.31 c 1.2s| 1 | 0 | 1797 | - | 10M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.836145e+01 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 1983 | - | 11M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.837224e+01 | -- | Inf
1.59/1.61 c 1.5s| 1 | 0 | 2060 | - | 11M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.837321e+01 | -- | Inf
1.69/1.76 c 1.7s| 1 | 0 | 2259 | - | 11M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.837867e+01 | -- | Inf
1.89/1.91 c 1.8s| 1 | 0 | 2400 | - | 11M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.838116e+01 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 2548 | - | 11M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 0 | 6.838610e+01 | -- | Inf
9.48/9.51 c 9.3s| 1 | 2 | 2548 | - | 11M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 48 | 6.838610e+01 | -- | Inf
9.69/9.78 o 100
9.69/9.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
9.69/9.78 c * 9.5s| 793 | 5 | 2548 | 0.0 | 11M| 20 | - | 200 | 449 | 0 | 0 | 13 | 566 | 48 | 6.964064e+01 | 1.000000e+02 | 43.59%
9.80/9.81 c
9.80/9.81 c SCIP Status : problem is solved [optimal solution found]
9.80/9.81 c Solving Time (sec) : 9.54
9.80/9.81 c Solving Nodes : 859
9.80/9.81 c Primal Bound : +1.00000000000000e+02 (1 solutions)
9.80/9.81 c Dual Bound : +1.00000000000000e+02
9.80/9.81 c Gap : 0.00 %
9.80/9.81 s OPTIMUM FOUND
9.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 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.80/9.81 c SCIP Status : problem is solved [optimal solution found]
9.80/9.81 c Solving Time : 9.54
9.80/9.81 c Original Problem :
9.80/9.81 c Problem name : HOME/instance-2666062-1276418054.opb
9.80/9.81 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.80/9.81 c Constraints : 440 initial, 440 maximal
9.80/9.81 c Presolved Problem :
9.80/9.81 c Problem name : t_HOME/instance-2666062-1276418054.opb
9.80/9.81 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.80/9.81 c Constraints : 440 initial, 467 maximal
9.80/9.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.80/9.81 c trivial : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c implics : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c probing : 0.00 0 0 0 0 0 0 0 0
9.80/9.81 c linear : 0.01 0 0 0 0 0 0 0 3
9.80/9.81 c logicor : 0.01 0 0 0 0 0 0 0 0
9.80/9.81 c root node : - 19 - - 19 - - - -
9.80/9.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.80/9.81 c integral : 0 0 0 1 0 0 0 0 0 2
9.80/9.81 c logicor : 440+ 14 6921 0 1 458 14530 0 0 0
9.80/9.81 c countsols : 0 0 0 0 1 0 0 0 0 0
9.80/9.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.80/9.81 c integral : 7.19 0.00 0.00 7.19 0.00
9.80/9.81 c logicor : 0.06 0.00 0.06 0.00 0.00
9.80/9.81 c countsols : 0.00 0.00 0.00 0.00 0.00
9.80/9.81 c Propagators : Time Calls Cutoffs DomReds
9.80/9.81 c vbounds : 0.00 2 0 0
9.80/9.81 c rootredcost : 0.00 1 0 0
9.80/9.81 c pseudoobj : 0.07 7489 0 0
9.80/9.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.80/9.81 c propagation : 0.01 458 448 448 3.9 158 3.9 -
9.80/9.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.80/9.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.80/9.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.80/9.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.80/9.81 c applied globally : - - - 606 3.9 - - -
9.80/9.81 c applied locally : - - - 0 0.0 - - -
9.80/9.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.80/9.81 c cut pool : 0.01 13 - - 717 - (maximal pool size: 1923)
9.80/9.81 c redcost : 0.00 14 0 0 0 0
9.80/9.81 c impliedbounds : 0.00 14 0 0 0 0
9.80/9.81 c intobj : 0.00 0 0 0 0 0
9.80/9.81 c cgmip : 0.00 0 0 0 0 0
9.80/9.81 c gomory : 0.74 14 0 0 37 0
9.80/9.81 c strongcg : 0.70 14 0 0 2174 0
9.80/9.81 c cmir : 0.06 10 0 0 0 0
9.80/9.81 c flowcover : 0.06 10 0 0 0 0
9.80/9.81 c clique : 0.00 1 0 0 0 0
9.80/9.81 c zerohalf : 0.00 0 0 0 0 0
9.80/9.81 c mcf : 0.00 1 0 0 0 0
9.80/9.81 c rapidlearning : 0.00 0 0 0 0 0
9.80/9.81 c Pricers : Time Calls Vars
9.80/9.81 c problem variables: 0.00 0 0
9.80/9.81 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.80/9.81 c relpscost : 7.19 1 0 0 0 0 2
9.80/9.81 c pscost : 0.00 0 0 0 0 0 0
9.80/9.81 c inference : 0.02 580 0 0 0 0 1160
9.80/9.81 c mostinf : 0.00 0 0 0 0 0 0
9.80/9.81 c leastinf : 0.00 0 0 0 0 0 0
9.80/9.81 c fullstrong : 0.00 0 0 0 0 0 0
9.80/9.81 c allfullstrong : 0.00 0 0 0 0 0 0
9.80/9.81 c random : 0.00 0 0 0 0 0 0
9.80/9.81 c Primal Heuristics : Time Calls Found
9.80/9.81 c LP solutions : 0.00 - 0
9.80/9.81 c pseudo solutions : 0.00 - 1
9.80/9.81 c oneopt : 0.00 0 0
9.80/9.81 c crossover : 0.00 0 0
9.80/9.81 c trivial : 0.00 2 0
9.80/9.81 c simplerounding : 0.00 0 0
9.80/9.81 c zirounding : 0.00 1 0
9.80/9.81 c rounding : 0.01 14 0
9.80/9.81 c shifting : 0.02 14 0
9.80/9.81 c intshifting : 0.00 0 0
9.80/9.81 c twoopt : 0.00 0 0
9.80/9.81 c fixandinfer : 0.00 0 0
9.80/9.81 c feaspump : 0.00 1 0
9.80/9.81 c coefdiving : 0.00 0 0
9.80/9.81 c pscostdiving : 0.00 0 0
9.80/9.81 c fracdiving : 0.00 0 0
9.80/9.81 c veclendiving : 0.00 0 0
9.80/9.81 c intdiving : 0.00 0 0
9.80/9.81 c actconsdiving : 0.00 0 0
9.80/9.81 c objpscostdiving : 0.00 0 0
9.80/9.81 c rootsoldiving : 0.00 0 0
9.80/9.81 c linesearchdiving : 0.00 0 0
9.80/9.81 c guideddiving : 0.00 0 0
9.80/9.81 c octane : 0.00 0 0
9.80/9.81 c rens : 0.00 0 0
9.80/9.81 c rins : 0.00 0 0
9.80/9.81 c localbranching : 0.00 0 0
9.80/9.81 c mutation : 0.00 0 0
9.80/9.81 c dins : 0.00 0 0
9.80/9.81 c undercover : 0.00 0 0
9.80/9.81 c nlp : 0.00 0 0
9.80/9.81 c trysol : 0.00 0 0
9.80/9.81 c LP : Time Calls Iterations Iter/call Iter/sec
9.80/9.81 c primal LP : 0.00 0 0 0.00 -
9.80/9.81 c dual LP : 0.44 14 2548 182.00 5790.91
9.80/9.81 c lex dual LP : 0.00 0 0 0.00 -
9.80/9.81 c barrier LP : 0.00 0 0 0.00 -
9.80/9.81 c diving/probing LP: 0.00 0 0 0.00 -
9.80/9.81 c strong branching : 7.19 48 39223 817.15 5455.22
9.80/9.81 c (at root node) : - 48 39223 817.15 -
9.80/9.81 c conflict analysis: 0.00 0 0 0.00 -
9.80/9.81 c B&B Tree :
9.80/9.81 c number of runs : 1
9.80/9.81 c nodes : 859
9.80/9.81 c nodes (total) : 859
9.80/9.81 c nodes left : 0
9.80/9.81 c max depth : 20
9.80/9.81 c max depth (total): 20
9.80/9.81 c backtracks : 207 (24.1%)
9.80/9.81 c delayed cutoffs : 304
9.80/9.81 c repropagations : 970 (6902 domain reductions, 181 cutoffs)
9.80/9.81 c avg switch length: 3.30
9.80/9.81 c switching time : 0.03
9.80/9.81 c Solution :
9.80/9.81 c Solutions found : 1 (1 improvements)
9.80/9.81 c First Solution : +1.00000000000000e+02 (in run 1, after 793 nodes, 9.51 seconds, depth 15, found by <relaxation>)
9.80/9.81 c Primal Bound : +1.00000000000000e+02 (in run 1, after 793 nodes, 9.51 seconds, depth 15, found by <relaxation>)
9.80/9.81 c Dual Bound : +1.00000000000000e+02
9.80/9.81 c Gap : 0.00 %
9.80/9.81 c Root Dual Bound : +6.83860999560910e+01
9.80/9.81 c Root Iterations : 2548
9.80/9.83 c Time complete: 9.82.