0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2667461-1276356527.opb>
0.00/0.01 c original problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 28 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 0 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 0 upgd conss, 4 impls, 15 clqs
0.00/0.02 c (round 2) 2 del vars, 1 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 22 upgd conss, 4 impls, 15 clqs
0.00/0.02 c (round 3) 2 del vars, 1 del conss, 0 chg bounds, 6 chg sides, 47 chg coeffs, 26 upgd conss, 4 impls, 15 clqs
0.00/0.03 c presolving (4 rounds):
0.00/0.03 c 2 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 47 changed coefficients
0.00/0.03 c 4 implications, 15 cliques
0.00/0.03 c presolved problem has 87 variables (87 bin, 0 int, 0 impl, 0 cont) and 27 constraints
0.00/0.03 c 6 constraints of type <knapsack>
0.00/0.03 c 15 constraints of type <setppc>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c 5 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 47 | - | 428k| 0 | 9 | 87 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | -- | Inf
0.00/0.04 o 3087
0.00/0.04 c s 0.0s| 1 | 0 | 47 | - | 431k| 0 | 9 | 87 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | 3.087000e+03 | 225.65%
0.09/0.13 o 2949
0.09/0.13 c y 0.1s| 1 | 0 | 47 | - | 480k| 0 | 9 | 87 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | 2.949000e+03 | 211.09%
0.09/0.14 c 0.1s| 1 | 0 | 69 | - | 625k| 0 | 13 | 87 | 154 | 87 | 33 | 6 | 0 | 0 | 1.002013e+03 | 2.949000e+03 | 194.31%
0.09/0.14 o 2934
0.09/0.14 c s 0.1s| 1 | 0 | 69 | - | 627k| 0 | 13 | 87 | 154 | 87 | 33 | 6 | 0 | 0 | 1.002013e+03 | 2.934000e+03 | 192.81%
0.09/0.15 c 0.1s| 1 | 0 | 79 | - | 644k| 0 | 19 | 87 | 154 | 87 | 38 | 11 | 0 | 0 | 1.004156e+03 | 2.934000e+03 | 192.19%
0.09/0.15 o 2323
0.09/0.15 c s 0.1s| 1 | 0 | 79 | - | 646k| 0 | 19 | 87 | 154 | 87 | 38 | 11 | 0 | 0 | 1.004156e+03 | 2.323000e+03 | 131.34%
0.09/0.15 o 2245
0.09/0.15 c b 0.1s| 1 | 0 | 79 | - | 648k| 0 | 19 | 87 | 154 | 87 | 38 | 11 | 0 | 0 | 1.004156e+03 | 2.245000e+03 | 123.57%
0.09/0.16 c 0.1s| 1 | 0 | 89 | - | 669k| 0 | 15 | 87 | 154 | 87 | 43 | 16 | 0 | 0 | 1.012466e+03 | 2.245000e+03 | 121.74%
0.09/0.16 o 1442
0.09/0.16 c s 0.1s| 1 | 0 | 89 | - | 671k| 0 | 15 | 87 | 154 | 87 | 43 | 16 | 0 | 0 | 1.012466e+03 | 1.442000e+03 | 42.42%
0.09/0.16 o 1364
0.09/0.16 c b 0.1s| 1 | 0 | 89 | - | 673k| 0 | 15 | 87 | 154 | 87 | 43 | 16 | 0 | 0 | 1.012466e+03 | 1.364000e+03 | 34.72%
0.09/0.17 c 0.1s| 1 | 0 | 106 | - | 620k| 0 | 21 | 87 | 63 | 87 | 46 | 19 | 0 | 0 | 1.020007e+03 | 1.364000e+03 | 33.72%
0.09/0.17 o 1332
0.09/0.17 c s 0.1s| 1 | 0 | 106 | - | 621k| 0 | 21 | 87 | 63 | 87 | 46 | 19 | 0 | 0 | 1.020007e+03 | 1.332000e+03 | 30.59%
0.09/0.18 c 0.1s| 1 | 0 | 113 | - | 618k| 0 | 23 | 87 | 53 | 87 | 49 | 22 | 0 | 0 | 1.029870e+03 | 1.332000e+03 | 29.34%
0.09/0.19 c 0.1s| 1 | 0 | 124 | - | 633k| 0 | 25 | 87 | 53 | 87 | 53 | 26 | 0 | 0 | 1.035047e+03 | 1.332000e+03 | 28.69%
0.19/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.20 c 0.2s| 1 | 0 | 127 | - | 635k| 0 | 25 | 87 | 53 | 87 | 54 | 27 | 0 | 0 | 1.035362e+03 | 1.332000e+03 | 28.65%
0.29/0.32 o 1148
0.29/0.32 c E 0.2s| 1 | 0 | 127 | - | 638k| 0 | 25 | 87 | 53 | 87 | 54 | 27 | 0 | 0 | 1.035362e+03 | 1.148000e+03 | 10.88%
0.29/0.33 c 0.2s| 1 | 0 | 127 | - | 638k| 0 | 25 | 87 | 53 | 87 | 54 | 27 | 0 | 0 | 1.035362e+03 | 1.148000e+03 | 10.88%
0.29/0.34 c 0.3s| 1 | 0 | 127 | - | 612k| 0 | 25 | 87 | 31 | 87 | 51 | 27 | 0 | 0 | 1.035362e+03 | 1.148000e+03 | 10.88%
0.29/0.35 c 0.3s| 1 | 2 | 127 | - | 613k| 0 | 25 | 87 | 31 | 87 | 51 | 27 | 0 | 12 | 1.035362e+03 | 1.148000e+03 | 10.88%
0.29/0.35 c (run 1, node 1) restarting after 16 global fixings of integer variables
0.29/0.35 c
0.29/0.35 c (restart) converted 13 cuts from the global cut pool into linear constraints
0.29/0.35 c
0.29/0.36 c presolving:
0.29/0.36 c (round 1) 16 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 6 impls, 14 clqs
0.29/0.36 c (round 2) 16 del vars, 6 del conss, 0 chg bounds, 2 chg sides, 10 chg coeffs, 14 upgd conss, 6 impls, 14 clqs
0.29/0.37 c presolving (3 rounds):
0.29/0.37 c 16 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 10 changed coefficients
0.29/0.37 c 6 implications, 14 cliques
0.29/0.37 c presolved problem has 71 variables (71 bin, 0 int, 0 impl, 0 cont) and 38 constraints
0.29/0.37 c 18 constraints of type <knapsack>
0.29/0.37 c 14 constraints of type <setppc>
0.29/0.37 c 1 constraints of type <linear>
0.29/0.37 c 5 constraints of type <logicor>
0.29/0.37 c transformed objective value is always integral (scale: 1)
0.29/0.37 c Presolving Time: 0.03
0.29/0.37 c
0.29/0.37 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.37 c 0.3s| 1 | 0 | 206 | - | 531k| 0 | 20 | 71 | 38 | 71 | 37 | 0 | 0 | 12 | 9.683063e+02 | 1.148000e+03 | 18.56%
0.29/0.38 c 0.3s| 1 | 0 | 230 | - | 563k| 0 | 21 | 71 | 38 | 71 | 43 | 6 | 0 | 12 | 1.031248e+03 | 1.148000e+03 | 11.32%
0.39/0.40 c 0.3s| 1 | 2 | 230 | - | 565k| 0 | 21 | 71 | 38 | 71 | 43 | 6 | 0 | 30 | 1.031248e+03 | 1.148000e+03 | 11.32%
0.49/0.50 o 1142
0.49/0.50 c * 0.4s| 17 | 7 | 427 | 12.3 | 575k| 7 | - | 71 | 38 | 71 | 38 | 6 | 0 | 204 | 1.043163e+03 | 1.142000e+03 | 9.47%
0.59/0.67 o 1136
0.59/0.67 c * 0.6s| 140 | 25 | 1236 | 7.2 | 615k| 14 | - | 71 | 46 | 71 | 38 | 6 | 9 | 401 | 1.063884e+03 | 1.136000e+03 | 6.78%
0.59/0.69 o 1120
0.59/0.69 c s 0.6s| 162 | 27 | 1352 | 7.0 | 622k| 14 | 6 | 71 | 50 | 71 | 38 | 6 | 14 | 418 | 1.063884e+03 | 1.120000e+03 | 5.27%
0.89/0.90 c
0.89/0.90 c SCIP Status : problem is solved [optimal solution found]
0.89/0.90 c Solving Time (sec) : 0.76
0.89/0.90 c Solving Nodes : 402 (total of 403 nodes in 2 runs)
0.89/0.90 c Primal Bound : +1.12000000000000e+03 (42 solutions)
0.89/0.90 c Dual Bound : +1.12000000000000e+03
0.89/0.90 c Gap : 0.00 %
0.89/0.90 s OPTIMUM FOUND
0.89/0.90 v -x10 -x9 x7 -x6 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67
0.89/0.90 v x66 -x65 x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41
0.89/0.90 v -x40 x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16
0.89/0.90 v -x15 x14 -x13 -x12 -x11 -x8 -x5 -x4 -x3 x2 x1
0.89/0.90 c SCIP Status : problem is solved [optimal solution found]
0.89/0.90 c Solving Time : 0.76
0.89/0.90 c Original Problem :
0.89/0.90 c Problem name : HOME/instance-2667461-1276356527.opb
0.89/0.90 c Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.90 c Constraints : 28 initial, 28 maximal
0.89/0.90 c Presolved Problem :
0.89/0.90 c Problem name : t_HOME/instance-2667461-1276356527.opb
0.89/0.90 c Variables : 71 (71 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.90 c Constraints : 38 initial, 123 maximal
0.89/0.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.90 c trivial : 0.00 16 0 0 0 0 0 0 0
0.89/0.90 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.89/0.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.90 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.90 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.90 c probing : 0.01 0 0 0 0 0 0 0 0
0.89/0.90 c knapsack : 0.01 0 0 0 0 0 1 6 32
0.89/0.90 c setppc : 0.00 0 0 0 0 0 0 0 0
0.89/0.90 c linear : 0.00 0 0 0 0 0 5 2 25
0.89/0.90 c logicor : 0.00 0 0 0 0 0 1 0 0
0.89/0.90 c root node : - 30 - - 30 - - - -
0.89/0.90 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.90 c integral : 0 0 0 334 0 16 152 0 0 410
0.89/0.90 c knapsack : 18 10 1297 2 0 18 303 64 0 0
0.89/0.90 c setppc : 14 10 1271 1 0 2 583 0 0 0
0.89/0.90 c linear : 1 11 1263 1 0 41 227 6 0 0
0.89/0.90 c logicor : 5+ 10 495 1 0 3 97 0 0 0
0.89/0.90 c countsols : 0 0 0 2 0 0 0 0 0 0
0.89/0.90 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.90 c integral : 0.18 0.00 0.00 0.18 0.00
0.89/0.90 c knapsack : 0.01 0.00 0.01 0.00 0.00
0.89/0.90 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.90 c linear : 0.00 0.00 0.00 0.00 0.00
0.89/0.90 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.90 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.90 c Propagators : Time Calls Cutoffs DomReds
0.89/0.90 c vbounds : 0.00 3 0 0
0.89/0.90 c rootredcost : 0.00 3 0 8
0.89/0.90 c pseudoobj : 0.02 1153 3 16
0.89/0.90 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.90 c propagation : 0.00 66 38 125 27.5 0 0.0 -
0.89/0.90 c infeasible LP : 0.00 19 18 37 18.9 0 0.0 0
0.89/0.90 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.90 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.90 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.90 c applied globally : - - - 87 20.4 - - -
0.89/0.90 c applied locally : - - - 7 33.7 - - -
0.89/0.90 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.90 c cut pool : 0.00 0 - - 0 - (maximal pool size: 26)
0.89/0.90 c redcost : 0.00 530 0 1280 0 0
0.89/0.90 c impliedbounds : 0.00 10 0 0 0 0
0.89/0.90 c intobj : 0.00 0 0 0 0 0
0.89/0.90 c cgmip : 0.00 0 0 0 0 0
0.89/0.90 c gomory : 0.01 10 0 0 11 0
0.89/0.90 c strongcg : 0.02 10 0 0 8 0
0.89/0.90 c cmir : 0.01 10 0 0 50 0
0.89/0.90 c flowcover : 0.07 10 0 0 74 0
0.89/0.90 c clique : 0.00 10 0 0 0 0
0.89/0.90 c zerohalf : 0.00 0 0 0 0 0
0.89/0.90 c mcf : 0.00 2 0 0 0 0
0.89/0.90 c rapidlearning : 0.07 1 0 0 0 127
0.89/0.90 c Pricers : Time Calls Vars
0.89/0.90 c problem variables: 0.00 0 0
0.89/0.90 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.90 c relpscost : 0.18 332 16 152 0 0 410
0.89/0.90 c pscost : 0.00 0 0 0 0 0 0
0.89/0.90 c inference : 0.00 0 0 0 0 0 0
0.89/0.90 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.90 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.90 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.90 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.90 c random : 0.00 0 0 0 0 0 0
0.89/0.90 c Primal Heuristics : Time Calls Found
0.89/0.90 c LP solutions : 0.00 - 2
0.89/0.90 c pseudo solutions : 0.00 - 0
0.89/0.90 c oneopt : 0.00 8 2
0.89/0.90 c pscostdiving : 0.00 1 0
0.89/0.90 c fracdiving : 0.00 1 0
0.89/0.90 c veclendiving : 0.00 1 0
0.89/0.90 c linesearchdiving : 0.00 1 0
0.89/0.90 c guideddiving : 0.00 1 0
0.89/0.90 c objpscostdiving : 0.00 1 0
0.89/0.90 c rootsoldiving : 0.01 1 0
0.89/0.90 c trivial : 0.00 2 0
0.89/0.90 c simplerounding : 0.01 181 0
0.89/0.90 c zirounding : 0.00 221 1
0.89/0.90 c rounding : 0.00 232 0
0.89/0.90 c shifting : 0.01 50 35
0.89/0.90 c intshifting : 0.00 0 0
0.89/0.90 c twoopt : 0.00 0 0
0.89/0.90 c fixandinfer : 0.00 0 0
0.89/0.90 c feaspump : 0.00 0 0
0.89/0.90 c coefdiving : 0.00 2 0
0.89/0.90 c intdiving : 0.00 0 0
0.89/0.90 c actconsdiving : 0.00 0 0
0.89/0.90 c octane : 0.00 0 0
0.89/0.90 c rens : 0.08 1 1
0.89/0.90 c rins : 0.00 0 0
0.89/0.90 c localbranching : 0.00 0 0
0.89/0.90 c mutation : 0.00 0 0
0.89/0.90 c crossover : 0.03 1 0
0.89/0.90 c dins : 0.00 0 0
0.89/0.90 c undercover : 0.00 0 0
0.89/0.90 c nlp : 0.00 0 0
0.89/0.90 c trysol : 0.00 0 0
0.89/0.90 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.90 c primal LP : 0.00 0 0 0.00 -
0.89/0.90 c dual LP : 0.15 495 2230 4.51 14866.67
0.89/0.91 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.91 c barrier LP : 0.00 0 0 0.00 -
0.89/0.91 c diving/probing LP: 0.01 28 88 3.14 8800.00
0.89/0.91 c strong branching : 0.18 495 4699 9.49 26105.56
0.89/0.91 c (at root node) : - 30 617 20.57 -
0.89/0.91 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.91 c B&B Tree :
0.89/0.91 c number of runs : 2
0.89/0.91 c nodes : 402
0.89/0.91 c nodes (total) : 403
0.89/0.91 c nodes left : 0
0.89/0.91 c max depth : 14
0.89/0.91 c max depth (total): 14
0.89/0.91 c backtracks : 84 (20.9%)
0.89/0.91 c delayed cutoffs : 6
0.89/0.91 c repropagations : 37 (86 domain reductions, 6 cutoffs)
0.89/0.91 c avg switch length: 3.86
0.89/0.91 c switching time : 0.03
0.89/0.91 c Solution :
0.89/0.91 c Solutions found : 42 (12 improvements)
0.89/0.91 c First Solution : +3.08700000000000e+03 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <shifting>)
0.89/0.91 c Primal Bound : +1.12000000000000e+03 (in run 2, after 162 nodes, 0.58 seconds, depth 10, found by <shifting>)
0.89/0.91 c Dual Bound : +1.12000000000000e+03
0.89/0.91 c Gap : 0.00 %
0.89/0.91 c Root Dual Bound : +1.03124780316344e+03
0.89/0.91 c Root Iterations : 230
0.89/0.91 c Time complete: 0.91.