0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702986-1278564373.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 190 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.02 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.03 c (round 2) 20 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1799 impls, 0 clqs
0.00/0.03 c (round 3) 31 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 8 upgd conss, 2199 impls, 0 clqs
0.00/0.03 c (round 4) 41 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 8 upgd conss, 2519 impls, 0 clqs
0.00/0.03 c (round 5) 51 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 8 upgd conss, 2759 impls, 0 clqs
0.00/0.04 c (round 6) 61 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 8 upgd conss, 2919 impls, 0 clqs
0.00/0.04 c (round 7) 71 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.04 c (round 8) 81 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 151/199 (75.9%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (9 rounds):
0.00/0.05 c 81 deleted vars, 57 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 81 changed coefficients
0.00/0.05 c 3027 implications, 0 cliques
0.00/0.05 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 126 constraints
0.00/0.05 c 110 constraints of type <and>
0.00/0.05 c 7 constraints of type <linear>
0.00/0.05 c 9 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1790
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c heuristics/undercover/freq = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.05/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.06 c 0.0s| 1 | 0 | 18 | - |1022k| 0 | 9 | 199 | 126 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 o 9
0.09/0.19 c y 0.2s| 1 | 0 | 292 | - |1089k| 0 | 9 | 199 | 126 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.20/0.20 c 0.2s| 1 | 0 | 308 | - |1435k| 0 | 30 | 199 | 355 | 199 | 230 | 13 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.20/0.22 c 0.2s| 1 | 0 | 326 | - |1509k| 0 | 41 | 199 | 355 | 199 | 249 | 32 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.20/0.25 c 0.2s| 1 | 0 | 355 | - |1591k| 0 | 54 | 199 | 355 | 199 | 269 | 52 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.20/0.28 c 0.3s| 1 | 0 | 382 | - |1678k| 0 | 63 | 199 | 355 | 199 | 288 | 71 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.29/0.33 c 0.3s| 1 | 0 | 419 | - |1709k| 0 | 76 | 199 | 355 | 199 | 302 | 85 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.29/0.39 c 0.4s| 1 | 0 | 473 | - |1758k| 0 | 78 | 199 | 355 | 199 | 322 | 105 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.39/0.49 c 0.5s| 1 | 2 | 473 | - |1759k| 0 | 78 | 199 | 355 | 199 | 322 | 105 | 0 | 10 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.39/0.49 c (run 1, node 1) restarting after 12 global fixings of integer variables
0.39/0.49 c
0.39/0.49 c (restart) converted 51 cuts from the global cut pool into linear constraints
0.39/0.49 c
0.39/0.49 c presolving:
0.49/0.50 c (round 1) 12 del vars, 0 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 3029 impls, 0 clqs
0.49/0.50 c (round 2) 12 del vars, 101 del conss, 0 chg bounds, 41 chg sides, 0 chg coeffs, 0 upgd conss, 3029 impls, 0 clqs
0.49/0.51 c (round 3) 12 del vars, 145 del conss, 0 chg bounds, 41 chg sides, 0 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.51 c (round 4) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 5 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.51 c (round 5) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 7 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.51 c (round 6) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 9 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.51 c (round 7) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 11 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 8) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 13 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 9) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 14 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 10) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 15 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 11) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 16 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 12) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 17 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c (round 13) 12 del vars, 145 del conss, 0 chg bounds, 43 chg sides, 18 chg coeffs, 187 upgd conss, 3029 impls, 0 clqs
0.49/0.52 c presolving (14 rounds):
0.49/0.52 c 12 deleted vars, 145 deleted constraints, 0 tightened bounds, 0 added holes, 43 changed sides, 18 changed coefficients
0.49/0.52 c 3029 implications, 0 cliques
0.49/0.52 c presolved problem has 187 variables (187 bin, 0 int, 0 impl, 0 cont) and 262 constraints
0.49/0.52 c 35 constraints of type <knapsack>
0.49/0.52 c 6 constraints of type <setppc>
0.49/0.52 c 102 constraints of type <and>
0.49/0.52 c 7 constraints of type <linear>
0.49/0.52 c 112 constraints of type <logicor>
0.49/0.52 c transformed objective value is always integral (scale: 2)
0.49/0.52 c Presolving Time: 0.07
0.49/0.52 c
0.49/0.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.5s| 1 | 0 | 524 | - |1471k| 0 | 42 | 187 | 262 | 187 | 271 | 0 | 0 | 10 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.49/0.57 c 0.6s| 1 | 0 | 560 | - |1549k| 0 | 64 | 187 | 262 | 187 | 296 | 25 | 0 | 10 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.60/0.63 c 0.6s| 1 | 2 | 560 | - |1550k| 0 | 64 | 187 | 262 | 187 | 296 | 25 | 0 | 27 | 3.000000e+00 | 9.000000e+00 | 200.00%
1.30/1.36 o 3
1.30/1.36 c * 1.4s| 107 | 0 | 1277 | 6.8 |1560k| 34 | - | 187 | 295 | 187 | 134 | 211 | 33 | 757 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.30/1.36 c
1.30/1.36 c SCIP Status : problem is solved [optimal solution found]
1.30/1.36 c Solving Time (sec) : 1.35
1.30/1.36 c Solving Nodes : 107 (total of 108 nodes in 2 runs)
1.30/1.36 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.30/1.36 c Dual Bound : +3.00000000000000e+00
1.30/1.36 c Gap : 0.00 %
1.30/1.36 s OPTIMUM FOUND
1.30/1.36 v -x105 x104 -x103 -x102 x101 -x100 x99 -x98 -x97 -x96 x70 -x69 x68 x67 x66 -x95 -x94 -x93 -x92 -x91 -x65 x64 -x63 -x62 x61 -x90
1.30/1.36 v x89 x88 x87 x86 -x60 -x59 -x58 x57 x56 -x85 -x84 -x83 x82 x81 x55 -x54 x53 -x52 x51 x80 -x79 -x78 x77 x76 -x50 x49 x48 -x47 x46
1.30/1.36 v -x75 -x74 -x73 -x72 -x71 x45 x44 -x43 x42 x41 -x40 x39 x38 -x37 x36 x35 x34 x33 x32 x31 -x30 -x29 -x28 x27 x26 x25 -x24 x23
1.30/1.36 v x22 x21 -x20 x19 -x18 -x17 x16 x15 -x14 x13 x12 x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
1.30/1.36 c SCIP Status : problem is solved [optimal solution found]
1.30/1.36 c Solving Time : 1.35
1.30/1.36 c Original Problem :
1.30/1.36 c Problem name : HOME/instance-2702986-1278564373.opb
1.30/1.36 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
1.30/1.36 c Constraints : 190 initial, 190 maximal
1.30/1.36 c Presolved Problem :
1.30/1.36 c Problem name : t_HOME/instance-2702986-1278564373.opb
1.30/1.36 c Variables : 187 (187 binary, 0 integer, 0 implicit integer, 0 continuous)
1.30/1.36 c Constraints : 262 initial, 295 maximal
1.30/1.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.30/1.36 c trivial : 0.00 12 0 0 0 0 0 0 0
1.30/1.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.30/1.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.30/1.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.30/1.36 c implics : 0.00 0 0 0 0 0 0 0 0
1.30/1.36 c probing : 0.01 0 0 0 0 0 0 0 0
1.30/1.36 c knapsack : 0.01 0 0 0 0 0 0 2 18
1.30/1.36 c setppc : 0.00 0 0 0 0 0 0 0 0
1.30/1.36 c and : 0.01 14 57 0 0 0 57 0 57
1.30/1.36 c linear : 0.01 2 8 0 0 0 101 41 24
1.30/1.36 c logicor : 0.01 0 0 0 0 0 44 0 0
1.30/1.36 c root node : - 12 - - 12 - - - -
1.30/1.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.30/1.36 c integral : 0 0 0 100 0 1 14 0 0 176
1.30/1.36 c knapsack : 35 1 278 0 0 1 7 21 0 0
1.30/1.36 c setppc : 6 1 236 0 0 0 2 0 0 0
1.30/1.36 c and : 102 187 593 0 0 10 319 209 0 0
1.30/1.36 c linear : 7 8 582 0 0 10 181 30 0 0
1.30/1.36 c logicor : 112+ 8 170 1 0 0 19 6 0 0
1.30/1.36 c countsols : 0 0 0 1 0 0 0 0 0 0
1.30/1.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.30/1.36 c integral : 0.76 0.00 0.00 0.76 0.00
1.30/1.36 c knapsack : 0.01 0.00 0.01 0.00 0.00
1.30/1.36 c setppc : 0.00 0.00 0.00 0.00 0.00
1.30/1.36 c and : 0.01 0.01 0.00 0.00 0.00
1.30/1.36 c linear : 0.01 0.00 0.01 0.00 0.00
1.30/1.36 c logicor : 0.00 0.00 0.00 0.00 0.00
1.30/1.36 c countsols : 0.00 0.00 0.00 0.00 0.00
1.30/1.36 c Propagators : Time Calls Cutoffs DomReds
1.30/1.36 c vbounds : 0.00 3 0 0
1.30/1.36 c rootredcost : 0.00 0 0 0
1.30/1.36 c pseudoobj : 0.00 282 0 0
1.30/1.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.30/1.36 c propagation : 0.00 21 20 102 19.0 5 9.8 -
1.30/1.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.30/1.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.30/1.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.30/1.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.30/1.36 c applied globally : - - - 33 12.2 - - -
1.30/1.36 c applied locally : - - - 0 0.0 - - -
1.30/1.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.30/1.36 c cut pool : 0.00 0 - - 0 - (maximal pool size: 66)
1.30/1.36 c redcost : 0.00 187 0 0 0 0
1.30/1.36 c impliedbounds : 0.00 7 0 0 44 0
1.30/1.36 c intobj : 0.00 0 0 0 0 0
1.30/1.36 c cgmip : 0.00 0 0 0 0 0
1.30/1.36 c gomory : 0.07 7 0 0 158 0
1.30/1.36 c strongcg : 0.05 7 0 0 336 0
1.30/1.36 c cmir : 0.03 7 0 0 92 0
1.30/1.36 c flowcover : 0.05 7 0 0 195 0
1.30/1.36 c clique : 0.00 7 0 0 0 0
1.30/1.36 c zerohalf : 0.00 0 0 0 0 0
1.30/1.36 c mcf : 0.00 2 0 0 0 0
1.30/1.36 c rapidlearning : 0.11 1 0 12 0 252
1.30/1.36 c Pricers : Time Calls Vars
1.30/1.36 c problem variables: 0.00 0 0
1.30/1.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.30/1.36 c relpscost : 0.76 99 1 14 0 0 176
1.30/1.36 c pscost : 0.00 0 0 0 0 0 0
1.30/1.36 c inference : 0.00 0 0 0 0 0 0
1.30/1.36 c mostinf : 0.00 0 0 0 0 0 0
1.30/1.37 c leastinf : 0.00 0 0 0 0 0 0
1.30/1.37 c fullstrong : 0.00 0 0 0 0 0 0
1.30/1.37 c allfullstrong : 0.00 0 0 0 0 0 0
1.30/1.37 c random : 0.00 0 0 0 0 0 0
1.30/1.37 c Primal Heuristics : Time Calls Found
1.30/1.37 c LP solutions : 0.00 - 1
1.30/1.37 c pseudo solutions : 0.00 - 0
1.30/1.37 c crossover : 0.00 0 0
1.30/1.37 c coefdiving : 0.00 0 0
1.30/1.37 c pscostdiving : 0.00 0 0
1.30/1.37 c fracdiving : 0.00 0 0
1.30/1.37 c veclendiving : 0.00 0 0
1.30/1.37 c objpscostdiving : 0.00 0 0
1.30/1.37 c rootsoldiving : 0.00 0 0
1.30/1.37 c linesearchdiving : 0.00 0 0
1.30/1.37 c guideddiving : 0.00 0 0
1.30/1.37 c intshifting : 0.00 0 0
1.30/1.37 c oneopt : 0.00 1 0
1.30/1.37 c feaspump : 0.01 1 0
1.30/1.37 c trivial : 0.00 2 0
1.30/1.37 c simplerounding : 0.00 0 0
1.30/1.37 c zirounding : 0.00 88 0
1.30/1.37 c rounding : 0.01 147 0
1.30/1.37 c shifting : 0.02 27 0
1.30/1.37 c twoopt : 0.00 0 0
1.30/1.37 c fixandinfer : 0.00 0 0
1.30/1.37 c intdiving : 0.00 0 0
1.30/1.37 c actconsdiving : 0.00 0 0
1.30/1.37 c octane : 0.00 0 0
1.30/1.37 c rens : 0.02 1 0
1.30/1.37 c rins : 0.00 0 0
1.30/1.37 c localbranching : 0.00 0 0
1.30/1.37 c mutation : 0.00 0 0
1.30/1.37 c dins : 0.00 0 0
1.30/1.37 c undercover : 0.02 1 0
1.30/1.37 c nlp : 0.00 0 0
1.30/1.37 c trysol : 0.00 0 0
1.30/1.37 c LP : Time Calls Iterations Iter/call Iter/sec
1.30/1.37 c primal LP : 0.00 0 0 0.00 -
1.30/1.37 c dual LP : 0.08 191 1003 5.25 12232.15
1.30/1.37 c lex dual LP : 0.00 0 0 0.00 -
1.30/1.37 c barrier LP : 0.00 0 0 0.00 -
1.30/1.37 c diving/probing LP: 0.01 14 274 19.57 -
1.30/1.37 c strong branching : 0.76 757 8894 11.75 11764.81
1.30/1.37 c (at root node) : - 27 1336 49.48 -
1.30/1.37 c conflict analysis: 0.00 0 0 0.00 -
1.30/1.37 c B&B Tree :
1.30/1.37 c number of runs : 2
1.30/1.37 c nodes : 107
1.30/1.37 c nodes (total) : 108
1.30/1.37 c nodes left : 0
1.30/1.37 c max depth : 34
1.30/1.37 c max depth (total): 34
1.30/1.37 c backtracks : 7 (6.5%)
1.30/1.37 c delayed cutoffs : 3
1.30/1.37 c repropagations : 17 (82 domain reductions, 3 cutoffs)
1.30/1.37 c avg switch length: 2.71
1.30/1.37 c switching time : 0.01
1.30/1.37 c Solution :
1.30/1.37 c Solutions found : 2 (2 improvements)
1.30/1.37 c First Solution : +9.00000000000000e+00 (in run 1, after 1 nodes, 0.17 seconds, depth 0, found by <trysol>)
1.30/1.37 c Primal Bound : +3.00000000000000e+00 (in run 2, after 107 nodes, 1.35 seconds, depth 34, found by <relaxation>)
1.30/1.37 c Dual Bound : +3.00000000000000e+00
1.30/1.37 c Gap : 0.00 %
1.30/1.37 c Root Dual Bound : +3.00000000000000e+00
1.30/1.37 c Root Iterations : 560
1.30/1.37 c Time complete: 1.37.