0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666419-1276647266.opb>
0.00/0.01 c original problem has 560 variables (560 bin, 0 int, 0 impl, 0 cont) and 409 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.03/0.09 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 45 chg coeffs, 0 upgd conss, 2464 impls, 0 clqs
0.03/0.10 c (round 2) 22 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 9 upgd conss, 3640 impls, 0 clqs
0.09/0.10 c (round 3) 36 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 69 chg coeffs, 9 upgd conss, 4648 impls, 0 clqs
0.09/0.11 c (round 4) 50 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 9 upgd conss, 5488 impls, 0 clqs
0.09/0.11 c (round 5) 64 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 93 chg coeffs, 9 upgd conss, 6160 impls, 0 clqs
0.09/0.11 c (round 6) 78 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 105 chg coeffs, 9 upgd conss, 6664 impls, 0 clqs
0.09/0.12 c (round 7) 92 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 117 chg coeffs, 9 upgd conss, 7000 impls, 0 clqs
0.09/0.12 c (round 8) 106 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 129 chg coeffs, 9 upgd conss, 7168 impls, 0 clqs
0.09/0.12 c (round 9) 120 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 141 chg coeffs, 9 upgd conss, 7168 impls, 0 clqs
0.09/0.15 c (0.1s) probing: 192/440 (43.6%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.09/0.15 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.15 c presolving (10 rounds):
0.09/0.15 c 120 deleted vars, 96 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 141 changed coefficients
0.09/0.15 c 7200 implications, 0 cliques
0.09/0.15 c presolved problem has 440 variables (440 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.09/0.15 c 288 constraints of type <and>
0.09/0.15 c 8 constraints of type <linear>
0.09/0.15 c 9 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 2)
0.09/0.15 c Presolving Time: 0.07
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.99
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c heuristics/undercover/freq = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.16 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.16 c 0.1s| 1 | 0 | 20 | - |2101k| 0 | 11 | 440 | 305 | 440 | 593 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.70 o 3
0.69/0.70 c u 0.5s| 1 | 0 | 475 | - |2141k| 0 | - | 440 | 305 | 440 | 593 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.71 c 0.5s| 1 | 0 | 475 | - |2132k| 0 | - | 440 | 305 | 440 | 593 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.71 c
0.69/0.71 c SCIP Status : problem is solved [optimal solution found]
0.69/0.71 c Solving Time (sec) : 0.49
0.69/0.71 c Solving Nodes : 1
0.69/0.71 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.69/0.71 c Dual Bound : +3.00000000000000e+00
0.69/0.71 c Gap : 0.00 %
0.69/0.71 s OPTIMUM FOUND
0.69/0.71 v -x168 -x167 -x166 -x165 -x164 x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x112 -x111 -x110 -x109 x108 x107 x106 -x154 -x153
0.69/0.71 v -x152 -x151 -x150 -x149 -x148 -x105 x104 -x103 x102 x101 -x100 x99 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x98 -x97 -x96
0.69/0.71 v x95 x94 x93 x92 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x91 -x90 -x89 -x88 x87 -x86 x85 -x133 -x132 -x131 -x130 -x129 -x128
0.69/0.71 v -x127 x84 -x83 x82 -x81 x80 x79 x78 -x126 -x125 -x124 -x123 -x122 x121 -x120 -x77 -x76 x75 x74 x73 -x72 x71 -x119 -x118
0.69/0.71 v -x117 -x116 -x115 x114 -x113 x70 -x69 x68 x67 x66 x65 x64 x63 -x62 -x61 -x60 -x59 x58 x57 -x56 -x55 -x54 -x53 -x52 x51 x50 -x49
0.69/0.71 v -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 x23
0.69/0.71 v 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.71 c SCIP Status : problem is solved [optimal solution found]
0.69/0.71 c Solving Time : 0.49
0.69/0.71 c Original Problem :
0.69/0.71 c Problem name : HOME/instance-2666419-1276647266.opb
0.69/0.71 c Variables : 560 (560 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.71 c Constraints : 409 initial, 409 maximal
0.69/0.71 c Presolved Problem :
0.69/0.71 c Problem name : t_HOME/instance-2666419-1276647266.opb
0.69/0.71 c Variables : 440 (440 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.71 c Constraints : 305 initial, 305 maximal
0.69/0.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.71 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c probing : 0.02 0 0 0 0 0 0 0 0
0.69/0.71 c and : 0.04 16 96 0 0 0 96 0 96
0.69/0.71 c linear : 0.00 1 7 0 0 0 0 0 45
0.69/0.71 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c root node : - 0 - - 0 - - - -
0.69/0.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.71 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.71 c and : 288 0 479 0 0 0 0 0 0 0
0.69/0.71 c linear : 8 0 479 0 0 0 0 0 0 0
0.69/0.71 c logicor : 9 0 80 0 0 0 0 0 0 0
0.69/0.71 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.71 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c and : 0.03 0.00 0.03 0.00 0.00
0.69/0.71 c linear : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c Propagators : Time Calls Cutoffs DomReds
0.69/0.71 c vbounds : 0.00 2 0 0
0.69/0.71 c rootredcost : 0.00 0 0 0
0.69/0.71 c pseudoobj : 0.00 82 0 0
0.69/0.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.71 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.71 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.71 c applied globally : - - - 0 0.0 - - -
0.69/0.71 c applied locally : - - - 0 0.0 - - -
0.69/0.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.71 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.71 c redcost : 0.00 0 0 0 0 0
0.69/0.71 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.71 c intobj : 0.00 0 0 0 0 0
0.69/0.71 c cgmip : 0.00 0 0 0 0 0
0.69/0.71 c gomory : 0.00 0 0 0 0 0
0.69/0.71 c strongcg : 0.00 0 0 0 0 0
0.69/0.71 c cmir : 0.00 0 0 0 0 0
0.69/0.71 c flowcover : 0.00 0 0 0 0 0
0.69/0.71 c clique : 0.00 0 0 0 0 0
0.69/0.71 c zerohalf : 0.00 0 0 0 0 0
0.69/0.71 c mcf : 0.00 0 0 0 0 0
0.69/0.71 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.71 c Pricers : Time Calls Vars
0.69/0.71 c problem variables: 0.00 0 0
0.69/0.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.71 c pscost : 0.00 0 0 0 0 0 0
0.69/0.71 c inference : 0.00 0 0 0 0 0 0
0.69/0.71 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.71 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.71 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.71 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.71 c random : 0.00 0 0 0 0 0 0
0.69/0.71 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.71 c Primal Heuristics : Time Calls Found
0.69/0.71 c LP solutions : 0.00 - 0
0.69/0.71 c pseudo solutions : 0.00 - 0
0.69/0.71 c oneopt : 0.00 0 0
0.69/0.71 c trivial : 0.00 2 0
0.69/0.71 c simplerounding : 0.00 0 0
0.69/0.71 c zirounding : 0.00 0 0
0.69/0.71 c rounding : 0.00 1 0
0.69/0.71 c shifting : 0.00 1 0
0.69/0.71 c intshifting : 0.00 0 0
0.69/0.71 c twoopt : 0.00 0 0
0.69/0.71 c fixandinfer : 0.00 0 0
0.69/0.71 c feaspump : 0.02 1 0
0.69/0.71 c coefdiving : 0.00 0 0
0.69/0.71 c pscostdiving : 0.00 0 0
0.69/0.71 c fracdiving : 0.00 0 0
0.69/0.71 c veclendiving : 0.00 0 0
0.69/0.71 c intdiving : 0.00 0 0
0.69/0.71 c actconsdiving : 0.00 0 0
0.69/0.71 c objpscostdiving : 0.00 0 0
0.69/0.71 c rootsoldiving : 0.00 0 0
0.69/0.71 c linesearchdiving : 0.00 0 0
0.69/0.71 c guideddiving : 0.00 0 0
0.69/0.71 c octane : 0.00 0 0
0.69/0.71 c rens : 0.00 0 0
0.69/0.71 c rins : 0.00 0 0
0.69/0.71 c localbranching : 0.00 0 0
0.69/0.71 c mutation : 0.00 0 0
0.69/0.71 c crossover : 0.00 0 0
0.69/0.71 c dins : 0.00 0 0
0.69/0.71 c undercover : 0.39 1 1
0.69/0.71 c nlp : 0.00 0 0
0.69/0.71 c trysol : 0.00 0 0
0.69/0.71 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.71 c primal LP : 0.00 0 0 0.00 -
0.69/0.71 c dual LP : 0.00 1 20 20.00 -
0.69/0.71 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.71 c barrier LP : 0.00 0 0 0.00 -
0.69/0.71 c diving/probing LP: 0.02 13 455 35.00 22750.00
0.69/0.71 c strong branching : 0.00 0 0 0.00 -
0.69/0.71 c (at root node) : - 0 0 0.00 -
0.69/0.71 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.71 c B&B Tree :
0.69/0.71 c number of runs : 1
0.69/0.71 c nodes : 1
0.69/0.71 c nodes (total) : 1
0.69/0.71 c nodes left : 0
0.69/0.71 c max depth : 0
0.69/0.71 c max depth (total): 0
0.69/0.71 c backtracks : 0 (0.0%)
0.69/0.71 c delayed cutoffs : 0
0.69/0.71 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.71 c avg switch length: 2.00
0.69/0.71 c switching time : 0.00
0.69/0.71 c Solution :
0.69/0.71 c Solutions found : 1 (1 improvements)
0.69/0.71 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.48 seconds, depth 0, found by <undercover>)
0.69/0.71 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.48 seconds, depth 0, found by <undercover>)
0.69/0.71 c Dual Bound : +3.00000000000000e+00
0.69/0.71 c Gap : 0.00 %
0.69/0.71 c Root Dual Bound : +3.00000000000000e+00
0.69/0.71 c Root Iterations : 475
0.69/0.72 c Time complete: 0.71.