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-2667526-1276447839.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 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) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 208 impls, 0 clqs
0.00/0.04 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 440 upgd conss, 208 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
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, 1 changed coefficients
0.00/0.04 c 208 implications, 0 cliques
0.00/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.04 c 440 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.02
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.05 c
0.09/0.11 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.11 c 0.1s| 1 | 0 | 670 | - |1164k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.700000e+01 | -- | Inf
0.80/0.81 c 0.8s| 1 | 0 | 3142 | - |2670k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.733333e+01 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 3284 | - |4192k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.750000e+01 | -- | Inf
1.00/1.09 c 1.0s| 1 | 0 | 3466 | - |5744k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.760606e+01 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 3667 | - |7271k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.764800e+01 | -- | Inf
1.29/1.40 c 1.3s| 1 | 0 | 3783 | - |8813k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.766667e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 3868 | - | 10M| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.766941e+01 | -- | Inf
1.69/1.71 c 1.6s| 1 | 0 | 4006 | - | 11M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.768664e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 4207 | - | 12M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.771908e+01 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 4322 | - | 12M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.772653e+01 | -- | Inf
2.10/2.19 c 2.1s| 1 | 0 | 4444 | - | 12M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.773125e+01 | -- | Inf
2.29/2.35 c 2.3s| 1 | 0 | 4628 | - | 13M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.774448e+01 | -- | Inf
2.49/2.54 c 2.5s| 1 | 0 | 4848 | - | 13M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.775350e+01 | -- | Inf
2.59/2.67 c 2.6s| 1 | 0 | 4950 | - | 13M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 0 | 6.775477e+01 | -- | Inf
2.79/2.80 c 2.7s| 1 | 0 | 4989 | - | 13M| 0 | 200 | 200 | 440 | 200 | 454 | 14 | 0 | 0 | 6.775504e+01 | -- | Inf
2.89/2.97 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.89/2.97 c 2.9s| 1 | 0 | 5149 | - | 13M| 0 | 200 | 200 | 440 | 200 | 455 | 15 | 0 | 0 | 6.775962e+01 | -- | Inf
3.09/3.11 c 3.0s| 1 | 0 | 5240 | - | 13M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 0 | 6.776071e+01 | -- | Inf
6.88/6.95 c 6.8s| 1 | 2 | 5240 | - | 13M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 17 | 6.776071e+01 | -- | Inf
6.88/6.99 o 100
6.88/6.99 c * 6.8s| 94 | 4 | 5240 | 0.0 | 13M| 15 | - | 200 | 461 | 0 | 0 | 16 | 67 | 17 | 6.866667e+01 | 1.000000e+02 | 45.63%
7.09/7.14 c
7.09/7.14 c SCIP Status : problem is solved [optimal solution found]
7.09/7.14 c Solving Time (sec) : 6.98
7.09/7.14 c Solving Nodes : 541
7.09/7.14 c Primal Bound : +1.00000000000000e+02 (1 solutions)
7.09/7.14 c Dual Bound : +1.00000000000000e+02
7.09/7.14 c Gap : 0.00 %
7.09/7.14 s OPTIMUM FOUND
7.09/7.14 v -x200 x199 -x198 x197 -x196 x195 x194 -x193 x192 -x191 x190 -x189 -x188 x187 x186 -x185 x184 -x183 -x182 x181 -x180 x179 -x178
7.09/7.14 v x177 x176 -x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 x160 -x159 -x158 x157 x156 -x155
7.09/7.14 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 -x140 x139 x138 -x137 -x136 x135 x134 -x133 -x132
7.09/7.14 v x131 -x130 x129 -x128 x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 x116 -x115 -x114 x113 -x112 x111 x110 -x109
7.09/7.14 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
7.09/7.14 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
7.09/7.14 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
7.09/7.14 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
7.09/7.14 c SCIP Status : problem is solved [optimal solution found]
7.09/7.14 c Solving Time : 6.98
7.09/7.14 c Original Problem :
7.09/7.14 c Problem name : HOME/instance-2667526-1276447839.opb
7.09/7.14 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
7.09/7.14 c Constraints : 440 initial, 440 maximal
7.09/7.14 c Presolved Problem :
7.09/7.14 c Problem name : t_HOME/instance-2667526-1276447839.opb
7.09/7.14 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
7.09/7.14 c Constraints : 440 initial, 482 maximal
7.09/7.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.09/7.14 c trivial : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c implics : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c probing : 0.01 0 0 0 0 0 0 0 0
7.09/7.14 c linear : 0.01 0 0 0 0 0 0 0 1
7.09/7.14 c logicor : 0.00 0 0 0 0 0 0 0 0
7.09/7.14 c root node : - 77 - - 77 - - - -
7.09/7.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.09/7.14 c integral : 0 0 0 1 0 0 0 0 0 2
7.09/7.14 c logicor : 440+ 17 4638 0 1 277 8968 0 0 0
7.09/7.14 c countsols : 0 0 0 0 1 0 0 0 0 0
7.09/7.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.09/7.14 c integral : 3.68 0.00 0.00 3.68 0.00
7.09/7.14 c logicor : 0.03 0.00 0.03 0.00 0.00
7.09/7.14 c countsols : 0.00 0.00 0.00 0.00 0.00
7.09/7.14 c Propagators : Time Calls Cutoffs DomReds
7.09/7.14 c vbounds : 0.01 2 0 0
7.09/7.14 c rootredcost : 0.00 1 0 0
7.09/7.14 c pseudoobj : 0.06 4880 0 0
7.09/7.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.09/7.14 c propagation : 0.01 277 273 273 3.6 133 3.6 -
7.09/7.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
7.09/7.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.09/7.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.09/7.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.09/7.14 c applied globally : - - - 406 3.6 - - -
7.09/7.14 c applied locally : - - - 0 0.0 - - -
7.09/7.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.09/7.14 c cut pool : 0.04 16 - - 1447 - (maximal pool size: 2292)
7.09/7.14 c redcost : 0.00 17 0 0 0 0
7.09/7.14 c impliedbounds : 0.00 17 0 0 0 0
7.09/7.14 c intobj : 0.00 0 0 0 0 0
7.09/7.14 c cgmip : 0.00 0 0 0 0 0
7.09/7.14 c gomory : 0.86 17 0 0 0 0
7.09/7.14 c strongcg : 0.82 17 0 0 2479 0
7.09/7.14 c cmir : 0.03 10 0 0 0 0
7.09/7.14 c flowcover : 0.08 10 0 0 0 0
7.09/7.14 c clique : 0.00 1 0 0 0 0
7.09/7.14 c zerohalf : 0.00 0 0 0 0 0
7.09/7.14 c mcf : 0.00 1 0 0 0 0
7.09/7.14 c rapidlearning : 0.00 0 0 0 0 0
7.09/7.14 c Pricers : Time Calls Vars
7.09/7.14 c problem variables: 0.00 0 0
7.09/7.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.09/7.14 c relpscost : 3.68 1 0 0 0 0 2
7.09/7.14 c pscost : 0.00 0 0 0 0 0 0
7.09/7.14 c inference : 0.02 384 0 0 0 0 768
7.09/7.14 c mostinf : 0.00 0 0 0 0 0 0
7.09/7.14 c leastinf : 0.00 0 0 0 0 0 0
7.09/7.14 c fullstrong : 0.00 0 0 0 0 0 0
7.09/7.14 c allfullstrong : 0.00 0 0 0 0 0 0
7.09/7.14 c random : 0.00 0 0 0 0 0 0
7.09/7.14 c Primal Heuristics : Time Calls Found
7.09/7.14 c LP solutions : 0.00 - 0
7.09/7.14 c pseudo solutions : 0.00 - 1
7.09/7.14 c oneopt : 0.00 0 0
7.09/7.14 c crossover : 0.00 0 0
7.09/7.14 c trivial : 0.00 2 0
7.09/7.14 c simplerounding : 0.00 0 0
7.09/7.14 c zirounding : 0.00 1 0
7.09/7.14 c rounding : 0.01 17 0
7.09/7.14 c shifting : 0.01 17 0
7.09/7.14 c intshifting : 0.00 0 0
7.09/7.14 c twoopt : 0.00 0 0
7.09/7.14 c fixandinfer : 0.00 0 0
7.09/7.14 c feaspump : 0.56 1 0
7.09/7.14 c coefdiving : 0.00 0 0
7.09/7.14 c pscostdiving : 0.00 0 0
7.09/7.14 c fracdiving : 0.00 0 0
7.09/7.14 c veclendiving : 0.00 0 0
7.09/7.14 c intdiving : 0.00 0 0
7.09/7.14 c actconsdiving : 0.00 0 0
7.09/7.14 c objpscostdiving : 0.00 0 0
7.09/7.14 c rootsoldiving : 0.00 0 0
7.09/7.14 c linesearchdiving : 0.00 0 0
7.09/7.14 c guideddiving : 0.00 0 0
7.09/7.14 c octane : 0.00 0 0
7.09/7.14 c rens : 0.00 0 0
7.09/7.14 c rins : 0.00 0 0
7.09/7.14 c localbranching : 0.00 0 0
7.09/7.14 c mutation : 0.00 0 0
7.09/7.14 c dins : 0.00 0 0
7.09/7.14 c undercover : 0.00 0 0
7.09/7.14 c nlp : 0.00 0 0
7.09/7.14 c trysol : 0.00 0 0
7.09/7.14 c LP : Time Calls Iterations Iter/call Iter/sec
7.09/7.14 c primal LP : 0.01 0 0 0.00 0.00
7.09/7.14 c dual LP : 0.69 17 2908 171.06 4214.49
7.09/7.14 c lex dual LP : 0.00 0 0 0.00 -
7.09/7.14 c barrier LP : 0.00 0 0 0.00 -
7.09/7.14 c diving/probing LP: 0.54 33 2332 70.67 4318.52
7.09/7.14 c strong branching : 3.68 17 10760 632.94 2923.91
7.09/7.14 c (at root node) : - 17 10760 632.94 -
7.09/7.14 c conflict analysis: 0.00 0 0 0.00 -
7.09/7.14 c B&B Tree :
7.09/7.14 c number of runs : 1
7.09/7.14 c nodes : 541
7.09/7.14 c nodes (total) : 541
7.09/7.14 c nodes left : 0
7.09/7.14 c max depth : 16
7.09/7.14 c max depth (total): 16
7.09/7.14 c backtracks : 131 (24.2%)
7.09/7.14 c delayed cutoffs : 230
7.09/7.14 c repropagations : 572 (4486 domain reductions, 122 cutoffs)
7.09/7.14 c avg switch length: 3.16
7.09/7.14 c switching time : 0.01
7.09/7.14 c Solution :
7.09/7.14 c Solutions found : 1 (1 improvements)
7.09/7.14 c First Solution : +1.00000000000000e+02 (in run 1, after 94 nodes, 6.85 seconds, depth 8, found by <relaxation>)
7.09/7.14 c Primal Bound : +1.00000000000000e+02 (in run 1, after 94 nodes, 6.85 seconds, depth 8, found by <relaxation>)
7.09/7.14 c Dual Bound : +1.00000000000000e+02
7.09/7.14 c Gap : 0.00 %
7.09/7.14 c Root Dual Bound : +6.77607053273470e+01
7.09/7.14 c Root Iterations : 5240
7.09/7.15 c Time complete: 7.14.