0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452015-1307102194.opb>
0.00/0.00 c original problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 11 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 6 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 744 impls, 0 clqs
0.00/0.01 c (round 2) 18 del vars, 9 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 1110 impls, 0 clqs
0.00/0.01 c (round 3) 29 del vars, 18 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 6 upgd conss, 1350 impls, 0 clqs
0.00/0.01 c (round 4) 39 del vars, 26 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 6 upgd conss, 1510 impls, 0 clqs
0.00/0.01 c (round 5) 49 del vars, 34 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 6 upgd conss, 1590 impls, 0 clqs
0.00/0.01 c (round 6) 59 del vars, 42 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 6 upgd conss, 1590 impls, 0 clqs
0.00/0.01 c (round 7) 60 del vars, 43 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 6 upgd conss, 1590 impls, 0 clqs
0.00/0.01 c presolving (8 rounds):
0.00/0.01 c 60 deleted vars, 43 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 60 changed coefficients
0.00/0.01 c 1620 implications, 0 cliques
0.00/0.01 c presolved problem has 140 variables (140 bin, 0 int, 0 impl, 0 cont) and 88 constraints
0.00/0.01 c 77 constraints of type <and>
0.00/0.01 c 5 constraints of type <linear>
0.00/0.01 c 6 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 2)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.4
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1800
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 25 | - | 723k| 0 | 20 | 140 | 102 | 140 | 165 | 0 | 14 | 0 | 3.000000e+00 | -- | Inf
0.00/0.04 o 3
0.00/0.04 c U 0.0s| 1 | 0 | 238 | - | 733k| 0 | - | 140 | 102 | 140 | 165 | 0 | 14 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.04 c 0.0s| 1 | 0 | 238 | - | 731k| 0 | - | 140 | 102 | 140 | 165 | 0 | 14 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.04 c Dual Bound : +3.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v -x75 x74 -x73 x72 -x71 -x70 -x69 -x68 x67 x66 x50 -x49 x48 x47 x46 -x65 -x64 -x63 -x62 x61 x45 -x44 -x43 -x42 x41 -x60 -x59 -x58
0.00/0.04 v -x57 -x56 -x40 -x39 x38 x37 x36 -x55 -x54 -x53 -x52 x51 -x35 -x34 -x33 -x32 x31 -x30 x29 x28 x27 x26 -x25 -x24 x23 x22 x21
0.00/0.04 v -x20 -x19 x18 x17 x16 -x15 -x14 x13 x12 x11 -x10 x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.01 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3452015-1307102194.opb
0.00/0.04 c Variables : 75 (75 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 11 initial, 11 maximal
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3452015-1307102194.opb
0.00/0.04 c Variables : 140 (140 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 88 initial, 102 maximal
0.00/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c and : 0.00 10 43 0 0 0 43 0 0 42
0.00/0.04 c linear : 0.00 1 6 0 0 0 0 0 0 18
0.00/0.04 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - 0 - - 0 - - - - -
0.00/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.04 c and : 77 0 384 0 0 4 519 1 0 0 0 0
0.00/0.04 c linear : 5 0 383 0 0 3 248 3 0 0 0 0
0.00/0.04 c logicor : 6+ 0 86 0 0 1 36 9 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c pseudoobj : 90 0 0 0
0.00/0.04 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.04 c vbounds : 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 13 12 121 40.5 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 14 20.4 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c redcost : 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0 0 0 0 0
0.00/0.04 c clique : 0.00 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.04 c Pricers : Time Calls Vars
0.00/0.04 c problem variables: 0.00 0 0
0.00/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : Time Calls Found
0.00/0.04 c LP solutions : 0.00 - 0
0.00/0.04 c pseudo solutions : 0.00 - 0
0.00/0.04 c oneopt : 0.00 0 0
0.00/0.04 c trivial : 0.00 2 0
0.00/0.04 c shiftandpropagate: 0.00 1 0
0.00/0.04 c simplerounding : 0.00 0 0
0.00/0.04 c zirounding : 0.00 0 0
0.00/0.04 c rounding : 0.00 1 0
0.00/0.04 c shifting : 0.00 1 0
0.00/0.04 c intshifting : 0.00 0 0
0.00/0.04 c twoopt : 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0 0
0.00/0.04 c feaspump : 0.00 1 0
0.00/0.04 c clique : 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0 0
0.00/0.04 c intdiving : 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0 0
0.00/0.04 c octane : 0.00 0 0
0.00/0.04 c rens : 0.00 0 0
0.00/0.04 c rins : 0.00 0 0
0.00/0.04 c localbranching : 0.00 0 0
0.00/0.04 c mutation : 0.00 0 0
0.00/0.04 c crossover : 0.00 0 0
0.00/0.04 c dins : 0.00 0 0
0.00/0.04 c vbounds : 0.00 0 0
0.00/0.04 c undercover : 0.02 1 1
0.00/0.04 c subnlp : 0.00 0 0
0.00/0.04 c trysol : 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.04 c primal LP : 0.00 0 0 0.00 -
0.00/0.04 c dual LP : 0.00 1 25 25.00 -
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 -
0.00/0.04 c diving/probing LP: 0.00 12 213 17.75 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 1
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 1 (1 improvements)
0.00/0.04 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <undercover>)
0.00/0.04 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <undercover>)
0.00/0.04 c Dual Bound : +3.00000000000000e+00
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +3.00000000000000e+00
0.00/0.04 c Root Iterations : 238
0.00/0.04 c Time complete: 0.04.