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-2666466-1276648089.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 205 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.04 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (round 2) 18 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 5 upgd conss, 1480 impls, 0 clqs
0.00/0.04 c (round 3) 32 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1816 impls, 0 clqs
0.00/0.05 c (round 4) 46 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.05 c (round 5) 60 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 144/220 (65.5%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (6 rounds):
0.00/0.06 c 60 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 73 changed coefficients
0.00/0.06 c 2000 implications, 0 cliques
0.00/0.06 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.00/0.06 c 144 constraints of type <and>
0.00/0.06 c 4 constraints of type <linear>
0.00/0.06 c 5 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/undercover/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.07 c 0.0s| 1 | 0 | 10 | - |1091k| 0 | 4 | 220 | 153 | 220 | 297 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.46 o 3
0.39/0.46 c u 0.3s| 1 | 0 | 165 | - |1109k| 0 | - | 220 | 153 | 220 | 297 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.46 c 0.3s| 1 | 0 | 165 | - |1105k| 0 | - | 220 | 153 | 220 | 297 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.46 c
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time (sec) : 0.29
0.39/0.46 c Solving Nodes : 1
0.39/0.46 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.46 c Dual Bound : +3.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 s OPTIMUM FOUND
0.39/0.46 v -x84 -x83 -x82 -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x56 x55 -x54 x53 -x52 x51 x50 -x70 -x69 -x68 -x67 -x66 -x65
0.39/0.46 v -x64 -x49 x48 x47 x46 -x45 -x44 x43 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x42 -x41 x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 -x31
0.39/0.46 v x30 x29 -x28 -x27 -x26 -x25 -x24 x23 x22 -x21 -x20 -x19 -x18 -x17 x16 x15 -x14 x13 x12 -x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3
0.39/0.46 v x2 x1
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time : 0.29
0.39/0.46 c Original Problem :
0.39/0.46 c Problem name : HOME/instance-2666466-1276648089.opb
0.39/0.46 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 205 initial, 205 maximal
0.39/0.46 c Presolved Problem :
0.39/0.46 c Problem name : t_HOME/instance-2666466-1276648089.opb
0.39/0.46 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 153 initial, 153 maximal
0.39/0.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.46 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.46 c and : 0.01 8 48 0 0 0 48 0 48
0.39/0.46 c linear : 0.01 1 3 0 0 0 0 0 25
0.39/0.46 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c root node : - 0 - - 0 - - - -
0.39/0.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.46 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.46 c and : 144 0 335 0 0 0 0 0 0 0
0.39/0.46 c linear : 4 0 335 0 0 0 0 0 0 0
0.39/0.46 c logicor : 5 0 69 0 0 0 0 0 0 0
0.39/0.46 c countsols : 0 0 0 0 0 0 0 0 0 0
0.39/0.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.46 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c and : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c linear : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c Propagators : Time Calls Cutoffs DomReds
0.39/0.46 c vbounds : 0.00 2 0 0
0.39/0.46 c rootredcost : 0.00 0 0 0
0.39/0.46 c pseudoobj : 0.00 42 0 0
0.39/0.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.46 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.46 c applied globally : - - - 0 0.0 - - -
0.39/0.46 c applied locally : - - - 0 0.0 - - -
0.39/0.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.46 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.46 c redcost : 0.00 0 0 0 0 0
0.39/0.46 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.46 c intobj : 0.00 0 0 0 0 0
0.39/0.46 c cgmip : 0.00 0 0 0 0 0
0.39/0.46 c gomory : 0.00 0 0 0 0 0
0.39/0.46 c strongcg : 0.00 0 0 0 0 0
0.39/0.46 c cmir : 0.00 0 0 0 0 0
0.39/0.46 c flowcover : 0.00 0 0 0 0 0
0.39/0.46 c clique : 0.00 0 0 0 0 0
0.39/0.46 c zerohalf : 0.00 0 0 0 0 0
0.39/0.46 c mcf : 0.00 0 0 0 0 0
0.39/0.46 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.46 c Pricers : Time Calls Vars
0.39/0.46 c problem variables: 0.00 0 0
0.39/0.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.46 c pscost : 0.00 0 0 0 0 0 0
0.39/0.46 c inference : 0.00 0 0 0 0 0 0
0.39/0.46 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.46 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.46 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c random : 0.00 0 0 0 0 0 0
0.39/0.46 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.46 c Primal Heuristics : Time Calls Found
0.39/0.46 c LP solutions : 0.00 - 0
0.39/0.46 c pseudo solutions : 0.00 - 0
0.39/0.46 c oneopt : 0.00 0 0
0.39/0.46 c trivial : 0.00 2 0
0.39/0.46 c simplerounding : 0.00 0 0
0.39/0.46 c zirounding : 0.00 0 0
0.39/0.46 c rounding : 0.00 1 0
0.39/0.46 c shifting : 0.00 1 0
0.39/0.46 c intshifting : 0.00 0 0
0.39/0.46 c twoopt : 0.00 0 0
0.39/0.46 c fixandinfer : 0.00 0 0
0.39/0.46 c feaspump : 0.01 1 0
0.39/0.46 c coefdiving : 0.00 0 0
0.39/0.46 c pscostdiving : 0.00 0 0
0.39/0.46 c fracdiving : 0.00 0 0
0.39/0.46 c veclendiving : 0.00 0 0
0.39/0.46 c intdiving : 0.00 0 0
0.39/0.46 c actconsdiving : 0.00 0 0
0.39/0.46 c objpscostdiving : 0.00 0 0
0.39/0.46 c rootsoldiving : 0.00 0 0
0.39/0.46 c linesearchdiving : 0.00 0 0
0.39/0.46 c guideddiving : 0.00 0 0
0.39/0.46 c octane : 0.00 0 0
0.39/0.46 c rens : 0.00 0 0
0.39/0.46 c rins : 0.00 0 0
0.39/0.46 c localbranching : 0.00 0 0
0.39/0.46 c mutation : 0.00 0 0
0.39/0.46 c crossover : 0.00 0 0
0.39/0.46 c dins : 0.00 0 0
0.39/0.46 c undercover : 0.25 1 1
0.39/0.46 c nlp : 0.00 0 0
0.39/0.46 c trysol : 0.00 0 0
0.39/0.46 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.46 c primal LP : 0.00 0 0 0.00 -
0.39/0.46 c dual LP : 0.00 1 10 10.00 -
0.39/0.46 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.46 c barrier LP : 0.00 0 0 0.00 -
0.39/0.46 c diving/probing LP: 0.01 10 155 15.50 15500.00
0.39/0.46 c strong branching : 0.00 0 0 0.00 -
0.39/0.46 c (at root node) : - 0 0 0.00 -
0.39/0.46 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.46 c B&B Tree :
0.39/0.46 c number of runs : 1
0.39/0.46 c nodes : 1
0.39/0.46 c nodes (total) : 1
0.39/0.46 c nodes left : 0
0.39/0.46 c max depth : 0
0.39/0.46 c max depth (total): 0
0.39/0.46 c backtracks : 0 (0.0%)
0.39/0.46 c delayed cutoffs : 0
0.39/0.46 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.46 c avg switch length: 2.00
0.39/0.46 c switching time : 0.00
0.39/0.46 c Solution :
0.39/0.46 c Solutions found : 1 (1 improvements)
0.39/0.46 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.29 seconds, depth 0, found by <undercover>)
0.39/0.46 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.29 seconds, depth 0, found by <undercover>)
0.39/0.46 c Dual Bound : +3.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 c Root Dual Bound : +3.00000000000000e+00
0.39/0.46 c Root Iterations : 165
0.39/0.47 c Time complete: 0.46.