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-2666697-1276663560.opb>
0.00/0.02 c original problem has 799 variables (799 bin, 0 int, 0 impl, 0 cont) and 799 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 o 0
0.00/0.03 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.03 c presolving:
0.19/0.21 c (round 1) 749 del vars, 50 del conss, 749 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2996 impls, 0 clqs
0.19/0.23 c presolving (2 rounds):
0.19/0.23 c 749 deleted vars, 50 deleted constraints, 749 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.23 c 4494 implications, 0 cliques
0.19/0.23 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 749 constraints
0.19/0.23 c 749 constraints of type <logicor>
0.19/0.23 c transformed objective value is always integral (scale: 1)
0.19/0.23 c Presolving Time: 0.11
0.19/0.23 c - non default parameters ----------------------------------------------------------------------
0.19/0.23 c # SCIP version 1.2.1.2
0.19/0.23 c
0.19/0.23 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.23 c conflict/interconss = 0
0.19/0.23 c
0.19/0.23 c # should binary conflicts be preferred?
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c conflict/preferbinary = TRUE
0.19/0.23 c
0.19/0.23 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.23 c constraints/agelimit = 1
0.19/0.23 c
0.19/0.23 c # should enforcement of pseudo solution be disabled?
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/disableenfops = TRUE
0.19/0.23 c
0.19/0.23 c # frequency for displaying node information lines
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.23 c display/freq = 10000
0.19/0.23 c
0.19/0.23 c # maximal time in seconds to run
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.23 c limits/time = 1799.99
0.19/0.23 c
0.19/0.23 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.23 c limits/memory = 1620
0.19/0.23 c
0.19/0.23 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.23 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.23 c lp/solvefreq = 0
0.19/0.23 c
0.19/0.23 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.19/0.23 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.23 c lp/pricing = a
0.19/0.23 c
0.19/0.23 c # should presolving try to simplify inequalities
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/linear/simplifyinequalities = TRUE
0.19/0.23 c
0.19/0.23 c # should presolving try to simplify knapsacks
0.19/0.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.23 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.23 c
0.19/0.23 c # priority of node selection rule <dfs> in standard mode
0.19/0.23 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.23 c nodeselection/dfs/stdpriority = 1000000
0.19/0.23 c
0.19/0.23 c -----------------------------------------------------------------------------------------------
0.19/0.23 c start solving
0.19/0.24 c
0.19/0.24 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.24 c t 0.1s| 1 | 0 | 50 | - |2218k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.19/0.24 o -1
0.19/0.24 c R 0.1s| 1 | 0 | 50 | - |2219k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.19/0.24 o -2
0.19/0.24 c s 0.1s| 1 | 0 | 50 | - |2220k| 0 | 50 | 50 | 749 | 50 | 749 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.19/0.26 c 0.1s| 1 | 0 | 69 | - |2225k| 0 | 43 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.150000e+01 |-2.000000e+00 | 90.70%
0.19/0.26 o -5
0.19/0.26 c b 0.1s| 1 | 0 | 69 | - |2226k| 0 | 43 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.150000e+01 |-5.000000e+00 | 76.74%
0.19/0.29 c 0.2s| 1 | 0 | 114 | - |2231k| 0 | 31 | 50 | 749 | 50 | 757 | 8 | 0 | 0 |-1.550000e+01 |-5.000000e+00 | 67.74%
0.29/0.33 c 0.2s| 1 | 0 | 169 | - |2237k| 0 | 24 | 50 | 749 | 50 | 762 | 13 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.29/0.37 c 0.2s| 1 | 0 | 219 | - |2242k| 0 | 27 | 50 | 749 | 50 | 769 | 20 | 0 | 0 |-1.000000e+01 |-5.000000e+00 | 50.00%
0.39/0.43 c 0.3s| 1 | 0 | 265 | - |2249k| 0 | 27 | 50 | 749 | 50 | 774 | 25 | 0 | 0 |-9.000000e+00 |-5.000000e+00 | 44.44%
0.39/0.48 c 0.3s| 1 | 0 | 324 | - |2255k| 0 | 29 | 50 | 749 | 50 | 781 | 32 | 0 | 0 |-8.333333e+00 |-5.000000e+00 | 40.00%
0.49/0.55 c 0.4s| 1 | 0 | 355 | - |2300k| 0 | 31 | 50 | 749 | 50 | 788 | 39 | 0 | 0 |-8.272727e+00 |-5.000000e+00 | 39.56%
0.59/0.63 c 0.5s| 1 | 0 | 415 | - |2428k| 0 | 32 | 50 | 749 | 50 | 796 | 47 | 0 | 0 |-8.018248e+00 |-5.000000e+00 | 37.64%
0.69/0.71 c 0.6s| 1 | 0 | 442 | - |2782k| 0 | 30 | 50 | 749 | 50 | 804 | 55 | 0 | 0 |-7.888889e+00 |-5.000000e+00 | 36.62%
0.69/0.80 c 0.7s| 1 | 0 | 461 | - |2978k| 0 | 26 | 50 | 749 | 50 | 811 | 62 | 0 | 0 |-7.666667e+00 |-5.000000e+00 | 34.78%
0.89/0.91 c 0.8s| 1 | 0 | 497 | - |3706k| 0 | 35 | 50 | 749 | 50 | 123 | 71 | 0 | 0 |-7.666667e+00 |-5.000000e+00 | 34.78%
0.89/0.93 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.93 c 0.8s| 1 | 0 | 573 | - |3764k| 0 | 39 | 50 | 749 | 50 | 132 | 80 | 0 | 0 |-7.584034e+00 |-5.000000e+00 | 34.07%
0.89/0.95 c 0.8s| 1 | 0 | 625 | - |3955k| 0 | 40 | 50 | 749 | 50 | 140 | 88 | 0 | 0 |-7.492243e+00 |-5.000000e+00 | 33.26%
0.89/0.97 c 0.8s| 1 | 0 | 663 | - |4172k| 0 | 42 | 50 | 749 | 50 | 146 | 94 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.99 c 0.8s| 1 | 0 | 689 | - |4264k| 0 | 41 | 50 | 749 | 50 | 152 | 100 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.02 c 0.9s| 1 | 0 | 796 | - |4300k| 0 | 43 | 50 | 749 | 50 | 159 | 107 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.04 c 0.9s| 1 | 0 | 819 | - |4521k| 0 | 46 | 50 | 749 | 50 | 123 | 117 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.06 c 0.9s| 1 | 0 | 863 | - |4709k| 0 | 42 | 50 | 749 | 50 | 130 | 124 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.08 c 0.9s| 1 | 0 | 881 | - |4852k| 0 | 49 | 50 | 749 | 50 | 138 | 132 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.54 c 1.4s| 1 | 0 | 924 | - |4849k| 0 | 42 | 50 | 749 | 50 | 138 | 132 | 0 | 33 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.56 c 1.4s| 1 | 0 | 956 | - |5040k| 0 | 38 | 50 | 749 | 50 | 142 | 136 | 0 | 33 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.59/1.66 c 1.5s| 1 | 0 | 986 | - |5036k| 0 | 36 | 50 | 749 | 50 | 142 | 136 | 0 | 43 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.59/1.68 c 1.5s| 1 | 0 | 1030 | - |5101k| 0 | 33 | 50 | 749 | 50 | 108 | 142 | 0 | 43 |-6.913043e+00 |-5.000000e+00 | 27.67%
1.59/1.68 c 1.5s| 1 | 0 | 1030 | - |5099k| 0 | - | 50 | 749 | 50 | 108 | 142 | 0 | 45 |-6.913043e+00 |-5.000000e+00 | 27.67%
1.59/1.68 c (run 1, node 1) restarting after 11 global fixings of integer variables
1.59/1.68 c
1.59/1.69 c (restart) converted 108 cuts from the global cut pool into linear constraints
1.59/1.69 c
1.59/1.69 c presolving:
1.59/1.70 c (round 1) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 0 chg coeffs, 0 upgd conss, 4494 impls, 95 clqs
1.69/1.70 c (round 2) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 0 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.71 c (round 3) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 9 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.71 c (round 4) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 13 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.72 c (round 5) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 16 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.72 c (round 6) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 17 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.72 c (round 7) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 19 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.72 c (round 8) 11 del vars, 337 del conss, 0 chg bounds, 18 chg sides, 20 chg coeffs, 88 upgd conss, 4494 impls, 95 clqs
1.69/1.73 c presolving (9 rounds):
1.69/1.73 c 11 deleted vars, 337 deleted constraints, 0 tightened bounds, 0 added holes, 18 changed sides, 20 changed coefficients
1.69/1.73 c 4494 implications, 95 cliques
1.69/1.73 c presolved problem has 39 variables (39 bin, 0 int, 0 impl, 0 cont) and 520 constraints
1.69/1.73 c 11 constraints of type <knapsack>
1.69/1.73 c 77 constraints of type <setppc>
1.69/1.73 c 432 constraints of type <logicor>
1.69/1.73 c transformed objective value is always integral (scale: 1)
1.69/1.73 c Presolving Time: 0.14
1.69/1.73 c
1.69/1.74 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.74 c 1.6s| 1 | 0 | 1155 | - |2154k| 0 | 30 | 39 | 520 | 39 | 520 | 0 | 0 | 45 |-6.877211e+00 |-5.000000e+00 | 27.30%
1.79/1.81 c 1.6s| 1 | 0 | 1178 | - |2360k| 0 | 30 | 39 | 520 | 39 | 525 | 5 | 0 | 45 |-6.727775e+00 |-5.000000e+00 | 25.68%
1.79/1.89 c 1.7s| 1 | 0 | 1199 | - |2356k| 0 | 27 | 39 | 520 | 39 | 525 | 5 | 0 | 54 |-6.628717e+00 |-5.000000e+00 | 24.57%
1.89/1.95 c 1.8s| 1 | 0 | 1199 | - |2351k| 0 | - | 39 | 520 | 39 | 525 | 5 | 0 | 65 |-6.628717e+00 |-5.000000e+00 | 24.57%
1.89/1.95 c (run 2, node 1) restarting after 10 global fixings of integer variables
1.89/1.95 c
1.89/1.95 c (restart) converted 5 cuts from the global cut pool into linear constraints
1.89/1.95 c
1.89/1.96 c presolving:
1.89/1.96 c (round 1) 10 del vars, 220 del conss, 0 chg bounds, 3 chg sides, 36 chg coeffs, 5 upgd conss, 4494 impls, 76 clqs
1.89/1.97 c (round 2) 10 del vars, 223 del conss, 0 chg bounds, 3 chg sides, 54 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.89/1.98 c (round 3) 10 del vars, 223 del conss, 0 chg bounds, 3 chg sides, 68 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.89/1.98 c (round 4) 10 del vars, 223 del conss, 0 chg bounds, 3 chg sides, 76 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.89/1.98 c (round 5) 10 del vars, 223 del conss, 0 chg bounds, 3 chg sides, 80 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.89/1.98 c (round 6) 10 del vars, 223 del conss, 0 chg bounds, 3 chg sides, 82 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.89/1.99 c presolving (7 rounds):
1.89/1.99 c 10 deleted vars, 223 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 82 changed coefficients
1.89/1.99 c 4494 implications, 77 cliques
1.89/1.99 c presolved problem has 29 variables (29 bin, 0 int, 0 impl, 0 cont) and 305 constraints
1.89/1.99 c 12 constraints of type <knapsack>
1.89/1.99 c 61 constraints of type <setppc>
1.89/1.99 c 232 constraints of type <logicor>
1.89/1.99 c transformed objective value is always integral (scale: 1)
1.89/1.99 c Presolving Time: 0.16
1.89/1.99 c
1.89/1.99 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.99 c 1.8s| 1 | 0 | 1290 | - |2002k| 0 | 19 | 29 | 305 | 29 | 305 | 0 | 0 | 65 |-6.428571e+00 |-5.000000e+00 | 22.22%
1.99/2.03 c 1.8s| 1 | 0 | 1298 | - |2018k| 0 | 17 | 29 | 305 | 29 | 269 | 4 | 0 | 65 |-6.285714e+00 |-5.000000e+00 | 20.45%
1.99/2.04 c 1.8s| 1 | 0 | 1302 | - |2017k| 0 | 15 | 29 | 305 | 29 | 269 | 4 | 0 | 82 |-6.250000e+00 |-5.000000e+00 | 20.00%
1.99/2.05 c 1.8s| 1 | 2 | 1302 | - |2017k| 0 | 15 | 29 | 305 | 29 | 269 | 4 | 0 | 83 |-6.250000e+00 |-5.000000e+00 | 20.00%
1.99/2.05 c (run 3, node 1) restarting after 4 global fixings of integer variables
1.99/2.05 c
1.99/2.05 c (restart) converted 3 cuts from the global cut pool into linear constraints
1.99/2.05 c
1.99/2.05 c presolving:
1.99/2.06 c (round 1) 4 del vars, 76 del conss, 0 chg bounds, 1 chg sides, 22 chg coeffs, 3 upgd conss, 4494 impls, 72 clqs
1.99/2.06 c (round 2) 4 del vars, 79 del conss, 0 chg bounds, 1 chg sides, 39 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.07 c (round 3) 4 del vars, 79 del conss, 0 chg bounds, 1 chg sides, 56 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.07 c (round 4) 4 del vars, 80 del conss, 0 chg bounds, 2 chg sides, 77 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.07 c (round 5) 4 del vars, 80 del conss, 0 chg bounds, 3 chg sides, 113 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.08 c (round 6) 4 del vars, 80 del conss, 0 chg bounds, 3 chg sides, 119 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.08 c (round 7) 4 del vars, 80 del conss, 0 chg bounds, 3 chg sides, 123 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.08 c (round 8) 4 del vars, 80 del conss, 0 chg bounds, 3 chg sides, 125 chg coeffs, 3 upgd conss, 4494 impls, 73 clqs
1.99/2.08 c presolving (9 rounds):
1.99/2.08 c 4 deleted vars, 80 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 125 changed coefficients
1.99/2.08 c 4494 implications, 73 cliques
1.99/2.08 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 230 constraints
1.99/2.08 c 12 constraints of type <knapsack>
1.99/2.08 c 53 constraints of type <setppc>
1.99/2.08 c 165 constraints of type <logicor>
1.99/2.08 c transformed objective value is always integral (scale: 1)
1.99/2.08 c Presolving Time: 0.18
1.99/2.08 c
1.99/2.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.09 c 1.9s| 1 | 0 | 1386 | - |1946k| 0 | 15 | 25 | 230 | 25 | 230 | 0 | 0 | 83 |-6.250000e+00 |-5.000000e+00 | 20.00%
1.99/2.09 o -6
1.99/2.09 c R 1.9s| 1 | 0 | 1386 | - |1947k| 0 | - | 25 | 230 | 25 | 230 | 0 | 0 | 83 |-6.250000e+00 |-6.000000e+00 | 4.00%
1.99/2.09 c 1.9s| 1 | 0 | 1386 | - |1947k| 0 | - | 25 | 230 | 25 | 230 | 0 | 0 | 83 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.99/2.09 c
1.99/2.09 c SCIP Status : problem is solved [optimal solution found]
1.99/2.09 c Solving Time (sec) : 1.86
1.99/2.09 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
1.99/2.09 c Primal Bound : -6.00000000000000e+00 (10 solutions)
1.99/2.09 c Dual Bound : -6.00000000000000e+00
1.99/2.09 c Gap : 0.00 %
1.99/2.09 s OPTIMUM FOUND
1.99/2.09 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
1.99/2.09 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.99/2.09 c SCIP Status : problem is solved [optimal solution found]
1.99/2.09 c Solving Time : 1.86
1.99/2.09 c Original Problem :
1.99/2.09 c Problem name : HOME/instance-2666697-1276663560.opb
1.99/2.09 c Variables : 799 (799 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09 c Constraints : 799 initial, 799 maximal
1.99/2.09 c Presolved Problem :
1.99/2.09 c Problem name : t_HOME/instance-2666697-1276663560.opb
1.99/2.09 c Variables : 25 (25 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09 c Constraints : 230 initial, 230 maximal
1.99/2.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.99/2.09 c trivial : 0.00 25 0 0 0 0 0 0 0
1.99/2.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c implics : 0.00 0 0 0 0 0 0 0 0
1.99/2.09 c probing : 0.01 0 0 0 0 0 0 0 0
1.99/2.09 c knapsack : 0.04 0 0 0 0 0 0 6 227
1.99/2.09 c setppc : 0.00 0 0 0 0 0 35 0 0
1.99/2.09 c linear : 0.02 749 0 0 749 0 70 18 0
1.99/2.09 c logicor : 0.02 0 0 0 0 0 585 0 0
1.99/2.09 c root node : - 25 - - 25 - - - -
1.99/2.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.99/2.09 c integral : 0 0 0 7 0 0 23 0 0 2
1.99/2.09 c knapsack : 12 2 6 0 0 0 0 0 0 0
1.99/2.09 c setppc : 53 2 6 0 0 0 0 0 0 0
1.99/2.09 c logicor : 165 23 104 0 0 0 0 0 0 0
1.99/2.09 c countsols : 0 0 0 0 0 0 0 0 0 0
1.99/2.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.99/2.09 c integral : 0.70 0.00 0.00 0.70 0.00
1.99/2.09 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c setppc : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c logicor : 0.01 0.01 0.00 0.00 0.00
1.99/2.09 c countsols : 0.00 0.00 0.00 0.00 0.00
1.99/2.09 c Propagators : Time Calls Cutoffs DomReds
1.99/2.09 c vbounds : 0.00 5 0 0
1.99/2.09 c rootredcost : 0.00 0 0 0
1.99/2.09 c pseudoobj : 0.00 31 0 0
1.99/2.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.09 c applied globally : - - - 0 0.0 - - -
1.99/2.09 c applied locally : - - - 0 0.0 - - -
1.99/2.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.99/2.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.99/2.09 c redcost : 0.00 23 0 2 0 0
1.99/2.09 c impliedbounds : 0.00 23 0 0 0 0
1.99/2.09 c intobj : 0.00 0 0 0 0 0
1.99/2.09 c cgmip : 0.00 0 0 0 0 0
1.99/2.09 c gomory : 0.40 23 0 0 4770 0
1.99/2.09 c strongcg : 0.31 22 0 0 5909 0
1.99/2.09 c cmir : 0.05 12 0 0 0 0
1.99/2.09 c flowcover : 0.03 12 0 0 0 0
1.99/2.09 c clique : 0.03 23 0 0 186 0
1.99/2.09 c zerohalf : 0.00 0 0 0 0 0
1.99/2.09 c mcf : 0.00 3 0 0 0 0
1.99/2.09 c rapidlearning : 0.00 0 0 0 0 0
1.99/2.09 c Pricers : Time Calls Vars
1.99/2.09 c problem variables: 0.00 0 0
1.99/2.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.99/2.09 c relpscost : 0.70 7 0 23 0 0 2
1.99/2.09 c pscost : 0.00 0 0 0 0 0 0
1.99/2.09 c inference : 0.00 0 0 0 0 0 0
1.99/2.09 c mostinf : 0.00 0 0 0 0 0 0
1.99/2.09 c leastinf : 0.00 0 0 0 0 0 0
1.99/2.09 c fullstrong : 0.00 0 0 0 0 0 0
1.99/2.09 c allfullstrong : 0.00 0 0 0 0 0 0
1.99/2.09 c random : 0.00 0 0 0 0 0 0
1.99/2.09 c Primal Heuristics : Time Calls Found
1.99/2.09 c LP solutions : 0.00 - 0
1.99/2.09 c pseudo solutions : 0.00 - 0
1.99/2.09 c feaspump : 0.00 0 0
1.99/2.09 c oneopt : 0.00 2 1
1.99/2.09 c trivial : 0.00 2 2
1.99/2.09 c simplerounding : 0.00 31 3
1.99/2.09 c zirounding : 0.00 1 1
1.99/2.09 c rounding : 0.00 31 2
1.99/2.09 c shifting : 0.00 30 1
1.99/2.09 c intshifting : 0.00 0 0
1.99/2.09 c twoopt : 0.00 0 0
1.99/2.09 c fixandinfer : 0.00 0 0
1.99/2.09 c coefdiving : 0.00 0 0
1.99/2.09 c pscostdiving : 0.00 0 0
1.99/2.09 c fracdiving : 0.00 0 0
1.99/2.09 c veclendiving : 0.00 0 0
1.99/2.09 c intdiving : 0.00 0 0
1.99/2.09 c actconsdiving : 0.00 0 0
1.99/2.09 c objpscostdiving : 0.00 0 0
1.99/2.09 c rootsoldiving : 0.00 0 0
1.99/2.09 c linesearchdiving : 0.00 0 0
1.99/2.09 c guideddiving : 0.00 0 0
1.99/2.09 c octane : 0.00 0 0
1.99/2.09 c rens : 0.00 0 0
1.99/2.09 c rins : 0.00 0 0
1.99/2.09 c localbranching : 0.00 0 0
1.99/2.09 c mutation : 0.00 0 0
1.99/2.09 c crossover : 0.00 0 0
1.99/2.09 c dins : 0.00 0 0
1.99/2.09 c undercover : 0.00 0 0
1.99/2.09 c nlp : 0.00 0 0
1.99/2.09 c trysol : 0.00 0 0
1.99/2.09 c LP : Time Calls Iterations Iter/call Iter/sec
1.99/2.09 c primal LP : 0.00 0 0 0.00 -
1.99/2.09 c dual LP : 0.13 31 1386 44.71 10661.54
1.99/2.09 c lex dual LP : 0.00 0 0 0.00 -
1.99/2.09 c barrier LP : 0.00 0 0 0.00 -
1.99/2.09 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.09 c strong branching : 0.70 83 6412 77.25 9160.00
1.99/2.09 c (at root node) : - 83 6412 77.25 -
1.99/2.09 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.09 c B&B Tree :
1.99/2.09 c number of runs : 4
1.99/2.09 c nodes : 1
1.99/2.09 c nodes (total) : 4
1.99/2.09 c nodes left : 0
1.99/2.09 c max depth : 0
1.99/2.09 c max depth (total): 0
1.99/2.09 c backtracks : 0 (0.0%)
1.99/2.09 c delayed cutoffs : 0
1.99/2.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.99/2.09 c avg switch length: 2.00
1.99/2.09 c switching time : 0.00
1.99/2.09 c Solution :
1.99/2.09 c Solutions found : 10 (5 improvements)
1.99/2.09 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.99/2.09 c Primal Bound : -6.00000000000000e+00 (in run 4, after 1 nodes, 1.86 seconds, depth 0, found by <rounding>)
1.99/2.09 c Dual Bound : -6.00000000000000e+00
1.99/2.09 c Gap : 0.00 %
1.99/2.09 c Root Dual Bound : -6.00000000000000e+00
1.99/2.09 c Root Iterations : 1386
2.09/2.10 c Time complete: 2.09.