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-2666427-1276647420.opb>
0.00/0.01 c original problem has 528 variables (528 bin, 0 int, 0 impl, 0 cont) and 397 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.09 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 0 upgd conss, 2076 impls, 0 clqs
0.08/0.09 c (round 2) 22 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 7 upgd conss, 3196 impls, 0 clqs
0.09/0.10 c (round 3) 38 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 7 upgd conss, 4092 impls, 0 clqs
0.09/0.10 c (round 4) 54 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 84 chg coeffs, 7 upgd conss, 4764 impls, 0 clqs
0.09/0.11 c (round 5) 70 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 98 chg coeffs, 7 upgd conss, 5212 impls, 0 clqs
0.09/0.11 c (round 6) 86 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 112 chg coeffs, 7 upgd conss, 5436 impls, 0 clqs
0.09/0.11 c (round 7) 102 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 126 chg coeffs, 7 upgd conss, 5436 impls, 0 clqs
0.09/0.14 c (0.1s) probing: 179/426 (42.0%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.09/0.14 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.14 c presolving (8 rounds):
0.09/0.14 c 102 deleted vars, 84 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 126 changed coefficients
0.09/0.14 c 5460 implications, 0 cliques
0.09/0.14 c presolved problem has 426 variables (426 bin, 0 int, 0 impl, 0 cont) and 307 constraints
0.09/0.14 c 294 constraints of type <and>
0.09/0.14 c 6 constraints of type <linear>
0.09/0.14 c 7 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 2)
0.09/0.14 c Presolving Time: 0.07
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.14 c # SCIP version 1.2.1.2
0.09/0.14 c
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = 10000
0.09/0.14 c
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = 1799.99
0.09/0.14 c
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = 1620
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c heuristics/undercover/freq = 0
0.09/0.14 c
0.09/0.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/rapidlearning/freq = 0
0.09/0.14 c
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving
0.09/0.14 c
0.09/0.14 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.14 c 0.1s| 1 | 0 | 16 | - |2008k| 0 | 9 | 426 | 307 | 426 | 601 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.59 o 3
0.49/0.59 c u 0.4s| 1 | 0 | 422 | - |2047k| 0 | - | 426 | 307 | 426 | 601 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.59/0.60 c 0.4s| 1 | 0 | 422 | - |2041k| 0 | - | 426 | 307 | 426 | 601 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.59/0.60 c
0.59/0.60 c SCIP Status : problem is solved [optimal solution found]
0.59/0.60 c Solving Time (sec) : 0.38
0.59/0.60 c Solving Nodes : 1
0.59/0.60 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.59/0.60 c Dual Bound : +3.00000000000000e+00
0.59/0.60 c Gap : 0.00 %
0.59/0.60 s OPTIMUM FOUND
0.59/0.60 v -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 x130 -x129 -x96 -x95 -x94 -x93 -x92 -x91 -x90
0.59/0.60 v x89 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 x88 -x87 x86 -x85 x84 -x83 x82 x81 -x120 -x119 -x118 -x117 -x116 -x115
0.59/0.60 v -x114 -x113 -x80 -x79 x78 x77 x76 -x75 -x74 x73 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x72 -x71 -x70 x69 -x68 -x67
0.59/0.60 v x66 x65 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 x64 -x63 x62 x61 -x60 -x59 -x58 x57 -x56 -x55 x54 x53 x52 -x51 x50 x49 -x48
0.59/0.60 v -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 -x22
0.59/0.60 v -x21 -x20 -x19 x18 x17 -x16 -x15 x14 x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.59/0.60 c SCIP Status : problem is solved [optimal solution found]
0.59/0.60 c Solving Time : 0.38
0.59/0.60 c Original Problem :
0.59/0.60 c Problem name : HOME/instance-2666427-1276647420.opb
0.59/0.60 c Variables : 528 (528 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.60 c Constraints : 397 initial, 397 maximal
0.59/0.60 c Presolved Problem :
0.59/0.60 c Problem name : t_HOME/instance-2666427-1276647420.opb
0.59/0.60 c Variables : 426 (426 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.60 c Constraints : 307 initial, 307 maximal
0.59/0.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.59/0.60 c trivial : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c implics : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c probing : 0.03 0 0 0 0 0 0 0 0
0.59/0.60 c and : 0.03 12 84 0 0 0 84 0 84
0.59/0.60 c linear : 0.00 1 5 0 0 0 0 0 42
0.59/0.60 c logicor : 0.00 0 0 0 0 0 0 0 0
0.59/0.60 c root node : - 0 - - 0 - - - -
0.59/0.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.59/0.60 c integral : 0 0 0 0 0 0 0 0 0 0
0.59/0.60 c and : 294 0 443 0 0 0 0 0 0 0
0.59/0.60 c linear : 6 0 443 0 0 0 0 0 0 0
0.59/0.60 c logicor : 7 0 71 0 0 0 0 0 0 0
0.59/0.60 c countsols : 0 0 0 0 0 0 0 0 0 0
0.59/0.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.59/0.60 c integral : 0.00 0.00 0.00 0.00 0.00
0.59/0.60 c and : 0.00 0.00 0.00 0.00 0.00
0.59/0.60 c linear : 0.01 0.00 0.01 0.00 0.00
0.59/0.60 c logicor : 0.00 0.00 0.00 0.00 0.00
0.59/0.60 c countsols : 0.00 0.00 0.00 0.00 0.00
0.59/0.60 c Propagators : Time Calls Cutoffs DomReds
0.59/0.60 c vbounds : 0.00 2 0 0
0.59/0.60 c rootredcost : 0.00 0 0 0
0.59/0.60 c pseudoobj : 0.00 76 0 0
0.59/0.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.60 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.60 c applied globally : - - - 0 0.0 - - -
0.59/0.60 c applied locally : - - - 0 0.0 - - -
0.59/0.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.60 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.59/0.60 c redcost : 0.00 0 0 0 0 0
0.59/0.60 c impliedbounds : 0.00 0 0 0 0 0
0.59/0.60 c intobj : 0.00 0 0 0 0 0
0.59/0.60 c cgmip : 0.00 0 0 0 0 0
0.59/0.60 c gomory : 0.00 0 0 0 0 0
0.59/0.60 c strongcg : 0.00 0 0 0 0 0
0.59/0.60 c cmir : 0.00 0 0 0 0 0
0.59/0.60 c flowcover : 0.00 0 0 0 0 0
0.59/0.60 c clique : 0.00 0 0 0 0 0
0.59/0.60 c zerohalf : 0.00 0 0 0 0 0
0.59/0.60 c mcf : 0.00 0 0 0 0 0
0.59/0.60 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.60 c Pricers : Time Calls Vars
0.59/0.60 c problem variables: 0.00 0 0
0.59/0.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.60 c pscost : 0.00 0 0 0 0 0 0
0.59/0.60 c inference : 0.00 0 0 0 0 0 0
0.59/0.60 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.60 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.60 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.60 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.60 c random : 0.00 0 0 0 0 0 0
0.59/0.60 c relpscost : 0.00 0 0 0 0 0 0
0.59/0.60 c Primal Heuristics : Time Calls Found
0.59/0.60 c LP solutions : 0.00 - 0
0.59/0.60 c pseudo solutions : 0.00 - 0
0.59/0.60 c oneopt : 0.00 0 0
0.59/0.60 c trivial : 0.00 2 0
0.59/0.60 c simplerounding : 0.00 0 0
0.59/0.60 c zirounding : 0.00 0 0
0.59/0.60 c rounding : 0.00 1 0
0.59/0.60 c shifting : 0.00 1 0
0.59/0.60 c intshifting : 0.00 0 0
0.59/0.60 c twoopt : 0.00 0 0
0.59/0.60 c fixandinfer : 0.00 0 0
0.59/0.60 c feaspump : 0.02 1 0
0.59/0.60 c coefdiving : 0.00 0 0
0.59/0.60 c pscostdiving : 0.00 0 0
0.59/0.60 c fracdiving : 0.00 0 0
0.59/0.60 c veclendiving : 0.00 0 0
0.59/0.60 c intdiving : 0.00 0 0
0.59/0.60 c actconsdiving : 0.00 0 0
0.59/0.60 c objpscostdiving : 0.00 0 0
0.59/0.60 c rootsoldiving : 0.00 0 0
0.59/0.60 c linesearchdiving : 0.00 0 0
0.59/0.60 c guideddiving : 0.00 0 0
0.59/0.60 c octane : 0.00 0 0
0.59/0.60 c rens : 0.00 0 0
0.59/0.60 c rins : 0.00 0 0
0.59/0.60 c localbranching : 0.00 0 0
0.59/0.60 c mutation : 0.00 0 0
0.59/0.60 c crossover : 0.00 0 0
0.59/0.60 c dins : 0.00 0 0
0.59/0.60 c undercover : 0.29 1 1
0.59/0.60 c nlp : 0.00 0 0
0.59/0.60 c trysol : 0.00 0 0
0.59/0.60 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.60 c primal LP : 0.00 0 0 0.00 -
0.59/0.60 c dual LP : 0.00 1 16 16.00 -
0.59/0.60 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.60 c barrier LP : 0.00 0 0 0.00 -
0.59/0.60 c diving/probing LP: 0.01 13 406 31.23 40600.00
0.59/0.60 c strong branching : 0.00 0 0 0.00 -
0.59/0.60 c (at root node) : - 0 0 0.00 -
0.59/0.60 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.60 c B&B Tree :
0.59/0.60 c number of runs : 1
0.59/0.60 c nodes : 1
0.59/0.60 c nodes (total) : 1
0.59/0.60 c nodes left : 0
0.59/0.60 c max depth : 0
0.59/0.60 c max depth (total): 0
0.59/0.60 c backtracks : 0 (0.0%)
0.59/0.60 c delayed cutoffs : 0
0.59/0.60 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.59/0.60 c avg switch length: 2.00
0.59/0.60 c switching time : 0.00
0.59/0.60 c Solution :
0.59/0.60 c Solutions found : 1 (1 improvements)
0.59/0.60 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.37 seconds, depth 0, found by <undercover>)
0.59/0.60 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.37 seconds, depth 0, found by <undercover>)
0.59/0.60 c Dual Bound : +3.00000000000000e+00
0.59/0.60 c Gap : 0.00 %
0.59/0.60 c Root Dual Bound : +3.00000000000000e+00
0.59/0.60 c Root Iterations : 422
0.59/0.61 c Time complete: 0.61.