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-2665403-1276642760.opb>
0.00/0.01 c original problem has 190 variables (190 bin, 0 int, 0 impl, 0 cont) and 419 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.01/0.02 o 92
0.01/0.02 c feasible solution found by trivial heuristic, objective value 9.200000e+01
0.01/0.02 c presolving:
0.01/0.02 c (round 1) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1558 impls, 0 clqs
0.01/0.04 c (round 2) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 323 upgd conss, 1558 impls, 0 clqs
0.01/0.04 c (round 3) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 337 upgd conss, 1558 impls, 0 clqs
0.01/0.05 c (0.0s) probing: 118/134 (88.1%) - 0 fixings, 3 aggregations, 28 implications, 0 bound changes
0.01/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.05 c (round 4) 59 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 337 upgd conss, 1608 impls, 0 clqs
0.01/0.05 c (0.0s) probing: 128/134 (95.5%) - 0 fixings, 3 aggregations, 28 implications, 0 bound changes
0.01/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.05 c presolving (5 rounds):
0.01/0.05 c 59 deleted vars, 82 deleted constraints, 30 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.05 c 1608 implications, 0 cliques
0.01/0.05 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 337 constraints
0.01/0.05 c 337 constraints of type <logicor>
0.01/0.05 c transformed objective value is always integral (scale: 1)
0.01/0.05 c Presolving Time: 0.03
0.01/0.05 c - non default parameters ----------------------------------------------------------------------
0.01/0.05 c # SCIP version 1.2.1.2
0.01/0.05 c
0.01/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05 c conflict/interconss = 0
0.01/0.05 c
0.01/0.05 c # should binary conflicts be preferred?
0.01/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05 c conflict/preferbinary = TRUE
0.01/0.05 c
0.01/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c constraints/agelimit = 1
0.01/0.05 c
0.01/0.05 c # should enforcement of pseudo solution be disabled?
0.01/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05 c constraints/disableenfops = TRUE
0.01/0.05 c
0.01/0.05 c # frequency for displaying node information lines
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.05 c display/freq = 10000
0.01/0.05 c
0.01/0.05 c # maximal time in seconds to run
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.05 c limits/time = 1799.99
0.01/0.05 c
0.01/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.05 c limits/memory = 1620
0.01/0.05 c
0.01/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c lp/solvefreq = 0
0.01/0.05 c
0.01/0.05 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.05 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.05 c lp/pricing = a
0.01/0.05 c
0.01/0.05 c # should presolving try to simplify inequalities
0.01/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05 c constraints/linear/simplifyinequalities = TRUE
0.01/0.05 c
0.01/0.05 c # should presolving try to simplify knapsacks
0.01/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.05 c
0.01/0.05 c # priority of node selection rule <dfs> in standard mode
0.01/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.05 c nodeselection/dfs/stdpriority = 1000000
0.01/0.05 c
0.01/0.05 c -----------------------------------------------------------------------------------------------
0.01/0.05 c start solving
0.01/0.05 c
0.01/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.01/0.06 c t 0.0s| 1 | 0 | 84 | - |1035k| 0 | 42 | 131 | 337 | 131 | 337 | 0 | 0 | 0 | 3.250000e+01 | 9.200000e+01 | 183.08%
0.01/0.06 o 39
0.01/0.06 c s 0.0s| 1 | 0 | 84 | - |1042k| 0 | 42 | 131 | 337 | 131 | 337 | 0 | 0 | 0 | 3.250000e+01 | 3.900000e+01 | 20.00%
0.01/0.09 c 0.1s| 1 | 0 | 107 | - |1052k| 0 | 20 | 131 | 337 | 131 | 338 | 1 | 0 | 0 | 3.250000e+01 | 3.900000e+01 | 20.00%
0.01/0.09 o 38
0.01/0.09 c b 0.1s| 1 | 0 | 107 | - |1057k| 0 | 20 | 131 | 337 | 131 | 338 | 1 | 0 | 0 | 3.250000e+01 | 3.800000e+01 | 16.92%
0.01/0.09 o 34
0.01/0.09 c R 0.1s| 1 | 0 | 107 | - |1057k| 0 | 20 | 131 | 337 | 131 | 338 | 1 | 0 | 0 | 3.250000e+01 | 3.400000e+01 | 4.62%
0.01/0.09 o 33
0.01/0.09 c s 0.1s| 1 | 0 | 107 | - |1059k| 0 | - | 131 | 337 | 131 | 338 | 1 | 0 | 0 | 3.250000e+01 | 3.300000e+01 | 1.54%
0.01/0.09 c 0.1s| 1 | 0 | 107 | - |1059k| 0 | - | 131 | 337 | 131 | 338 | 1 | 0 | 0 | 3.300000e+01 | 3.300000e+01 | 0.00%
0.01/0.09 c
0.01/0.09 c SCIP Status : problem is solved [optimal solution found]
0.01/0.09 c Solving Time (sec) : 0.07
0.01/0.09 c Solving Nodes : 1
0.01/0.09 c Primal Bound : +3.30000000000000e+01 (6 solutions)
0.01/0.09 c Dual Bound : +3.30000000000000e+01
0.01/0.09 c Gap : 0.00 %
0.01/0.09 s OPTIMUM FOUND
0.01/0.09 v x190 x187 -x184 -x183 -x182 x179 x176 -x173 -x172 x169 x166 -x162 -x160 -x167 x158 -x155 -x154 -x153 -x150 x146 -x142 -x148 -x141
0.01/0.09 v x140 x137 -x135 -x133 -x132 -x131 x121 -x118 x117 -x108 x105 -x103 -x99 -x106 -x98 -x97 x96 -x82 -x129 -x81 -x80 -x79 -x78
0.01/0.09 v x72 -x64 -x63 -x188 -x62 -x61 -x60 -x59 -x185 -x180 -x177 -x174 -x58 -x170 -x51 -x50 -x164 -x49 -x48 -x156 -x47 -x46 x45 -x40
0.01/0.09 v -x151 -x39 -x38 x37 -x144 -x138 -x36 -x35 -x115 -x34 -x31 -x30 -x29 -x28 x119 -x27 -x26 -x25 -x24 -x23 -x94 -x22 -x21 -x20
0.01/0.09 v -x19 -x76 -x70 -x6 -x189 -x186 -x181 -x178 -x175 -x171 -x168 -x165 -x163 -x161 -x159 -x157 -x152 -x149 -x147 -x145 -x143 -x139
0.01/0.09 v -x136 -x134 -x130 -x128 -x127 -x126 -x125 -x124 -x123 -x122 x120 -x116 -x114 -x113 -x112 -x111 -x110 -x109 -x107 -x104 -x102
0.01/0.09 v -x101 -x100 -x95 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x77 -x75 -x74 -x73 -x71 x69 x68 -x67 -x66 x65 x57
0.01/0.09 v x56 x55 x54 x53 x52 x44 x43 x42 x41 x33 x32 x18 x17 x16 x15 x14 x13 x12 x11 x10 x9 x8 x7 x5 x4 x3 x2 x1
0.01/0.09 c SCIP Status : problem is solved [optimal solution found]
0.01/0.09 c Solving Time : 0.07
0.01/0.09 c Original Problem :
0.01/0.09 c Problem name : HOME/instance-2665403-1276642760.opb
0.01/0.09 c Variables : 190 (190 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 419 initial, 419 maximal
0.01/0.09 c Presolved Problem :
0.01/0.09 c Problem name : t_HOME/instance-2665403-1276642760.opb
0.01/0.09 c Variables : 131 (131 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 337 initial, 337 maximal
0.01/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.01/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c probing : 0.01 0 3 0 0 0 0 0 0
0.01/0.09 c linear : 0.00 30 26 0 30 0 82 0 0
0.01/0.09 c logicor : 0.01 0 0 0 0 0 0 0 0
0.01/0.09 c root node : - 0 - - 0 - - - -
0.01/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.01/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c logicor : 337 1 270 0 0 0 0 0 0 0
0.01/0.09 c countsols : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.01/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c Propagators : Time Calls Cutoffs DomReds
0.01/0.09 c vbounds : 0.00 2 0 0
0.01/0.09 c rootredcost : 0.00 0 0 0
0.01/0.09 c pseudoobj : 0.00 2 0 0
0.01/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c applied globally : - - - 0 0.0 - - -
0.01/0.09 c applied locally : - - - 0 0.0 - - -
0.01/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 6)
0.01/0.09 c redcost : 0.00 1 0 0 0 0
0.01/0.09 c impliedbounds : 0.00 1 0 0 0 0
0.01/0.09 c intobj : 0.00 0 0 0 0 0
0.01/0.09 c cgmip : 0.00 0 0 0 0 0
0.01/0.09 c gomory : 0.02 1 0 0 230 0
0.01/0.09 c strongcg : 0.01 1 0 0 230 0
0.01/0.09 c cmir : 0.00 1 0 0 0 0
0.01/0.09 c flowcover : 0.00 1 0 0 0 0
0.01/0.09 c clique : 0.00 1 0 0 0 0
0.01/0.09 c zerohalf : 0.00 0 0 0 0 0
0.01/0.09 c mcf : 0.00 1 0 0 0 0
0.01/0.09 c rapidlearning : 0.00 0 0 0 0 0
0.01/0.09 c Pricers : Time Calls Vars
0.01/0.09 c problem variables: 0.00 0 0
0.01/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.09 c pscost : 0.00 0 0 0 0 0 0
0.01/0.09 c inference : 0.00 0 0 0 0 0 0
0.01/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c random : 0.00 0 0 0 0 0 0
0.01/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.09 c Primal Heuristics : Time Calls Found
0.01/0.09 c LP solutions : 0.00 - 0
0.01/0.09 c pseudo solutions : 0.00 - 0
0.01/0.09 c trivial : 0.00 2 2
0.01/0.09 c simplerounding : 0.00 0 0
0.01/0.09 c zirounding : 0.00 0 0
0.01/0.09 c rounding : 0.01 2 1
0.01/0.09 c shifting : 0.00 2 2
0.01/0.09 c intshifting : 0.00 0 0
0.01/0.09 c oneopt : 0.00 1 1
0.01/0.09 c twoopt : 0.00 0 0
0.01/0.09 c fixandinfer : 0.00 0 0
0.01/0.09 c feaspump : 0.00 0 0
0.01/0.09 c coefdiving : 0.00 0 0
0.01/0.09 c pscostdiving : 0.00 0 0
0.01/0.09 c fracdiving : 0.00 0 0
0.01/0.09 c veclendiving : 0.00 0 0
0.01/0.09 c intdiving : 0.00 0 0
0.01/0.09 c actconsdiving : 0.00 0 0
0.01/0.09 c objpscostdiving : 0.00 0 0
0.01/0.09 c rootsoldiving : 0.00 0 0
0.01/0.09 c linesearchdiving : 0.00 0 0
0.01/0.09 c guideddiving : 0.00 0 0
0.01/0.09 c octane : 0.00 0 0
0.01/0.09 c rens : 0.00 0 0
0.01/0.09 c rins : 0.00 0 0
0.01/0.09 c localbranching : 0.00 0 0
0.01/0.09 c mutation : 0.00 0 0
0.01/0.09 c crossover : 0.00 0 0
0.01/0.09 c dins : 0.00 0 0
0.01/0.09 c undercover : 0.00 0 0
0.01/0.09 c nlp : 0.00 0 0
0.01/0.09 c trysol : 0.00 0 0
0.01/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.09 c primal LP : 0.00 0 0 0.00 -
0.01/0.09 c dual LP : 0.00 2 107 53.50 -
0.01/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.01/0.09 c barrier LP : 0.00 0 0 0.00 -
0.01/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.09 c strong branching : 0.00 0 0 0.00 -
0.01/0.09 c (at root node) : - 0 0 0.00 -
0.01/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.09 c B&B Tree :
0.01/0.09 c number of runs : 1
0.01/0.09 c nodes : 1
0.01/0.09 c nodes (total) : 1
0.01/0.09 c nodes left : 0
0.01/0.09 c max depth : 0
0.01/0.09 c max depth (total): 0
0.01/0.09 c backtracks : 0 (0.0%)
0.01/0.09 c delayed cutoffs : 0
0.01/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.01/0.09 c avg switch length: 2.00
0.01/0.09 c switching time : 0.00
0.01/0.09 c Solution :
0.01/0.09 c Solutions found : 6 (5 improvements)
0.01/0.09 c First Solution : +9.20000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.01/0.09 c Primal Bound : +3.30000000000000e+01 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <shifting>)
0.01/0.09 c Dual Bound : +3.30000000000000e+01
0.01/0.09 c Gap : 0.00 %
0.01/0.09 c Root Dual Bound : +3.30000000000000e+01
0.01/0.09 c Root Iterations : 107
0.09/0.10 c Time complete: 0.09.