0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703143-1278564507.opb>
0.00/0.01 c original problem has 616 variables (616 bin, 0 int, 0 impl, 0 cont) and 463 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.05 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 0 upgd conss, 2548 impls, 0 clqs
0.00/0.06 c (round 2) 23 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 3892 impls, 0 clqs
0.00/0.06 c (round 3) 39 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 8 upgd conss, 5012 impls, 0 clqs
0.00/0.06 c (round 4) 55 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 90 chg coeffs, 8 upgd conss, 5908 impls, 0 clqs
0.00/0.07 c (round 5) 71 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 104 chg coeffs, 8 upgd conss, 6580 impls, 0 clqs
0.00/0.07 c (round 6) 87 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 118 chg coeffs, 8 upgd conss, 7028 impls, 0 clqs
0.00/0.07 c (round 7) 103 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 132 chg coeffs, 8 upgd conss, 7252 impls, 0 clqs
0.00/0.07 c (round 8) 119 del vars, 98 del conss, 0 chg bounds, 0 chg sides, 146 chg coeffs, 8 upgd conss, 7252 impls, 0 clqs
0.00/0.10 c (0.1s) probing: 193/497 (38.8%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.00/0.10 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.10 c presolving (9 rounds):
0.00/0.10 c 119 deleted vars, 98 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 146 changed coefficients
0.00/0.10 c 7280 implications, 0 cliques
0.00/0.10 c presolved problem has 497 variables (497 bin, 0 int, 0 impl, 0 cont) and 358 constraints
0.00/0.10 c 343 constraints of type <and>
0.00/0.10 c 7 constraints of type <linear>
0.00/0.10 c 8 constraints of type <logicor>
0.00/0.10 c transformed objective value is always integral (scale: 2)
0.00/0.10 c Presolving Time: 0.08
0.00/0.10 c - non default parameters ----------------------------------------------------------------------
0.00/0.10 c # SCIP version 1.2.1.3
0.00/0.10 c
0.00/0.10 c # frequency for displaying node information lines
0.00/0.10 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.10 c display/freq = 10000
0.00/0.10 c
0.00/0.10 c # maximal time in seconds to run
0.00/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.10 c limits/time = 1790
0.00/0.10 c
0.00/0.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.10 c limits/memory = 1620
0.00/0.10 c
0.00/0.10 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.10 c # [type: int, range: [1,2], default: 1]
0.00/0.10 c timing/clocktype = 2
0.00/0.10 c
0.00/0.10 c # should presolving try to simplify inequalities
0.00/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.10 c constraints/linear/simplifyinequalities = TRUE
0.00/0.10 c
0.00/0.10 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.10 c constraints/indicator/addCouplingCons = TRUE
0.00/0.10 c
0.00/0.10 c # should presolving try to simplify knapsacks
0.00/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.10 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.10 c
0.00/0.10 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.10 c heuristics/undercover/freq = 0
0.00/0.10 c
0.00/0.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.10 c separating/rapidlearning/freq = 0
0.00/0.10 c
0.00/0.10 c -----------------------------------------------------------------------------------------------
0.00/0.10 c start solving
0.00/0.10 c
0.10/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.10 c 0.1s| 1 | 0 | 18 | - |2338k| 0 | 10 | 497 | 358 | 497 | 701 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.75 o 3
0.69/0.75 c u 0.7s| 1 | 0 | 471 | - |2379k| 0 | - | 497 | 358 | 497 | 701 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.76 c 0.7s| 1 | 0 | 471 | - |2371k| 0 | - | 497 | 358 | 497 | 701 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.76 c
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time (sec) : 0.74
0.69/0.76 c Solving Nodes : 1
0.69/0.76 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.69/0.76 c Dual Bound : +3.00000000000000e+00
0.69/0.76 c Gap : 0.00 %
0.69/0.76 s OPTIMUM FOUND
0.69/0.76 v -x168 -x167 x166 x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x112 x111 x110 -x109 -x108 -x107
0.69/0.76 v x106 x105 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x104 -x103 x102 -x101 -x100 -x99 -x98 x97 -x144 -x143 -x142 -x141
0.69/0.76 v -x140 -x139 -x138 x137 -x96 -x95 -x94 -x93 x92 -x91 x90 x89 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x88 x87 -x86 x85
0.69/0.76 v x84 -x83 -x82 x81 -x128 -x127 -x126 -x125 -x124 -x123 x122 -x121 -x80 x79 x78 x77 -x76 -x75 x74 x73 -x120 -x119 -x118 -x117 -x116
0.69/0.76 v -x115 -x114 x113 x72 x71 -x70 x69 -x68 -x67 -x66 x65 x64 -x63 -x62 -x61 -x60 -x59 x58 x57 -x56 -x55 -x54 -x53 -x52 -x51
0.69/0.76 v x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 x25 -x24
0.69/0.76 v -x23 -x22 -x21 -x20 -x19 x18 x17 x16 -x15 -x14 x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time : 0.74
0.69/0.76 c Original Problem :
0.69/0.76 c Problem name : HOME/instance-2703143-1278564507.opb
0.69/0.76 c Variables : 616 (616 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 463 initial, 463 maximal
0.69/0.76 c Presolved Problem :
0.69/0.76 c Problem name : t_HOME/instance-2703143-1278564507.opb
0.69/0.76 c Variables : 497 (497 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 358 initial, 358 maximal
0.69/0.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.76 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c probing : 0.02 0 0 0 0 0 0 0 0
0.69/0.76 c and : 0.04 14 98 0 0 0 98 0 98
0.69/0.76 c linear : 0.01 1 6 0 0 0 0 0 48
0.69/0.76 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c root node : - 0 - - 0 - - - -
0.69/0.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.76 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.76 c and : 343 0 483 0 0 0 0 0 0 0
0.69/0.76 c linear : 7 0 483 0 0 0 0 0 0 0
0.69/0.76 c logicor : 8 0 71 0 0 0 0 0 0 0
0.69/0.76 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.76 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c and : 0.01 0.00 0.01 0.00 0.00
0.69/0.76 c linear : 0.01 0.00 0.01 0.00 0.00
0.69/0.76 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c Propagators : Time Calls Cutoffs DomReds
0.69/0.76 c vbounds : 0.00 2 0 0
0.69/0.76 c rootredcost : 0.00 0 0 0
0.69/0.76 c pseudoobj : 0.00 86 0 0
0.69/0.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.76 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.76 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.76 c applied globally : - - - 0 0.0 - - -
0.69/0.76 c applied locally : - - - 0 0.0 - - -
0.69/0.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.76 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.76 c redcost : 0.00 0 0 0 0 0
0.69/0.76 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.76 c intobj : 0.00 0 0 0 0 0
0.69/0.76 c cgmip : 0.00 0 0 0 0 0
0.69/0.76 c gomory : 0.00 0 0 0 0 0
0.69/0.76 c strongcg : 0.00 0 0 0 0 0
0.69/0.76 c cmir : 0.00 0 0 0 0 0
0.69/0.76 c flowcover : 0.00 0 0 0 0 0
0.69/0.76 c clique : 0.00 0 0 0 0 0
0.69/0.76 c zerohalf : 0.00 0 0 0 0 0
0.69/0.76 c mcf : 0.00 0 0 0 0 0
0.69/0.76 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.76 c Pricers : Time Calls Vars
0.69/0.76 c problem variables: 0.00 0 0
0.69/0.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.76 c pscost : 0.00 0 0 0 0 0 0
0.69/0.76 c inference : 0.00 0 0 0 0 0 0
0.69/0.76 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.76 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.76 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c random : 0.00 0 0 0 0 0 0
0.69/0.76 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.76 c Primal Heuristics : Time Calls Found
0.69/0.76 c LP solutions : 0.00 - 0
0.69/0.76 c pseudo solutions : 0.00 - 0
0.69/0.76 c oneopt : 0.00 0 0
0.69/0.76 c trivial : 0.00 2 0
0.69/0.76 c simplerounding : 0.00 0 0
0.69/0.76 c zirounding : 0.00 0 0
0.69/0.76 c rounding : 0.00 1 0
0.69/0.76 c shifting : 0.00 1 0
0.69/0.76 c intshifting : 0.00 0 0
0.69/0.76 c twoopt : 0.00 0 0
0.69/0.76 c fixandinfer : 0.00 0 0
0.69/0.76 c feaspump : 0.02 1 0
0.69/0.76 c coefdiving : 0.00 0 0
0.69/0.76 c pscostdiving : 0.00 0 0
0.69/0.76 c fracdiving : 0.00 0 0
0.69/0.76 c veclendiving : 0.00 0 0
0.69/0.76 c intdiving : 0.00 0 0
0.69/0.76 c actconsdiving : 0.00 0 0
0.69/0.76 c objpscostdiving : 0.00 0 0
0.69/0.76 c rootsoldiving : 0.00 0 0
0.69/0.76 c linesearchdiving : 0.00 0 0
0.69/0.76 c guideddiving : 0.00 0 0
0.69/0.76 c octane : 0.00 0 0
0.69/0.76 c rens : 0.00 0 0
0.69/0.76 c rins : 0.00 0 0
0.69/0.76 c localbranching : 0.00 0 0
0.69/0.76 c mutation : 0.00 0 0
0.69/0.76 c crossover : 0.00 0 0
0.69/0.76 c dins : 0.00 0 0
0.69/0.76 c undercover : 0.63 1 1
0.69/0.76 c nlp : 0.00 0 0
0.69/0.76 c trysol : 0.00 0 0
0.69/0.76 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.76 c primal LP : 0.00 0 0 0.00 -
0.69/0.76 c dual LP : 0.00 1 18 18.00 -
0.69/0.76 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.76 c barrier LP : 0.00 0 0 0.00 -
0.69/0.76 c diving/probing LP: 0.02 12 453 37.75 23842.11
0.69/0.76 c strong branching : 0.00 0 0 0.00 -
0.69/0.76 c (at root node) : - 0 0 0.00 -
0.69/0.76 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.76 c B&B Tree :
0.69/0.76 c number of runs : 1
0.69/0.76 c nodes : 1
0.69/0.76 c nodes (total) : 1
0.69/0.76 c nodes left : 0
0.69/0.76 c max depth : 0
0.69/0.76 c max depth (total): 0
0.69/0.76 c backtracks : 0 (0.0%)
0.69/0.76 c delayed cutoffs : 0
0.69/0.76 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.76 c avg switch length: 2.00
0.69/0.76 c switching time : 0.00
0.69/0.76 c Solution :
0.69/0.76 c Solutions found : 1 (1 improvements)
0.69/0.76 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.73 seconds, depth 0, found by <undercover>)
0.69/0.76 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.73 seconds, depth 0, found by <undercover>)
0.69/0.76 c Dual Bound : +3.00000000000000e+00
0.69/0.76 c Gap : 0.00 %
0.69/0.76 c Root Dual Bound : +3.00000000000000e+00
0.69/0.76 c Root Iterations : 471
0.69/0.77 c Time complete: 0.76.