0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452346-1307108721.opb>
0.00/0.00 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 749 del vars, 50 del conss, 0 add conss, 749 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2996 impls, 0 clqs
0.00/0.04 c (round 2) 749 del vars, 50 del conss, 0 add conss, 749 chg bounds, 0 chg sides, 0 chg coeffs, 749 upgd conss, 4494 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 749 deleted vars, 50 deleted constraints, 0 added constraints, 749 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 4494 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 749 constraints
0.00/0.04 c 749 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.04
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.4
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 = 1800
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 = 13950
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = 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.00/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.00/0.05 c t 0.0s| 1 | 0 | 50 | - |1756k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.05 o -1
0.00/0.05 c R 0.0s| 1 | 0 | 50 | - |1756k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.05 o -2
0.00/0.05 c s 0.0s| 1 | 0 | 50 | - |1757k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.05 c 0.1s| 1 | 0 | 69 | - |1763k| 0 | 43 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.150000e+01 |-2.000000e+00 | 90.70%
0.00/0.05 o -5
0.00/0.05 c b 0.1s| 1 | 0 | 69 | - |1764k| 0 | 43 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.150000e+01 |-5.000000e+00 | 76.74%
0.00/0.06 c 0.1s| 1 | 0 | 116 | - |1774k| 0 | 31 | 50 | 749 | 50 | 761 | 12 | 0 | 0 |-1.550000e+01 |-5.000000e+00 | 67.74%
0.00/0.08 c 0.1s| 1 | 0 | 238 | - |1780k| 0 | 24 | 50 | 749 | 50 | 766 | 17 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.00/0.09 c 0.1s| 1 | 0 | 294 | - |1786k| 0 | 31 | 50 | 749 | 50 | 773 | 24 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.11/0.12 c 0.1s| 1 | 0 | 348 | - |1812k| 0 | 23 | 50 | 749 | 50 | 782 | 33 | 0 | 0 |-1.016667e+01 |-5.000000e+00 | 50.82%
0.11/0.14 c 0.1s| 1 | 0 | 388 | - |1830k| 0 | 24 | 50 | 749 | 50 | 789 | 40 | 0 | 0 |-9.666667e+00 |-5.000000e+00 | 48.28%
0.11/0.16 c 0.2s| 1 | 0 | 454 | - |1847k| 0 | 30 | 50 | 749 | 50 | 795 | 46 | 0 | 0 |-9.027027e+00 |-5.000000e+00 | 44.61%
0.11/0.19 c 0.2s| 1 | 0 | 489 | - |2312k| 0 | 33 | 50 | 749 | 50 | 803 | 54 | 0 | 0 |-8.523810e+00 |-5.000000e+00 | 41.34%
0.19/0.23 c 0.2s| 1 | 0 | 519 | - |2857k| 0 | 34 | 50 | 749 | 50 | 810 | 61 | 0 | 0 |-8.221818e+00 |-5.000000e+00 | 39.19%
0.19/0.27 c 0.3s| 1 | 0 | 582 | - |3478k| 0 | 35 | 50 | 749 | 50 | 819 | 70 | 0 | 0 |-7.973975e+00 |-5.000000e+00 | 37.30%
0.29/0.32 c 0.3s| 1 | 0 | 611 | - |4050k| 0 | 39 | 50 | 749 | 50 | 136 | 78 | 0 | 0 |-7.701694e+00 |-5.000000e+00 | 35.08%
0.29/0.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.33 c 0.3s| 1 | 0 | 641 | - |4253k| 0 | 39 | 50 | 749 | 50 | 147 | 89 | 0 | 0 |-7.576125e+00 |-5.000000e+00 | 34.00%
0.29/0.34 c 0.3s| 1 | 0 | 680 | - |4567k| 0 | 44 | 50 | 749 | 50 | 152 | 94 | 0 | 0 |-7.423195e+00 |-5.000000e+00 | 32.64%
0.29/0.35 c 0.3s| 1 | 0 | 715 | - |4823k| 0 | 43 | 50 | 749 | 50 | 162 | 104 | 0 | 0 |-7.363280e+00 |-5.000000e+00 | 32.10%
0.29/0.36 c 0.4s| 1 | 0 | 806 | - |5083k| 0 | 41 | 50 | 749 | 50 | 170 | 112 | 0 | 0 |-7.229371e+00 |-5.000000e+00 | 30.84%
0.29/0.37 c 0.4s| 1 | 0 | 847 | - |5357k| 0 | 44 | 50 | 749 | 50 | 178 | 120 | 0 | 0 |-7.193704e+00 |-5.000000e+00 | 30.49%
0.29/0.38 c 0.4s| 1 | 0 | 887 | - |5655k| 0 | 46 | 50 | 749 | 50 | 127 | 130 | 0 | 0 |-7.151776e+00 |-5.000000e+00 | 30.09%
0.29/0.39 c 0.4s| 1 | 0 | 933 | - |5851k| 0 | 43 | 50 | 749 | 50 | 132 | 135 | 0 | 0 |-7.122742e+00 |-5.000000e+00 | 29.80%
0.39/0.40 c 0.4s| 1 | 0 | 962 | - |6019k| 0 | 47 | 50 | 749 | 50 | 138 | 141 | 0 | 0 |-7.090618e+00 |-5.000000e+00 | 29.48%
0.39/0.41 c 0.4s| 1 | 0 | 1005 | - |6132k| 0 | 48 | 50 | 749 | 50 | 145 | 148 | 0 | 0 |-7.059820e+00 |-5.000000e+00 | 29.18%
0.39/0.41 c 0.4s| 1 | 0 | 1050 | - |6138k| 0 | 45 | 50 | 749 | 50 | 153 | 156 | 0 | 0 |-7.038743e+00 |-5.000000e+00 | 28.96%
0.39/0.42 c 0.4s| 1 | 0 | 1108 | - |6148k| 0 | 45 | 50 | 749 | 50 | 160 | 163 | 0 | 0 |-7.005530e+00 |-5.000000e+00 | 28.63%
0.39/0.42 c 0.4s| 1 | 0 | 1133 | - |6153k| 0 | 48 | 50 | 749 | 50 | 131 | 169 | 0 | 0 |-6.999162e+00 |-5.000000e+00 | 28.56%
0.39/0.43 c 0.4s| 1 | 0 | 1164 | - |6157k| 0 | 48 | 50 | 749 | 50 | 137 | 175 | 0 | 0 |-6.994607e+00 |-5.000000e+00 | 28.52%
0.39/0.44 c 0.4s| 1 | 0 | 1185 | - |6161k| 0 | 50 | 50 | 749 | 50 | 141 | 179 | 0 | 0 |-6.991788e+00 |-5.000000e+00 | 28.49%
0.39/0.44 c 0.4s| 1 | 0 | 1193 | - |6162k| 0 | 49 | 50 | 749 | 50 | 143 | 181 | 0 | 0 |-6.991417e+00 |-5.000000e+00 | 28.48%
0.39/0.45 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.45 c 0.4s| 1 | 0 | 1240 | - |6167k| 0 | 48 | 50 | 749 | 50 | 145 | 183 | 0 | 0 |-6.956051e+00 |-5.000000e+00 | 28.12%
0.39/0.45 c 0.5s| 1 | 0 | 1255 | - |6171k| 0 | 49 | 50 | 749 | 50 | 149 | 187 | 0 | 0 |-6.949618e+00 |-5.000000e+00 | 28.05%
0.39/0.46 c 0.5s| 1 | 0 | 1267 | - |6175k| 0 | 49 | 50 | 749 | 50 | 116 | 192 | 0 | 0 |-6.948863e+00 |-5.000000e+00 | 28.05%
0.39/0.47 c 0.5s| 1 | 0 | 1332 | - |6182k| 0 | 47 | 50 | 749 | 50 | 121 | 197 | 0 | 0 |-6.921772e+00 |-5.000000e+00 | 27.76%
0.39/0.47 c 0.5s| 1 | 0 | 1343 | - |6185k| 0 | 47 | 50 | 749 | 50 | 126 | 202 | 0 | 0 |-6.919714e+00 |-5.000000e+00 | 27.74%
0.39/0.48 c 0.5s| 1 | 0 | 1398 | - |6192k| 0 | 46 | 50 | 749 | 50 | 129 | 205 | 0 | 0 |-6.895399e+00 |-5.000000e+00 | 27.49%
0.39/0.48 c 0.5s| 1 | 0 | 1408 | - |6197k| 0 | 45 | 50 | 749 | 50 | 134 | 210 | 0 | 0 |-6.894403e+00 |-5.000000e+00 | 27.48%
0.39/0.48 c 0.5s| 1 | 0 | 1413 | - |6198k| 0 | 46 | 50 | 749 | 50 | 136 | 212 | 0 | 0 |-6.894329e+00 |-5.000000e+00 | 27.48%
0.39/0.49 c 0.5s| 1 | 0 | 1417 | - |6199k| 0 | 46 | 50 | 749 | 50 | 112 | 213 | 0 | 0 |-6.894263e+00 |-5.000000e+00 | 27.48%
0.39/0.49 c 0.5s| 1 | 0 | 1421 | - |6201k| 0 | 48 | 50 | 749 | 50 | 113 | 214 | 0 | 0 |-6.894249e+00 |-5.000000e+00 | 27.48%
0.59/0.61 c 0.6s| 1 | 0 | 1481 | - |6197k| 0 | 43 | 50 | 749 | 50 | 113 | 214 | 0 | 22 |-6.860848e+00 |-5.000000e+00 | 27.12%
0.59/0.62 c 0.6s| 1 | 0 | 1521 | - |6206k| 0 | 41 | 50 | 749 | 50 | 122 | 223 | 0 | 22 |-6.805970e+00 |-5.000000e+00 | 26.54%
0.59/0.64 c 0.6s| 1 | 0 | 1595 | - |6201k| 0 | 29 | 50 | 749 | 50 | 122 | 223 | 0 | 32 |-6.515152e+00 |-5.000000e+00 | 23.26%
0.59/0.65 c 0.6s| 1 | 0 | 1624 | - |6275k| 0 | 34 | 50 | 749 | 50 | 131 | 232 | 0 | 32 |-6.428372e+00 |-5.000000e+00 | 22.22%
0.59/0.65 c 0.7s| 1 | 0 | 1624 | - |6271k| 0 | - | 50 | 749 | 50 | 131 | 232 | 0 | 38 |-6.428372e+00 |-5.000000e+00 | 22.22%
0.59/0.65 c (run 1, node 1) restarting after 14 global fixings of integer variables
0.59/0.65 c
0.59/0.65 c (restart) converted 126 cuts from the global cut pool into linear constraints
0.59/0.65 c
0.59/0.66 c presolving:
0.59/0.66 c (round 1) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 0 chg coeffs, 0 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c (round 2) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 0 chg coeffs, 90 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c (round 3) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 12 chg coeffs, 90 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c (round 4) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 20 chg coeffs, 90 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c (round 5) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 25 chg coeffs, 90 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c (round 6) 14 del vars, 411 del conss, 0 add conss, 0 chg bounds, 25 chg sides, 29 chg coeffs, 90 upgd conss, 4494 impls, 105 clqs
0.59/0.66 c presolving (7 rounds):
0.59/0.66 c 14 deleted vars, 411 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 25 changed sides, 29 changed coefficients
0.59/0.66 c 4494 implications, 105 cliques
0.59/0.66 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 464 constraints
0.59/0.66 c 8 constraints of type <knapsack>
0.59/0.66 c 82 constraints of type <setppc>
0.59/0.66 c 374 constraints of type <logicor>
0.59/0.66 c transformed objective value is always integral (scale: 1)
0.59/0.66 c Presolving Time: 0.05
0.59/0.66 c
0.59/0.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.67 c 0.7s| 1 | 0 | 1801 | - |1603k| 0 | 28 | 36 | 464 | 36 | 464 | 0 | 0 | 38 |-6.385057e+00 |-5.000000e+00 | 21.69%
0.69/0.70 c 0.7s| 1 | 0 | 1821 | - |1935k| 0 | 31 | 36 | 464 | 36 | 471 | 7 | 0 | 38 |-6.328625e+00 |-5.000000e+00 | 20.99%
0.69/0.73 c 0.7s| 1 | 0 | 1845 | - |1930k| 0 | 25 | 36 | 464 | 36 | 471 | 7 | 0 | 54 |-6.231092e+00 |-5.000000e+00 | 19.76%
0.69/0.73 c 0.7s| 1 | 0 | 1845 | - |1925k| 0 | - | 36 | 464 | 36 | 471 | 7 | 0 | 60 |-6.231092e+00 |-5.000000e+00 | 19.76%
0.69/0.73 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.69/0.73 c
0.69/0.73 c (restart) converted 7 cuts from the global cut pool into linear constraints
0.69/0.73 c
0.69/0.73 c presolving:
0.69/0.73 c (round 1) 10 del vars, 192 del conss, 4 add conss, 0 chg bounds, 4 chg sides, 35 chg coeffs, 7 upgd conss, 4494 impls, 90 clqs
0.69/0.74 c (round 2) 10 del vars, 229 del conss, 4 add conss, 0 chg bounds, 4 chg sides, 45 chg coeffs, 7 upgd conss, 4494 impls, 91 clqs
0.69/0.74 c (round 3) 10 del vars, 229 del conss, 4 add conss, 0 chg bounds, 4 chg sides, 56 chg coeffs, 7 upgd conss, 4494 impls, 91 clqs
0.69/0.74 c (round 4) 10 del vars, 229 del conss, 4 add conss, 0 chg bounds, 4 chg sides, 61 chg coeffs, 7 upgd conss, 4494 impls, 91 clqs
0.69/0.74 c (round 5) 10 del vars, 229 del conss, 5 add conss, 0 chg bounds, 5 chg sides, 68 chg coeffs, 7 upgd conss, 4494 impls, 91 clqs
0.69/0.74 c presolving (6 rounds):
0.69/0.74 c 10 deleted vars, 229 deleted constraints, 5 added constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 68 changed coefficients
0.69/0.74 c 4494 implications, 91 cliques
0.69/0.74 c presolved problem has 26 variables (26 bin, 0 int, 0 impl, 0 cont) and 247 constraints
0.69/0.74 c 9 constraints of type <knapsack>
0.69/0.74 c 55 constraints of type <setppc>
0.69/0.74 c 183 constraints of type <logicor>
0.69/0.74 c transformed objective value is always integral (scale: 1)
0.69/0.74 c Presolving Time: 0.05
0.69/0.74 c
0.69/0.74 o -6
0.69/0.74 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.74 c * 0.7s| 1 | 0 | 1912 | - |1419k| 0 | - | 26 | 247 | 26 | 247 | 0 | 0 | 60 |-2.600000e+01 |-6.000000e+00 | 76.92%
0.69/0.74 c 0.7s| 1 | 0 | 1912 | - |1419k| 0 | - | 26 | 247 | 26 | 247 | 0 | 0 | 60 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.69/0.74 c
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Solving Time (sec) : 0.74
0.69/0.74 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.69/0.74 c Primal Bound : -6.00000000000000e+00 (7 solutions)
0.69/0.74 c Dual Bound : -6.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 s OPTIMUM FOUND
0.69/0.74 v -x50 -x49 x48 -x47 x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 x25 -x24
0.69/0.74 v x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Total Time : 0.74
0.69/0.74 c solving : 0.74
0.69/0.74 c presolving : 0.05 (included in solving)
0.69/0.74 c reading : 0.00 (included in solving)
0.69/0.74 c Original Problem :
0.69/0.74 c Problem name : HOME/instance-3452346-1307108721.opb
0.69/0.74 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 50 initial, 50 maximal
0.69/0.74 c Presolved Problem :
0.69/0.74 c Problem name : t_HOME/instance-3452346-1307108721.opb
0.69/0.74 c Variables : 26 (26 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 247 initial, 247 maximal
0.69/0.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.74 c trivial : 0.00 24 0 0 0 0 0 0 0 0
0.69/0.74 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.69/0.74 c knapsack : 0.01 0 0 0 0 0 0 5 5 97
0.69/0.74 c setppc : 0.00 0 0 0 0 0 38 0 0 0
0.69/0.74 c and : 0.02 0 0 0 0 0 0 0 0 0
0.69/0.74 c linear : 0.00 749 0 0 749 0 86 0 25 0
0.69/0.74 c logicor : 0.01 0 0 0 0 0 566 0 0 0
0.69/0.74 c root node : - 24 - - 24 - - - - -
0.69/0.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.69/0.74 c integral : 0 0 0 5 0 13 0 0 24 0 0 0
0.69/0.74 c knapsack : 9 1 3 0 0 0 0 0 0 0 0 0
0.69/0.74 c setppc : 55 1 3 0 0 0 0 0 0 0 0 0
0.69/0.74 c logicor : 183 40 53 0 0 8 0 0 0 0 0 0
0.69/0.74 c countsols : 0 0 0 0 0 9 0 0 0 0 0 0
0.69/0.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.69/0.74 c integral : 0.17 0.00 0.00 0.17 0.00 0.00 0.00
0.69/0.74 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.69/0.74 c vbounds : 0 0 0 0
0.69/0.74 c rootredcost : 0 0 0 0
0.69/0.74 c pseudoobj : 50 0 0 0
0.69/0.74 c Propagator Timings : TotalTime Propagate Resprop
0.69/0.74 c vbounds : 0.00 0.00 0.00
0.69/0.74 c rootredcost : 0.00 0.00 0.00
0.69/0.74 c pseudoobj : 0.00 0.00 0.00
0.69/0.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c applied globally : - - - 0 0.0 - - -
0.69/0.74 c applied locally : - - - 0 0.0 - - -
0.69/0.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.74 c redcost : 0.00 40 0 0 0 0
0.69/0.74 c impliedbounds : 0.00 40 0 0 0 0
0.69/0.74 c intobj : 0.00 0 0 0 0 0
0.69/0.74 c gomory : 0.20 40 0 0 4803 0
0.69/0.74 c cgmip : 0.00 0 0 0 0 0
0.69/0.74 c closecuts : 0.00 0 0 0 0 0
0.69/0.74 c strongcg : 0.13 21 0 0 6101 0
0.69/0.74 c cmir : 0.01 11 0 0 0 0
0.69/0.74 c flowcover : 0.02 11 0 0 0 0
0.69/0.74 c clique : 0.03 40 0 0 277 0
0.69/0.74 c zerohalf : 0.00 0 0 0 0 0
0.69/0.74 c mcf : 0.00 2 0 0 0 0
0.69/0.74 c oddcycle : 0.00 0 0 0 0 0
0.69/0.74 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.74 c Pricers : Time Calls Vars
0.69/0.74 c problem variables: 0.00 0 0
0.69/0.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.74 c relpscost : 0.17 5 0 24 0 0 0
0.69/0.74 c pscost : 0.00 0 0 0 0 0 0
0.69/0.74 c inference : 0.00 0 0 0 0 0 0
0.69/0.74 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.74 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.74 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.74 c random : 0.00 0 0 0 0 0 0
0.69/0.74 c Primal Heuristics : Time Calls Found
0.69/0.74 c LP solutions : 0.00 - 0
0.69/0.74 c pseudo solutions : 0.00 - 0
0.69/0.74 c oneopt : 0.00 2 1
0.69/0.74 c trivial : 0.00 2 1
0.69/0.74 c shiftandpropagate: 0.00 0 0
0.69/0.74 c simplerounding : 0.00 44 0
0.69/0.74 c zirounding : 0.00 1 0
0.69/0.74 c rounding : 0.00 44 1
0.69/0.74 c shifting : 0.00 44 3
0.69/0.74 c intshifting : 0.00 0 0
0.69/0.74 c twoopt : 0.00 0 0
0.69/0.74 c fixandinfer : 0.00 0 0
0.69/0.74 c feaspump : 0.00 0 0
0.69/0.74 c clique : 0.00 0 0
0.69/0.74 c coefdiving : 0.00 0 0
0.69/0.74 c pscostdiving : 0.00 0 0
0.69/0.74 c fracdiving : 0.00 0 0
0.69/0.74 c veclendiving : 0.00 0 0
0.69/0.74 c intdiving : 0.00 0 0
0.69/0.74 c actconsdiving : 0.00 0 0
0.69/0.74 c objpscostdiving : 0.00 0 0
0.69/0.74 c rootsoldiving : 0.00 0 0
0.69/0.74 c linesearchdiving : 0.00 0 0
0.69/0.74 c guideddiving : 0.00 0 0
0.69/0.74 c octane : 0.00 0 0
0.69/0.74 c rens : 0.00 0 0
0.69/0.74 c rins : 0.00 0 0
0.69/0.74 c localbranching : 0.00 0 0
0.69/0.74 c mutation : 0.00 0 0
0.69/0.74 c crossover : 0.00 0 0
0.69/0.74 c dins : 0.00 0 0
0.69/0.74 c vbounds : 0.00 0 0
0.69/0.74 c undercover : 0.00 0 0
0.69/0.74 c subnlp : 0.00 0 0
0.69/0.74 c trysol : 0.00 0 0
0.69/0.74 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.74 c primal LP : 0.00 0 0 0.00 -
0.69/0.74 c dual LP : 0.07 45 1912 42.49 28587.23
0.69/0.74 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.74 c barrier LP : 0.00 0 0 0.00 -
0.69/0.74 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.74 c strong branching : 0.17 60 5740 95.67 33807.26
0.69/0.74 c (at root node) : - 60 5740 95.67 -
0.69/0.74 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.74 c B&B Tree :
0.69/0.74 c number of runs : 3
0.69/0.74 c nodes : 1
0.69/0.74 c nodes (total) : 3
0.69/0.74 c nodes left : 0
0.69/0.74 c max depth : 0
0.69/0.74 c max depth (total): 0
0.69/0.74 c backtracks : 0 (0.0%)
0.69/0.74 c delayed cutoffs : 0
0.69/0.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.74 c avg switch length: 2.00
0.69/0.74 c switching time : 0.00
0.69/0.74 c Solution :
0.69/0.74 c Solutions found : 7 (5 improvements)
0.69/0.74 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.69/0.74 c Primal Bound : -6.00000000000000e+00 (in run 3, after 1 nodes, 0.74 seconds, depth 0, found by <relaxation>)
0.69/0.74 c Dual Bound : -6.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 c Root Dual Bound : -6.00000000000000e+00
0.69/0.74 c Root Iterations : 1912
0.69/0.75 c Time complete: 0.74.