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-2666103-1276448599.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.02/0.03 c presolving:
0.02/0.04 c (round 1) 0 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 0 clqs
0.02/0.04 c (round 2) 8 del vars, 75 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 820 impls, 0 clqs
0.02/0.05 c (round 3) 13 del vars, 99 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 846 impls, 0 clqs
0.02/0.05 c (round 4) 22 del vars, 176 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 856 impls, 0 clqs
0.02/0.05 c (round 5) 25 del vars, 212 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.02/0.05 c (round 6) 27 del vars, 230 del conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 994 impls, 0 clqs
0.02/0.07 c (round 7) 27 del vars, 247 del conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 1014 impls, 0 clqs
0.02/0.09 c (round 8) 27 del vars, 249 del conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 1014 impls, 0 clqs
0.09/0.10 c (round 9) 82 del vars, 249 del conss, 24 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 1826 impls, 0 clqs
0.09/0.10 c (round 10) 82 del vars, 613 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2232 impls, 0 clqs
0.09/0.11 c (round 11) 85 del vars, 624 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2232 impls, 0 clqs
0.09/0.11 c (round 12) 86 del vars, 629 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2232 impls, 0 clqs
0.09/0.11 c (round 13) 89 del vars, 636 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2232 impls, 0 clqs
0.09/0.11 c (round 14) 91 del vars, 652 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2270 impls, 0 clqs
0.09/0.12 c (round 15) 91 del vars, 663 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2284 impls, 0 clqs
0.09/0.12 c (round 16) 184 del vars, 663 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2932 impls, 0 clqs
0.09/0.12 c (round 17) 184 del vars, 937 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2954 impls, 0 clqs
0.09/0.13 c (round 18) 193 del vars, 943 del conss, 25 chg bounds, 17 chg sides, 0 chg coeffs, 703 upgd conss, 2954 impls, 0 clqs
0.09/0.13 c presolving (19 rounds):
0.09/0.13 c 193 deleted vars, 943 deleted constraints, 25 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.13 c 2962 implications, 0 cliques
0.09/0.13 c presolved problem has 7 variables (7 bin, 0 int, 0 impl, 0 cont) and 7 constraints
0.09/0.13 c 7 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.08
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.2
0.09/0.13 c
0.09/0.13 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c conflict/interconss = 0
0.09/0.13 c
0.09/0.13 c # should binary conflicts be preferred?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c conflict/preferbinary = TRUE
0.09/0.13 c
0.09/0.13 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c constraints/agelimit = 1
0.09/0.13 c
0.09/0.13 c # should enforcement of pseudo solution be disabled?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/disableenfops = TRUE
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1799.98
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c lp/solvefreq = 0
0.09/0.13 c
0.09/0.13 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.13 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.13 c lp/pricing = a
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # priority of node selection rule <dfs> in standard mode
0.09/0.13 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.13 c nodeselection/dfs/stdpriority = 1000000
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.09/0.13 o 97
0.09/0.13 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.13 c t 0.1s| 1 | 0 | 0 | - |1105k| 0 | - | 7 | 7 | 0 | 0 | 0 | 0 | 0 | -- | 9.700000e+01 | Inf
0.09/0.13 o 94
0.09/0.13 c b 0.1s| 1 | 0 | 0 | - |1110k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | -- | 9.400000e+01 | Inf
0.09/0.13 c 0.1s| 1 | 0 | 3 | - |1107k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.09/0.13 c 0.1s| 1 | 0 | 3 | - |1107k| 0 | - | 7 | 7 | 7 | 7 | 0 | 0 | 0 | 9.400000e+01 | 9.400000e+01 | 0.00%
0.09/0.13 c
0.09/0.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Solving Time (sec) : 0.08
0.09/0.13 c Solving Nodes : 1
0.09/0.13 c Primal Bound : +9.40000000000000e+01 (2 solutions)
0.09/0.13 c Dual Bound : +9.40000000000000e+01
0.09/0.13 c Gap : 0.00 %
0.09/0.13 s OPTIMUM FOUND
0.09/0.13 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.13 v -x177 x176 -x175 -x174 x173 x172 -x171 -x170 x169 -x168 x167 x166 -x165 -x164 x163 -x162 x161 -x160 -x159 x158 -x157 -x156
0.09/0.13 v x155 -x154 x153 -x152 x151 -x150 x149 x148 -x147 x146 -x145 -x144 x143 x142 -x141 x140 -x139 x138 -x137 -x136 x135 x134 -x133
0.09/0.13 v -x132 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.13 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.13 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.13 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 -x29
0.09/0.13 v 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.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Solving Time : 0.08
0.09/0.13 c Original Problem :
0.09/0.13 c Problem name : HOME/instance-2666103-1276448599.opb
0.09/0.13 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 950 initial, 950 maximal
0.09/0.13 c Presolved Problem :
0.09/0.13 c Problem name : t_HOME/instance-2666103-1276448599.opb
0.09/0.13 c Variables : 7 (7 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 7 initial, 7 maximal
0.09/0.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.13 c trivial : 0.00 5 0 0 0 0 0 0 0
0.09/0.13 c dualfix : 0.00 10 0 0 0 0 0 0 0
0.09/0.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c implics : 0.00 0 3 0 0 0 0 0 0
0.09/0.13 c probing : 0.01 140 8 0 0 0 0 0 0
0.09/0.13 c linear : 0.03 20 0 0 24 0 247 17 0
0.09/0.13 c logicor : 0.02 7 0 0 1 0 696 0 0
0.09/0.13 c root node : - 0 - - 0 - - - -
0.09/0.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.13 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.13 c logicor : 7 0 293 0 0 17 0 0 0 0
0.09/0.13 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.13 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c logicor : 0.01 0.00 0.01 0.00 0.00
0.09/0.13 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c Propagators : Time Calls Cutoffs DomReds
0.09/0.13 c vbounds : 0.00 2 0 0
0.09/0.13 c rootredcost : 0.00 0 0 0
0.09/0.13 c pseudoobj : 0.00 2 1 0
0.09/0.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.13 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c applied globally : - - - 0 0.0 - - -
0.09/0.13 c applied locally : - - - 0 0.0 - - -
0.09/0.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.13 c redcost : 0.00 0 0 0 0 0
0.09/0.13 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.13 c intobj : 0.00 0 0 0 0 0
0.09/0.13 c cgmip : 0.00 0 0 0 0 0
0.09/0.13 c gomory : 0.00 0 0 0 0 0
0.09/0.13 c strongcg : 0.00 0 0 0 0 0
0.09/0.13 c cmir : 0.00 0 0 0 0 0
0.09/0.13 c flowcover : 0.00 0 0 0 0 0
0.09/0.13 c clique : 0.00 0 0 0 0 0
0.09/0.13 c zerohalf : 0.00 0 0 0 0 0
0.09/0.13 c mcf : 0.00 0 0 0 0 0
0.09/0.13 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.13 c Pricers : Time Calls Vars
0.09/0.13 c problem variables: 0.00 0 0
0.09/0.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.13 c pscost : 0.00 0 0 0 0 0 0
0.09/0.13 c inference : 0.00 0 0 0 0 0 0
0.09/0.13 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.13 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.13 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c random : 0.00 0 0 0 0 0 0
0.09/0.13 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.13 c Primal Heuristics : Time Calls Found
0.09/0.13 c LP solutions : 0.00 - 0
0.09/0.13 c pseudo solutions : 0.00 - 0
0.09/0.13 c trivial : 0.01 2 1
0.09/0.13 c simplerounding : 0.00 0 0
0.09/0.13 c zirounding : 0.00 0 0
0.09/0.13 c rounding : 0.00 0 0
0.09/0.13 c shifting : 0.00 0 0
0.09/0.13 c intshifting : 0.00 0 0
0.09/0.13 c oneopt : 0.00 1 1
0.09/0.13 c twoopt : 0.00 0 0
0.09/0.13 c fixandinfer : 0.00 0 0
0.09/0.13 c feaspump : 0.00 0 0
0.09/0.13 c coefdiving : 0.00 0 0
0.09/0.13 c pscostdiving : 0.00 0 0
0.09/0.13 c fracdiving : 0.00 0 0
0.09/0.13 c veclendiving : 0.00 0 0
0.09/0.13 c intdiving : 0.00 0 0
0.09/0.13 c actconsdiving : 0.00 0 0
0.09/0.13 c objpscostdiving : 0.00 0 0
0.09/0.13 c rootsoldiving : 0.00 0 0
0.09/0.13 c linesearchdiving : 0.00 0 0
0.09/0.13 c guideddiving : 0.00 0 0
0.09/0.13 c octane : 0.00 0 0
0.09/0.13 c rens : 0.00 0 0
0.09/0.13 c rins : 0.00 0 0
0.09/0.13 c localbranching : 0.00 0 0
0.09/0.13 c mutation : 0.00 0 0
0.09/0.13 c crossover : 0.00 0 0
0.09/0.13 c dins : 0.00 0 0
0.09/0.13 c undercover : 0.00 0 0
0.09/0.13 c nlp : 0.00 0 0
0.09/0.13 c trysol : 0.00 0 0
0.09/0.13 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.13 c primal LP : 0.00 0 0 0.00 -
0.09/0.13 c dual LP : 0.00 1 3 3.00 -
0.09/0.13 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.13 c barrier LP : 0.00 0 0 0.00 -
0.09/0.13 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.13 c strong branching : 0.00 0 0 0.00 -
0.09/0.13 c (at root node) : - 0 0 0.00 -
0.09/0.13 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.13 c B&B Tree :
0.09/0.13 c number of runs : 1
0.09/0.13 c nodes : 1
0.09/0.13 c nodes (total) : 1
0.09/0.13 c nodes left : 0
0.09/0.13 c max depth : 0
0.09/0.13 c max depth (total): 0
0.09/0.13 c backtracks : 0 (0.0%)
0.09/0.13 c delayed cutoffs : 0
0.09/0.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.13 c avg switch length: 2.00
0.09/0.13 c switching time : 0.00
0.09/0.13 c Solution :
0.09/0.13 c Solutions found : 2 (2 improvements)
0.09/0.13 c First Solution : +9.70000000000000e+01 (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trivial>)
0.09/0.13 c Primal Bound : +9.40000000000000e+01 (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <oneopt>)
0.09/0.13 c Dual Bound : +9.40000000000000e+01
0.09/0.13 c Gap : 0.00 %
0.09/0.13 c Root Dual Bound : +9.40000000000000e+01
0.09/0.13 c Root Iterations : 3
0.09/0.14 c Time complete: 0.13.