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-3453164-1307083364.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 722 impls, 0 clqs
0.00/0.01 c (round 2) 4 del vars, 38 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 732 impls, 0 clqs
0.00/0.01 c (round 3) 5 del vars, 47 del conss, 0 add conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.01 c (round 4) 9 del vars, 65 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.01 c (round 5) 14 del vars, 116 del conss, 0 add conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 776 impls, 0 clqs
0.00/0.02 c (round 6) 16 del vars, 147 del conss, 0 add conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.02 c (round 7) 19 del vars, 170 del conss, 0 add conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.02 c (round 8) 22 del vars, 191 del conss, 0 add conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 830 impls, 0 clqs
0.00/0.02 c (round 9) 22 del vars, 194 del conss, 0 add conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.02 c (round 10) 22 del vars, 211 del conss, 0 add conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.03 c (round 11) 22 del vars, 211 del conss, 0 add conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 844 impls, 0 clqs
0.03/0.05 c (round 12) 72 del vars, 211 del conss, 0 add conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5922 impls, 0 clqs
0.03/0.05 c (round 13) 72 del vars, 471 del conss, 0 add conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.03/0.05 c (round 14) 72 del vars, 481 del conss, 0 add conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.03/0.05 c (round 15) 73 del vars, 481 del conss, 0 add conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.03/0.05 c (round 16) 73 del vars, 489 del conss, 0 add conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.03/0.05 c presolving (17 rounds):
0.03/0.05 c 73 deleted vars, 489 deleted constraints, 0 added constraints, 26 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.03/0.05 c 6040 implications, 0 cliques
0.03/0.05 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 411 constraints
0.03/0.05 c 95 constraints of type <setppc>
0.03/0.05 c 316 constraints of type <logicor>
0.03/0.05 c transformed objective value is always integral (scale: 1)
0.03/0.05 c Presolving Time: 0.04
0.03/0.05 c - non default parameters ----------------------------------------------------------------------
0.03/0.05 c # SCIP version 2.0.1.4
0.03/0.05 c
0.03/0.05 c # frequency for displaying node information lines
0.03/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.05 c display/freq = 10000
0.03/0.05 c
0.03/0.05 c # maximal time in seconds to run
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/time = 1800
0.03/0.05 c
0.03/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.05 c limits/memory = 13950
0.03/0.05 c
0.03/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.05 c # [type: int, range: [1,2], default: 1]
0.03/0.05 c timing/clocktype = 2
0.03/0.05 c
0.03/0.05 c # belongs reading time to solving time?
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c timing/reading = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify inequalities
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/linear/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/indicator/addCouplingCons = TRUE
0.03/0.05 c
0.03/0.05 c # should presolving try to simplify knapsacks
0.03/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.05 c
0.03/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.05 c separating/rapidlearning/freq = 0
0.03/0.05 c
0.03/0.05 c -----------------------------------------------------------------------------------------------
0.03/0.05 c start solving
0.03/0.05 c
0.03/0.05 o 100
0.03/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.03/0.05 c T 0.1s| 1 | 0 | 0 | - |1432k| 0 | - | 127 | 411 | 127 | 406 | 0 | 0 | 0 | -- | 1.000000e+02 | Inf
0.03/0.05 o 95
0.03/0.05 c b 0.1s| 1 | 0 | 0 | - |1423k| 0 | - | 127 | 411 | 127 | 406 | 0 | 0 | 0 | -- | 9.500000e+01 | Inf
0.03/0.07 c 0.1s| 1 | 0 | 345 | - |1420k| 0 | 108 | 127 | 411 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | 9.500000e+01 | 17.47%
0.09/0.11 o 94
0.09/0.11 c y 0.1s| 1 | 0 | 345 | - |2839k| 0 | 108 | 127 | 411 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | 9.400000e+01 | 16.23%
0.09/0.12 c 0.1s| 1 | 0 | 557 | - |2037k| 0 | 98 | 127 | 416 | 127 | 471 | 65 | 0 | 0 | 8.245455e+01 | 9.400000e+01 | 14.00%
0.09/0.12 o 93
0.09/0.12 c b 0.1s| 1 | 0 | 557 | - |2042k| 0 | 98 | 127 | 416 | 127 | 471 | 65 | 0 | 0 | 8.245455e+01 | 9.300000e+01 | 12.79%
0.09/0.16 c 0.2s| 1 | 0 | 607 | - |2176k| 0 | 111 | 127 | 416 | 127 | 475 | 69 | 0 | 0 | 8.279134e+01 | 9.300000e+01 | 12.33%
0.19/0.20 c 0.2s| 1 | 0 | 701 | - |2492k| 0 | 109 | 127 | 416 | 127 | 480 | 74 | 0 | 0 | 8.308426e+01 | 9.300000e+01 | 11.93%
0.19/0.25 c 0.3s| 1 | 0 | 863 | - |2783k| 0 | 104 | 127 | 416 | 127 | 486 | 80 | 0 | 0 | 8.355239e+01 | 9.300000e+01 | 11.31%
0.19/0.29 c 0.3s| 1 | 0 | 905 | - |3114k| 0 | 100 | 127 | 416 | 127 | 489 | 83 | 0 | 0 | 8.357322e+01 | 9.300000e+01 | 11.28%
0.29/0.33 c 0.3s| 1 | 0 | 974 | - |3373k| 0 | 103 | 127 | 416 | 127 | 490 | 84 | 0 | 0 | 8.360700e+01 | 9.300000e+01 | 11.23%
0.29/0.39 c 0.4s| 1 | 0 | 1245 | - |3663k| 0 | 106 | 127 | 416 | 127 | 493 | 87 | 0 | 0 | 8.402108e+01 | 9.300000e+01 | 10.69%
0.29/0.39 o 93
0.29/0.39 c s 0.4s| 1 | 0 | 1245 | - |3665k| 0 | 106 | 127 | 416 | 127 | 493 | 87 | 0 | 0 | 8.402108e+01 | 9.300000e+01 | 10.69%
0.39/0.45 c 0.5s| 1 | 0 | 1291 | - |5128k| 0 | 109 | 127 | 416 | 127 | 496 | 90 | 0 | 0 | 8.404227e+01 | 9.300000e+01 | 10.66%
0.39/0.45 o 91
0.39/0.45 c b 0.5s| 1 | 0 | 1291 | - |5134k| 0 | 109 | 127 | 416 | 127 | 496 | 90 | 0 | 0 | 8.404227e+01 | 9.100000e+01 | 8.28%
0.49/0.50 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.50 c 0.5s| 1 | 0 | 1363 | - |5560k| 0 | 107 | 127 | 416 | 127 | 500 | 94 | 0 | 0 | 8.406149e+01 | 9.100000e+01 | 8.25%
0.49/0.55 c 0.6s| 1 | 0 | 1533 | - |5713k| 0 | 113 | 127 | 416 | 127 | 503 | 97 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
0.49/0.59 c 0.6s| 1 | 0 | 1610 | - |6155k| 0 | 104 | 127 | 416 | 127 | 468 | 101 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
0.59/0.64 c 0.6s| 1 | 0 | 1652 | - |7267k| 0 | 109 | 127 | 416 | 127 | 470 | 103 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
0.59/0.68 c 0.7s| 1 | 0 | 1689 | - |8320k| 0 | 107 | 127 | 416 | 127 | 474 | 107 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
0.69/0.72 c 0.7s| 1 | 0 | 1730 | - |9165k| 0 | 115 | 127 | 416 | 127 | 477 | 110 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
0.69/0.75 c 0.8s| 1 | 0 | 1767 | - |9276k| 0 | 111 | 127 | 416 | 127 | 482 | 115 | 0 | 0 | 8.450000e+01 | 9.100000e+01 | 7.69%
1.11/1.18 c 1.2s| 1 | 0 | 1802 | - |9263k| 0 | 106 | 127 | 406 | 127 | 482 | 115 | 0 | 15 | 8.450000e+01 | 9.100000e+01 | 7.69%
1.19/1.22 c 1.2s| 1 | 0 | 1843 | - |9475k| 0 | 103 | 127 | 406 | 127 | 472 | 116 | 0 | 15 | 8.450000e+01 | 9.100000e+01 | 7.69%
1.59/1.61 c 1.6s| 1 | 0 | 2190 | - |9450k| 0 | 82 | 127 | 379 | 127 | 472 | 116 | 0 | 34 | 8.483606e+01 | 9.100000e+01 | 7.27%
1.59/1.65 c 1.7s| 1 | 0 | 2263 | - |9613k| 0 | 79 | 127 | 379 | 127 | 474 | 118 | 0 | 34 | 8.500000e+01 | 9.100000e+01 | 7.06%
1.69/1.78 c 1.8s| 1 | 0 | 2333 | - |9602k| 0 | 76 | 127 | 364 | 127 | 474 | 118 | 0 | 53 | 8.555971e+01 | 9.100000e+01 | 6.36%
1.79/1.81 c 1.8s| 1 | 0 | 2364 | - |9637k| 0 | 72 | 127 | 364 | 127 | 475 | 119 | 0 | 53 | 8.600000e+01 | 9.100000e+01 | 5.81%
1.99/2.01 c 2.0s| 1 | 2 | 2364 | - |9637k| 0 | 72 | 127 | 364 | 127 | 475 | 119 | 0 | 71 | 8.600000e+01 | 9.100000e+01 | 5.81%
1.99/2.01 c (run 1, node 1) restarting after 26 global fixings of integer variables
1.99/2.01 c
1.99/2.01 c (restart) converted 13 cuts from the global cut pool into linear constraints
1.99/2.01 c
1.99/2.02 c presolving:
1.99/2.02 c (round 1) 26 del vars, 154 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 6402 impls, 1 clqs
1.99/2.02 c (round 2) 27 del vars, 166 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 6402 impls, 1 clqs
1.99/2.02 c (round 3) 27 del vars, 167 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 12 upgd conss, 6402 impls, 1 clqs
1.99/2.02 c (round 4) 27 del vars, 167 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 12 upgd conss, 6402 impls, 1 clqs
1.99/2.02 c presolving (5 rounds):
1.99/2.02 c 27 deleted vars, 167 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 6 changed coefficients
1.99/2.02 c 6402 implications, 1 cliques
1.99/2.02 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 210 constraints
1.99/2.02 c 4 constraints of type <knapsack>
1.99/2.02 c 70 constraints of type <setppc>
1.99/2.02 c 136 constraints of type <logicor>
1.99/2.02 c transformed objective value is always integral (scale: 1)
1.99/2.02 c Presolving Time: 0.05
1.99/2.02 c
1.99/2.03 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.03 c 2.0s| 1 | 0 | 2518 | - |1333k| 0 | 72 | 100 | 210 | 100 | 208 | 0 | 0 | 71 | 8.600000e+01 | 9.100000e+01 | 5.81%
1.99/2.04 c 2.0s| 1 | 0 | 2537 | - |1454k| 0 | 73 | 100 | 210 | 100 | 212 | 4 | 0 | 71 | 8.600000e+01 | 9.100000e+01 | 5.81%
2.10/2.18 c 2.2s| 1 | 0 | 2576 | - |1456k| 0 | 71 | 100 | 209 | 100 | 212 | 4 | 0 | 107 | 8.606818e+01 | 9.100000e+01 | 5.73%
2.21/2.24 c 2.2s| 1 | 0 | 2583 | - |1446k| 0 | 65 | 100 | 202 | 100 | 212 | 4 | 0 | 145 | 8.618750e+01 | 9.100000e+01 | 5.58%
2.21/2.24 c 2.2s| 1 | 2 | 2583 | - |1447k| 0 | 65 | 100 | 202 | 100 | 212 | 4 | 0 | 145 | 8.618750e+01 | 9.100000e+01 | 5.58%
2.21/2.24 c (run 2, node 1) restarting after 8 global fixings of integer variables
2.21/2.24 c
2.21/2.24 c (restart) converted 2 cuts from the global cut pool into linear constraints
2.21/2.24 c
2.21/2.24 c presolving:
2.21/2.24 c (round 1) 8 del vars, 26 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 6458 impls, 1 clqs
2.21/2.25 c (round 2) 11 del vars, 30 del conss, 1 add conss, 0 chg bounds, 1 chg sides, 5 chg coeffs, 2 upgd conss, 6458 impls, 1 clqs
2.21/2.25 c (round 3) 11 del vars, 35 del conss, 2 add conss, 0 chg bounds, 2 chg sides, 9 chg coeffs, 2 upgd conss, 6458 impls, 2 clqs
2.21/2.25 c presolving (4 rounds):
2.21/2.25 c 11 deleted vars, 35 deleted constraints, 2 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 9 changed coefficients
2.21/2.25 c 6458 implications, 2 cliques
2.21/2.25 c presolved problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 171 constraints
2.21/2.25 c 5 constraints of type <knapsack>
2.21/2.25 c 58 constraints of type <setppc>
2.21/2.25 c 108 constraints of type <logicor>
2.21/2.25 c transformed objective value is always integral (scale: 1)
2.21/2.25 c Presolving Time: 0.06
2.21/2.25 c
2.21/2.25 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.21/2.25 c 2.3s| 1 | 0 | 2738 | - |1293k| 0 | 61 | 89 | 171 | 89 | 169 | 0 | 0 | 145 | 8.625000e+01 | 9.100000e+01 | 5.51%
2.21/2.27 c 2.3s| 1 | 0 | 2765 | - |1362k| 0 | 55 | 89 | 171 | 89 | 172 | 3 | 0 | 145 | 8.666667e+01 | 9.100000e+01 | 5.00%
2.21/2.27 o 90
2.21/2.27 c R 2.3s| 1 | 0 | 2765 | - |1364k| 0 | 55 | 89 | 171 | 89 | 172 | 3 | 0 | 145 | 8.666667e+01 | 9.000000e+01 | 3.85%
2.21/2.30 c 2.3s| 1 | 2 | 2765 | - |1365k| 0 | 55 | 89 | 171 | 89 | 172 | 3 | 0 | 164 | 8.666667e+01 | 9.000000e+01 | 3.85%
2.21/2.30 o 89
2.21/2.30 c b 2.3s| 2 | 1 | 2765 | 0.0 |1373k| 1 | - | 89 | 171 | 89 | 166 | 3 | 0 | 164 | 8.733333e+01 | 8.900000e+01 | 1.91%
2.29/2.30 o 88
2.29/2.30 c R 2.3s| 3 | 0 | 2853 | 22.0 |1346k| 1 | - | 89 | 148 | 89 | 166 | 3 | 0 | 171 | 8.800000e+01 | 8.800000e+01 | 0.00%
2.29/2.30 c
2.29/2.30 c SCIP Status : problem is solved [optimal solution found]
2.29/2.30 c Solving Time (sec) : 2.30
2.29/2.30 c Solving Nodes : 3 (total of 5 nodes in 3 runs)
2.29/2.30 c Primal Bound : +8.80000000000000e+01 (13 solutions)
2.29/2.30 c Dual Bound : +8.80000000000000e+01
2.29/2.30 c Gap : 0.00 %
2.29/2.30 s OPTIMUM FOUND
2.29/2.30 v -x200 -x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 -x186 x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178
2.29/2.30 v x177 -x176 x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 -x160 x159 x158 -x157 x156 -x155
2.29/2.30 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 x140 -x139 x138 -x137 x136 -x135 -x134 x133
2.29/2.30 v -x132 -x131 x130 -x129 -x128 x127 -x126 x125 x124 -x123 -x122 x121 x120 -x119 x118 -x117 -x116 x115 -x114 x113 -x112 x111 -x110
2.29/2.30 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
2.29/2.30 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
2.29/2.30 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
2.29/2.30 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
2.29/2.30 c SCIP Status : problem is solved [optimal solution found]
2.29/2.30 c Total Time : 2.30
2.29/2.30 c solving : 2.30
2.29/2.30 c presolving : 0.06 (included in solving)
2.29/2.30 c reading : 0.01 (included in solving)
2.29/2.30 c Original Problem :
2.29/2.30 c Problem name : HOME/instance-3453164-1307083364.opb
2.29/2.30 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.30 c Constraints : 900 initial, 900 maximal
2.29/2.30 c Presolved Problem :
2.29/2.30 c Problem name : t_HOME/instance-3453164-1307083364.opb
2.29/2.30 c Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.30 c Constraints : 171 initial, 171 maximal
2.29/2.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.29/2.30 c trivial : 0.00 36 0 0 0 0 0 0 0 0
2.29/2.30 c dualfix : 0.00 4 0 0 0 0 0 0 0 0
2.29/2.30 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.30 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.30 c probing : 0.02 39 12 0 4 0 0 0 0 0
2.29/2.30 c knapsack : 0.01 0 0 0 0 0 0 2 2 15
2.29/2.30 c setppc : 0.00 0 0 0 0 0 63 0 0 0
2.29/2.30 c linear : 0.01 20 0 0 22 0 214 0 17 0
2.29/2.30 c logicor : 0.01 0 0 0 0 0 414 0 0 0
2.29/2.30 c root node : - 63 - - 63 - - - - -
2.29/2.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.29/2.30 c integral : 0 0 0 10 0 21 0 1 19 0 0 6
2.29/2.30 c knapsack : 5 2 22 0 0 0 0 0 9 2 0 0
2.29/2.30 c setppc : 58 20 817 0 0 16 0 8 25 0 0 0
2.29/2.30 c logicor : 108 20 614 0 0 13 0 6 16 0 0 0
2.29/2.30 c countsols : 0 0 0 0 0 15 0 0 0 0 0 0
2.29/2.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.29/2.30 c integral : 1.34 0.00 0.00 1.34 0.00 0.00 0.00
2.29/2.30 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.30 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.30 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.30 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.30 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.29/2.30 c vbounds : 0 0 0 0
2.29/2.30 c rootredcost : 1 0 0 0
2.29/2.30 c pseudoobj : 94 0 0 0
2.29/2.30 c Propagator Timings : TotalTime Propagate Resprop
2.29/2.30 c vbounds : 0.00 0.00 0.00
2.29/2.30 c rootredcost : 0.00 0.00 0.00
2.29/2.30 c pseudoobj : 0.00 0.00 0.00
2.29/2.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.30 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.30 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.30 c applied globally : - - - 0 0.0 - - -
2.29/2.30 c applied locally : - - - 0 0.0 - - -
2.29/2.30 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.30 c cut pool : 0.00 0 - - 0 - (maximal pool size: 33)
2.29/2.30 c redcost : 0.00 24 0 13 0 0
2.29/2.30 c impliedbounds : 0.00 20 0 0 133 0
2.29/2.30 c intobj : 0.00 0 0 0 0 0
2.29/2.30 c gomory : 0.32 20 0 0 1987 0
2.29/2.30 c cgmip : 0.00 0 0 0 0 0
2.29/2.30 c closecuts : 0.00 0 0 0 0 0
2.29/2.30 c strongcg : 0.28 20 0 0 4370 0
2.29/2.30 c cmir : 0.02 12 0 0 1 0
2.29/2.30 c flowcover : 0.05 12 0 0 2 0
2.29/2.30 c clique : 0.01 20 0 0 79 0
2.29/2.30 c zerohalf : 0.00 0 0 0 0 0
2.29/2.30 c mcf : 0.00 3 0 0 0 0
2.29/2.30 c oddcycle : 0.00 0 0 0 0 0
2.29/2.30 c rapidlearning : 0.02 1 0 0 0 5
2.29/2.30 c Pricers : Time Calls Vars
2.29/2.30 c problem variables: 0.00 0 0
2.29/2.30 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.30 c relpscost : 1.34 10 1 19 0 0 6
2.29/2.30 c pscost : 0.00 0 0 0 0 0 0
2.29/2.30 c inference : 0.00 0 0 0 0 0 0
2.29/2.30 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.30 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.30 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.30 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.30 c random : 0.00 0 0 0 0 0 0
2.29/2.30 c Primal Heuristics : Time Calls Found
2.29/2.30 c LP solutions : 0.00 - 0
2.29/2.30 c pseudo solutions : 0.00 - 0
2.29/2.30 c crossover : 0.00 0 0
2.29/2.30 c coefdiving : 0.00 0 0
2.29/2.30 c trivial : 0.00 2 0
2.29/2.30 c shiftandpropagate: 0.00 1 1
2.29/2.30 c simplerounding : 0.00 0 0
2.29/2.30 c zirounding : 0.00 3 0
2.29/2.30 c rounding : 0.00 31 2
2.29/2.30 c shifting : 0.01 28 5
2.29/2.30 c intshifting : 0.00 0 0
2.29/2.30 c oneopt : 0.00 8 4
2.29/2.30 c twoopt : 0.00 0 0
2.29/2.30 c fixandinfer : 0.00 0 0
2.29/2.30 c feaspump : 0.00 0 0
2.29/2.30 c clique : 0.00 0 0
2.29/2.30 c pscostdiving : 0.00 0 0
2.29/2.30 c fracdiving : 0.00 0 0
2.29/2.30 c veclendiving : 0.00 0 0
2.29/2.30 c intdiving : 0.00 0 0
2.29/2.30 c actconsdiving : 0.00 0 0
2.29/2.30 c objpscostdiving : 0.00 0 0
2.29/2.30 c rootsoldiving : 0.00 0 0
2.29/2.30 c linesearchdiving : 0.00 0 0
2.29/2.30 c guideddiving : 0.00 0 0
2.29/2.30 c octane : 0.00 0 0
2.29/2.30 c rens : 0.01 0 0
2.29/2.30 c rins : 0.00 0 0
2.29/2.30 c localbranching : 0.00 0 0
2.29/2.30 c mutation : 0.00 0 0
2.29/2.30 c dins : 0.00 0 0
2.29/2.30 c vbounds : 0.00 0 0
2.29/2.30 c undercover : 0.00 0 0
2.29/2.30 c subnlp : 0.00 0 0
2.29/2.30 c trysol : 0.00 0 0
2.29/2.30 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.30 c primal LP : 0.00 0 0 0.00 -
2.29/2.30 c dual LP : 0.13 31 2853 92.03 21195.51
2.29/2.30 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.30 c barrier LP : 0.00 0 0 0.00 -
2.29/2.30 c diving/probing LP: 0.00 0 0 0.00 -
2.29/2.30 c strong branching : 1.34 171 27450 160.53 20426.71
2.29/2.30 c (at root node) : - 164 27294 166.43 -
2.29/2.30 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.30 c B&B Tree :
2.29/2.30 c number of runs : 3
2.29/2.30 c nodes : 3
2.29/2.30 c nodes (total) : 5
2.29/2.30 c nodes left : 0
2.29/2.30 c max depth : 1
2.29/2.30 c max depth (total): 1
2.29/2.30 c backtracks : 0 (0.0%)
2.29/2.30 c delayed cutoffs : 0
2.29/2.30 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.29/2.30 c avg switch length: 2.00
2.29/2.30 c switching time : 0.00
2.29/2.30 c Solution :
2.29/2.30 c Solutions found : 13 (9 improvements)
2.29/2.30 c First Solution : +1.00000000000000e+02 (in run 1, after 1 nodes, 0.05 seconds, depth 15, found by <shiftandpropagate>)
2.29/2.30 c Primal Bound : +8.80000000000000e+01 (in run 3, after 3 nodes, 2.30 seconds, depth 1, found by <rounding>)
2.29/2.30 c Dual Bound : +8.80000000000000e+01
2.29/2.30 c Gap : 0.00 %
2.29/2.30 c Root Dual Bound : +8.66666666666667e+01
2.29/2.30 c Root Iterations : 2765
2.29/2.31 c Time complete: 2.3.