0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665235-1276660132.opb>
0.01/0.01 c original problem has 783 variables (783 bin, 0 int, 0 impl, 0 cont) and 783 constraints
0.01/0.01 c problem read
0.01/0.01 c presolving settings loaded
0.01/0.02 o 0
0.01/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.01/0.02 c presolving:
0.19/0.20 c (round 1) 733 del vars, 50 del conss, 733 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2932 impls, 0 clqs
0.19/0.23 c presolving (2 rounds):
0.19/0.23 c 733 deleted vars, 50 deleted constraints, 733 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.23 c 4398 implications, 0 cliques
0.19/0.23 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 733 constraints
0.19/0.23 c 733 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.12
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.23 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 | 51 | - |2177k| 0 | 50 | 50 | 733 | 50 | 733 | 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 | 51 | - |2178k| 0 | 50 | 50 | 733 | 50 | 733 | 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 | 51 | - |2178k| 0 | 50 | 50 | 733 | 50 | 733 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.19/0.26 c 0.1s| 1 | 0 | 104 | - |2185k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-2.000000e+00 | 88.57%
0.19/0.26 o -5
0.19/0.26 c b 0.1s| 1 | 0 | 104 | - |2187k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-5.000000e+00 | 71.43%
0.19/0.29 c 0.2s| 1 | 0 | 160 | - |2191k| 0 | 26 | 50 | 733 | 50 | 744 | 11 | 0 | 0 |-1.300000e+01 |-5.000000e+00 | 61.54%
0.29/0.32 c 0.2s| 1 | 0 | 186 | - |2195k| 0 | 24 | 50 | 733 | 50 | 746 | 13 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.29/0.35 c 0.2s| 1 | 0 | 236 | - |2200k| 0 | 22 | 50 | 733 | 50 | 752 | 19 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.29/0.38 c 0.3s| 1 | 0 | 276 | - |2204k| 0 | 27 | 50 | 733 | 50 | 758 | 25 | 0 | 0 |-1.020000e+01 |-5.000000e+00 | 50.98%
0.39/0.43 c 0.3s| 1 | 0 | 353 | - |2212k| 0 | 29 | 50 | 733 | 50 | 766 | 33 | 0 | 0 |-9.388889e+00 |-5.000000e+00 | 46.75%
0.49/0.50 c 0.4s| 1 | 0 | 401 | - |2346k| 0 | 29 | 50 | 733 | 50 | 772 | 39 | 0 | 0 |-8.800000e+00 |-5.000000e+00 | 43.18%
0.49/0.58 c 0.5s| 1 | 0 | 436 | - |2467k| 0 | 30 | 50 | 733 | 50 | 778 | 45 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.59/0.69 c 0.6s| 1 | 0 | 562 | - |2935k| 0 | 35 | 50 | 733 | 50 | 784 | 51 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.79/0.83 c 0.7s| 1 | 0 | 617 | - |3548k| 0 | 37 | 50 | 733 | 50 | 792 | 59 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.88/0.94 c 0.8s| 1 | 0 | 750 | - |3932k| 0 | 36 | 50 | 733 | 50 | 107 | 69 | 0 | 0 |-7.753846e+00 |-5.000000e+00 | 35.52%
0.88/0.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.88/0.96 c 0.8s| 1 | 0 | 781 | - |4122k| 0 | 48 | 50 | 733 | 50 | 117 | 79 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.88/0.98 c 0.8s| 1 | 0 | 800 | - |4292k| 0 | 46 | 50 | 733 | 50 | 129 | 91 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.88/0.99 c 0.9s| 1 | 0 | 818 | - |4478k| 0 | 47 | 50 | 733 | 50 | 136 | 98 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.02 c 0.9s| 1 | 0 | 841 | - |4687k| 0 | 45 | 50 | 733 | 50 | 143 | 105 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.04 c 0.9s| 1 | 0 | 867 | - |4893k| 0 | 46 | 50 | 733 | 50 | 151 | 113 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.07 c 0.9s| 1 | 0 | 892 | - |5131k| 0 | 49 | 50 | 733 | 50 | 111 | 122 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.38/1.44 c 1.3s| 1 | 0 | 969 | - |5127k| 0 | 42 | 50 | 733 | 50 | 111 | 122 | 0 | 31 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.38/1.46 c 1.3s| 1 | 0 | 1013 | - |5294k| 0 | 43 | 50 | 733 | 50 | 120 | 131 | 0 | 31 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.48/1.59 c 1.4s| 1 | 0 | 1055 | - |5289k| 0 | 36 | 50 | 733 | 50 | 120 | 131 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.59/1.61 c 1.4s| 1 | 0 | 1085 | - |5456k| 0 | 34 | 50 | 733 | 50 | 122 | 133 | 0 | 45 |-6.965517e+00 |-5.000000e+00 | 28.22%
1.59/1.62 c 1.4s| 1 | 0 | 1085 | - |5454k| 0 | - | 50 | 733 | 50 | 122 | 133 | 0 | 47 |-6.965517e+00 |-5.000000e+00 | 28.22%
1.59/1.62 c (run 1, node 1) restarting after 12 global fixings of integer variables
1.59/1.62 c
1.59/1.62 c (restart) converted 119 cuts from the global cut pool into linear constraints
1.59/1.62 c
1.59/1.63 c presolving:
1.59/1.63 c (round 1) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 0 chg coeffs, 0 upgd conss, 4398 impls, 106 clqs
1.59/1.64 c (round 2) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 0 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.65 c (round 3) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 12 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.65 c (round 4) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 22 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.65 c (round 5) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 26 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.66 c (round 6) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 29 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.66 c (round 7) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 31 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.66 c (round 8) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 33 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.66 c (round 9) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 35 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.67 c (round 10) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 36 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.67 c (round 11) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 38 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.67 c (round 12) 12 del vars, 369 del conss, 0 chg bounds, 28 chg sides, 40 chg coeffs, 91 upgd conss, 4398 impls, 106 clqs
1.59/1.67 c presolving (13 rounds):
1.59/1.67 c 12 deleted vars, 369 deleted constraints, 0 tightened bounds, 0 added holes, 28 changed sides, 40 changed coefficients
1.59/1.67 c 4398 implications, 106 cliques
1.59/1.67 c presolved problem has 38 variables (38 bin, 0 int, 0 impl, 0 cont) and 483 constraints
1.59/1.67 c 12 constraints of type <knapsack>
1.59/1.67 c 79 constraints of type <setppc>
1.59/1.67 c 392 constraints of type <logicor>
1.59/1.67 c transformed objective value is always integral (scale: 1)
1.59/1.67 c Presolving Time: 0.16
1.59/1.67 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.5s| 1 | 0 | 1155 | - |2104k| 0 | 36 | 38 | 483 | 38 | 483 | 0 | 0 | 47 |-6.898551e+00 |-5.000000e+00 | 27.52%
1.68/1.77 c 1.6s| 1 | 0 | 1171 | - |2617k| 0 | 36 | 38 | 483 | 38 | 488 | 5 | 0 | 47 |-6.804987e+00 |-5.000000e+00 | 26.52%
1.88/1.91 c 1.7s| 1 | 0 | 1214 | - |2613k| 0 | 25 | 38 | 483 | 38 | 488 | 5 | 0 | 57 |-6.718661e+00 |-5.000000e+00 | 25.58%
1.98/2.07 c 1.9s| 1 | 0 | 1214 | - |2609k| 0 | - | 38 | 483 | 38 | 488 | 5 | 0 | 76 |-6.718661e+00 |-5.000000e+00 | 25.58%
1.98/2.07 c (run 2, node 1) restarting after 10 global fixings of integer variables
1.98/2.07 c
1.98/2.07 c (restart) converted 5 cuts from the global cut pool into linear constraints
1.98/2.07 c
1.98/2.07 c presolving:
1.98/2.08 c (round 1) 10 del vars, 192 del conss, 0 chg bounds, 20 chg sides, 109 chg coeffs, 5 upgd conss, 4398 impls, 84 clqs
1.98/2.09 c (round 2) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 160 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
1.98/2.09 c (round 3) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 181 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
1.98/2.09 c (round 4) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 194 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
1.98/2.10 c (round 5) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 204 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.10 c (round 6) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 210 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.10 c (round 7) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 215 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.10 c (round 8) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 219 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.10 c (round 9) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 221 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.11 c (round 10) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 222 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.11 c (round 11) 10 del vars, 244 del conss, 0 chg bounds, 24 chg sides, 223 chg coeffs, 5 upgd conss, 4398 impls, 86 clqs
2.09/2.11 c presolving (12 rounds):
2.09/2.11 c 10 deleted vars, 244 deleted constraints, 0 tightened bounds, 0 added holes, 24 changed sides, 223 changed coefficients
2.09/2.11 c 4398 implications, 86 cliques
2.09/2.11 c presolved problem has 28 variables (28 bin, 0 int, 0 impl, 0 cont) and 268 constraints
2.09/2.11 c 13 constraints of type <knapsack>
2.09/2.11 c 53 constraints of type <setppc>
2.09/2.11 c 202 constraints of type <logicor>
2.09/2.11 c transformed objective value is always integral (scale: 1)
2.09/2.11 c Presolving Time: 0.19
2.09/2.11 c
2.09/2.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.09/2.12 c 1.9s| 1 | 0 | 1256 | - |1950k| 0 | 19 | 28 | 268 | 28 | 268 | 0 | 0 | 76 |-6.673704e+00 |-5.000000e+00 | 25.08%
2.09/2.15 c 1.9s| 1 | 0 | 1262 | - |1992k| 0 | 16 | 28 | 268 | 28 | 254 | 4 | 0 | 76 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.09/2.18 c 1.9s| 1 | 2 | 1262 | - |1993k| 0 | 16 | 28 | 268 | 28 | 254 | 4 | 0 | 92 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.09/2.18 o -6
2.09/2.18 c * 1.9s| 17 | 0 | 1262 | 0.0 |1996k| 8 | - | 28 | 268 | 0 | 0 | 4 | 0 | 92 |-6.000000e+00 |-6.000000e+00 | 0.00%
2.09/2.18 c
2.09/2.18 c SCIP Status : problem is solved [optimal solution found]
2.09/2.18 c Solving Time (sec) : 1.95
2.09/2.18 c Solving Nodes : 17 (total of 19 nodes in 3 runs)
2.09/2.18 c Primal Bound : -6.00000000000000e+00 (11 solutions)
2.09/2.18 c Dual Bound : -6.00000000000000e+00
2.09/2.18 c Gap : 0.00 %
2.09/2.18 s OPTIMUM FOUND
2.09/2.18 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
2.09/2.18 v -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.09/2.18 c SCIP Status : problem is solved [optimal solution found]
2.09/2.18 c Solving Time : 1.95
2.09/2.18 c Original Problem :
2.09/2.18 c Problem name : HOME/instance-2665235-1276660132.opb
2.09/2.18 c Variables : 783 (783 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.18 c Constraints : 783 initial, 783 maximal
2.09/2.18 c Presolved Problem :
2.09/2.18 c Problem name : t_HOME/instance-2665235-1276660132.opb
2.09/2.18 c Variables : 28 (28 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.18 c Constraints : 268 initial, 268 maximal
2.09/2.18 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.09/2.18 c trivial : 0.00 22 0 0 0 0 0 0 0
2.09/2.18 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.09/2.18 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.09/2.18 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.09/2.18 c implics : 0.00 0 0 0 0 0 0 0 0
2.09/2.18 c probing : 0.01 0 0 0 0 0 0 0 0
2.09/2.18 c knapsack : 0.04 0 0 0 0 0 0 24 263
2.09/2.18 c setppc : 0.00 0 0 0 0 0 54 0 0
2.09/2.18 c linear : 0.01 733 0 0 733 0 78 28 0
2.09/2.18 c logicor : 0.01 0 0 0 0 0 531 0 0
2.09/2.18 c root node : - 23 - - 23 - - - -
2.09/2.18 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.09/2.18 c integral : 0 0 0 6 0 0 22 0 0 2
2.09/2.18 c knapsack : 13 2 27 0 0 1 1 0 0 0
2.09/2.18 c setppc : 53 2 24 0 0 3 44 0 0 0
2.09/2.18 c logicor : 202 21 119 0 1 0 2 0 0 0
2.09/2.18 c countsols : 0 0 0 0 1 0 0 0 0 0
2.09/2.18 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.09/2.18 c integral : 0.77 0.00 0.00 0.77 0.00
2.09/2.18 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.09/2.18 c setppc : 0.00 0.00 0.00 0.00 0.00
2.09/2.18 c logicor : 0.00 0.00 0.00 0.00 0.00
2.09/2.18 c countsols : 0.00 0.00 0.00 0.00 0.00
2.09/2.18 c Propagators : Time Calls Cutoffs DomReds
2.09/2.18 c vbounds : 0.00 4 0 0
2.09/2.18 c rootredcost : 0.00 0 0 0
2.09/2.18 c pseudoobj : 0.00 50 3 19
2.09/2.18 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.09/2.18 c propagation : 0.00 7 0 0 0.0 0 0.0 -
2.09/2.18 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.18 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.18 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.18 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.09/2.18 c applied globally : - - - 0 0.0 - - -
2.09/2.18 c applied locally : - - - 0 0.0 - - -
2.09/2.18 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.09/2.18 c cut pool : 0.00 0 - - 0 - (maximal pool size: 38)
2.09/2.18 c redcost : 0.00 21 0 1 0 0
2.09/2.18 c impliedbounds : 0.00 21 0 0 0 0
2.09/2.18 c intobj : 0.00 0 0 0 0 0
2.09/2.18 c cgmip : 0.00 0 0 0 0 0
2.09/2.18 c gomory : 0.38 21 0 0 5323 0
2.09/2.18 c strongcg : 0.29 21 0 0 6122 0
2.09/2.18 c cmir : 0.04 12 0 0 0 0
2.09/2.18 c flowcover : 0.03 12 0 0 0 0
2.09/2.18 c clique : 0.02 21 0 0 177 0
2.09/2.18 c zerohalf : 0.00 0 0 0 0 0
2.09/2.18 c mcf : 0.01 3 0 0 0 0
2.09/2.18 c rapidlearning : 0.00 0 0 0 0 0
2.09/2.18 c Pricers : Time Calls Vars
2.09/2.18 c problem variables: 0.00 0 0
2.09/2.18 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.09/2.18 c relpscost : 0.77 6 0 22 0 0 2
2.09/2.18 c pscost : 0.00 0 0 0 0 0 0
2.09/2.18 c inference : 0.00 8 0 0 0 0 16
2.09/2.18 c mostinf : 0.00 0 0 0 0 0 0
2.09/2.18 c leastinf : 0.00 0 0 0 0 0 0
2.09/2.18 c fullstrong : 0.00 0 0 0 0 0 0
2.09/2.18 c allfullstrong : 0.00 0 0 0 0 0 0
2.09/2.18 c random : 0.00 0 0 0 0 0 0
2.09/2.18 c Primal Heuristics : Time Calls Found
2.09/2.18 c LP solutions : 0.00 - 0
2.09/2.18 c pseudo solutions : 0.00 - 1
2.09/2.18 c crossover : 0.00 0 0
2.09/2.18 c oneopt : 0.01 2 1
2.09/2.18 c trivial : 0.00 2 2
2.09/2.18 c simplerounding : 0.00 27 2
2.09/2.18 c zirounding : 0.00 2 2
2.09/2.18 c rounding : 0.00 27 1
2.09/2.18 c shifting : 0.01 27 2
2.09/2.18 c intshifting : 0.00 0 0
2.09/2.18 c twoopt : 0.00 0 0
2.09/2.18 c fixandinfer : 0.00 0 0
2.09/2.18 c feaspump : 0.00 0 0
2.09/2.18 c coefdiving : 0.00 0 0
2.09/2.18 c pscostdiving : 0.00 0 0
2.09/2.18 c fracdiving : 0.00 0 0
2.09/2.18 c veclendiving : 0.00 0 0
2.09/2.18 c intdiving : 0.00 0 0
2.09/2.18 c actconsdiving : 0.00 0 0
2.09/2.18 c objpscostdiving : 0.00 0 0
2.09/2.18 c rootsoldiving : 0.00 0 0
2.09/2.18 c linesearchdiving : 0.00 0 0
2.09/2.18 c guideddiving : 0.00 0 0
2.09/2.18 c octane : 0.00 0 0
2.09/2.18 c rens : 0.00 0 0
2.09/2.18 c rins : 0.00 0 0
2.09/2.18 c localbranching : 0.00 0 0
2.09/2.18 c mutation : 0.00 0 0
2.09/2.18 c dins : 0.00 0 0
2.09/2.18 c undercover : 0.00 0 0
2.09/2.18 c nlp : 0.00 0 0
2.09/2.18 c trysol : 0.00 0 0
2.09/2.18 c LP : Time Calls Iterations Iter/call Iter/sec
2.09/2.18 c primal LP : 0.01 0 0 0.00 0.00
2.09/2.18 c dual LP : 0.16 27 1262 46.74 7887.50
2.09/2.18 c lex dual LP : 0.00 0 0 0.00 -
2.09/2.18 c barrier LP : 0.00 0 0 0.00 -
2.09/2.18 c diving/probing LP: 0.00 0 0 0.00 -
2.09/2.18 c strong branching : 0.77 92 10090 109.67 13103.90
2.09/2.18 c (at root node) : - 92 10090 109.67 -
2.09/2.18 c conflict analysis: 0.00 0 0 0.00 -
2.09/2.18 c B&B Tree :
2.09/2.18 c number of runs : 3
2.09/2.18 c nodes : 17
2.09/2.18 c nodes (total) : 19
2.09/2.18 c nodes left : 0
2.09/2.18 c max depth : 8
2.09/2.18 c max depth (total): 8
2.09/2.18 c backtracks : 1 (5.9%)
2.09/2.18 c delayed cutoffs : 0
2.09/2.18 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.09/2.18 c avg switch length: 2.00
2.09/2.18 c switching time : 0.00
2.09/2.18 c Solution :
2.09/2.18 c Solutions found : 11 (5 improvements)
2.09/2.18 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
2.09/2.18 c Primal Bound : -6.00000000000000e+00 (in run 3, after 17 nodes, 1.95 seconds, depth 8, found by <relaxation>)
2.09/2.18 c Dual Bound : -6.00000000000000e+00
2.09/2.18 c Gap : 0.00 %
2.09/2.18 c Root Dual Bound : -6.00000000000000e+00
2.09/2.18 c Root Iterations : 1262
2.09/2.19 c Time complete: 2.17.