0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3485033-1307779625.opb>
0.00/0.00 c original problem has 162 variables (162 bin, 0 int, 0 impl, 0 cont) and 19 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 9 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 2256 impls, 0 clqs
0.00/0.01 c (round 2) 21 del vars, 10 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 10 upgd conss, 3216 impls, 0 clqs
0.00/0.02 c (round 3) 33 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 10 upgd conss, 4056 impls, 0 clqs
0.00/0.02 c (round 4) 45 del vars, 30 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 10 upgd conss, 4776 impls, 0 clqs
0.00/0.02 c (round 5) 57 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 80 chg coeffs, 10 upgd conss, 5376 impls, 0 clqs
0.00/0.02 c (round 6) 69 del vars, 50 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 10 upgd conss, 5856 impls, 0 clqs
0.00/0.02 c (round 7) 81 del vars, 60 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 100 chg coeffs, 10 upgd conss, 6216 impls, 0 clqs
0.00/0.02 c (round 8) 93 del vars, 70 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 110 chg coeffs, 10 upgd conss, 6456 impls, 0 clqs
0.00/0.02 c (round 9) 105 del vars, 80 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 120 chg coeffs, 10 upgd conss, 6576 impls, 0 clqs
0.00/0.02 c (round 10) 117 del vars, 90 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 130 chg coeffs, 10 upgd conss, 6576 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 187/369 (50.7%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (11 rounds):
0.00/0.03 c 117 deleted vars, 90 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 130 changed coefficients
0.00/0.03 c 6612 implications, 0 cliques
0.00/0.03 c presolved problem has 369 variables (369 bin, 0 int, 0 impl, 0 cont) and 244 constraints
0.00/0.03 c 225 constraints of type <and>
0.00/0.03 c 9 constraints of type <linear>
0.00/0.03 c 10 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 2)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.4
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 22 | - |1649k| 0 | 12 | 369 | 244 | 369 | 469 | 0 | 8 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 o 3
0.09/0.13 c U 0.1s| 1 | 0 | 242 | - |1677k| 0 | - | 369 | 244 | 369 | 469 | 0 | 8 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.14 c 0.1s| 1 | 0 | 242 | - |1671k| 0 | - | 369 | 244 | 369 | 469 | 0 | 8 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.14 c
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Solving Time (sec) : 0.13
0.09/0.14 c Solving Nodes : 1
0.09/0.14 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.09/0.14 c Dual Bound : +3.00000000000000e+00
0.09/0.14 c Gap : 0.00 %
0.09/0.14 s OPTIMUM FOUND
0.09/0.14 v -x162 x161 x160 x159 x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 x108 x107 -x106 x105 x104 x103 -x150 -x149 -x148 -x147 x146
0.09/0.14 v -x145 x102 x101 x100 x99 -x98 x97 -x144 -x143 -x142 -x141 -x140 -x139 x96 x95 x94 x93 x92 x91 -x138 -x137 -x136 -x135 -x134 -x133
0.09/0.14 v -x90 x89 -x88 x87 -x86 x85 -x132 -x131 -x130 -x129 x128 -x127 -x84 -x83 -x82 x81 x80 x79 -x126 -x125 -x124 -x123 -x122 -x121
0.09/0.14 v x78 -x77 x76 x75 -x74 x73 -x120 -x119 -x118 -x117 -x116 -x115 -x72 -x71 x70 x69 x68 x67 -x114 -x113 -x112 -x111 -x110 x109
0.09/0.14 v -x66 -x65 -x64 x63 -x62 x61 x60 -x59 -x58 -x57 x56 x55 -x54 -x53 -x52 -x51 x50 x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40
0.09/0.14 v -x39 x38 x37 -x36 -x35 -x34 -x33 x32 x31 -x30 -x29 -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 x20 x19 -x18 -x17 -x16 -x15 x14
0.09/0.14 v x13 -x12 x11 -x10 x9 x8 x7 -x6 -x5 -x4 -x3 x2 x1
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Total Time : 0.13
0.09/0.14 c solving : 0.13
0.09/0.14 c presolving : 0.02 (included in solving)
0.09/0.14 c reading : 0.00 (included in solving)
0.09/0.14 c Original Problem :
0.09/0.14 c Problem name : HOME/instance-3485033-1307779625.opb
0.09/0.14 c Variables : 162 (162 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 19 initial, 19 maximal
0.09/0.14 c Presolved Problem :
0.09/0.14 c Problem name : t_HOME/instance-3485033-1307779625.opb
0.09/0.14 c Variables : 369 (369 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 244 initial, 244 maximal
0.09/0.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.14 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.09/0.14 c and : 0.01 18 90 0 0 0 90 0 0 90
0.09/0.14 c linear : 0.00 1 8 0 0 0 0 0 0 40
0.09/0.14 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c root node : - 0 - - 0 - - - - -
0.09/0.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.14 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.09/0.14 c and : 225 0 604 0 0 4 1357 0 0 0 0 0
0.09/0.14 c linear : 9 0 604 0 0 3 561 7 0 0 0 0
0.09/0.14 c logicor : 10+ 0 118 0 0 1 68 8 0 0 0 0
0.09/0.14 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.09/0.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.14 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c linear : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.09/0.14 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.14 c vbounds : 0 0 0 0
0.09/0.14 c rootredcost : 0 0 0 0
0.09/0.14 c pseudoobj : 215 0 0 0
0.09/0.14 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.14 c vbounds : 0.00 0.00 0.00
0.09/0.14 c rootredcost : 0.00 0.00 0.00
0.09/0.14 c pseudoobj : 0.00 0.00 0.00
0.09/0.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.14 c propagation : 0.00 15 8 233 131.1 0 0.0 -
0.09/0.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.14 c applied globally : - - - 0 0.0 - - -
0.09/0.14 c applied locally : - - - 8 39.9 - - -
0.09/0.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.14 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.14 c redcost : 0.00 0 0 0 0 0
0.09/0.14 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.14 c intobj : 0.00 0 0 0 0 0
0.09/0.14 c gomory : 0.00 0 0 0 0 0
0.09/0.14 c cgmip : 0.00 0 0 0 0 0
0.09/0.14 c closecuts : 0.00 0 0 0 0 0
0.09/0.14 c strongcg : 0.00 0 0 0 0 0
0.09/0.14 c cmir : 0.00 0 0 0 0 0
0.09/0.14 c flowcover : 0.00 0 0 0 0 0
0.09/0.14 c clique : 0.00 0 0 0 0 0
0.09/0.14 c zerohalf : 0.00 0 0 0 0 0
0.09/0.14 c mcf : 0.00 0 0 0 0 0
0.09/0.14 c oddcycle : 0.00 0 0 0 0 0
0.09/0.14 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.14 c Pricers : Time Calls Vars
0.09/0.14 c problem variables: 0.00 0 0
0.09/0.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.14 c pscost : 0.00 0 0 0 0 0 0
0.09/0.14 c inference : 0.00 0 0 0 0 0 0
0.09/0.14 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.14 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.14 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c random : 0.00 0 0 0 0 0 0
0.09/0.14 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.14 c Primal Heuristics : Time Calls Found
0.09/0.14 c LP solutions : 0.00 - 0
0.09/0.14 c pseudo solutions : 0.00 - 0
0.09/0.14 c oneopt : 0.00 0 0
0.09/0.14 c trivial : 0.00 2 0
0.09/0.14 c shiftandpropagate: 0.01 1 0
0.09/0.14 c simplerounding : 0.00 0 0
0.09/0.14 c zirounding : 0.00 0 0
0.09/0.14 c rounding : 0.00 1 0
0.09/0.14 c shifting : 0.00 1 0
0.09/0.14 c intshifting : 0.00 0 0
0.09/0.14 c twoopt : 0.00 0 0
0.09/0.14 c fixandinfer : 0.00 0 0
0.09/0.14 c feaspump : 0.00 1 0
0.09/0.14 c clique : 0.00 0 0
0.09/0.14 c coefdiving : 0.00 0 0
0.09/0.14 c pscostdiving : 0.00 0 0
0.09/0.14 c fracdiving : 0.00 0 0
0.09/0.14 c veclendiving : 0.00 0 0
0.09/0.14 c intdiving : 0.00 0 0
0.09/0.14 c actconsdiving : 0.00 0 0
0.09/0.14 c objpscostdiving : 0.00 0 0
0.09/0.14 c rootsoldiving : 0.00 0 0
0.09/0.14 c linesearchdiving : 0.00 0 0
0.09/0.14 c guideddiving : 0.00 0 0
0.09/0.14 c octane : 0.00 0 0
0.09/0.14 c rens : 0.00 0 0
0.09/0.14 c rins : 0.00 0 0
0.09/0.14 c localbranching : 0.00 0 0
0.09/0.14 c mutation : 0.00 0 0
0.09/0.14 c crossover : 0.00 0 0
0.09/0.14 c dins : 0.00 0 0
0.09/0.14 c vbounds : 0.00 0 0
0.09/0.14 c undercover : 0.09 1 1
0.09/0.14 c subnlp : 0.00 0 0
0.09/0.14 c trysol : 0.00 0 0
0.09/0.14 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.14 c primal LP : 0.00 0 0 0.00 -
0.09/0.14 c dual LP : 0.00 1 22 22.00 -
0.09/0.14 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.14 c barrier LP : 0.00 0 0 0.00 -
0.09/0.14 c diving/probing LP: 0.00 10 220 22.00 -
0.09/0.14 c strong branching : 0.00 0 0 0.00 -
0.09/0.14 c (at root node) : - 0 0 0.00 -
0.09/0.14 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.14 c B&B Tree :
0.09/0.14 c number of runs : 1
0.09/0.14 c nodes : 1
0.09/0.14 c nodes (total) : 1
0.09/0.14 c nodes left : 0
0.09/0.14 c max depth : 0
0.09/0.14 c max depth (total): 0
0.09/0.14 c backtracks : 0 (0.0%)
0.09/0.14 c delayed cutoffs : 0
0.09/0.14 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.14 c avg switch length: 2.00
0.09/0.14 c switching time : 0.00
0.09/0.14 c Solution :
0.09/0.14 c Solutions found : 1 (1 improvements)
0.09/0.14 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.13 seconds, depth 0, found by <undercover>)
0.09/0.14 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.13 seconds, depth 0, found by <undercover>)
0.09/0.14 c Dual Bound : +3.00000000000000e+00
0.09/0.14 c Gap : 0.00 %
0.09/0.14 c Root Dual Bound : +3.00000000000000e+00
0.09/0.14 c Root Iterations : 242
0.09/0.14 c Time complete: 0.13.