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-2667535-1276448661.opb>
0.00/0.01 c original problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 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.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 225 upgd conss, 1476 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 252 upgd conss, 1476 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 1548 implications, 0 cliques
0.00/0.04 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 constraints
0.00/0.04 c 252 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 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 | 102 | - | 823k| 0 | 87 | 132 | 252 | 132 | 252 | 0 | 0 | 0 | 4.350000e+01 | -- | Inf
0.03/0.08 o 65
0.03/0.08 c F 0.1s| 1 | 0 | 613 | - | 835k| 0 | 0 | 132 | 252 | 132 | 252 | 0 | 0 | 0 | 4.350000e+01 | 6.500000e+01 | 49.43%
0.09/0.10 c 0.1s| 1 | 0 | 677 | - | 841k| 0 | 95 | 132 | 252 | 132 | 270 | 18 | 0 | 0 | 4.800000e+01 | 6.500000e+01 | 35.42%
0.09/0.10 o 57
0.09/0.10 c b 0.1s| 1 | 0 | 677 | - | 845k| 0 | 95 | 132 | 252 | 132 | 270 | 18 | 0 | 0 | 4.800000e+01 | 5.700000e+01 | 18.75%
0.09/0.12 c 0.1s| 1 | 0 | 736 | - | 869k| 0 | 96 | 132 | 252 | 132 | 277 | 25 | 0 | 0 | 4.800000e+01 | 5.700000e+01 | 18.75%
0.09/0.15 c 0.1s| 1 | 0 | 785 | - | 896k| 0 | 99 | 132 | 252 | 132 | 283 | 31 | 0 | 0 | 4.854167e+01 | 5.700000e+01 | 17.42%
0.09/0.19 c 0.1s| 1 | 0 | 818 | - | 948k| 0 | 97 | 132 | 252 | 132 | 289 | 37 | 0 | 0 | 4.900000e+01 | 5.700000e+01 | 16.33%
0.19/0.23 c 0.2s| 1 | 0 | 893 | - |1090k| 0 | 100 | 132 | 252 | 132 | 291 | 39 | 0 | 0 | 4.912500e+01 | 5.700000e+01 | 16.03%
0.19/0.27 c 0.2s| 1 | 0 | 975 | - |1137k| 0 | 98 | 132 | 252 | 132 | 295 | 43 | 0 | 0 | 4.929545e+01 | 5.700000e+01 | 15.63%
0.19/0.28 o 57
0.19/0.28 c s 0.2s| 1 | 0 | 975 | - |1139k| 0 | 98 | 132 | 252 | 132 | 295 | 43 | 0 | 0 | 4.929545e+01 | 5.700000e+01 | 15.63%
0.29/0.32 c 0.3s| 1 | 0 | 1056 | - |1252k| 0 | 98 | 132 | 252 | 132 | 299 | 47 | 0 | 0 | 4.961765e+01 | 5.700000e+01 | 14.88%
0.29/0.32 o 56
0.29/0.32 c b 0.3s| 1 | 0 | 1056 | - |1256k| 0 | 98 | 132 | 252 | 132 | 299 | 47 | 0 | 0 | 4.961765e+01 | 5.600000e+01 | 12.86%
0.29/0.38 c 0.3s| 1 | 0 | 1120 | - |1336k| 0 | 99 | 132 | 252 | 132 | 302 | 50 | 0 | 0 | 4.989362e+01 | 5.600000e+01 | 12.24%
0.39/0.43 c 0.4s| 1 | 0 | 1181 | - |1539k| 0 | 101 | 132 | 252 | 132 | 306 | 54 | 0 | 0 | 5.014286e+01 | 5.600000e+01 | 11.68%
0.39/0.49 c 0.4s| 1 | 0 | 1229 | - |1685k| 0 | 82 | 132 | 252 | 132 | 309 | 57 | 0 | 0 | 5.033333e+01 | 5.600000e+01 | 11.26%
0.49/0.52 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.52 c 0.5s| 1 | 0 | 1327 | - |1779k| 0 | 97 | 132 | 252 | 132 | 310 | 58 | 0 | 0 | 5.054203e+01 | 5.600000e+01 | 10.80%
0.49/0.58 c 0.5s| 1 | 0 | 1367 | - |2071k| 0 | 99 | 132 | 252 | 132 | 312 | 60 | 0 | 0 | 5.058824e+01 | 5.600000e+01 | 10.70%
0.59/0.64 c 0.6s| 1 | 0 | 1485 | - |2319k| 0 | 85 | 132 | 252 | 132 | 314 | 62 | 0 | 0 | 5.063636e+01 | 5.600000e+01 | 10.59%
0.59/0.68 c 0.6s| 1 | 0 | 1555 | - |2449k| 0 | 96 | 132 | 252 | 132 | 310 | 63 | 0 | 0 | 5.066550e+01 | 5.600000e+01 | 10.53%
0.69/0.73 c 0.7s| 1 | 0 | 1583 | - |2586k| 0 | 96 | 132 | 252 | 132 | 314 | 67 | 0 | 0 | 5.066704e+01 | 5.600000e+01 | 10.53%
0.69/0.78 c 0.7s| 1 | 0 | 1648 | - |2636k| 0 | 93 | 132 | 252 | 132 | 317 | 70 | 0 | 0 | 5.068226e+01 | 5.600000e+01 | 10.49%
0.79/0.84 c 0.8s| 1 | 0 | 1765 | - |2721k| 0 | 98 | 132 | 252 | 132 | 318 | 71 | 0 | 0 | 5.100000e+01 | 5.600000e+01 | 9.80%
0.79/0.88 c 0.8s| 1 | 0 | 1809 | - |2731k| 0 | 97 | 132 | 252 | 132 | 319 | 72 | 0 | 0 | 5.100000e+01 | 5.600000e+01 | 9.80%
1.49/1.52 c 1.5s| 1 | 2 | 1809 | - |2732k| 0 | 97 | 132 | 252 | 132 | 319 | 72 | 0 | 18 | 5.100000e+01 | 5.600000e+01 | 9.80%
1.59/1.68 o 54
1.59/1.68 c * 1.6s| 823 | 21 | 1809 | 0.0 |2760k| 33 | - | 132 | 285 | 0 | 0 | 72 | 497 | 18 | 5.101384e+01 | 5.400000e+01 | 5.85%
2.99/3.00 c
2.99/3.00 c SCIP Status : problem is solved [optimal solution found]
2.99/3.00 c Solving Time (sec) : 2.74
2.99/3.00 c Solving Nodes : 7911
2.99/3.00 c Primal Bound : +5.40000000000000e+01 (7 solutions)
2.99/3.00 c Dual Bound : +5.40000000000000e+01
2.99/3.00 c Gap : 0.00 %
2.99/3.00 s OPTIMUM FOUND
2.99/3.00 v x132 -x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 -x110
2.99/3.00 v x109 x108 -x107 x106 -x105 -x104 x103 x102 -x101 x100 -x99 -x98 x97 -x96 -x95 -x94 x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 x85
2.99/3.00 v -x84 -x83 -x82 x81 x80 -x79 -x78 x77 -x76 -x75 -x74 x73 -x72 x71 -x70 -x69 -x68 x67 x66 -x65 -x64 x63 -x62 -x61 -x60 x59 -x58
2.99/3.00 v -x57 -x56 x55 x54 -x53 -x52 x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 x39 x38 -x37 -x36 -x35 -x34 x33 -x32 x31
2.99/3.00 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
2.99/3.00 v x1
2.99/3.00 c SCIP Status : problem is solved [optimal solution found]
2.99/3.00 c Solving Time : 2.74
2.99/3.00 c Original Problem :
2.99/3.00 c Problem name : HOME/instance-2667535-1276448661.opb
2.99/3.00 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.00 c Constraints : 252 initial, 252 maximal
2.99/3.00 c Presolved Problem :
2.99/3.00 c Problem name : t_HOME/instance-2667535-1276448661.opb
2.99/3.00 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.00 c Constraints : 252 initial, 348 maximal
2.99/3.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.00 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c probing : 0.01 0 0 0 0 0 0 0 0
2.99/3.00 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.00 c root node : - 132 - - 132 - - - -
2.99/3.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.00 c integral : 0 0 0 1 0 0 0 0 0 2
2.99/3.00 c logicor : 252+ 19 22333 0 1 3616 32393 0 0 0
2.99/3.00 c countsols : 0 0 0 0 1 0 0 0 0 0
2.99/3.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.00 c integral : 0.58 0.00 0.00 0.58 0.00
2.99/3.00 c logicor : 0.51 0.00 0.51 0.00 0.00
2.99/3.00 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.00 c Propagators : Time Calls Cutoffs DomReds
2.99/3.00 c vbounds : 0.01 2 0 0
2.99/3.00 c rootredcost : 0.00 1 0 0
2.99/3.00 c pseudoobj : 0.27 32149 863 58988
2.99/3.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.00 c propagation : 0.38 4479 4318 4318 7.6 47 9.2 -
2.99/3.00 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.00 c applied globally : - - - 4365 7.6 - - -
2.99/3.00 c applied locally : - - - 0 0.0 - - -
2.99/3.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.00 c cut pool : 0.01 18 - - 285 - (maximal pool size: 983)
2.99/3.00 c redcost : 0.00 19 0 0 0 0
2.99/3.00 c impliedbounds : 0.00 19 0 0 5 0
2.99/3.00 c intobj : 0.00 0 0 0 0 0
2.99/3.00 c cgmip : 0.00 0 0 0 0 0
2.99/3.00 c gomory : 0.32 19 0 0 3430 0
2.99/3.00 c strongcg : 0.25 19 0 0 3452 0
2.99/3.00 c cmir : 0.04 10 0 0 0 0
2.99/3.00 c flowcover : 0.03 10 0 0 0 0
2.99/3.00 c clique : 0.01 19 0 0 39 0
2.99/3.00 c zerohalf : 0.00 0 0 0 0 0
2.99/3.00 c mcf : 0.00 1 0 0 0 0
2.99/3.00 c rapidlearning : 0.00 0 0 0 0 0
2.99/3.00 c Pricers : Time Calls Vars
2.99/3.00 c problem variables: 0.00 0 0
2.99/3.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.00 c relpscost : 0.58 1 0 0 0 0 2
2.99/3.00 c pscost : 0.00 0 0 0 0 0 0
2.99/3.00 c inference : 0.03 5537 0 0 0 0 11074
2.99/3.00 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.00 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.00 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.00 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.00 c random : 0.00 0 0 0 0 0 0
2.99/3.00 c Primal Heuristics : Time Calls Found
2.99/3.00 c LP solutions : 0.00 - 0
2.99/3.00 c pseudo solutions : 0.00 - 1
2.99/3.00 c crossover : 0.00 0 0
2.99/3.00 c oneopt : 0.00 4 2
2.99/3.00 c trivial : 0.00 2 0
2.99/3.00 c simplerounding : 0.00 0 0
2.99/3.00 c zirounding : 0.00 1 0
2.99/3.00 c rounding : 0.00 19 0
2.99/3.00 c shifting : 0.01 19 3
2.99/3.00 c intshifting : 0.00 0 0
2.99/3.00 c twoopt : 0.00 0 0
2.99/3.00 c fixandinfer : 0.00 0 0
2.99/3.00 c feaspump : 0.03 1 1
2.99/3.00 c coefdiving : 0.00 0 0
2.99/3.00 c pscostdiving : 0.00 0 0
2.99/3.00 c fracdiving : 0.00 0 0
2.99/3.00 c veclendiving : 0.00 0 0
2.99/3.00 c intdiving : 0.00 0 0
2.99/3.00 c actconsdiving : 0.00 0 0
2.99/3.00 c objpscostdiving : 0.00 0 0
2.99/3.00 c rootsoldiving : 0.00 0 0
2.99/3.00 c linesearchdiving : 0.00 0 0
2.99/3.00 c guideddiving : 0.00 0 0
2.99/3.00 c octane : 0.00 0 0
2.99/3.00 c rens : 0.00 0 0
2.99/3.00 c rins : 0.00 0 0
2.99/3.00 c localbranching : 0.00 0 0
2.99/3.00 c mutation : 0.00 0 0
2.99/3.00 c dins : 0.00 0 0
2.99/3.00 c undercover : 0.00 0 0
2.99/3.00 c nlp : 0.00 0 0
2.99/3.00 c trysol : 0.01 0 0
2.99/3.00 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.00 c primal LP : 0.00 0 0 0.00 -
2.99/3.00 c dual LP : 0.12 19 1298 68.32 10816.67
2.99/3.00 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.00 c barrier LP : 0.00 0 0 0.00 -
2.99/3.00 c diving/probing LP: 0.03 21 511 24.33 17033.33
2.99/3.00 c strong branching : 0.58 18 3705 205.83 6387.93
2.99/3.00 c (at root node) : - 18 3705 205.83 -
2.99/3.00 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.00 c B&B Tree :
2.99/3.00 c number of runs : 1
2.99/3.00 c nodes : 7911
2.99/3.00 c nodes (total) : 7911
2.99/3.00 c nodes left : 0
2.99/3.00 c max depth : 40
2.99/3.00 c max depth (total): 40
2.99/3.00 c backtracks : 2201 (27.8%)
2.99/3.00 c delayed cutoffs : 3159
2.99/3.00 c repropagations : 7616 (46964 domain reductions, 2107 cutoffs)
2.99/3.00 c avg switch length: 2.86
2.99/3.00 c switching time : 0.20
2.99/3.00 c Solution :
2.99/3.00 c Solutions found : 7 (5 improvements)
2.99/3.00 c First Solution : +6.50000000000000e+01 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <feaspump>)
2.99/3.00 c Primal Bound : +5.40000000000000e+01 (in run 1, after 823 nodes, 1.59 seconds, depth 33, found by <relaxation>)
2.99/3.00 c Dual Bound : +5.40000000000000e+01
2.99/3.00 c Gap : 0.00 %
2.99/3.00 c Root Dual Bound : +5.10000000000000e+01
2.99/3.00 c Root Iterations : 1809
2.99/3.01 c Time complete: 3.