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-2667518-1276429984.opb>
0.01/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 700 constraints
0.01/0.02 c problem read
0.01/0.02 c presolving settings loaded
0.01/0.03 c presolving:
0.01/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 216 impls, 0 clqs
0.01/0.05 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 700 upgd conss, 216 impls, 0 clqs
0.01/0.06 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.01/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.06 c presolving (3 rounds):
0.01/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
0.01/0.06 c 216 implications, 0 cliques
0.01/0.06 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 700 constraints
0.01/0.06 c 700 constraints of type <logicor>
0.01/0.06 c transformed objective value is always integral (scale: 1)
0.01/0.06 c Presolving Time: 0.04
0.01/0.06 c - non default parameters ----------------------------------------------------------------------
0.01/0.06 c # SCIP version 1.2.1.2
0.01/0.06 c
0.01/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c conflict/interconss = 0
0.01/0.06 c
0.01/0.06 c # should binary conflicts be preferred?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c conflict/preferbinary = TRUE
0.01/0.06 c
0.01/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c constraints/agelimit = 1
0.01/0.06 c
0.01/0.06 c # should enforcement of pseudo solution be disabled?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/disableenfops = TRUE
0.01/0.06 c
0.01/0.06 c # frequency for displaying node information lines
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06 c display/freq = 10000
0.01/0.06 c
0.01/0.06 c # maximal time in seconds to run
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/time = 1799.99
0.01/0.06 c
0.01/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/memory = 1620
0.01/0.06 c
0.01/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c lp/solvefreq = 0
0.01/0.06 c
0.01/0.06 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.01/0.06 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.06 c lp/pricing = a
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify inequalities
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/linear/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify knapsacks
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # priority of node selection rule <dfs> in standard mode
0.01/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.06 c nodeselection/dfs/stdpriority = 1000000
0.01/0.06 c
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c start solving
0.01/0.07 c
0.09/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 755 | - |1441k| 0 | 200 | 200 | 700 | 200 | 700 | 0 | 0 | 0 | 6.733333e+01 | -- | Inf
1.49/1.52 c 1.5s| 1 | 0 | 4395 | - |3027k| 0 | 200 | 200 | 700 | 200 | 701 | 1 | 0 | 0 | 6.777778e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 4686 | - |4369k| 0 | 200 | 200 | 700 | 200 | 702 | 2 | 0 | 0 | 6.792593e+01 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 4852 | - |5533k| 0 | 200 | 200 | 700 | 200 | 703 | 3 | 0 | 0 | 6.800000e+01 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 5067 | - |7143k| 0 | 200 | 200 | 700 | 200 | 704 | 4 | 0 | 0 | 6.803604e+01 | -- | Inf
2.20/2.22 c 2.1s| 1 | 0 | 5213 | - |8544k| 0 | 200 | 200 | 700 | 200 | 705 | 5 | 0 | 0 | 6.806897e+01 | -- | Inf
2.39/2.42 c 2.4s| 1 | 0 | 5436 | - | 10M| 0 | 200 | 200 | 700 | 200 | 706 | 6 | 0 | 0 | 6.809709e+01 | -- | Inf
2.59/2.63 c 2.5s| 1 | 0 | 5692 | - | 11M| 0 | 200 | 200 | 700 | 200 | 707 | 7 | 0 | 0 | 6.814088e+01 | -- | Inf
2.79/2.84 c 2.8s| 1 | 0 | 5955 | - | 12M| 0 | 200 | 200 | 700 | 200 | 708 | 8 | 0 | 0 | 6.816521e+01 | -- | Inf
2.99/3.05 c 3.0s| 1 | 0 | 6208 | - | 13M| 0 | 200 | 200 | 700 | 200 | 709 | 9 | 0 | 0 | 6.817347e+01 | -- | Inf
3.19/3.29 c 3.2s| 1 | 0 | 6507 | - | 14M| 0 | 200 | 200 | 700 | 200 | 710 | 10 | 0 | 0 | 6.819396e+01 | -- | Inf
3.49/3.55 c 3.5s| 1 | 0 | 6885 | - | 16M| 0 | 200 | 200 | 700 | 200 | 711 | 11 | 0 | 0 | 6.821049e+01 | -- | Inf
3.79/3.83 c 3.7s| 1 | 0 | 7314 | - | 17M| 0 | 200 | 200 | 700 | 200 | 713 | 13 | 0 | 0 | 6.822924e+01 | -- | Inf
4.09/4.10 c 4.0s| 1 | 0 | 7711 | - | 18M| 0 | 200 | 200 | 700 | 200 | 714 | 14 | 0 | 0 | 6.824494e+01 | -- | Inf
4.30/4.39 c 4.3s| 1 | 0 | 8118 | - | 20M| 0 | 200 | 200 | 700 | 200 | 715 | 15 | 0 | 0 | 6.826180e+01 | -- | Inf
4.69/4.73 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.69/4.73 c 4.6s| 1 | 0 | 8639 | - | 21M| 0 | 200 | 200 | 700 | 200 | 716 | 16 | 0 | 0 | 6.827672e+01 | -- | Inf
4.89/4.98 c 4.9s| 1 | 0 | 8873 | - | 21M| 0 | 200 | 200 | 700 | 200 | 717 | 17 | 0 | 0 | 6.827888e+01 | -- | Inf
13.99/14.07 c 13.8s| 1 | 2 | 8873 | - | 21M| 0 | 200 | 200 | 700 | 200 | 717 | 17 | 0 | 21 | 6.827888e+01 | -- | Inf
14.08/14.11 o 100
14.08/14.11 c *13.9s| 102 | 5 | 8873 | 0.0 | 21M| 17 | - | 200 | 712 | 0 | 0 | 17 | 54 | 21 | 6.900000e+01 | 1.000000e+02 | 44.93%
14.08/14.12 c
14.08/14.12 c SCIP Status : problem is solved [optimal solution found]
14.08/14.12 c Solving Time (sec) : 13.90
14.08/14.12 c Solving Nodes : 143
14.08/14.12 c Primal Bound : +1.00000000000000e+02 (1 solutions)
14.08/14.12 c Dual Bound : +1.00000000000000e+02
14.08/14.12 c Gap : 0.00 %
14.08/14.13 s OPTIMUM FOUND
14.08/14.13 v -x200 x199 -x198 x197 x196 -x195 -x194 x193 x192 -x191 -x190 x189 -x188 x187 -x186 x185 -x184 x183 x182 -x181 x180 -x179 -x178
14.08/14.13 v x177 x176 -x175 x174 -x173 -x172 x171 x170 -x169 x168 -x167 x166 -x165 x164 -x163 -x162 x161 x160 -x159 x158 -x157 -x156 x155
14.08/14.13 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 x142 -x141 -x140 x139 -x138 x137 x136 -x135 -x134 x133 x132
14.08/14.13 v -x131 -x130 x129 x128 -x127 x126 -x125 -x124 x123 x122 -x121 x120 -x119 -x118 x117 x116 -x115 -x114 x113 x112 -x111 x110 -x109
14.08/14.13 v x108 -x107 -x106 x105 x104 -x103 x102 -x101 x100 -x99 -x98 x97 -x96 x95 -x94 x93 x92 -x91 x90 -x89 -x88 x87 x86 -x85 -x84
14.08/14.13 v 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 -x56
14.08/14.13 v 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 x28
14.08/14.13 v -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
14.08/14.13 c SCIP Status : problem is solved [optimal solution found]
14.08/14.13 c Solving Time : 13.90
14.08/14.13 c Original Problem :
14.08/14.13 c Problem name : HOME/instance-2667518-1276429984.opb
14.08/14.13 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
14.08/14.13 c Constraints : 700 initial, 700 maximal
14.08/14.13 c Presolved Problem :
14.08/14.13 c Problem name : t_HOME/instance-2667518-1276429984.opb
14.08/14.13 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
14.08/14.13 c Constraints : 700 initial, 718 maximal
14.08/14.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
14.08/14.13 c trivial : 0.00 0 0 0 0 0 0 0 0
14.08/14.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
14.08/14.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
14.08/14.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
14.08/14.13 c implics : 0.00 0 0 0 0 0 0 0 0
14.08/14.13 c probing : 0.01 0 0 0 0 0 0 0 0
14.08/14.13 c linear : 0.02 0 0 0 0 0 0 0 2
14.08/14.13 c logicor : 0.01 0 0 0 0 0 0 0 0
14.08/14.13 c root node : - 43 - - 43 - - - -
14.08/14.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
14.08/14.13 c integral : 0 0 0 1 0 0 0 0 0 2
14.08/14.13 c logicor : 700+ 17 1214 0 1 73 2885 0 0 0
14.08/14.13 c countsols : 0 0 0 0 1 0 0 0 0 0
14.08/14.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
14.08/14.13 c integral : 8.83 0.00 0.00 8.83 0.00
14.08/14.13 c logicor : 0.00 0.00 0.00 0.00 0.00
14.08/14.13 c countsols : 0.00 0.00 0.00 0.00 0.00
14.08/14.13 c Propagators : Time Calls Cutoffs DomReds
14.08/14.13 c vbounds : 0.00 2 0 0
14.08/14.13 c rootredcost : 0.00 1 0 0
14.08/14.13 c pseudoobj : 0.03 1154 0 0
14.08/14.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
14.08/14.13 c propagation : 0.00 73 71 71 3.3 12 3.7 -
14.08/14.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
14.08/14.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
14.08/14.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
14.08/14.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
14.08/14.13 c applied globally : - - - 83 3.3 - - -
14.08/14.13 c applied locally : - - - 0 0.0 - - -
14.08/14.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
14.08/14.13 c cut pool : 0.06 16 - - 2232 - (maximal pool size: 4329)
14.08/14.13 c redcost : 0.00 17 0 0 0 0
14.08/14.13 c impliedbounds : 0.00 17 0 0 0 0
14.08/14.13 c intobj : 0.00 0 0 0 0 0
14.08/14.13 c cgmip : 0.00 0 0 0 0 0
14.08/14.13 c gomory : 0.82 17 0 0 142 0
14.08/14.13 c strongcg : 0.94 17 0 0 4602 0
14.08/14.13 c cmir : 0.07 10 0 0 0 0
14.08/14.13 c flowcover : 0.05 10 0 0 0 0
14.08/14.13 c clique : 0.00 1 0 0 0 0
14.08/14.13 c zerohalf : 0.00 0 0 0 0 0
14.08/14.13 c mcf : 0.01 1 0 0 0 0
14.08/14.13 c rapidlearning : 0.00 0 0 0 0 0
14.08/14.13 c Pricers : Time Calls Vars
14.08/14.13 c problem variables: 0.00 0 0
14.08/14.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
14.08/14.13 c relpscost : 8.83 1 0 0 0 0 2
14.08/14.13 c pscost : 0.00 0 0 0 0 0 0
14.08/14.13 c inference : 0.01 100 0 0 0 0 200
14.08/14.13 c mostinf : 0.00 0 0 0 0 0 0
14.08/14.13 c leastinf : 0.00 0 0 0 0 0 0
14.08/14.13 c fullstrong : 0.00 0 0 0 0 0 0
14.08/14.13 c allfullstrong : 0.00 0 0 0 0 0 0
14.08/14.13 c random : 0.00 0 0 0 0 0 0
14.08/14.13 c Primal Heuristics : Time Calls Found
14.08/14.13 c LP solutions : 0.00 - 0
14.08/14.13 c pseudo solutions : 0.00 - 1
14.08/14.13 c oneopt : 0.00 0 0
14.08/14.13 c crossover : 0.00 0 0
14.08/14.13 c trivial : 0.00 2 0
14.08/14.13 c simplerounding : 0.00 0 0
14.08/14.13 c zirounding : 0.00 1 0
14.08/14.13 c rounding : 0.01 17 0
14.08/14.13 c shifting : 0.04 17 0
14.08/14.13 c intshifting : 0.00 0 0
14.08/14.13 c twoopt : 0.00 0 0
14.08/14.13 c fixandinfer : 0.00 0 0
14.08/14.13 c feaspump : 1.14 1 0
14.08/14.13 c coefdiving : 0.00 0 0
14.08/14.13 c pscostdiving : 0.00 0 0
14.08/14.13 c fracdiving : 0.00 0 0
14.08/14.13 c veclendiving : 0.00 0 0
14.08/14.13 c intdiving : 0.00 0 0
14.08/14.13 c actconsdiving : 0.00 0 0
14.08/14.13 c objpscostdiving : 0.00 0 0
14.08/14.13 c rootsoldiving : 0.00 0 0
14.08/14.13 c linesearchdiving : 0.00 0 0
14.08/14.13 c guideddiving : 0.00 0 0
14.08/14.13 c octane : 0.00 0 0
14.08/14.13 c rens : 0.01 0 0
14.08/14.13 c rins : 0.00 0 0
14.08/14.13 c localbranching : 0.00 0 0
14.08/14.13 c mutation : 0.00 0 0
14.08/14.13 c dins : 0.00 0 0
14.08/14.13 c undercover : 0.00 0 0
14.08/14.13 c nlp : 0.00 0 0
14.08/14.13 c trysol : 0.00 0 0
14.08/14.13 c LP : Time Calls Iterations Iter/call Iter/sec
14.08/14.13 c primal LP : 0.00 0 0 0.00 -
14.08/14.13 c dual LP : 1.80 17 5489 322.88 3049.44
14.08/14.13 c lex dual LP : 0.00 0 0 0.00 -
14.08/14.13 c barrier LP : 0.00 0 0 0.00 -
14.08/14.13 c diving/probing LP: 1.14 44 3384 76.91 2968.42
14.08/14.13 c strong branching : 8.83 21 20791 990.05 2354.59
14.08/14.13 c (at root node) : - 21 20791 990.05 -
14.08/14.13 c conflict analysis: 0.00 0 0 0.00 -
14.08/14.13 c B&B Tree :
14.08/14.13 c number of runs : 1
14.08/14.13 c nodes : 143
14.08/14.13 c nodes (total) : 143
14.08/14.13 c nodes left : 0
14.08/14.13 c max depth : 17
14.08/14.13 c max depth (total): 17
14.08/14.13 c backtracks : 36 (25.2%)
14.08/14.13 c delayed cutoffs : 60
14.08/14.13 c repropagations : 144 (1208 domain reductions, 32 cutoffs)
14.08/14.13 c avg switch length: 3.13
14.08/14.13 c switching time : 0.01
14.08/14.13 c Solution :
14.08/14.13 c Solutions found : 1 (1 improvements)
14.08/14.13 c First Solution : +1.00000000000000e+02 (in run 1, after 102 nodes, 13.88 seconds, depth 12, found by <relaxation>)
14.08/14.13 c Primal Bound : +1.00000000000000e+02 (in run 1, after 102 nodes, 13.88 seconds, depth 12, found by <relaxation>)
14.08/14.13 c Dual Bound : +1.00000000000000e+02
14.08/14.13 c Gap : 0.00 %
14.08/14.13 c Root Dual Bound : +6.82788793292453e+01
14.08/14.13 c Root Iterations : 8873
14.08/14.14 c Time complete: 14.13.