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-2703153-1278564511.opb>
0.00/0.01 c original problem has 490 variables (490 bin, 0 int, 0 impl, 0 cont) and 358 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.02/0.04 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 0 upgd conss, 2044 impls, 0 clqs
0.02/0.04 c (round 2) 21 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 3052 impls, 0 clqs
0.02/0.05 c (round 3) 35 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 3892 impls, 0 clqs
0.02/0.05 c (round 4) 49 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 8 upgd conss, 4564 impls, 0 clqs
0.02/0.05 c (round 5) 63 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 8 upgd conss, 5068 impls, 0 clqs
0.02/0.05 c (round 6) 77 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 100 chg coeffs, 8 upgd conss, 5404 impls, 0 clqs
0.02/0.06 c (round 7) 91 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 112 chg coeffs, 8 upgd conss, 5572 impls, 0 clqs
0.02/0.06 c (round 8) 105 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 124 chg coeffs, 8 upgd conss, 5572 impls, 0 clqs
0.02/0.08 c (0.1s) probing: 180/385 (46.8%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.02/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.02/0.08 c presolving (9 rounds):
0.02/0.08 c 105 deleted vars, 84 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 124 changed coefficients
0.02/0.08 c 5600 implications, 0 cliques
0.02/0.08 c presolved problem has 385 variables (385 bin, 0 int, 0 impl, 0 cont) and 267 constraints
0.02/0.08 c 252 constraints of type <and>
0.02/0.08 c 7 constraints of type <linear>
0.02/0.08 c 8 constraints of type <logicor>
0.02/0.08 c transformed objective value is always integral (scale: 2)
0.02/0.08 c Presolving Time: 0.06
0.02/0.08 c - non default parameters ----------------------------------------------------------------------
0.02/0.08 c # SCIP version 1.2.1.3
0.02/0.08 c
0.02/0.08 c # frequency for displaying node information lines
0.02/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.08 c display/freq = 10000
0.02/0.08 c
0.02/0.08 c # maximal time in seconds to run
0.02/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08 c limits/time = 1790
0.02/0.08 c
0.02/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08 c limits/memory = 1620
0.02/0.08 c
0.02/0.08 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.08 c # [type: int, range: [1,2], default: 1]
0.02/0.08 c timing/clocktype = 2
0.02/0.08 c
0.02/0.08 c # should presolving try to simplify inequalities
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/linear/simplifyinequalities = TRUE
0.02/0.08 c
0.02/0.08 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/indicator/addCouplingCons = TRUE
0.02/0.08 c
0.02/0.08 c # should presolving try to simplify knapsacks
0.02/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.08 c
0.02/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08 c heuristics/undercover/freq = 0
0.02/0.08 c
0.02/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08 c separating/rapidlearning/freq = 0
0.02/0.08 c
0.02/0.08 c -----------------------------------------------------------------------------------------------
0.02/0.08 c start solving
0.02/0.08 c
0.02/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.08 c 0.1s| 1 | 0 | 18 | - |1846k| 0 | 10 | 385 | 267 | 385 | 519 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.58 o 3
0.49/0.58 c u 0.6s| 1 | 0 | 396 | - |1875k| 0 | - | 385 | 267 | 385 | 519 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.58 c 0.6s| 1 | 0 | 396 | - |1868k| 0 | - | 385 | 267 | 385 | 519 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.58 c
0.49/0.58 c SCIP Status : problem is solved [optimal solution found]
0.49/0.58 c Solving Time (sec) : 0.57
0.49/0.58 c Solving Nodes : 1
0.49/0.58 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.49/0.58 c Dual Bound : +3.00000000000000e+00
0.49/0.58 c Gap : 0.00 %
0.49/0.59 s OPTIMUM FOUND
0.49/0.59 v -x147 -x146 x145 x144 x143 x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x98 x97 x96 x95 -x94 x93 x92 -x133 -x132 -x131
0.49/0.59 v -x130 -x129 -x128 -x127 x91 x90 -x89 x88 -x87 -x86 x85 -x126 -x125 -x124 -x123 -x122 x121 -x120 -x84 x83 -x82 -x81 -x80 x79 x78
0.49/0.59 v -x119 -x118 -x117 -x116 -x115 -x114 x113 x77 x76 -x75 -x74 -x73 -x72 x71 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x70 -x69
0.49/0.59 v -x68 x67 -x66 x65 x64 -x105 -x104 -x103 -x102 -x101 -x100 x99 -x63 -x62 x61 x60 -x59 -x58 x57 x56 -x55 -x54 -x53 -x52 x51 x50
0.49/0.59 v -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.49/0.59 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.49/0.59 c SCIP Status : problem is solved [optimal solution found]
0.49/0.59 c Solving Time : 0.57
0.49/0.59 c Original Problem :
0.49/0.59 c Problem name : HOME/instance-2703153-1278564511.opb
0.49/0.59 c Variables : 490 (490 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 358 initial, 358 maximal
0.49/0.59 c Presolved Problem :
0.49/0.59 c Problem name : t_HOME/instance-2703153-1278564511.opb
0.49/0.59 c Variables : 385 (385 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 267 initial, 267 maximal
0.49/0.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.59 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c probing : 0.02 0 0 0 0 0 0 0 0
0.49/0.59 c and : 0.02 14 84 0 0 0 84 0 84
0.49/0.59 c linear : 0.01 1 6 0 0 0 0 0 40
0.49/0.59 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c root node : - 0 - - 0 - - - -
0.49/0.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.59 c integral : 0 0 0 0 0 0 0 0 0 0
0.49/0.59 c and : 252 0 443 0 0 0 0 0 0 0
0.49/0.59 c linear : 7 0 443 0 0 0 0 0 0 0
0.49/0.59 c logicor : 8 0 79 0 0 0 0 0 0 0
0.49/0.59 c countsols : 0 0 0 0 0 0 0 0 0 0
0.49/0.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.59 c integral : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c and : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c linear : 0.01 0.00 0.01 0.00 0.00
0.49/0.59 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c Propagators : Time Calls Cutoffs DomReds
0.49/0.59 c vbounds : 0.00 2 0 0
0.49/0.59 c rootredcost : 0.00 0 0 0
0.49/0.59 c pseudoobj : 0.00 72 0 0
0.49/0.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.59 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.59 c applied globally : - - - 0 0.0 - - -
0.49/0.59 c applied locally : - - - 0 0.0 - - -
0.49/0.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.59 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.59 c redcost : 0.00 0 0 0 0 0
0.49/0.59 c impliedbounds : 0.00 0 0 0 0 0
0.49/0.59 c intobj : 0.00 0 0 0 0 0
0.49/0.59 c cgmip : 0.00 0 0 0 0 0
0.49/0.59 c gomory : 0.00 0 0 0 0 0
0.49/0.59 c strongcg : 0.00 0 0 0 0 0
0.49/0.59 c cmir : 0.00 0 0 0 0 0
0.49/0.59 c flowcover : 0.00 0 0 0 0 0
0.49/0.59 c clique : 0.00 0 0 0 0 0
0.49/0.59 c zerohalf : 0.00 0 0 0 0 0
0.49/0.59 c mcf : 0.00 0 0 0 0 0
0.49/0.59 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.59 c Pricers : Time Calls Vars
0.49/0.59 c problem variables: 0.00 0 0
0.49/0.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.59 c pscost : 0.00 0 0 0 0 0 0
0.49/0.59 c inference : 0.00 0 0 0 0 0 0
0.49/0.59 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.59 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.59 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c random : 0.00 0 0 0 0 0 0
0.49/0.59 c relpscost : 0.00 0 0 0 0 0 0
0.49/0.59 c Primal Heuristics : Time Calls Found
0.49/0.59 c LP solutions : 0.00 - 0
0.49/0.59 c pseudo solutions : 0.00 - 0
0.49/0.59 c oneopt : 0.00 0 0
0.49/0.59 c trivial : 0.00 2 0
0.49/0.59 c simplerounding : 0.00 0 0
0.49/0.59 c zirounding : 0.00 0 0
0.49/0.59 c rounding : 0.00 1 0
0.49/0.59 c shifting : 0.00 1 0
0.49/0.59 c intshifting : 0.00 0 0
0.49/0.59 c twoopt : 0.00 0 0
0.49/0.59 c fixandinfer : 0.00 0 0
0.49/0.59 c feaspump : 0.02 1 0
0.49/0.59 c coefdiving : 0.00 0 0
0.49/0.59 c pscostdiving : 0.00 0 0
0.49/0.59 c fracdiving : 0.00 0 0
0.49/0.59 c veclendiving : 0.00 0 0
0.49/0.59 c intdiving : 0.00 0 0
0.49/0.59 c actconsdiving : 0.00 0 0
0.49/0.59 c objpscostdiving : 0.00 0 0
0.49/0.59 c rootsoldiving : 0.00 0 0
0.49/0.59 c linesearchdiving : 0.00 0 0
0.49/0.59 c guideddiving : 0.00 0 0
0.49/0.59 c octane : 0.00 0 0
0.49/0.59 c rens : 0.00 0 0
0.49/0.59 c rins : 0.00 0 0
0.49/0.59 c localbranching : 0.00 0 0
0.49/0.59 c mutation : 0.00 0 0
0.49/0.59 c crossover : 0.00 0 0
0.49/0.59 c dins : 0.00 0 0
0.49/0.59 c undercover : 0.49 1 1
0.49/0.59 c nlp : 0.00 0 0
0.49/0.59 c trysol : 0.00 0 0
0.49/0.59 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.59 c primal LP : 0.00 0 0 0.00 -
0.49/0.59 c dual LP : 0.00 1 18 18.00 -
0.49/0.59 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.59 c barrier LP : 0.00 0 0 0.00 -
0.49/0.59 c diving/probing LP: 0.01 13 378 29.08 29076.92
0.49/0.59 c strong branching : 0.00 0 0 0.00 -
0.49/0.59 c (at root node) : - 0 0 0.00 -
0.49/0.59 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.59 c B&B Tree :
0.49/0.59 c number of runs : 1
0.49/0.59 c nodes : 1
0.49/0.59 c nodes (total) : 1
0.49/0.59 c nodes left : 0
0.49/0.59 c max depth : 0
0.49/0.59 c max depth (total): 0
0.49/0.59 c backtracks : 0 (0.0%)
0.49/0.59 c delayed cutoffs : 0
0.49/0.59 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.59 c avg switch length: 2.00
0.49/0.59 c switching time : 0.00
0.49/0.59 c Solution :
0.49/0.59 c Solutions found : 1 (1 improvements)
0.49/0.59 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.57 seconds, depth 0, found by <undercover>)
0.49/0.59 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.57 seconds, depth 0, found by <undercover>)
0.49/0.59 c Dual Bound : +3.00000000000000e+00
0.49/0.59 c Gap : 0.00 %
0.49/0.59 c Root Dual Bound : +3.00000000000000e+00
0.49/0.59 c Root Iterations : 396
0.59/0.60 c Time complete: 0.59.