0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664698-1276464729.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 786 impls, 0 clqs
0.00/0.04 c (round 2) 12 del vars, 79 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 0 clqs
0.00/0.04 c (round 3) 19 del vars, 142 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 884 impls, 0 clqs
0.00/0.05 c (round 4) 23 del vars, 184 del conss, 20 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 946 impls, 0 clqs
0.00/0.05 c (round 5) 26 del vars, 225 del conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 956 impls, 0 clqs
0.00/0.05 c (round 6) 30 del vars, 253 del conss, 27 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1014 impls, 0 clqs
0.05/0.05 c (round 7) 31 del vars, 263 del conss, 28 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1080 impls, 0 clqs
0.05/0.09 c (round 8) 31 del vars, 283 del conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 1096 impls, 0 clqs
0.09/0.12 c (round 9) 83 del vars, 283 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6444 impls, 0 clqs
0.09/0.12 c (round 10) 83 del vars, 555 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6598 impls, 0 clqs
0.09/0.13 c (round 11) 83 del vars, 563 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6598 impls, 0 clqs
0.09/0.14 c (round 12) 85 del vars, 563 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6700 impls, 0 clqs
0.09/0.14 c (round 13) 85 del vars, 623 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6806 impls, 0 clqs
0.09/0.14 c (round 14) 85 del vars, 627 del conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6806 impls, 0 clqs
0.09/0.14 c presolving (15 rounds):
0.09/0.14 c 85 deleted vars, 627 deleted constraints, 30 tightened bounds, 0 added holes, 18 changed sides, 0 changed coefficients
0.09/0.14 c 6806 implications, 0 cliques
0.09/0.14 c presolved problem has 115 variables (115 bin, 0 int, 0 impl, 0 cont) and 273 constraints
0.09/0.14 c 273 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.09
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.14 c # SCIP version 1.2.1.2
0.09/0.14 c
0.09/0.14 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c conflict/interconss = 0
0.09/0.14 c
0.09/0.14 c # should binary conflicts be preferred?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c conflict/preferbinary = TRUE
0.09/0.14 c
0.09/0.14 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c constraints/agelimit = 1
0.09/0.14 c
0.09/0.14 c # should enforcement of pseudo solution be disabled?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/disableenfops = TRUE
0.09/0.14 c
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = 10000
0.09/0.14 c
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = 1799.98
0.09/0.14 c
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = 1620
0.09/0.14 c
0.09/0.14 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c lp/solvefreq = -1
0.09/0.14 c
0.09/0.14 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.09/0.14 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.14 c lp/pricing = a
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # priority of node selection rule <dfs> in standard mode
0.09/0.14 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.14 c nodeselection/dfs/stdpriority = 1000000
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.14 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.14 c 0.1s| 1 | 2 | 0 | - |1217k| 0 | - | 115 | 273 | 0 | 0 | 0 | 0 | 0 | 4.200000e+01 | -- | Inf
0.09/0.15 o 98
0.09/0.15 c * 0.1s| 21 | 2 | 0 | 0.0 |1227k| 9 | - | 115 | 277 | 0 | 0 | 0 | 7 | 0 | 4.300000e+01 | 9.800000e+01 | 127.91%
0.09/0.15 o 93
0.09/0.15 c * 0.1s| 43 | 8 | 0 | 0.0 |1188k| 19 | - | 115 | 241 | 0 | 0 | 0 | 11 | 0 | 5.700000e+01 | 9.300000e+01 | 63.16%
0.09/0.16 o 92
0.09/0.16 c * 0.1s| 73 | 7 | 0 | 0.0 |1191k| 19 | - | 115 | 247 | 0 | 0 | 0 | 28 | 0 | 5.700000e+01 | 9.200000e+01 | 61.40%
0.09/0.19 c
0.09/0.19 c SCIP Status : problem is solved [optimal solution found]
0.09/0.19 c Solving Time (sec) : 0.13
0.09/0.19 c Solving Nodes : 201
0.09/0.19 c Primal Bound : +9.20000000000000e+01 (3 solutions)
0.09/0.19 c Dual Bound : +9.20000000000000e+01
0.09/0.19 c Gap : 0.00 %
0.09/0.19 s OPTIMUM FOUND
0.09/0.19 v -x200 x199 -x198 x197 -x196 x195 x194 -x193 -x192 x191 -x190 x189 x188 -x187 x186 -x185 -x184 -x183 -x182 x181 -x180 x179 -x178
0.09/0.19 v -x177 x176 -x175 -x174 x173 -x172 x171 -x170 x169 -x168 x167 x166 -x165 -x164 x163 -x162 x161 x160 -x159 -x158 x157 -x156 x155
0.09/0.19 v -x154 x153 x152 -x151 -x150 x149 x148 -x147 -x146 x145 -x144 x143 x142 -x141 -x140 x139 -x138 x137 -x136 x135 x134 -x133 -x132
0.09/0.19 v x131 -x130 x129 -x128 x127 -x126 x125 -x124 x123 x122 -x121 -x120 x119 -x118 x117 -x116 x115 -x114 x113 -x112 x111 -x110
0.09/0.19 v x109 -x108 x107 -x106 -x105 -x104 x103 x102 -x101 x100 -x99 -x98 x97 -x96 x95 -x94 -x93 -x92 x91 -x90 x89 -x88 x87 -x86 x85
0.09/0.19 v x84 -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
0.09/0.19 v x56 -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
0.09/0.19 v -x29 x28 -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
0.09/0.19 c SCIP Status : problem is solved [optimal solution found]
0.09/0.19 c Solving Time : 0.13
0.09/0.19 c Original Problem :
0.09/0.19 c Problem name : HOME/instance-2664698-1276464729.opb
0.09/0.19 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.19 c Constraints : 900 initial, 900 maximal
0.09/0.19 c Presolved Problem :
0.09/0.19 c Problem name : t_HOME/instance-2664698-1276464729.opb
0.09/0.19 c Variables : 115 (115 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.19 c Constraints : 273 initial, 278 maximal
0.09/0.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.19 c trivial : 0.00 6 0 0 0 0 0 0 0
0.09/0.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c implics : 0.00 0 3 0 0 0 0 0 0
0.09/0.19 c probing : 0.04 43 11 0 2 0 0 0 0
0.09/0.19 c linear : 0.03 22 0 0 28 0 281 18 0
0.09/0.19 c logicor : 0.02 0 0 0 0 0 346 0 0
0.09/0.19 c root node : - 111 - - 111 - - - -
0.09/0.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.19 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.19 c logicor : 273+ 0 1698 0 3 114 1591 0 0 0
0.09/0.19 c countsols : 0 0 0 0 3 0 0 0 0 0
0.09/0.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.19 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.19 c logicor : 0.04 0.00 0.04 0.00 0.00
0.09/0.19 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.19 c Propagators : Time Calls Cutoffs DomReds
0.09/0.19 c vbounds : 0.00 2 0 0
0.09/0.19 c rootredcost : 0.00 0 0 0
0.09/0.19 c pseudoobj : 0.01 1075 10 1218
0.09/0.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.19 c propagation : 0.01 105 103 103 4.4 2 2.5 -
0.09/0.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c pseudo solution : 0.00 1 1 1 1.0 0 0.0 -
0.09/0.19 c applied globally : - - - 106 4.3 - - -
0.09/0.19 c applied locally : - - - 0 0.0 - - -
0.09/0.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.19 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.19 c redcost : 0.00 0 0 0 0 0
0.09/0.19 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.19 c intobj : 0.00 0 0 0 0 0
0.09/0.19 c cgmip : 0.00 0 0 0 0 0
0.09/0.19 c gomory : 0.00 0 0 0 0 0
0.09/0.19 c strongcg : 0.00 0 0 0 0 0
0.09/0.19 c cmir : 0.00 0 0 0 0 0
0.09/0.19 c flowcover : 0.00 0 0 0 0 0
0.09/0.19 c clique : 0.00 0 0 0 0 0
0.09/0.19 c zerohalf : 0.00 0 0 0 0 0
0.09/0.19 c mcf : 0.00 0 0 0 0 0
0.09/0.19 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.19 c Pricers : Time Calls Vars
0.09/0.19 c problem variables: 0.00 0 0
0.09/0.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.19 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.19 c pscost : 0.00 0 0 0 0 0 0
0.09/0.19 c inference : 0.00 140 0 0 0 0 280
0.09/0.19 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.19 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.19 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.19 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.19 c random : 0.00 0 0 0 0 0 0
0.09/0.19 c Primal Heuristics : Time Calls Found
0.09/0.19 c LP solutions : 0.00 - 0
0.09/0.19 c pseudo solutions : 0.00 - 3
0.09/0.19 c oneopt : 0.00 0 0
0.09/0.19 c trivial : 0.00 2 0
0.09/0.19 c simplerounding : 0.00 0 0
0.09/0.19 c zirounding : 0.00 0 0
0.09/0.19 c rounding : 0.00 0 0
0.09/0.19 c shifting : 0.00 0 0
0.09/0.19 c intshifting : 0.00 0 0
0.09/0.19 c twoopt : 0.00 0 0
0.09/0.19 c fixandinfer : 0.00 0 0
0.09/0.19 c feaspump : 0.00 0 0
0.09/0.19 c coefdiving : 0.00 0 0
0.09/0.19 c pscostdiving : 0.00 0 0
0.09/0.19 c fracdiving : 0.00 0 0
0.09/0.19 c veclendiving : 0.00 0 0
0.09/0.19 c intdiving : 0.00 0 0
0.09/0.19 c actconsdiving : 0.00 0 0
0.09/0.19 c objpscostdiving : 0.00 0 0
0.09/0.19 c rootsoldiving : 0.00 0 0
0.09/0.19 c linesearchdiving : 0.00 0 0
0.09/0.19 c guideddiving : 0.00 0 0
0.09/0.19 c octane : 0.00 0 0
0.09/0.19 c rens : 0.00 0 0
0.09/0.19 c rins : 0.00 0 0
0.09/0.19 c localbranching : 0.00 0 0
0.09/0.19 c mutation : 0.00 0 0
0.09/0.19 c crossover : 0.00 0 0
0.09/0.19 c dins : 0.00 0 0
0.09/0.19 c undercover : 0.00 0 0
0.09/0.19 c nlp : 0.00 0 0
0.09/0.19 c trysol : 0.00 0 0
0.09/0.19 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.19 c primal LP : 0.00 0 0 0.00 -
0.09/0.19 c dual LP : 0.00 0 0 0.00 -
0.09/0.19 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.19 c barrier LP : 0.00 0 0 0.00 -
0.09/0.19 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.19 c strong branching : 0.00 0 0 0.00 -
0.09/0.19 c (at root node) : - 0 0 0.00 -
0.09/0.19 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.19 c B&B Tree :
0.09/0.19 c number of runs : 1
0.09/0.19 c nodes : 201
0.09/0.19 c nodes (total) : 201
0.09/0.19 c nodes left : 0
0.09/0.19 c max depth : 19
0.09/0.19 c max depth (total): 19
0.09/0.19 c backtracks : 53 (26.4%)
0.09/0.19 c delayed cutoffs : 69
0.09/0.19 c repropagations : 148 (1344 domain reductions, 48 cutoffs)
0.09/0.19 c avg switch length: 2.52
0.09/0.19 c switching time : 0.01
0.09/0.19 c Solution :
0.09/0.19 c Solutions found : 3 (3 improvements)
0.09/0.19 c First Solution : +9.80000000000000e+01 (in run 1, after 21 nodes, 0.10 seconds, depth 8, found by <relaxation>)
0.09/0.19 c Primal Bound : +9.20000000000000e+01 (in run 1, after 73 nodes, 0.11 seconds, depth 12, found by <relaxation>)
0.09/0.19 c Dual Bound : +9.20000000000000e+01
0.09/0.19 c Gap : 0.00 %
0.09/0.19 c Root Dual Bound : +4.20000000000000e+01
0.09/0.19 c Root Iterations : 0
0.09/0.20 c Time complete: 0.19.