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-2667568-1276469047.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 836 impls, 0 clqs
0.00/0.04 c (round 2) 8 del vars, 72 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 860 impls, 0 clqs
0.00/0.05 c (round 3) 13 del vars, 98 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 886 impls, 0 clqs
0.00/0.05 c (round 4) 22 del vars, 169 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 892 impls, 0 clqs
0.00/0.05 c (round 5) 25 del vars, 212 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1020 impls, 0 clqs
0.00/0.07 c (round 6) 25 del vars, 232 del conss, 22 chg bounds, 19 chg sides, 0 chg coeffs, 0 upgd conss, 1032 impls, 0 clqs
0.09/0.09 c (round 7) 25 del vars, 234 del conss, 22 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 1032 impls, 0 clqs
0.09/0.12 c (round 8) 49 del vars, 234 del conss, 24 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2352 impls, 0 clqs
0.09/0.12 c (round 9) 49 del vars, 439 del conss, 24 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2352 impls, 0 clqs
0.09/0.13 c (round 10) 49 del vars, 442 del conss, 24 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2352 impls, 0 clqs
0.09/0.13 c presolving (11 rounds):
0.09/0.13 c 49 deleted vars, 442 deleted constraints, 24 tightened bounds, 0 added holes, 19 changed sides, 0 changed coefficients
0.09/0.13 c 2352 implications, 0 cliques
0.09/0.13 c presolved problem has 151 variables (151 bin, 0 int, 0 impl, 0 cont) and 508 constraints
0.09/0.13 c 508 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.08
0.09/0.13 c - non default parameters ----------------------------------------------------------------------
0.09/0.13 c # SCIP version 1.2.1.2
0.09/0.13 c
0.09/0.13 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c conflict/interconss = 0
0.09/0.13 c
0.09/0.13 c # should binary conflicts be preferred?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c conflict/preferbinary = TRUE
0.09/0.13 c
0.09/0.13 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.13 c constraints/agelimit = 1
0.09/0.13 c
0.09/0.13 c # should enforcement of pseudo solution be disabled?
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/disableenfops = TRUE
0.09/0.13 c
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = 10000
0.09/0.13 c
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = 1799.98
0.09/0.13 c
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = 1620
0.09/0.13 c
0.09/0.13 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.13 c lp/solvefreq = 0
0.09/0.13 c
0.09/0.13 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.09/0.13 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.13 c lp/pricing = a
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # should presolving try to simplify knapsacks
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.13 c
0.09/0.13 c # priority of node selection rule <dfs> in standard mode
0.09/0.13 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.13 c nodeselection/dfs/stdpriority = 1000000
0.09/0.13 c
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving
0.09/0.13 c
0.19/0.27 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.27 c 0.2s| 1 | 0 | 1152 | - |1551k| 0 | 138 | 151 | 508 | 151 | 508 | 0 | 0 | 0 | 8.023819e+01 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 2013 | - |3304k| 0 | 130 | 151 | 508 | 151 | 538 | 30 | 0 | 0 | 8.123810e+01 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 2121 | - |4114k| 0 | 144 | 151 | 508 | 151 | 547 | 39 | 0 | 0 | 8.160712e+01 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 2201 | - |4769k| 0 | 139 | 151 | 508 | 151 | 549 | 41 | 0 | 0 | 8.167946e+01 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 2270 | - |5350k| 0 | 135 | 151 | 508 | 151 | 557 | 49 | 0 | 0 | 8.174679e+01 | -- | Inf
1.00/1.08 c 1.0s| 1 | 0 | 2371 | - |6036k| 0 | 139 | 151 | 508 | 151 | 558 | 50 | 0 | 0 | 8.183684e+01 | -- | Inf
1.19/1.23 c 1.1s| 1 | 0 | 2485 | - |6685k| 0 | 140 | 151 | 508 | 151 | 559 | 51 | 0 | 0 | 8.185343e+01 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 2555 | - |7474k| 0 | 139 | 151 | 508 | 151 | 561 | 53 | 0 | 0 | 8.186551e+01 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 2578 | - |8211k| 0 | 140 | 151 | 508 | 151 | 563 | 55 | 0 | 0 | 8.200000e+01 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 2615 | - |8863k| 0 | 138 | 151 | 508 | 151 | 564 | 56 | 0 | 0 | 8.200000e+01 | -- | Inf
1.69/1.80 c 1.7s| 1 | 0 | 2641 | - |9512k| 0 | 138 | 151 | 508 | 151 | 565 | 57 | 0 | 0 | 8.200000e+01 | -- | Inf
1.89/1.93 c 1.8s| 1 | 0 | 2678 | - | 10M| 0 | 143 | 151 | 508 | 151 | 566 | 58 | 0 | 0 | 8.200000e+01 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 2704 | - | 10M| 0 | 140 | 151 | 508 | 151 | 567 | 59 | 0 | 0 | 8.200000e+01 | -- | Inf
2.10/2.19 c 2.1s| 1 | 0 | 2750 | - | 10M| 0 | 141 | 151 | 508 | 151 | 568 | 60 | 0 | 0 | 8.200000e+01 | -- | Inf
4.80/4.85 c 4.7s| 1 | 2 | 2750 | - | 10M| 0 | 141 | 151 | 508 | 151 | 568 | 60 | 0 | 18 | 8.200000e+01 | -- | Inf
4.80/4.85 o 95
4.80/4.85 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.80/4.85 c * 4.7s| 18 | 7 | 2750 | 0.0 | 10M| 15 | - | 151 | 509 | 0 | 0 | 60 | 1 | 18 | 8.349094e+01 | 9.500000e+01 | 13.78%
4.89/4.91 c
4.89/4.91 c SCIP Status : problem is solved [optimal solution found]
4.89/4.91 c Solving Time (sec) : 4.78
4.89/4.91 c Solving Nodes : 207
4.89/4.91 c Primal Bound : +9.50000000000000e+01 (1 solutions)
4.89/4.91 c Dual Bound : +9.50000000000000e+01
4.89/4.91 c Gap : 0.00 %
4.89/4.91 s OPTIMUM FOUND
4.89/4.91 v -x200 -x199 -x198 x197 -x196 x195 -x194 x193 -x192 x191 -x190 x189 -x188 -x187 -x186 x185 -x184 x183 -x182 x181 x180 -x179 -x178
4.89/4.91 v x177 -x176 x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 x160 -x159 -x158 x157 -x156 x155
4.89/4.91 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 -x145 x144 -x143 -x142 x141 -x140 x139 x138 -x137 -x136 x135 -x134 x133
4.89/4.91 v -x132 x131 -x130 x129 x128 -x127 -x126 x125 x124 -x123 -x122 x121 -x120 x119 x118 -x117 -x116 x115 -x114 x113 x112 -x111 -x110
4.89/4.91 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
4.89/4.91 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 x57
4.89/4.91 v -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 x30 -x29
4.89/4.91 v 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 x1
4.89/4.91 c SCIP Status : problem is solved [optimal solution found]
4.89/4.91 c Solving Time : 4.78
4.89/4.91 c Original Problem :
4.89/4.91 c Problem name : HOME/instance-2667568-1276469047.opb
4.89/4.91 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.91 c Constraints : 950 initial, 950 maximal
4.89/4.91 c Presolved Problem :
4.89/4.91 c Problem name : t_HOME/instance-2667568-1276469047.opb
4.89/4.91 c Variables : 151 (151 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.91 c Constraints : 508 initial, 525 maximal
4.89/4.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.89/4.91 c trivial : 0.00 4 0 0 0 0 0 0 0
4.89/4.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c implics : 0.00 0 3 0 0 0 0 0 0
4.89/4.91 c probing : 0.02 24 0 0 2 0 0 0 0
4.89/4.91 c linear : 0.03 18 0 0 22 0 232 19 0
4.89/4.91 c logicor : 0.03 0 0 0 0 0 210 0 0
4.89/4.91 c root node : - 99 - - 99 - - - -
4.89/4.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.89/4.91 c integral : 0 0 0 1 0 0 0 0 0 2
4.89/4.91 c logicor : 508+ 13 1858 0 1 78 3159 0 0 0
4.89/4.91 c countsols : 0 0 0 0 1 0 0 0 0 0
4.89/4.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.89/4.91 c integral : 2.63 0.00 0.00 2.63 0.00
4.89/4.91 c logicor : 0.02 0.00 0.02 0.00 0.00
4.89/4.91 c countsols : 0.00 0.00 0.00 0.00 0.00
4.89/4.91 c Propagators : Time Calls Cutoffs DomReds
4.89/4.91 c vbounds : 0.00 2 0 0
4.89/4.91 c rootredcost : 0.00 1 0 0
4.89/4.91 c pseudoobj : 0.02 1459 36 336
4.89/4.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.91 c propagation : 0.00 75 70 70 6.2 0 0.0 -
4.89/4.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.91 c applied globally : - - - 70 6.2 - - -
4.89/4.91 c applied locally : - - - 0 0.0 - - -
4.89/4.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.91 c cut pool : 0.03 12 - - 809 - (maximal pool size: 2804)
4.89/4.91 c redcost : 0.00 13 0 0 0 0
4.89/4.91 c impliedbounds : 0.00 13 0 0 63 0
4.89/4.91 c intobj : 0.00 0 0 0 0 0
4.89/4.91 c cgmip : 0.00 0 0 0 0 0
4.89/4.91 c gomory : 0.74 13 0 0 822 0
4.89/4.91 c strongcg : 0.66 13 0 0 3221 0
4.89/4.91 c cmir : 0.05 10 0 0 0 0
4.89/4.91 c flowcover : 0.05 10 0 0 0 0
4.89/4.91 c clique : 0.00 13 0 0 21 0
4.89/4.91 c zerohalf : 0.00 0 0 0 0 0
4.89/4.91 c mcf : 0.00 1 0 0 0 0
4.89/4.91 c rapidlearning : 0.00 0 0 0 0 0
4.89/4.91 c Pricers : Time Calls Vars
4.89/4.91 c problem variables: 0.00 0 0
4.89/4.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.91 c relpscost : 2.63 1 0 0 0 0 2
4.89/4.91 c pscost : 0.00 0 0 0 0 0 0
4.89/4.91 c inference : 0.00 121 0 0 0 0 242
4.89/4.91 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.91 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.91 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.91 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.91 c random : 0.00 0 0 0 0 0 0
4.89/4.91 c Primal Heuristics : Time Calls Found
4.89/4.91 c LP solutions : 0.00 - 0
4.89/4.91 c pseudo solutions : 0.00 - 1
4.89/4.91 c oneopt : 0.00 0 0
4.89/4.91 c crossover : 0.00 0 0
4.89/4.91 c trivial : 0.00 2 0
4.89/4.91 c simplerounding : 0.00 0 0
4.89/4.91 c zirounding : 0.00 1 0
4.89/4.91 c rounding : 0.00 14 0
4.89/4.91 c shifting : 0.00 14 0
4.89/4.91 c intshifting : 0.00 0 0
4.89/4.91 c twoopt : 0.00 0 0
4.89/4.91 c fixandinfer : 0.00 0 0
4.89/4.91 c feaspump : 0.14 1 0
4.89/4.91 c coefdiving : 0.00 0 0
4.89/4.91 c pscostdiving : 0.00 0 0
4.89/4.91 c fracdiving : 0.00 0 0
4.89/4.91 c veclendiving : 0.00 0 0
4.89/4.91 c intdiving : 0.00 0 0
4.89/4.91 c actconsdiving : 0.00 0 0
4.89/4.91 c objpscostdiving : 0.00 0 0
4.89/4.91 c rootsoldiving : 0.00 0 0
4.89/4.91 c linesearchdiving : 0.00 0 0
4.89/4.91 c guideddiving : 0.00 0 0
4.89/4.91 c octane : 0.00 0 0
4.89/4.91 c rens : 0.01 0 0
4.89/4.91 c rins : 0.00 0 0
4.89/4.91 c localbranching : 0.00 0 0
4.89/4.91 c mutation : 0.00 0 0
4.89/4.91 c dins : 0.00 0 0
4.89/4.91 c undercover : 0.00 0 0
4.89/4.91 c nlp : 0.00 0 0
4.89/4.91 c trysol : 0.00 0 0
4.89/4.91 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.91 c primal LP : 0.00 0 0 0.00 -
4.89/4.91 c dual LP : 0.30 14 2075 148.21 6916.67
4.89/4.91 c lex dual LP : 0.00 0 0 0.00 -
4.89/4.91 c barrier LP : 0.00 0 0 0.00 -
4.89/4.91 c diving/probing LP: 0.13 21 675 32.14 5192.31
4.89/4.91 c strong branching : 2.63 18 9990 555.00 3798.48
4.89/4.91 c (at root node) : - 18 9990 555.00 -
4.89/4.91 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.91 c B&B Tree :
4.89/4.91 c number of runs : 1
4.89/4.91 c nodes : 207
4.89/4.91 c nodes (total) : 207
4.89/4.91 c nodes left : 0
4.89/4.91 c max depth : 18
4.89/4.91 c max depth (total): 18
4.89/4.91 c backtracks : 54 (26.1%)
4.89/4.91 c delayed cutoffs : 32
4.89/4.91 c repropagations : 98 (1387 domain reductions, 27 cutoffs)
4.89/4.91 c avg switch length: 2.38
4.89/4.91 c switching time : 0.01
4.89/4.91 c Solution :
4.89/4.91 c Solutions found : 1 (1 improvements)
4.89/4.91 c First Solution : +9.50000000000000e+01 (in run 1, after 18 nodes, 4.73 seconds, depth 15, found by <relaxation>)
4.89/4.91 c Primal Bound : +9.50000000000000e+01 (in run 1, after 18 nodes, 4.73 seconds, depth 15, found by <relaxation>)
4.89/4.91 c Dual Bound : +9.50000000000000e+01
4.89/4.91 c Gap : 0.00 %
4.89/4.91 c Root Dual Bound : +8.20000000000000e+01
4.89/4.91 c Root Iterations : 2750
4.89/4.92 c Time complete: 4.92.