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-2665069-1276648889.opb>
0.00/0.01 c original problem has 648 variables (648 bin, 0 int, 0 impl, 0 cont) and 499 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.09/0.12 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 0 upgd conss, 2544 impls, 0 clqs
0.09/0.13 c (round 2) 24 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 7 upgd conss, 3984 impls, 0 clqs
0.09/0.14 c (round 3) 42 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 7 upgd conss, 5136 impls, 0 clqs
0.09/0.14 c (round 4) 60 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 97 chg coeffs, 7 upgd conss, 6000 impls, 0 clqs
0.09/0.14 c (round 5) 78 del vars, 64 del conss, 0 chg bounds, 0 chg sides, 113 chg coeffs, 7 upgd conss, 6576 impls, 0 clqs
0.09/0.15 c (round 6) 96 del vars, 80 del conss, 0 chg bounds, 0 chg sides, 129 chg coeffs, 7 upgd conss, 6864 impls, 0 clqs
0.09/0.15 c (round 7) 114 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 145 chg coeffs, 7 upgd conss, 6864 impls, 0 clqs
0.09/0.18 c (0.1s) probing: 190/534 (35.6%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.09/0.18 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.18 c presolving (8 rounds):
0.09/0.18 c 114 deleted vars, 96 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 145 changed coefficients
0.09/0.18 c 6888 implications, 0 cliques
0.09/0.18 c presolved problem has 534 variables (534 bin, 0 int, 0 impl, 0 cont) and 397 constraints
0.09/0.18 c 384 constraints of type <and>
0.09/0.18 c 6 constraints of type <linear>
0.09/0.18 c 7 constraints of type <logicor>
0.09/0.18 c transformed objective value is always integral (scale: 2)
0.09/0.18 c Presolving Time: 0.09
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.2
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1800
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c heuristics/undercover/freq = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.09/0.19 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.19 c 0.1s| 1 | 0 | 18 | - |2493k| 0 | 11 | 534 | 397 | 534 | 781 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.80 o 3
0.79/0.80 c u 0.5s| 1 | 0 | 18 | - |2540k| 0 | - | 534 | 397 | 534 | 781 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.81 c 0.5s| 1 | 0 | 18 | - |2532k| 0 | - | 534 | 397 | 534 | 781 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.81 c
0.79/0.81 c SCIP Status : problem is solved [optimal solution found]
0.79/0.81 c Solving Time (sec) : 0.51
0.79/0.81 c Solving Nodes : 1
0.79/0.81 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.79/0.81 c Dual Bound : +3.00000000000000e+00
0.79/0.81 c Gap : 0.00 %
0.79/0.81 s OPTIMUM FOUND
0.79/0.81 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 x146 -x145 x108 x107 -x106 -x105
0.79/0.81 v x104 x103 -x102 x101 x100 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x99 x98 x97 -x96 -x95 x94 x93 -x92 x91 -x135
0.79/0.81 v -x134 -x133 -x132 -x131 -x130 -x129 x128 -x127 -x90 x89 x88 x87 -x86 x85 x84 x83 x82 -x126 -x125 -x124 -x123 -x122 -x121 -x120
0.79/0.81 v -x119 x118 x81 x80 -x79 x78 -x77 -x76 x75 -x74 x73 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 x72 -x71 -x70 x69
0.79/0.81 v x68 -x67 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
0.79/0.81 v -x41 -x40 -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
0.79/0.81 v x14 x13 x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.79/0.81 c SCIP Status : problem is solved [optimal solution found]
0.79/0.81 c Solving Time : 0.51
0.79/0.81 c Original Problem :
0.79/0.81 c Problem name : HOME/instance-2665069-1276648889.opb
0.79/0.81 c Variables : 648 (648 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.81 c Constraints : 499 initial, 499 maximal
0.79/0.81 c Presolved Problem :
0.79/0.81 c Problem name : t_HOME/instance-2665069-1276648889.opb
0.79/0.81 c Variables : 534 (534 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.81 c Constraints : 397 initial, 397 maximal
0.79/0.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.81 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c probing : 0.02 0 0 0 0 0 0 0 0
0.79/0.81 c and : 0.07 12 96 0 0 0 96 0 96
0.79/0.81 c linear : 0.00 1 5 0 0 0 0 0 49
0.79/0.81 c logicor : 0.00 0 0 0 0 0 0 0 0
0.79/0.81 c root node : - 0 - - 0 - - - -
0.79/0.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.81 c integral : 0 0 0 0 0 0 0 0 0 0
0.79/0.81 c and : 384 0 475 0 0 0 0 0 0 0
0.79/0.81 c linear : 6 0 475 0 0 0 0 0 0 0
0.79/0.81 c logicor : 7 0 65 0 0 0 0 0 0 0
0.79/0.81 c countsols : 0 0 0 0 0 0 0 0 0 0
0.79/0.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.81 c integral : 0.00 0.00 0.00 0.00 0.00
0.79/0.81 c and : 0.02 0.00 0.02 0.00 0.00
0.79/0.81 c linear : 0.00 0.00 0.00 0.00 0.00
0.79/0.81 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.81 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.81 c Propagators : Time Calls Cutoffs DomReds
0.79/0.81 c vbounds : 0.00 2 0 0
0.79/0.81 c rootredcost : 0.00 0 0 0
0.79/0.81 c pseudoobj : 0.00 86 0 0
0.79/0.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.81 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.81 c applied globally : - - - 0 0.0 - - -
0.79/0.81 c applied locally : - - - 0 0.0 - - -
0.79/0.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.81 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.81 c redcost : 0.00 0 0 0 0 0
0.79/0.81 c impliedbounds : 0.00 0 0 0 0 0
0.79/0.81 c intobj : 0.00 0 0 0 0 0
0.79/0.81 c cgmip : 0.00 0 0 0 0 0
0.79/0.81 c gomory : 0.00 0 0 0 0 0
0.79/0.81 c strongcg : 0.00 0 0 0 0 0
0.79/0.81 c cmir : 0.00 0 0 0 0 0
0.79/0.81 c flowcover : 0.00 0 0 0 0 0
0.79/0.81 c clique : 0.00 0 0 0 0 0
0.79/0.81 c zerohalf : 0.00 0 0 0 0 0
0.79/0.81 c mcf : 0.00 0 0 0 0 0
0.79/0.81 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.81 c Pricers : Time Calls Vars
0.79/0.81 c problem variables: 0.00 0 0
0.79/0.81 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.81 c pscost : 0.00 0 0 0 0 0 0
0.79/0.81 c inference : 0.00 0 0 0 0 0 0
0.79/0.81 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.81 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.81 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.81 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.81 c random : 0.00 0 0 0 0 0 0
0.79/0.81 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.81 c Primal Heuristics : Time Calls Found
0.79/0.81 c LP solutions : 0.00 - 0
0.79/0.81 c pseudo solutions : 0.00 - 0
0.79/0.81 c oneopt : 0.00 0 0
0.79/0.81 c trivial : 0.00 2 0
0.79/0.81 c simplerounding : 0.00 0 0
0.79/0.81 c zirounding : 0.00 0 0
0.79/0.81 c rounding : 0.00 1 0
0.79/0.81 c shifting : 0.00 1 0
0.79/0.81 c intshifting : 0.00 0 0
0.79/0.81 c twoopt : 0.00 0 0
0.79/0.81 c fixandinfer : 0.00 0 0
0.79/0.81 c feaspump : 0.01 1 0
0.79/0.81 c coefdiving : 0.00 0 0
0.79/0.81 c pscostdiving : 0.00 0 0
0.79/0.81 c fracdiving : 0.00 0 0
0.79/0.81 c veclendiving : 0.00 0 0
0.79/0.81 c intdiving : 0.00 0 0
0.79/0.81 c actconsdiving : 0.00 0 0
0.79/0.81 c objpscostdiving : 0.00 0 0
0.79/0.81 c rootsoldiving : 0.00 0 0
0.79/0.81 c linesearchdiving : 0.00 0 0
0.79/0.81 c guideddiving : 0.00 0 0
0.79/0.81 c octane : 0.00 0 0
0.79/0.81 c rens : 0.00 0 0
0.79/0.81 c rins : 0.00 0 0
0.79/0.81 c localbranching : 0.00 0 0
0.79/0.81 c mutation : 0.00 0 0
0.79/0.81 c crossover : 0.00 0 0
0.79/0.81 c dins : 0.00 0 0
0.79/0.81 c undercover : 0.39 1 1
0.79/0.81 c nlp : 0.00 0 0
0.79/0.81 c trysol : 0.00 0 0
0.79/0.81 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.81 c primal LP : 0.00 0 0 0.00 -
0.79/0.81 c dual LP : 0.00 1 18 18.00 -
0.79/0.81 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.81 c barrier LP : 0.00 0 0 0.00 -
0.79/0.81 c diving/probing LP: 0.01 0 0 0.00 0.00
0.79/0.81 c strong branching : 0.00 0 0 0.00 -
0.79/0.81 c (at root node) : - 0 0 0.00 -
0.79/0.81 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.81 c B&B Tree :
0.79/0.81 c number of runs : 1
0.79/0.81 c nodes : 1
0.79/0.81 c nodes (total) : 1
0.79/0.81 c nodes left : 0
0.79/0.81 c max depth : 0
0.79/0.81 c max depth (total): 0
0.79/0.81 c backtracks : 0 (0.0%)
0.79/0.81 c delayed cutoffs : 0
0.79/0.81 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.81 c avg switch length: 2.00
0.79/0.81 c switching time : 0.00
0.79/0.81 c Solution :
0.79/0.81 c Solutions found : 1 (1 improvements)
0.79/0.81 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.51 seconds, depth 0, found by <undercover>)
0.79/0.81 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.51 seconds, depth 0, found by <undercover>)
0.79/0.81 c Dual Bound : +3.00000000000000e+00
0.79/0.81 c Gap : 0.00 %
0.79/0.81 c Root Dual Bound : +3.00000000000000e+00
0.79/0.81 c Root Iterations : 18
0.79/0.82 c Time complete: 0.81.