0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703259-1278569478.opb>
0.00/0.02 c original problem has 790 variables (790 bin, 0 int, 0 impl, 0 cont) and 790 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 o 0
0.00/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.02 c presolving:
0.07/0.09 c (round 1) 740 del vars, 50 del conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2960 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 740 deleted vars, 50 deleted constraints, 740 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 4440 implications, 0 cliques
0.09/0.11 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 740 constraints
0.09/0.11 c 740 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.99
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 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.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.12 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.12 c t 0.1s| 1 | 0 | 50 | - |2198k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.09/0.12 o -1
0.09/0.12 c R 0.1s| 1 | 0 | 50 | - |2199k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.09/0.12 o -2
0.09/0.12 c s 0.1s| 1 | 0 | 50 | - |2199k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.09/0.14 c 0.1s| 1 | 0 | 80 | - |2205k| 0 | 41 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.050000e+01 |-2.000000e+00 | 90.24%
0.09/0.14 o -4
0.09/0.14 c b 0.1s| 1 | 0 | 80 | - |2206k| 0 | 41 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.050000e+01 |-4.000000e+00 | 80.49%
0.09/0.17 c 0.2s| 1 | 0 | 142 | - |2211k| 0 | 31 | 50 | 740 | 50 | 749 | 9 | 0 | 0 |-1.550000e+01 |-4.000000e+00 | 74.19%
0.19/0.21 c 0.2s| 1 | 0 | 183 | - |2215k| 0 | 27 | 50 | 740 | 50 | 754 | 14 | 0 | 0 |-1.350000e+01 |-4.000000e+00 | 70.37%
0.19/0.25 c 0.2s| 1 | 0 | 208 | - |2220k| 0 | 25 | 50 | 740 | 50 | 760 | 20 | 0 | 0 |-1.250000e+01 |-4.000000e+00 | 68.00%
0.19/0.29 c 0.3s| 1 | 0 | 272 | - |2228k| 0 | 25 | 50 | 740 | 50 | 772 | 32 | 0 | 0 |-1.037500e+01 |-4.000000e+00 | 61.45%
0.30/0.35 c 0.3s| 1 | 0 | 322 | - |2245k| 0 | 30 | 50 | 740 | 50 | 778 | 38 | 0 | 0 |-9.487805e+00 |-4.000000e+00 | 57.84%
0.39/0.44 c 0.4s| 1 | 0 | 362 | - |2399k| 0 | 33 | 50 | 740 | 50 | 785 | 45 | 0 | 0 |-8.653846e+00 |-4.000000e+00 | 53.78%
0.49/0.52 c 0.5s| 1 | 0 | 403 | - |2491k| 0 | 33 | 50 | 740 | 50 | 792 | 52 | 0 | 0 |-8.224242e+00 |-4.000000e+00 | 51.36%
0.59/0.61 c 0.6s| 1 | 0 | 418 | - |2763k| 0 | 35 | 50 | 740 | 50 | 797 | 57 | 0 | 0 |-8.147940e+00 |-4.000000e+00 | 50.91%
0.69/0.72 c 0.7s| 1 | 0 | 465 | - |3239k| 0 | 34 | 50 | 740 | 50 | 805 | 65 | 0 | 0 |-7.974344e+00 |-4.000000e+00 | 49.84%
0.69/0.72 o -5
0.69/0.72 c R 0.7s| 1 | 0 | 465 | - |3240k| 0 | 34 | 50 | 740 | 50 | 805 | 65 | 0 | 0 |-7.974344e+00 |-5.000000e+00 | 37.30%
0.79/0.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.81 c 0.8s| 1 | 0 | 501 | - |3430k| 0 | 38 | 50 | 740 | 50 | 132 | 75 | 0 | 0 |-7.804898e+00 |-5.000000e+00 | 35.94%
0.79/0.84 c 0.8s| 1 | 0 | 570 | - |3673k| 0 | 41 | 50 | 740 | 50 | 142 | 85 | 0 | 0 |-7.627925e+00 |-5.000000e+00 | 34.45%
0.79/0.87 c 0.8s| 1 | 0 | 587 | - |3925k| 0 | 41 | 50 | 740 | 50 | 148 | 91 | 0 | 0 |-7.572111e+00 |-5.000000e+00 | 33.97%
0.79/0.89 c 0.9s| 1 | 0 | 621 | - |4034k| 0 | 43 | 50 | 740 | 50 | 155 | 98 | 0 | 0 |-7.474273e+00 |-5.000000e+00 | 33.10%
0.90/0.91 c 0.9s| 1 | 0 | 671 | - |4264k| 0 | 40 | 50 | 740 | 50 | 160 | 103 | 0 | 0 |-7.372570e+00 |-5.000000e+00 | 32.18%
0.90/0.94 c 0.9s| 1 | 0 | 699 | - |4512k| 0 | 41 | 50 | 740 | 50 | 167 | 110 | 0 | 0 |-7.323572e+00 |-5.000000e+00 | 31.73%
0.90/0.97 c 0.9s| 1 | 0 | 733 | - |4747k| 0 | 44 | 50 | 740 | 50 | 117 | 118 | 0 | 0 |-7.266235e+00 |-5.000000e+00 | 31.19%
0.90/0.99 c 1.0s| 1 | 0 | 776 | - |4913k| 0 | 40 | 50 | 740 | 50 | 124 | 125 | 0 | 0 |-7.172986e+00 |-5.000000e+00 | 30.29%
1.00/1.01 c 1.0s| 1 | 0 | 830 | - |5091k| 0 | 45 | 50 | 740 | 50 | 130 | 131 | 0 | 0 |-7.100288e+00 |-5.000000e+00 | 29.58%
1.00/1.03 c 1.0s| 1 | 0 | 862 | - |5270k| 0 | 45 | 50 | 740 | 50 | 137 | 138 | 0 | 0 |-7.072310e+00 |-5.000000e+00 | 29.30%
1.00/1.05 c 1.0s| 1 | 0 | 904 | - |5275k| 0 | 44 | 50 | 740 | 50 | 143 | 144 | 0 | 0 |-7.049175e+00 |-5.000000e+00 | 29.07%
1.00/1.06 c 1.0s| 1 | 0 | 942 | - |5283k| 0 | 42 | 50 | 740 | 50 | 149 | 150 | 0 | 0 |-7.035114e+00 |-5.000000e+00 | 28.93%
1.00/1.07 c 1.1s| 1 | 0 | 964 | - |5288k| 0 | 42 | 50 | 740 | 50 | 123 | 156 | 0 | 0 |-7.031569e+00 |-5.000000e+00 | 28.89%
1.00/1.09 c 1.1s| 1 | 0 | 1006 | - |5298k| 0 | 44 | 50 | 740 | 50 | 126 | 159 | 0 | 0 |-7.007270e+00 |-5.000000e+00 | 28.65%
1.00/1.10 c 1.1s| 1 | 0 | 1035 | - |5304k| 0 | 45 | 50 | 740 | 50 | 133 | 166 | 0 | 0 |-6.998833e+00 |-5.000000e+00 | 28.56%
1.10/1.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.11 c 1.1s| 1 | 0 | 1077 | - |5311k| 0 | 44 | 50 | 740 | 50 | 141 | 174 | 0 | 0 |-6.971128e+00 |-5.000000e+00 | 28.28%
1.10/1.13 c 1.1s| 1 | 0 | 1109 | - |5316k| 0 | 42 | 50 | 740 | 50 | 147 | 180 | 0 | 0 |-6.966224e+00 |-5.000000e+00 | 28.23%
1.10/1.14 c 1.1s| 1 | 0 | 1123 | - |5319k| 0 | 44 | 50 | 740 | 50 | 156 | 189 | 0 | 0 |-6.964976e+00 |-5.000000e+00 | 28.21%
1.10/1.15 c 1.1s| 1 | 0 | 1145 | - |5321k| 0 | 44 | 50 | 740 | 50 | 134 | 193 | 0 | 0 |-6.964471e+00 |-5.000000e+00 | 28.21%
1.10/1.16 c 1.1s| 1 | 0 | 1156 | - |5323k| 0 | 44 | 50 | 740 | 50 | 136 | 195 | 0 | 0 |-6.964127e+00 |-5.000000e+00 | 28.20%
1.39/1.49 c 1.5s| 1 | 0 | 1228 | - |5319k| 0 | 38 | 50 | 740 | 50 | 136 | 195 | 0 | 24 |-6.844858e+00 |-5.000000e+00 | 26.95%
1.49/1.51 c 1.5s| 1 | 0 | 1297 | - |5461k| 0 | 39 | 50 | 740 | 50 | 144 | 203 | 0 | 24 |-6.718975e+00 |-5.000000e+00 | 25.58%
1.49/1.58 c 1.6s| 1 | 0 | 1333 | - |5456k| 0 | 31 | 50 | 740 | 50 | 144 | 203 | 0 | 34 |-6.672324e+00 |-5.000000e+00 | 25.06%
1.59/1.60 c 1.6s| 1 | 0 | 1372 | - |5469k| 0 | 29 | 50 | 740 | 50 | 150 | 209 | 0 | 34 |-6.588946e+00 |-5.000000e+00 | 24.12%
1.59/1.63 c 1.6s| 1 | 0 | 1372 | - |5465k| 0 | - | 50 | 740 | 50 | 150 | 209 | 0 | 40 |-6.588946e+00 |-5.000000e+00 | 24.12%
1.59/1.63 c (run 1, node 1) restarting after 14 global fixings of integer variables
1.59/1.63 c
1.59/1.63 c (restart) converted 148 cuts from the global cut pool into linear constraints
1.59/1.63 c
1.59/1.64 c presolving:
1.59/1.64 c (round 1) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 0 upgd conss, 4440 impls, 129 clqs
1.59/1.65 c (round 2) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 0 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.65 c (round 3) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 13 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.65 c (round 4) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 28 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.66 c (round 5) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 33 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.66 c (round 6) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 35 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.66 c (round 7) 14 del vars, 414 del conss, 0 chg bounds, 35 chg sides, 36 chg coeffs, 103 upgd conss, 4440 impls, 129 clqs
1.59/1.66 c presolving (8 rounds):
1.59/1.66 c 14 deleted vars, 414 deleted constraints, 0 tightened bounds, 0 added holes, 35 changed sides, 36 changed coefficients
1.59/1.66 c 4440 implications, 129 cliques
1.59/1.66 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 474 constraints
1.59/1.66 c 9 constraints of type <knapsack>
1.59/1.66 c 94 constraints of type <setppc>
1.59/1.66 c 371 constraints of type <logicor>
1.59/1.66 c transformed objective value is always integral (scale: 1)
1.59/1.66 c Presolving Time: 0.12
1.59/1.66 c
1.59/1.68 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.68 c 1.7s| 1 | 0 | 1526 | - |2111k| 0 | 25 | 36 | 474 | 36 | 474 | 0 | 0 | 40 |-6.581594e+00 |-5.000000e+00 | 24.03%
1.69/1.74 c 1.7s| 1 | 0 | 1598 | - |2123k| 0 | 28 | 36 | 474 | 36 | 420 | 3 | 0 | 40 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.89/1.91 c 1.9s| 1 | 0 | 1620 | - |2118k| 0 | 12 | 36 | 474 | 36 | 420 | 3 | 0 | 64 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.89/1.91 c 1.9s| 1 | 2 | 1620 | - |2118k| 0 | 12 | 36 | 474 | 36 | 420 | 3 | 0 | 64 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.89/1.91 c (run 2, node 1) restarting after 7 global fixings of integer variables
1.89/1.91 c
1.89/1.91 c (restart) converted 2 cuts from the global cut pool into linear constraints
1.89/1.91 c
1.89/1.91 c presolving:
1.89/1.92 c (round 1) 7 del vars, 183 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 2 upgd conss, 4440 impls, 112 clqs
1.89/1.92 c (round 2) 7 del vars, 183 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 2 upgd conss, 4440 impls, 112 clqs
1.89/1.92 c (round 3) 7 del vars, 183 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 2 upgd conss, 4440 impls, 112 clqs
1.89/1.93 c (round 4) 7 del vars, 183 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 2 upgd conss, 4440 impls, 112 clqs
1.89/1.93 c presolving (5 rounds):
1.89/1.93 c 7 deleted vars, 183 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 46 changed coefficients
1.89/1.93 c 4440 implications, 112 cliques
1.89/1.93 c presolved problem has 29 variables (29 bin, 0 int, 0 impl, 0 cont) and 293 constraints
1.89/1.93 c 10 constraints of type <knapsack>
1.89/1.93 c 65 constraints of type <setppc>
1.89/1.93 c 218 constraints of type <logicor>
1.89/1.93 c transformed objective value is always integral (scale: 1)
1.89/1.93 c Presolving Time: 0.13
1.89/1.93 c
1.89/1.94 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.94 c 1.9s| 1 | 0 | 1754 | - |1982k| 0 | 26 | 29 | 293 | 29 | 293 | 0 | 0 | 64 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.89/1.98 c 2.0s| 1 | 0 | 1761 | - |2060k| 0 | 27 | 29 | 293 | 29 | 296 | 3 | 0 | 64 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.00/2.09 c 2.1s| 1 | 0 | 1783 | - |2056k| 0 | 12 | 29 | 293 | 29 | 296 | 3 | 0 | 91 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.00/2.09 c 2.1s| 1 | 2 | 1783 | - |2057k| 0 | 12 | 29 | 293 | 29 | 296 | 3 | 0 | 91 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.00/2.09 c (run 3, node 1) restarting after 4 global fixings of integer variables
2.00/2.09 c
2.00/2.09 c presolving:
2.00/2.09 c (round 1) 4 del vars, 83 del conss, 0 chg bounds, 2 chg sides, 12 chg coeffs, 0 upgd conss, 4440 impls, 87 clqs
2.00/2.09 c (round 2) 4 del vars, 83 del conss, 0 chg bounds, 2 chg sides, 14 chg coeffs, 0 upgd conss, 4440 impls, 87 clqs
2.00/2.10 c presolving (3 rounds):
2.00/2.10 c 4 deleted vars, 83 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 14 changed coefficients
2.00/2.10 c 4440 implications, 87 cliques
2.00/2.10 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 212 constraints
2.00/2.10 c 10 constraints of type <knapsack>
2.00/2.10 c 57 constraints of type <setppc>
2.00/2.10 c 145 constraints of type <logicor>
2.00/2.10 c transformed objective value is always integral (scale: 1)
2.00/2.10 c Presolving Time: 0.14
2.00/2.10 c
2.10/2.10 o -6
2.10/2.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.10 c * 2.1s| 1 | 0 | 1898 | - |1920k| 0 | - | 25 | 212 | 25 | 212 | 0 | 0 | 91 |-2.500000e+01 |-6.000000e+00 | 76.00%
2.10/2.10 c 2.1s| 1 | 0 | 1898 | - |1920k| 0 | - | 25 | 212 | 25 | 212 | 0 | 0 | 91 |-6.000000e+00 |-6.000000e+00 | 0.00%
2.10/2.10 c
2.10/2.10 c SCIP Status : problem is solved [optimal solution found]
2.10/2.10 c Solving Time (sec) : 2.09
2.10/2.10 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
2.10/2.10 c Primal Bound : -6.00000000000000e+00 (13 solutions)
2.10/2.10 c Dual Bound : -6.00000000000000e+00
2.10/2.10 c Gap : 0.00 %
2.10/2.10 s OPTIMUM FOUND
2.10/2.10 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
2.10/2.10 v -x24 x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
2.10/2.10 c SCIP Status : problem is solved [optimal solution found]
2.10/2.10 c Solving Time : 2.09
2.10/2.10 c Original Problem :
2.10/2.10 c Problem name : HOME/instance-2703259-1278569478.opb
2.10/2.10 c Variables : 790 (790 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.10 c Constraints : 790 initial, 790 maximal
2.10/2.10 c Presolved Problem :
2.10/2.10 c Problem name : t_HOME/instance-2703259-1278569478.opb
2.10/2.10 c Variables : 25 (25 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.10 c Constraints : 212 initial, 212 maximal
2.10/2.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.10/2.10 c trivial : 0.00 25 0 0 0 0 0 0 0
2.10/2.10 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.10/2.10 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.10/2.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.10/2.10 c implics : 0.00 0 0 0 0 0 0 0 0
2.10/2.10 c probing : 0.01 0 0 0 0 0 0 0 0
2.10/2.10 c knapsack : 0.03 0 0 0 0 0 0 2 96
2.10/2.10 c setppc : 0.01 0 0 0 0 0 40 0 0
2.10/2.10 c linear : 0.01 740 0 0 740 0 95 35 0
2.10/2.10 c logicor : 0.01 0 0 0 0 0 595 0 0
2.10/2.10 c root node : - 25 - - 25 - - - -
2.10/2.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.10/2.10 c integral : 0 0 0 7 0 0 23 0 0 4
2.10/2.10 c knapsack : 10 2 6 0 0 0 0 0 0 0
2.10/2.10 c setppc : 57 2 6 0 0 0 0 0 0 0
2.10/2.10 c logicor : 145 35 104 0 0 0 0 0 0 0
2.10/2.10 c countsols : 0 0 0 0 0 0 0 0 0 0
2.10/2.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.10/2.10 c integral : 0.67 0.00 0.00 0.67 0.00
2.10/2.10 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.10/2.10 c setppc : 0.00 0.00 0.00 0.00 0.00
2.10/2.10 c logicor : 0.01 0.01 0.00 0.00 0.00
2.10/2.10 c countsols : 0.00 0.00 0.00 0.00 0.00
2.10/2.10 c Propagators : Time Calls Cutoffs DomReds
2.10/2.10 c vbounds : 0.00 5 0 0
2.10/2.10 c rootredcost : 0.00 0 0 0
2.10/2.10 c pseudoobj : 0.00 47 0 0
2.10/2.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.10/2.10 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.10 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.10 c applied globally : - - - 0 0.0 - - -
2.10/2.10 c applied locally : - - - 0 0.0 - - -
2.10/2.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.10/2.10 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.10/2.10 c redcost : 0.00 35 0 2 0 0
2.10/2.10 c impliedbounds : 0.00 35 0 0 0 0
2.10/2.10 c intobj : 0.00 0 0 0 0 0
2.10/2.10 c cgmip : 0.00 0 0 0 0 0
2.10/2.10 c gomory : 0.48 35 0 0 4336 0
2.10/2.10 c strongcg : 0.34 22 0 0 5667 0
2.10/2.11 c cmir : 0.04 12 0 0 0 0
2.10/2.11 c flowcover : 0.07 12 0 0 0 0
2.10/2.11 c clique : 0.04 35 0 0 264 0
2.10/2.11 c zerohalf : 0.00 0 0 0 0 0
2.10/2.11 c mcf : 0.00 3 0 0 0 0
2.10/2.11 c rapidlearning : 0.00 0 0 0 0 0
2.10/2.11 c Pricers : Time Calls Vars
2.10/2.11 c problem variables: 0.00 0 0
2.10/2.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.10/2.11 c relpscost : 0.67 7 0 23 0 0 4
2.10/2.11 c pscost : 0.00 0 0 0 0 0 0
2.10/2.11 c inference : 0.00 0 0 0 0 0 0
2.10/2.11 c mostinf : 0.00 0 0 0 0 0 0
2.10/2.11 c leastinf : 0.00 0 0 0 0 0 0
2.10/2.11 c fullstrong : 0.00 0 0 0 0 0 0
2.10/2.11 c allfullstrong : 0.00 0 0 0 0 0 0
2.10/2.11 c random : 0.00 0 0 0 0 0 0
2.10/2.11 c Primal Heuristics : Time Calls Found
2.10/2.11 c LP solutions : 0.00 - 0
2.10/2.11 c pseudo solutions : 0.00 - 0
2.10/2.11 c oneopt : 0.00 3 1
2.10/2.11 c trivial : 0.00 2 2
2.10/2.11 c simplerounding : 0.00 41 2
2.10/2.11 c zirounding : 0.00 1 1
2.10/2.11 c rounding : 0.01 41 2
2.10/2.11 c shifting : 0.01 41 4
2.10/2.11 c intshifting : 0.00 0 0
2.10/2.11 c twoopt : 0.00 0 0
2.10/2.11 c fixandinfer : 0.00 0 0
2.10/2.11 c feaspump : 0.00 0 0
2.10/2.11 c coefdiving : 0.00 0 0
2.10/2.11 c pscostdiving : 0.00 0 0
2.10/2.11 c fracdiving : 0.00 0 0
2.10/2.11 c veclendiving : 0.00 0 0
2.10/2.11 c intdiving : 0.00 0 0
2.10/2.11 c actconsdiving : 0.00 0 0
2.10/2.11 c objpscostdiving : 0.00 0 0
2.10/2.11 c rootsoldiving : 0.00 0 0
2.10/2.11 c linesearchdiving : 0.00 0 0
2.10/2.11 c guideddiving : 0.00 0 0
2.10/2.11 c octane : 0.00 0 0
2.10/2.11 c rens : 0.01 0 0
2.10/2.11 c rins : 0.00 0 0
2.10/2.11 c localbranching : 0.00 0 0
2.10/2.11 c mutation : 0.00 0 0
2.10/2.11 c crossover : 0.00 0 0
2.10/2.11 c dins : 0.00 0 0
2.10/2.11 c undercover : 0.00 0 0
2.10/2.11 c nlp : 0.00 0 0
2.10/2.11 c trysol : 0.00 0 0
2.10/2.11 c LP : Time Calls Iterations Iter/call Iter/sec
2.10/2.11 c primal LP : 0.00 0 0 0.00 -
2.10/2.11 c dual LP : 0.18 42 1898 45.19 10428.63
2.10/2.11 c lex dual LP : 0.00 0 0 0.00 -
2.10/2.11 c barrier LP : 0.00 0 0 0.00 -
2.10/2.11 c diving/probing LP: 0.00 0 0 0.00 -
2.10/2.11 c strong branching : 0.67 91 6995 76.87 10440.49
2.10/2.11 c (at root node) : - 91 6995 76.87 -
2.10/2.11 c conflict analysis: 0.00 0 0 0.00 -
2.10/2.11 c B&B Tree :
2.10/2.11 c number of runs : 4
2.10/2.11 c nodes : 1
2.10/2.11 c nodes (total) : 4
2.10/2.11 c nodes left : 0
2.10/2.11 c max depth : 0
2.10/2.11 c max depth (total): 0
2.10/2.11 c backtracks : 0 (0.0%)
2.10/2.11 c delayed cutoffs : 0
2.10/2.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.10/2.11 c avg switch length: 2.00
2.10/2.11 c switching time : 0.00
2.10/2.11 c Solution :
2.10/2.11 c Solutions found : 13 (6 improvements)
2.10/2.11 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
2.10/2.11 c Primal Bound : -6.00000000000000e+00 (in run 4, after 1 nodes, 2.09 seconds, depth 0, found by <relaxation>)
2.10/2.11 c Dual Bound : -6.00000000000000e+00
2.10/2.11 c Gap : 0.00 %
2.10/2.11 c Root Dual Bound : -6.00000000000000e+00
2.10/2.11 c Root Iterations : 1898
2.10/2.11 c Time complete: 2.11.