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-3452084-1307102262.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, 784 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, 26 chg coeffs, 1 upgd conss, 1151 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, 35 chg coeffs, 7 upgd conss, 1391 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, 43 chg coeffs, 7 upgd conss, 1551 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, 51 chg coeffs, 7 upgd conss, 1631 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, 59 chg coeffs, 7 upgd conss, 1631 impls, 0 clqs
0.00/0.01 c presolving (7 rounds):
0.00/0.01 c 59 deleted vars, 42 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 59 changed coefficients
0.00/0.01 c 1661 implications, 0 cliques
0.00/0.01 c presolved problem has 141 variables (141 bin, 0 int, 0 impl, 0 cont) and 89 constraints
0.00/0.01 c 78 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 | 27 | - | 733k| 0 | 18 | 141 | 117 | 141 | 167 | 0 | 28 | 0 | 3.000000e+00 | -- | Inf
0.00/0.04 o 9
0.00/0.04 c y 0.0s| 1 | 0 | 250 | - | 803k| 0 | 18 | 141 | 117 | 141 | 167 | 0 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.00/0.04 c 0.0s| 1 | 0 | 262 | - | 774k| 0 | 30 | 141 | 130 | 141 | 175 | 8 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.04/0.05 c 0.0s| 1 | 0 | 277 | - | 790k| 0 | 34 | 141 | 115 | 141 | 169 | 18 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.04/0.06 c 0.1s| 1 | 0 | 306 | - | 854k| 0 | 39 | 141 | 115 | 141 | 180 | 29 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.04/0.07 c 0.1s| 1 | 0 | 352 | - | 902k| 0 | 49 | 141 | 115 | 141 | 198 | 47 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.04/0.08 c 0.1s| 1 | 0 | 380 | - | 930k| 0 | 61 | 141 | 115 | 141 | 212 | 61 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.09/0.10 c 0.1s| 1 | 0 | 403 | - | 952k| 0 | 59 | 141 | 115 | 141 | 231 | 80 | 28 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.09/0.14 c 0.1s| 1 | 2 | 403 | - | 952k| 0 | 59 | 141 | 115 | 141 | 231 | 80 | 28 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.09/0.14 c (run 1, node 1) restarting after 12 global fixings of integer variables
0.09/0.14 c
0.09/0.14 c (restart) converted 39 cuts from the global cut pool into linear constraints
0.09/0.14 c
0.09/0.14 c presolving:
0.09/0.14 c (round 1) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 2) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 3) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 4) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 5) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 6) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c (round 7) 12 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 45 upgd conss, 1663 impls, 1 clqs
0.09/0.14 c presolving (8 rounds):
0.09/0.14 c 12 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 26 changed coefficients
0.09/0.14 c 1663 implications, 1 cliques
0.09/0.14 c presolved problem has 129 variables (129 bin, 0 int, 0 impl, 0 cont) and 142 constraints
0.09/0.14 c 19 constraints of type <knapsack>
0.09/0.14 c 12 constraints of type <setppc>
0.09/0.14 c 70 constraints of type <and>
0.09/0.14 c 5 constraints of type <linear>
0.09/0.14 c 36 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.02
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 | 438 | - | 918k| 0 | 28 | 129 | 142 | 129 | 190 | 0 | 28 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.09/0.15 c 0.2s| 1 | 0 | 465 | - | 997k| 0 | 35 | 129 | 142 | 129 | 205 | 15 | 28 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.09/0.17 c 0.2s| 1 | 2 | 465 | - | 997k| 0 | 35 | 129 | 142 | 129 | 205 | 15 | 28 | 26 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.19/0.26 o 3
0.19/0.26 c * 0.3s| 66 | 0 | 938 | 7.2 | 994k| 25 | - | 129 | 178 | 129 | 93 | 153 | 64 | 288 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.19/0.26 c
0.19/0.26 c SCIP Status : problem is solved [optimal solution found]
0.19/0.26 c Solving Time (sec) : 0.26
0.19/0.26 c Solving Nodes : 66 (total of 67 nodes in 2 runs)
0.19/0.26 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.19/0.26 c Dual Bound : +3.00000000000000e+00
0.19/0.26 c Gap : 0.00 %
0.19/0.26 s OPTIMUM FOUND
0.19/0.26 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.19/0.26 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 -x20
0.19/0.26 v -x19 x18 -x17 x16 -x15 -x14 x13 x12 x11 -x10 x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
0.19/0.26 c SCIP Status : problem is solved [optimal solution found]
0.19/0.26 c Total Time : 0.26
0.19/0.26 c solving : 0.26
0.19/0.26 c presolving : 0.02 (included in solving)
0.19/0.26 c reading : 0.00 (included in solving)
0.19/0.26 c Original Problem :
0.19/0.26 c Problem name : HOME/instance-3452084-1307102262.opb
0.19/0.26 c Variables : 75 (75 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.26 c Constraints : 11 initial, 11 maximal
0.19/0.26 c Presolved Problem :
0.19/0.26 c Problem name : t_HOME/instance-3452084-1307102262.opb
0.19/0.26 c Variables : 129 (129 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.26 c Constraints : 142 initial, 178 maximal
0.19/0.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.26 c trivial : 0.00 12 0 0 0 0 0 0 0 0
0.19/0.26 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c knapsack : 0.00 0 0 0 0 0 0 0 0 24
0.19/0.26 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.26 c and : 0.00 10 41 0 0 0 41 0 0 41
0.19/0.26 c linear : 0.00 2 6 0 0 0 0 0 0 20
0.19/0.26 c logicor : 0.00 0 0 0 0 0 13 0 0 0
0.19/0.26 c root node : - 12 - - 12 - - - - -
0.19/0.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.26 c integral : 0 0 0 66 0 8 0 0 14 0 0 114
0.19/0.26 c knapsack : 19 1 165 0 0 0 8 0 6 16 0 0
0.19/0.26 c setppc : 12 1 154 0 0 0 41 0 10 0 0 0
0.19/0.26 c and : 70 123 534 0 0 4 980 3 148 170 0 0
0.19/0.26 c linear : 5 8 530 0 0 2 482 17 77 0 0 0
0.19/0.26 c logicor : 36+ 7 139 1 0 1 65 8 8 0 0 0
0.19/0.26 c countsols : 0 0 0 1 0 3 0 0 0 0 0 0
0.19/0.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.26 c integral : 0.10 0.00 0.00 0.10 0.00 0.00 0.00
0.19/0.26 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.26 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.26 c vbounds : 0 0 0 0
0.19/0.26 c rootredcost : 0 0 0 0
0.19/0.26 c pseudoobj : 239 0 0 0
0.19/0.26 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.26 c vbounds : 0.00 0.00 0.00
0.19/0.26 c rootredcost : 0.00 0.00 0.00
0.19/0.26 c pseudoobj : 0.00 0.00 0.00
0.19/0.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.26 c propagation : 0.00 28 28 259 35.7 11 7.0 -
0.19/0.26 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.26 c applied globally : - - - 64 14.6 - - -
0.19/0.26 c applied locally : - - - 0 0.0 - - -
0.19/0.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.26 c cut pool : 0.00 0 - - 0 - (maximal pool size: 68)
0.19/0.26 c redcost : 0.00 124 0 2 0 0
0.19/0.26 c impliedbounds : 0.00 7 0 0 40 0
0.19/0.26 c intobj : 0.00 0 0 0 0 0
0.19/0.26 c gomory : 0.02 7 0 0 251 0
0.19/0.26 c cgmip : 0.00 0 0 0 0 0
0.19/0.26 c closecuts : 0.00 0 0 0 0 0
0.19/0.26 c strongcg : 0.02 7 0 0 357 0
0.19/0.26 c cmir : 0.01 7 0 0 69 0
0.19/0.26 c flowcover : 0.02 7 0 0 134 0
0.19/0.26 c clique : 0.00 7 0 0 1 0
0.19/0.26 c zerohalf : 0.00 0 0 0 0 0
0.19/0.26 c mcf : 0.00 2 0 0 0 0
0.19/0.26 c oddcycle : 0.00 0 0 0 0 0
0.19/0.26 c rapidlearning : 0.01 1 0 0 0 13
0.19/0.26 c Pricers : Time Calls Vars
0.19/0.26 c problem variables: 0.00 0 0
0.19/0.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.26 c relpscost : 0.10 65 0 14 0 0 114
0.19/0.26 c pscost : 0.00 0 0 0 0 0 0
0.19/0.26 c inference : 0.00 0 0 0 0 0 0
0.19/0.26 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.26 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.26 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.26 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.26 c random : 0.00 0 0 0 0 0 0
0.19/0.26 c Primal Heuristics : Time Calls Found
0.19/0.26 c LP solutions : 0.00 - 1
0.19/0.26 c pseudo solutions : 0.00 - 0
0.19/0.26 c crossover : 0.00 0 0
0.19/0.26 c fracdiving : 0.00 0 0
0.19/0.26 c veclendiving : 0.00 0 0
0.19/0.26 c objpscostdiving : 0.00 0 0
0.19/0.26 c rootsoldiving : 0.00 0 0
0.19/0.26 c linesearchdiving : 0.00 0 0
0.19/0.26 c guideddiving : 0.00 0 0
0.19/0.26 c intshifting : 0.00 0 0
0.19/0.26 c oneopt : 0.00 1 0
0.19/0.26 c coefdiving : 0.00 1 0
0.19/0.26 c pscostdiving : 0.00 1 0
0.19/0.26 c feaspump : 0.00 1 0
0.19/0.26 c trivial : 0.00 2 0
0.19/0.26 c shiftandpropagate: 0.00 1 0
0.19/0.26 c simplerounding : 0.00 0 0
0.19/0.26 c zirounding : 0.00 0 0
0.19/0.26 c rounding : 0.00 109 0
0.19/0.26 c shifting : 0.01 30 0
0.19/0.26 c twoopt : 0.00 0 0
0.19/0.26 c fixandinfer : 0.00 0 0
0.19/0.26 c clique : 0.00 0 0
0.19/0.26 c intdiving : 0.00 0 0
0.19/0.26 c actconsdiving : 0.00 0 0
0.19/0.26 c octane : 0.00 0 0
0.19/0.26 c rens : 0.01 1 0
0.19/0.26 c rins : 0.00 0 0
0.19/0.26 c localbranching : 0.00 0 0
0.19/0.26 c mutation : 0.00 0 0
0.19/0.26 c dins : 0.00 0 0
0.19/0.26 c vbounds : 0.00 0 0
0.19/0.26 c undercover : 0.00 1 0
0.19/0.26 c subnlp : 0.00 0 0
0.19/0.26 c trysol : 0.00 0 0
0.19/0.26 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.26 c primal LP : 0.00 0 0 0.00 -
0.19/0.26 c dual LP : 0.02 129 691 5.36 37262.73
0.19/0.26 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.26 c barrier LP : 0.00 0 0 0.00 -
0.19/0.26 c diving/probing LP: 0.00 20 247 12.35 -
0.19/0.26 c strong branching : 0.10 288 3365 11.68 33124.97
0.19/0.26 c (at root node) : - 26 1453 55.88 -
0.19/0.26 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.26 c B&B Tree :
0.19/0.26 c number of runs : 2
0.19/0.26 c nodes : 66
0.19/0.26 c nodes (total) : 67
0.19/0.26 c nodes left : 0
0.19/0.26 c max depth : 25
0.19/0.26 c max depth (total): 25
0.19/0.26 c backtracks : 3 (4.5%)
0.19/0.26 c delayed cutoffs : 1
0.19/0.26 c repropagations : 13 (34 domain reductions, 1 cutoffs)
0.19/0.26 c avg switch length: 2.27
0.19/0.26 c switching time : 0.00
0.19/0.26 c Solution :
0.19/0.26 c Solutions found : 2 (2 improvements)
0.19/0.26 c First Solution : +9.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trysol>)
0.19/0.26 c Primal Bound : +3.00000000000000e+00 (in run 2, after 66 nodes, 0.26 seconds, depth 25, found by <relaxation>)
0.19/0.26 c Dual Bound : +3.00000000000000e+00
0.19/0.26 c Gap : 0.00 %
0.19/0.26 c Root Dual Bound : +3.00000000000000e+00
0.19/0.26 c Root Iterations : 465
0.19/0.26 c Time complete: 0.26.