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-3452138-1307102314.opb>
0.00/0.00 c original problem has 30 variables (30 bin, 0 int, 0 impl, 0 cont) and 5 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) 3 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 250 impls, 0 clqs
0.00/0.00 c (round 2) 5 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 4 upgd conss, 272 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 5 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 9 changed coefficients
0.00/0.01 c 314 implications, 0 cliques
0.00/0.01 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.01 c 49 constraints of type <and>
0.00/0.01 c 2 constraints of type <linear>
0.00/0.01 c 4 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
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.01 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.01 c 0.0s| 1 | 0 | 22 | - | 433k| 0 | 12 | 75 | 84 | 75 | 101 | 0 | 29 | 0 | 2.000000e+00 | -- | Inf
0.00/0.03 o 5
0.00/0.03 c y 0.0s| 1 | 0 | 110 | - | 500k| 0 | 12 | 75 | 84 | 75 | 101 | 0 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.03 c 0.0s| 1 | 0 | 121 | - | 530k| 0 | 18 | 75 | 130 | 75 | 109 | 8 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.04 c 0.0s| 1 | 0 | 136 | - | 500k| 0 | 18 | 75 | 94 | 75 | 93 | 12 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.04 c 0.0s| 1 | 0 | 145 | - | 535k| 0 | 25 | 75 | 94 | 75 | 101 | 20 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.05 c 0.0s| 1 | 0 | 156 | - | 592k| 0 | 27 | 75 | 94 | 75 | 109 | 28 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.05 c 0.1s| 1 | 0 | 174 | - | 613k| 0 | 21 | 75 | 94 | 75 | 115 | 34 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.06 c 0.1s| 1 | 0 | 213 | - | 625k| 0 | 18 | 75 | 94 | 75 | 119 | 38 | 29 | 0 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.07 c 0.1s| 1 | 2 | 213 | - | 626k| 0 | 18 | 75 | 94 | 75 | 119 | 38 | 29 | 8 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.07 c (run 1, node 1) restarting after 14 global fixings of integer variables
0.00/0.07 c
0.00/0.07 c (restart) converted 12 cuts from the global cut pool into linear constraints
0.00/0.07 c
0.00/0.07 c presolving:
0.00/0.07 c (round 1) 14 del vars, 8 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 316 impls, 0 clqs
0.00/0.07 c (round 2) 14 del vars, 14 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 1 chg coeffs, 0 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 3) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 1 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 4) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 7 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 5) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 10 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 6) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 14 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 7) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 18 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 8) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 21 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 9) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 23 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 10) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 24 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 11) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 12) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 27 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 13) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 30 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 14) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 31 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 15) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 32 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 16) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 34 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 17) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 36 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 18) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 38 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 19) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 40 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c (round 20) 14 del vars, 17 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 41 chg coeffs, 36 upgd conss, 316 impls, 0 clqs
0.00/0.08 c presolving (21 rounds):
0.00/0.08 c 14 deleted vars, 17 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 41 changed coefficients
0.00/0.08 c 316 implications, 0 cliques
0.00/0.08 c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 89 constraints
0.00/0.08 c 5 constraints of type <knapsack>
0.00/0.08 c 6 constraints of type <setppc>
0.00/0.08 c 39 constraints of type <and>
0.00/0.08 c 2 constraints of type <linear>
0.00/0.08 c 37 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.01
0.00/0.08 c
0.00/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.00/0.08 c 0.1s| 1 | 0 | 239 | - | 499k| 0 | 12 | 61 | 89 | 61 | 93 | 0 | 29 | 8 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.00/0.09 c 0.1s| 1 | 0 | 256 | - | 519k| 0 | 24 | 61 | 89 | 61 | 104 | 11 | 29 | 8 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.09/0.10 c 0.1s| 1 | 2 | 256 | - | 520k| 0 | 24 | 61 | 89 | 61 | 104 | 11 | 29 | 20 | 2.000000e+00 | 5.000000e+00 | 150.00%
0.09/0.11 o 2
0.09/0.11 c * 0.1s| 23 | 0 | 424 | 7.3 | 517k| 11 | - | 61 | 106 | 61 | 49 | 76 | 46 | 55 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.09/0.11 c
0.09/0.11 c SCIP Status : problem is solved [optimal solution found]
0.09/0.11 c Solving Time (sec) : 0.11
0.09/0.11 c Solving Nodes : 23 (total of 24 nodes in 2 runs)
0.09/0.11 c Primal Bound : +2.00000000000000e+00 (2 solutions)
0.09/0.11 c Dual Bound : +2.00000000000000e+00
0.09/0.11 c Gap : 0.00 %
0.09/0.11 s OPTIMUM FOUND
0.09/0.11 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 x2 -x1
0.09/0.11 c SCIP Status : problem is solved [optimal solution found]
0.09/0.11 c Total Time : 0.11
0.09/0.11 c solving : 0.11
0.09/0.11 c presolving : 0.01 (included in solving)
0.09/0.11 c reading : 0.00 (included in solving)
0.09/0.11 c Original Problem :
0.09/0.11 c Problem name : HOME/instance-3452138-1307102314.opb
0.09/0.11 c Variables : 30 (30 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.11 c Constraints : 5 initial, 5 maximal
0.09/0.11 c Presolved Problem :
0.09/0.11 c Problem name : t_HOME/instance-3452138-1307102314.opb
0.09/0.11 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.11 c Constraints : 89 initial, 106 maximal
0.09/0.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.11 c trivial : 0.00 14 0 0 0 0 0 0 0 0
0.09/0.11 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c implics : 0.00 0 2 0 0 0 0 0 0 0
0.09/0.11 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c knapsack : 0.01 0 0 0 0 0 0 0 0 40
0.09/0.11 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c and : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c linear : 0.00 1 2 0 0 0 2 0 2 10
0.09/0.11 c logicor : 0.00 0 0 0 0 0 15 0 0 0
0.09/0.11 c root node : - 14 - - 14 - - - - -
0.09/0.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.11 c integral : 0 0 0 20 0 8 0 0 1 0 0 36
0.09/0.11 c knapsack : 5 1 47 0 0 0 0 0 1 2 0 0
0.09/0.11 c setppc : 6 1 38 0 0 0 19 0 6 1 0 0
0.09/0.11 c and : 39 46 264 0 0 4 325 2 98 79 0 0
0.09/0.11 c linear : 2 8 261 0 0 1 79 12 35 0 0 0
0.09/0.11 c logicor : 37+ 7 97 0 0 1 18 6 6 0 0 0
0.09/0.11 c countsols : 0 0 0 1 0 3 0 0 0 0 0 0
0.09/0.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.11 c integral : 0.02 0.00 0.00 0.02 0.00 0.00 0.00
0.09/0.11 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.11 c vbounds : 0 0 0 0
0.09/0.11 c rootredcost : 0 0 0 0
0.09/0.11 c pseudoobj : 107 3 0 1
0.09/0.11 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.11 c vbounds : 0.00 0.00 0.00
0.09/0.11 c rootredcost : 0.00 0.00 0.00
0.09/0.11 c pseudoobj : 0.00 0.00 0.00
0.09/0.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.11 c propagation : 0.00 20 20 68 14.2 4 9.8 -
0.09/0.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.11 c applied globally : - - - 46 12.6 - - -
0.09/0.11 c applied locally : - - - 0 0.0 - - -
0.09/0.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 23)
0.09/0.11 c redcost : 0.00 47 0 3 0 0
0.09/0.11 c impliedbounds : 0.00 7 0 0 23 0
0.09/0.11 c intobj : 0.00 0 0 0 0 0
0.09/0.11 c gomory : 0.01 7 0 0 59 0
0.09/0.11 c cgmip : 0.00 0 0 0 0 0
0.09/0.11 c closecuts : 0.00 0 0 0 0 0
0.09/0.11 c strongcg : 0.01 7 0 0 182 0
0.09/0.11 c cmir : 0.00 7 0 0 35 0
0.09/0.11 c flowcover : 0.01 7 0 0 67 0
0.09/0.11 c clique : 0.00 7 0 0 0 0
0.09/0.11 c zerohalf : 0.00 0 0 0 0 0
0.09/0.11 c mcf : 0.00 2 0 0 0 0
0.09/0.11 c oddcycle : 0.00 0 0 0 0 0
0.09/0.11 c rapidlearning : 0.02 1 0 0 0 46
0.09/0.11 c Pricers : Time Calls Vars
0.09/0.11 c problem variables: 0.00 0 0
0.09/0.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.11 c relpscost : 0.02 19 0 1 0 0 36
0.09/0.11 c pscost : 0.00 0 0 0 0 0 0
0.09/0.11 c inference : 0.00 0 0 0 0 0 0
0.09/0.11 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.11 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.11 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.11 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.11 c random : 0.00 0 0 0 0 0 0
0.09/0.11 c Primal Heuristics : Time Calls Found
0.09/0.11 c LP solutions : 0.00 - 1
0.09/0.11 c pseudo solutions : 0.00 - 0
0.09/0.11 c crossover : 0.00 0 0
0.09/0.11 c coefdiving : 0.00 0 0
0.09/0.11 c pscostdiving : 0.00 0 0
0.09/0.11 c fracdiving : 0.00 0 0
0.09/0.11 c veclendiving : 0.00 0 0
0.09/0.11 c objpscostdiving : 0.00 0 0
0.09/0.11 c rootsoldiving : 0.00 0 0
0.09/0.11 c linesearchdiving : 0.00 0 0
0.09/0.11 c guideddiving : 0.00 0 0
0.09/0.11 c intshifting : 0.00 0 0
0.09/0.11 c oneopt : 0.00 1 0
0.09/0.11 c trivial : 0.00 2 0
0.09/0.11 c shiftandpropagate: 0.00 1 0
0.09/0.11 c simplerounding : 0.00 0 0
0.09/0.11 c zirounding : 0.00 0 0
0.09/0.11 c rounding : 0.00 50 0
0.09/0.11 c shifting : 0.00 10 0
0.09/0.11 c twoopt : 0.00 0 0
0.09/0.11 c fixandinfer : 0.00 0 0
0.09/0.11 c feaspump : 0.00 1 0
0.09/0.11 c clique : 0.00 0 0
0.09/0.11 c intdiving : 0.00 0 0
0.09/0.11 c actconsdiving : 0.00 0 0
0.09/0.11 c octane : 0.00 0 0
0.09/0.11 c rens : 0.01 1 0
0.09/0.11 c rins : 0.00 0 0
0.09/0.11 c localbranching : 0.00 0 0
0.09/0.11 c mutation : 0.00 0 0
0.09/0.11 c dins : 0.00 0 0
0.09/0.11 c vbounds : 0.00 0 0
0.09/0.11 c undercover : 0.00 1 0
0.09/0.11 c subnlp : 0.00 0 0
0.09/0.11 c trysol : 0.00 0 0
0.09/0.11 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.11 c primal LP : 0.00 0 0 0.00 -
0.09/0.11 c dual LP : 0.01 51 336 6.59 -
0.09/0.11 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.11 c barrier LP : 0.00 0 0 0.00 -
0.09/0.11 c diving/probing LP: 0.00 10 88 8.80 -
0.09/0.11 c strong branching : 0.02 55 1124 20.44 52565.12
0.09/0.11 c (at root node) : - 20 818 40.90 -
0.09/0.11 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.11 c B&B Tree :
0.09/0.11 c number of runs : 2
0.09/0.11 c nodes : 23
0.09/0.11 c nodes (total) : 24
0.09/0.11 c nodes left : 0
0.09/0.11 c max depth : 11
0.09/0.11 c max depth (total): 11
0.09/0.11 c backtracks : 1 (4.3%)
0.09/0.11 c delayed cutoffs : 1
0.09/0.11 c repropagations : 4 (13 domain reductions, 1 cutoffs)
0.09/0.11 c avg switch length: 2.00
0.09/0.11 c switching time : 0.00
0.09/0.11 c Solution :
0.09/0.11 c Solutions found : 2 (2 improvements)
0.09/0.11 c First Solution : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trysol>)
0.09/0.11 c Primal Bound : +2.00000000000000e+00 (in run 2, after 23 nodes, 0.11 seconds, depth 11, found by <relaxation>)
0.09/0.11 c Dual Bound : +2.00000000000000e+00
0.09/0.11 c Gap : 0.00 %
0.09/0.11 c Root Dual Bound : +2.00000000000000e+00
0.09/0.11 c Root Iterations : 256
0.09/0.11 c Time complete: 0.11.