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-2667515-1276427840.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 722 impls, 0 clqs
0.00/0.04 c (round 2) 4 del vars, 38 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 732 impls, 0 clqs
0.00/0.04 c (round 3) 5 del vars, 47 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.05 c (round 4) 9 del vars, 65 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.05 c (round 5) 14 del vars, 116 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 776 impls, 0 clqs
0.00/0.05 c (round 6) 16 del vars, 147 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 7) 19 del vars, 170 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.06 c (round 8) 22 del vars, 191 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 830 impls, 0 clqs
0.00/0.06 c (round 9) 22 del vars, 194 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.07 c (round 10) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.09 c (round 11) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 844 impls, 0 clqs
0.09/0.14 c (round 12) 72 del vars, 211 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5922 impls, 0 clqs
0.09/0.14 c (round 13) 72 del vars, 461 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.15 c (round 14) 72 del vars, 471 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.15 c (round 15) 73 del vars, 471 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.15 c (round 16) 73 del vars, 479 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.15 c presolving (17 rounds):
0.09/0.15 c 73 deleted vars, 479 deleted constraints, 26 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.15 c 6040 implications, 0 cliques
0.09/0.15 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 421 constraints
0.09/0.15 c 421 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.10
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c conflict/interconss = 0
0.09/0.15 c
0.09/0.15 c # should binary conflicts be preferred?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c conflict/preferbinary = TRUE
0.09/0.15 c
0.09/0.15 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c constraints/agelimit = 1
0.09/0.15 c
0.09/0.15 c # should enforcement of pseudo solution be disabled?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/disableenfops = TRUE
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.98
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = 0
0.09/0.15 c
0.09/0.15 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.15 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.15 c lp/pricing = a
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # priority of node selection rule <dfs> in standard mode
0.09/0.15 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.15 c nodeselection/dfs/stdpriority = 1000000
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
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.1s| 1 | 0 | 489 | - |1490k| 0 | 108 | 127 | 421 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | -- | Inf
0.19/0.24 o 90
0.19/0.24 c F 0.2s| 1 | 0 | 723 | - |1508k| 0 | 0 | 127 | 421 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | 9.000000e+01 | 11.28%
0.29/0.34 c 0.3s| 1 | 0 | 851 | - |2019k| 0 | 98 | 127 | 421 | 127 | 482 | 76 | 0 | 0 | 8.248889e+01 | 9.000000e+01 | 9.11%
0.39/0.43 c 0.4s| 1 | 0 | 959 | - |2107k| 0 | 110 | 127 | 421 | 127 | 490 | 84 | 0 | 0 | 8.300377e+01 | 9.000000e+01 | 8.43%
0.49/0.53 c 0.5s| 1 | 0 | 1039 | - |2324k| 0 | 102 | 127 | 421 | 127 | 497 | 91 | 0 | 0 | 8.342636e+01 | 9.000000e+01 | 7.88%
0.59/0.62 c 0.6s| 1 | 0 | 1102 | - |2357k| 0 | 104 | 127 | 421 | 127 | 503 | 97 | 0 | 0 | 8.350597e+01 | 9.000000e+01 | 7.78%
0.69/0.71 c 0.6s| 1 | 0 | 1125 | - |2471k| 0 | 101 | 127 | 421 | 127 | 508 | 102 | 0 | 0 | 8.351806e+01 | 9.000000e+01 | 7.76%
0.79/0.82 c 0.7s| 1 | 0 | 1198 | - |2555k| 0 | 105 | 127 | 421 | 127 | 509 | 103 | 0 | 0 | 8.357233e+01 | 9.000000e+01 | 7.69%
0.89/0.92 c 0.8s| 1 | 0 | 1241 | - |2617k| 0 | 108 | 127 | 421 | 127 | 511 | 105 | 0 | 0 | 8.366667e+01 | 9.000000e+01 | 7.57%
1.00/1.03 c 0.9s| 1 | 0 | 1292 | - |2974k| 0 | 105 | 127 | 421 | 127 | 514 | 108 | 0 | 0 | 8.366667e+01 | 9.000000e+01 | 7.57%
1.09/1.18 c 1.1s| 1 | 0 | 1497 | - |3207k| 0 | 105 | 127 | 421 | 127 | 517 | 111 | 0 | 0 | 8.381390e+01 | 9.000000e+01 | 7.38%
1.19/1.28 c 1.2s| 1 | 0 | 1528 | - |3461k| 0 | 105 | 127 | 421 | 127 | 519 | 113 | 0 | 0 | 8.381982e+01 | 9.000000e+01 | 7.37%
1.39/1.44 c 1.4s| 1 | 0 | 1856 | - |3636k| 0 | 103 | 127 | 421 | 127 | 465 | 114 | 0 | 0 | 8.395657e+01 | 9.000000e+01 | 7.20%
1.49/1.57 c 1.5s| 1 | 0 | 1955 | - |4625k| 0 | 101 | 127 | 421 | 127 | 466 | 115 | 0 | 0 | 8.400000e+01 | 9.000000e+01 | 7.14%
1.59/1.67 c 1.6s| 1 | 0 | 2039 | - |4920k| 0 | 104 | 127 | 421 | 127 | 467 | 116 | 0 | 0 | 8.400000e+01 | 9.000000e+01 | 7.14%
1.69/1.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.78 c 1.7s| 1 | 0 | 2260 | - |5024k| 0 | 108 | 127 | 421 | 127 | 469 | 118 | 0 | 0 | 8.401425e+01 | 9.000000e+01 | 7.12%
1.69/1.78 o 90
1.69/1.78 c s 1.7s| 1 | 0 | 2260 | - |5026k| 0 | 108 | 127 | 421 | 127 | 469 | 118 | 0 | 0 | 8.401425e+01 | 9.000000e+01 | 7.12%
1.89/1.91 c 1.8s| 1 | 0 | 2450 | - |5395k| 0 | 105 | 127 | 421 | 127 | 475 | 124 | 0 | 0 | 8.408217e+01 | 9.000000e+01 | 7.04%
1.89/1.91 o 88
1.89/1.91 c b 1.8s| 1 | 0 | 2450 | - |5400k| 0 | 105 | 127 | 421 | 127 | 475 | 124 | 0 | 0 | 8.408217e+01 | 8.800000e+01 | 4.66%
1.99/2.01 c 1.9s| 1 | 0 | 2547 | - |5692k| 0 | 103 | 127 | 421 | 127 | 480 | 129 | 0 | 0 | 8.408725e+01 | 8.800000e+01 | 4.65%
2.10/2.16 c 2.0s| 1 | 0 | 2879 | - |5725k| 0 | 101 | 127 | 421 | 127 | 471 | 132 | 0 | 0 | 8.419241e+01 | 8.800000e+01 | 4.52%
2.20/2.25 c 2.1s| 1 | 0 | 2931 | - |5987k| 0 | 104 | 127 | 421 | 127 | 472 | 133 | 0 | 0 | 8.419448e+01 | 8.800000e+01 | 4.52%
2.29/2.35 c 2.2s| 1 | 0 | 3060 | - |6123k| 0 | 104 | 127 | 421 | 127 | 473 | 134 | 0 | 0 | 8.427273e+01 | 8.800000e+01 | 4.42%
2.39/2.43 c 2.3s| 1 | 0 | 3115 | - |6140k| 0 | 110 | 127 | 421 | 127 | 474 | 135 | 0 | 0 | 8.427273e+01 | 8.800000e+01 | 4.42%
2.39/2.49 c 2.4s| 1 | 0 | 3149 | - |6145k| 0 | 108 | 127 | 421 | 127 | 479 | 140 | 0 | 0 | 8.437500e+01 | 8.800000e+01 | 4.30%
2.49/2.54 c 2.4s| 1 | 0 | 3184 | - |6148k| 0 | 106 | 127 | 421 | 127 | 480 | 141 | 0 | 0 | 8.437500e+01 | 8.800000e+01 | 4.30%
5.40/5.40 c 5.3s| 1 | 0 | 3336 | - |6126k| 0 | 95 | 127 | 401 | 127 | 465 | 141 | 0 | 27 | 8.437500e+01 | 8.800000e+01 | 4.30%
5.40/5.45 c 5.3s| 1 | 0 | 3353 | - |6130k| 0 | 97 | 127 | 401 | 127 | 466 | 142 | 0 | 27 | 8.437500e+01 | 8.800000e+01 | 4.30%
6.39/6.49 c 6.3s| 1 | 0 | 3572 | - |6094k| 0 | 68 | 127 | 366 | 127 | 466 | 142 | 0 | 37 | 8.612500e+01 | 8.800000e+01 | 2.18%
6.49/6.52 c 6.4s| 1 | 0 | 3601 | - |6086k| 0 | 63 | 127 | 362 | 127 | 237 | 143 | 0 | 37 | 8.675000e+01 | 8.800000e+01 | 1.44%
6.49/6.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
6.49/6.53 c 6.4s| 1 | 0 | 3601 | - |6088k| 0 | 63 | 127 | 362 | 127 | 237 | 143 | 0 | 39 | 8.800000e+01 | 8.800000e+01 | 0.00%
6.49/6.53 c
6.49/6.53 c SCIP Status : problem is solved [optimal solution found]
6.49/6.53 c Solving Time (sec) : 6.37
6.49/6.53 c Solving Nodes : 1
6.49/6.53 c Primal Bound : +8.80000000000000e+01 (5 solutions)
6.49/6.53 c Dual Bound : +8.80000000000000e+01
6.49/6.53 c Gap : 0.00 %
6.49/6.53 s OPTIMUM FOUND
6.49/6.53 v -x200 -x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 -x186 x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178
6.49/6.53 v x177 -x176 x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 -x160 x159 x158 -x157 x156 -x155
6.49/6.53 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 x140 -x139 x138 -x137 x136 -x135 -x134 x133
6.49/6.53 v -x132 -x131 x130 -x129 -x128 x127 -x126 x125 x124 -x123 -x122 x121 -x120 -x119 x118 -x117 -x116 x115 -x114 x113 -x112 x111 -x110
6.49/6.53 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
6.49/6.53 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
6.49/6.53 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
6.49/6.53 v 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 -x1
6.49/6.53 c SCIP Status : problem is solved [optimal solution found]
6.49/6.53 c Solving Time : 6.37
6.49/6.53 c Original Problem :
6.49/6.53 c Problem name : HOME/instance-2667515-1276427840.opb
6.49/6.53 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.53 c Constraints : 900 initial, 900 maximal
6.49/6.53 c Presolved Problem :
6.49/6.53 c Problem name : t_HOME/instance-2667515-1276427840.opb
6.49/6.53 c Variables : 127 (127 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.53 c Constraints : 421 initial, 421 maximal
6.49/6.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.49/6.53 c trivial : 0.00 2 0 0 0 0 0 0 0
6.49/6.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c implics : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c probing : 0.04 39 12 0 4 0 0 0 0
6.49/6.53 c linear : 0.02 20 0 0 22 0 211 17 0
6.49/6.53 c logicor : 0.02 0 0 0 0 0 268 0 0
6.49/6.53 c root node : - 38 - - 38 - - - -
6.49/6.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.49/6.53 c integral : 0 0 0 3 0 1 6 0 0 0
6.49/6.53 c logicor : 421 25 941 0 0 14 27 0 0 0
6.49/6.53 c countsols : 0 0 0 0 0 0 0 0 0 0
6.49/6.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.49/6.53 c integral : 3.74 0.00 0.00 3.74 0.00
6.49/6.53 c logicor : 0.01 0.01 0.00 0.00 0.00
6.49/6.53 c countsols : 0.00 0.00 0.00 0.00 0.00
6.49/6.53 c Propagators : Time Calls Cutoffs DomReds
6.49/6.53 c vbounds : 0.00 2 0 0
6.49/6.53 c rootredcost : 0.00 0 0 0
6.49/6.53 c pseudoobj : 0.00 35 0 0
6.49/6.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.49/6.53 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.49/6.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.49/6.53 c applied globally : - - - 0 0.0 - - -
6.49/6.53 c applied locally : - - - 0 0.0 - - -
6.49/6.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.49/6.53 c cut pool : 0.05 24 - - 196 - (maximal pool size: 1776)
6.49/6.53 c redcost : 0.00 25 0 5 0 0
6.49/6.53 c impliedbounds : 0.01 25 0 0 166 0
6.49/6.53 c intobj : 0.00 0 0 0 0 0
6.49/6.53 c cgmip : 0.00 0 0 0 0 0
6.49/6.53 c gomory : 0.94 25 0 0 1927 0
6.49/6.53 c strongcg : 0.66 20 0 0 2963 0
6.49/6.53 c cmir : 0.05 10 0 0 0 0
6.49/6.53 c flowcover : 0.06 10 0 0 0 0
6.49/6.53 c clique : 0.03 25 0 0 61 0
6.49/6.53 c zerohalf : 0.00 0 0 0 0 0
6.49/6.53 c mcf : 0.00 1 0 0 0 0
6.49/6.53 c rapidlearning : 0.00 0 0 0 0 0
6.49/6.53 c Pricers : Time Calls Vars
6.49/6.53 c problem variables: 0.00 0 0
6.49/6.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.49/6.53 c relpscost : 3.74 3 1 6 0 0 0
6.49/6.53 c pscost : 0.00 0 0 0 0 0 0
6.49/6.53 c inference : 0.00 0 0 0 0 0 0
6.49/6.53 c mostinf : 0.00 0 0 0 0 0 0
6.49/6.53 c leastinf : 0.00 0 0 0 0 0 0
6.49/6.53 c fullstrong : 0.00 0 0 0 0 0 0
6.49/6.53 c allfullstrong : 0.00 0 0 0 0 0 0
6.49/6.53 c random : 0.00 0 0 0 0 0 0
6.49/6.53 c Primal Heuristics : Time Calls Found
6.49/6.53 c LP solutions : 0.00 - 0
6.49/6.53 c pseudo solutions : 0.00 - 0
6.49/6.53 c crossover : 0.00 0 0
6.49/6.53 c oneopt : 0.00 3 1
6.49/6.53 c trivial : 0.00 2 0
6.49/6.53 c simplerounding : 0.00 0 0
6.49/6.53 c zirounding : 0.00 1 0
6.49/6.53 c rounding : 0.00 27 0
6.49/6.53 c shifting : 0.04 27 3
6.49/6.53 c intshifting : 0.00 0 0
6.49/6.53 c twoopt : 0.00 0 0
6.49/6.53 c fixandinfer : 0.00 0 0
6.49/6.53 c feaspump : 0.04 1 1
6.49/6.53 c coefdiving : 0.00 0 0
6.49/6.53 c pscostdiving : 0.00 0 0
6.49/6.53 c fracdiving : 0.00 0 0
6.49/6.53 c veclendiving : 0.00 0 0
6.49/6.53 c intdiving : 0.00 0 0
6.49/6.53 c actconsdiving : 0.00 0 0
6.49/6.53 c objpscostdiving : 0.00 0 0
6.49/6.53 c rootsoldiving : 0.00 0 0
6.49/6.53 c linesearchdiving : 0.00 0 0
6.49/6.53 c guideddiving : 0.00 0 0
6.49/6.53 c octane : 0.00 0 0
6.49/6.53 c rens : 0.01 0 0
6.49/6.53 c rins : 0.00 0 0
6.49/6.53 c localbranching : 0.00 0 0
6.49/6.53 c mutation : 0.00 0 0
6.49/6.53 c dins : 0.00 0 0
6.49/6.53 c undercover : 0.00 0 0
6.49/6.53 c nlp : 0.00 0 0
6.49/6.53 c trysol : 0.00 0 0
6.49/6.53 c LP : Time Calls Iterations Iter/call Iter/sec
6.49/6.53 c primal LP : 0.01 0 0 0.00 0.00
6.49/6.53 c dual LP : 0.58 27 3367 124.70 5805.17
6.49/6.53 c lex dual LP : 0.00 0 0 0.00 -
6.49/6.53 c barrier LP : 0.00 0 0 0.00 -
6.49/6.53 c diving/probing LP: 0.04 6 234 39.00 5850.00
6.49/6.53 c strong branching : 3.74 39 16118 413.28 4309.63
6.49/6.53 c (at root node) : - 39 16118 413.28 -
6.49/6.53 c conflict analysis: 0.00 0 0 0.00 -
6.49/6.53 c B&B Tree :
6.49/6.53 c number of runs : 1
6.49/6.53 c nodes : 1
6.49/6.53 c nodes (total) : 1
6.49/6.53 c nodes left : 0
6.49/6.53 c max depth : 0
6.49/6.53 c max depth (total): 0
6.49/6.53 c backtracks : 0 (0.0%)
6.49/6.53 c delayed cutoffs : 0
6.49/6.53 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.49/6.53 c avg switch length: 2.00
6.49/6.53 c switching time : 0.00
6.49/6.53 c Solution :
6.49/6.53 c Solutions found : 5 (3 improvements)
6.49/6.53 c First Solution : +9.00000000000000e+01 (in run 1, after 1 nodes, 0.18 seconds, depth 0, found by <feaspump>)
6.49/6.53 c Primal Bound : +8.80000000000000e+01 (in run 1, after 1 nodes, 1.81 seconds, depth 0, found by <oneopt>)
6.49/6.53 c Dual Bound : +8.80000000000000e+01
6.49/6.53 c Gap : 0.00 %
6.49/6.53 c Root Dual Bound : +8.80000000000000e+01
6.49/6.53 c Root Iterations : 3601
6.49/6.54 c Time complete: 6.54.