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-2703034-1278564407.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) 21 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1818 impls, 0 clqs
0.00/0.03 c (round 3) 31 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 8 upgd conss, 2218 impls, 0 clqs
0.00/0.03 c (round 4) 41 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 8 upgd conss, 2538 impls, 0 clqs
0.00/0.03 c (round 5) 51 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 8 upgd conss, 2778 impls, 0 clqs
0.03/0.04 c (round 6) 61 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 2938 impls, 0 clqs
0.03/0.04 c (round 7) 71 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.03/0.04 c (round 8) 81 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 80 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.03/0.05 c (0.0s) probing: 155/199 (77.9%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.03/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.05 c presolving (9 rounds):
0.03/0.05 c 81 deleted vars, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 80 changed coefficients
0.03/0.05 c 3046 implications, 0 cliques
0.03/0.05 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 127 constraints
0.03/0.05 c 110 constraints of type <and>
0.03/0.05 c 7 constraints of type <linear>
0.03/0.05 c 10 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 2)
0.03/0.05 c Presolving Time: 0.04
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 1.2.1.3
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1790
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 1620
0.03/0.05 c
0.03/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.05 c # [type: int, range: [1,2], default: 1]
0.03/0.05 c timing/clocktype = 2
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/indicator/addCouplingCons = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c heuristics/undercover/freq = 0
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.05 c
0.03/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.05 c 0.0s| 1 | 0 | 17 | - |1024k| 0 | 8 | 199 | 127 | 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 | 289 | - |1070k| 0 | 8 | 199 | 127 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.19/0.20 c 0.2s| 1 | 0 | 314 | - |1422k| 0 | 35 | 199 | 328 | 199 | 230 | 13 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.19/0.23 c 0.2s| 1 | 0 | 339 | - |1494k| 0 | 44 | 199 | 328 | 199 | 251 | 34 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.19/0.25 c 0.2s| 1 | 0 | 370 | - |1556k| 0 | 54 | 199 | 328 | 199 | 269 | 52 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.19/0.29 c 0.3s| 1 | 0 | 408 | - |1591k| 0 | 53 | 199 | 328 | 199 | 286 | 69 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.29/0.33 c 0.3s| 1 | 0 | 444 | - |1637k| 0 | 81 | 199 | 328 | 199 | 309 | 92 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.29/0.39 c 0.4s| 1 | 0 | 476 | - |1661k| 0 | 95 | 199 | 328 | 199 | 326 | 109 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.39/0.48 c 0.5s| 1 | 2 | 476 | - |1661k| 0 | 95 | 199 | 328 | 199 | 326 | 109 | 0 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.39/0.48 c (run 1, node 1) restarting after 12 global fixings of integer variables
0.39/0.48 c
0.39/0.48 c (restart) converted 71 cuts from the global cut pool into linear constraints
0.39/0.48 c
0.39/0.48 c presolving:
0.39/0.49 c (round 1) 12 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 3048 impls, 0 clqs
0.39/0.49 c (round 2) 12 del vars, 106 del conss, 0 chg bounds, 29 chg sides, 1 chg coeffs, 0 upgd conss, 3048 impls, 0 clqs
0.39/0.49 c (round 3) 12 del vars, 120 del conss, 0 chg bounds, 29 chg sides, 1 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.39/0.50 c (round 4) 12 del vars, 120 del conss, 0 chg bounds, 43 chg sides, 85 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.49/0.50 c (round 5) 12 del vars, 120 del conss, 0 chg bounds, 43 chg sides, 87 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.49/0.50 c (round 6) 12 del vars, 120 del conss, 0 chg bounds, 43 chg sides, 89 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.49/0.50 c (round 7) 12 del vars, 120 del conss, 0 chg bounds, 43 chg sides, 91 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.49/0.50 c (round 8) 12 del vars, 120 del conss, 0 chg bounds, 43 chg sides, 93 chg coeffs, 174 upgd conss, 3048 impls, 0 clqs
0.49/0.50 c presolving (9 rounds):
0.49/0.50 c 12 deleted vars, 120 deleted constraints, 0 tightened bounds, 0 added holes, 43 changed sides, 93 changed coefficients
0.49/0.50 c 3048 implications, 0 cliques
0.49/0.50 c presolved problem has 187 variables (187 bin, 0 int, 0 impl, 0 cont) and 279 constraints
0.49/0.50 c 33 constraints of type <knapsack>
0.49/0.50 c 19 constraints of type <setppc>
0.49/0.50 c 102 constraints of type <and>
0.49/0.50 c 7 constraints of type <linear>
0.49/0.50 c 118 constraints of type <logicor>
0.49/0.50 c transformed objective value is always integral (scale: 2)
0.49/0.50 c Presolving Time: 0.06
0.49/0.50 c
0.49/0.51 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.51 c 0.5s| 1 | 0 | 528 | - |1467k| 0 | 47 | 187 | 279 | 187 | 285 | 0 | 0 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.49/0.54 c 0.5s| 1 | 0 | 568 | - |1537k| 0 | 58 | 187 | 279 | 187 | 307 | 22 | 0 | 9 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.59/0.61 c 0.6s| 1 | 2 | 568 | - |1538k| 0 | 58 | 187 | 279 | 187 | 307 | 22 | 0 | 26 | 3.000000e+00 | 9.000000e+00 | 200.00%
1.59/1.65 o 3
1.59/1.65 c * 1.6s| 314 | 0 | 2533 | 6.3 |1605k| 37 | - | 187 | 469 | 187 | 124 | 652 | 190 |1040 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.59/1.65 c
1.59/1.65 c SCIP Status : problem is solved [optimal solution found]
1.59/1.65 c Solving Time (sec) : 1.64
1.59/1.65 c Solving Nodes : 314 (total of 315 nodes in 2 runs)
1.59/1.65 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.59/1.65 c Dual Bound : +3.00000000000000e+00
1.59/1.65 c Gap : 0.00 %
1.59/1.65 s OPTIMUM FOUND
1.59/1.65 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.59/1.65 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
1.59/1.65 v x46 -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.59/1.65 v -x22 x21 -x20 x19 -x18 x17 x16 -x15 x14 -x13 x12 x11 x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
1.59/1.65 c SCIP Status : problem is solved [optimal solution found]
1.59/1.65 c Solving Time : 1.64
1.59/1.65 c Original Problem :
1.59/1.65 c Problem name : HOME/instance-2703034-1278564407.opb
1.59/1.65 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 190 initial, 190 maximal
1.59/1.65 c Presolved Problem :
1.59/1.65 c Problem name : t_HOME/instance-2703034-1278564407.opb
1.59/1.65 c Variables : 187 (187 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 279 initial, 469 maximal
1.59/1.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.65 c trivial : 0.00 12 0 0 0 0 0 0 0
1.59/1.65 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.65 c knapsack : 0.01 0 0 0 0 0 0 14 92
1.59/1.65 c setppc : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c and : 0.01 14 56 0 0 0 56 0 56
1.59/1.65 c linear : 0.01 3 8 0 0 0 106 29 25
1.59/1.65 c logicor : 0.01 0 0 0 0 0 14 0 0
1.59/1.65 c root node : - 12 - - 12 - - - -
1.59/1.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.65 c integral : 0 0 0 292 0 0 88 0 0 460
1.59/1.65 c knapsack : 33 1 1075 0 0 1 3 12 0 0
1.59/1.65 c setppc : 19 1 1053 0 0 1 61 0 0 0
1.59/1.65 c and : 102 564 1394 0 0 36 1023 661 0 0
1.59/1.65 c linear : 7 8 1358 0 0 64 672 10 0 0
1.59/1.65 c logicor : 118+ 8 550 1 0 6 126 6 0 0
1.59/1.65 c countsols : 0 0 0 1 0 0 0 0 0 0
1.59/1.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.65 c integral : 0.82 0.00 0.00 0.82 0.00
1.59/1.65 c knapsack : 0.01 0.00 0.01 0.00 0.00
1.59/1.65 c setppc : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c and : 0.01 0.00 0.01 0.00 0.00
1.59/1.65 c linear : 0.02 0.00 0.02 0.00 0.00
1.59/1.65 c logicor : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c Propagators : Time Calls Cutoffs DomReds
1.59/1.65 c vbounds : 0.00 3 0 0
1.59/1.65 c rootredcost : 0.00 0 0 0
1.59/1.65 c pseudoobj : 0.00 1080 0 1
1.59/1.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.65 c propagation : 0.01 108 105 635 25.6 34 17.0 -
1.59/1.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.65 c applied globally : - - - 190 13.4 - - -
1.59/1.65 c applied locally : - - - 0 0.0 - - -
1.59/1.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 59)
1.59/1.65 c redcost : 0.01 564 0 10 0 0
1.59/1.65 c impliedbounds : 0.00 7 0 0 45 0
1.59/1.65 c intobj : 0.00 0 0 0 0 0
1.59/1.65 c cgmip : 0.00 0 0 0 0 0
1.59/1.65 c gomory : 0.06 7 0 0 160 0
1.59/1.65 c strongcg : 0.05 7 0 0 289 0
1.59/1.65 c cmir : 0.03 7 0 0 98 0
1.59/1.65 c flowcover : 0.05 7 0 0 203 0
1.59/1.65 c clique : 0.00 2 0 0 0 0
1.59/1.65 c zerohalf : 0.00 0 0 0 0 0
1.59/1.65 c mcf : 0.00 2 0 0 0 0
1.59/1.65 c rapidlearning : 0.11 1 0 6 0 256
1.59/1.65 c Pricers : Time Calls Vars
1.59/1.65 c problem variables: 0.00 0 0
1.59/1.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.65 c relpscost : 0.81 291 0 88 0 0 460
1.59/1.65 c pscost : 0.00 0 0 0 0 0 0
1.59/1.65 c inference : 0.00 0 0 0 0 0 0
1.59/1.65 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.65 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.65 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c random : 0.00 0 0 0 0 0 0
1.59/1.65 c Primal Heuristics : Time Calls Found
1.59/1.65 c LP solutions : 0.00 - 1
1.59/1.65 c pseudo solutions : 0.00 - 0
1.59/1.65 c crossover : 0.00 0 0
1.59/1.65 c objpscostdiving : 0.00 0 0
1.59/1.65 c rootsoldiving : 0.00 0 0
1.59/1.65 c linesearchdiving : 0.00 0 0
1.59/1.65 c guideddiving : 0.00 0 0
1.59/1.65 c intshifting : 0.00 0 0
1.59/1.65 c oneopt : 0.00 1 0
1.59/1.65 c coefdiving : 0.01 1 0
1.59/1.65 c pscostdiving : 0.00 1 0
1.59/1.65 c fracdiving : 0.00 1 0
1.59/1.65 c veclendiving : 0.00 1 0
1.59/1.65 c feaspump : 0.01 1 0
1.59/1.65 c trivial : 0.00 2 0
1.59/1.65 c simplerounding : 0.00 0 0
1.59/1.65 c zirounding : 0.00 229 0
1.59/1.65 c rounding : 0.01 309 0
1.59/1.65 c shifting : 0.04 54 0
1.59/1.65 c twoopt : 0.00 0 0
1.59/1.65 c fixandinfer : 0.00 0 0
1.59/1.65 c intdiving : 0.00 0 0
1.59/1.65 c actconsdiving : 0.00 0 0
1.59/1.65 c octane : 0.00 0 0
1.59/1.65 c rens : 0.02 1 0
1.59/1.65 c rins : 0.00 0 0
1.59/1.65 c localbranching : 0.00 0 0
1.59/1.65 c mutation : 0.00 0 0
1.59/1.65 c dins : 0.00 0 0
1.59/1.65 c undercover : 0.02 1 0
1.59/1.65 c nlp : 0.00 0 0
1.59/1.65 c trysol : 0.00 0 0
1.59/1.65 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.65 c primal LP : 0.00 0 0 0.00 -
1.59/1.65 c dual LP : 0.19 585 2205 3.77 11728.79
1.59/1.65 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.65 c barrier LP : 0.00 0 0 0.00 -
1.59/1.65 c diving/probing LP: 0.01 55 328 5.96 21866.67
1.59/1.65 c strong branching : 0.81 1040 9434 9.07 11704.77
1.59/1.65 c (at root node) : - 26 1249 48.04 -
1.59/1.65 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.65 c B&B Tree :
1.59/1.65 c number of runs : 2
1.59/1.65 c nodes : 314
1.59/1.65 c nodes (total) : 315
1.59/1.65 c nodes left : 0
1.59/1.65 c max depth : 37
1.59/1.65 c max depth (total): 37
1.59/1.65 c backtracks : 38 (12.1%)
1.59/1.65 c delayed cutoffs : 26
1.59/1.65 c repropagations : 125 (275 domain reductions, 18 cutoffs)
1.59/1.65 c avg switch length: 2.80
1.59/1.65 c switching time : 0.02
1.59/1.65 c Solution :
1.59/1.65 c Solutions found : 2 (2 improvements)
1.59/1.65 c First Solution : +9.00000000000000e+00 (in run 1, after 1 nodes, 0.18 seconds, depth 0, found by <trysol>)
1.59/1.65 c Primal Bound : +3.00000000000000e+00 (in run 2, after 314 nodes, 1.64 seconds, depth 36, found by <relaxation>)
1.59/1.65 c Dual Bound : +3.00000000000000e+00
1.59/1.65 c Gap : 0.00 %
1.59/1.65 c Root Dual Bound : +3.00000000000000e+00
1.59/1.65 c Root Iterations : 568
1.59/1.66 c Time complete: 1.65.