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-2665267-1276663558.opb>
0.00/0.01 c original problem has 799 variables (799 bin, 0 int, 0 impl, 0 cont) and 799 constraints
0.00/0.01 c problem read
0.00/0.01 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.19/0.20 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.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 | 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 | 78 | - |2225k| 0 | 41 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.050000e+01 |-2.000000e+00 | 90.24%
0.19/0.26 o -5
0.19/0.26 c b 0.1s| 1 | 0 | 78 | - |2226k| 0 | 41 | 50 | 749 | 50 | 752 | 3 | 0 | 0 |-2.050000e+01 |-5.000000e+00 | 75.61%
0.19/0.29 c 0.2s| 1 | 0 | 131 | - |2231k| 0 | 31 | 50 | 749 | 50 | 757 | 8 | 0 | 0 |-1.550000e+01 |-5.000000e+00 | 67.74%
0.29/0.31 c 0.2s| 1 | 0 | 165 | - |2237k| 0 | 27 | 50 | 749 | 50 | 761 | 12 | 0 | 0 |-1.350000e+01 |-5.000000e+00 | 62.96%
0.29/0.35 c 0.2s| 1 | 0 | 225 | - |2242k| 0 | 23 | 50 | 749 | 50 | 768 | 19 | 0 | 0 |-1.150000e+01 |-5.000000e+00 | 56.52%
0.29/0.38 c 0.3s| 1 | 0 | 270 | - |2246k| 0 | 28 | 50 | 749 | 50 | 771 | 22 | 0 | 0 |-1.050000e+01 |-5.000000e+00 | 52.38%
0.39/0.43 c 0.3s| 1 | 0 | 317 | - |2269k| 0 | 27 | 50 | 749 | 50 | 779 | 30 | 0 | 0 |-9.000000e+00 |-5.000000e+00 | 44.44%
0.39/0.49 c 0.4s| 1 | 0 | 342 | - |2303k| 0 | 24 | 50 | 749 | 50 | 787 | 38 | 0 | 0 |-9.000000e+00 |-5.000000e+00 | 44.44%
0.49/0.54 c 0.4s| 1 | 0 | 389 | - |2329k| 0 | 29 | 50 | 749 | 50 | 794 | 45 | 0 | 0 |-8.625000e+00 |-5.000000e+00 | 42.03%
0.59/0.62 c 0.5s| 1 | 0 | 448 | - |2394k| 0 | 26 | 50 | 749 | 50 | 801 | 52 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.69/0.70 c 0.6s| 1 | 0 | 472 | - |2630k| 0 | 32 | 50 | 749 | 50 | 810 | 61 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.79/0.80 c 0.7s| 1 | 0 | 506 | - |3093k| 0 | 37 | 50 | 749 | 50 | 112 | 68 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.79/0.82 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.82 c 0.7s| 1 | 0 | 528 | - |3264k| 0 | 34 | 50 | 749 | 50 | 119 | 75 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.79/0.84 c 0.7s| 1 | 0 | 601 | - |3491k| 0 | 34 | 50 | 749 | 50 | 128 | 84 | 0 | 0 |-7.853444e+00 |-5.000000e+00 | 36.33%
0.79/0.86 c 0.7s| 1 | 0 | 654 | - |3566k| 0 | 37 | 50 | 749 | 50 | 135 | 91 | 0 | 0 |-7.638444e+00 |-5.000000e+00 | 34.54%
0.79/0.89 c 0.8s| 1 | 0 | 689 | - |3890k| 0 | 31 | 50 | 749 | 50 | 144 | 100 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.91 c 0.8s| 1 | 0 | 725 | - |4037k| 0 | 32 | 50 | 749 | 50 | 152 | 108 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.93 c 0.8s| 1 | 0 | 773 | - |4149k| 0 | 35 | 50 | 749 | 50 | 104 | 113 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.94 c 0.8s| 1 | 0 | 809 | - |4179k| 0 | 36 | 50 | 749 | 50 | 111 | 120 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.96 c 0.8s| 1 | 0 | 843 | - |4239k| 0 | 34 | 50 | 749 | 50 | 119 | 128 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.97 c 0.8s| 1 | 0 | 872 | - |4310k| 0 | 39 | 50 | 749 | 50 | 130 | 139 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.99/1.10 c 0.9s| 1 | 0 | 937 | - |4306k| 0 | 35 | 50 | 749 | 50 | 130 | 139 | 0 | 16 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.10/1.11 c 0.9s| 1 | 0 | 1015 | - |4352k| 0 | 35 | 50 | 749 | 50 | 136 | 145 | 0 | 16 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.20/1.27 c 1.1s| 1 | 0 | 1105 | - |4347k| 0 | 35 | 50 | 749 | 50 | 109 | 145 | 0 | 37 |-6.941176e+00 |-5.000000e+00 | 27.97%
1.20/1.28 c 1.1s| 1 | 0 | 1147 | - |4453k| 0 | 23 | 50 | 749 | 50 | 119 | 155 | 0 | 37 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.20/1.29 c 1.1s| 1 | 0 | 1147 | - |4449k| 0 | - | 50 | 749 | 50 | 119 | 155 | 0 | 42 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.20/1.29 c (run 1, node 1) restarting after 15 global fixings of integer variables
1.20/1.29 c
1.20/1.29 c (restart) converted 119 cuts from the global cut pool into linear constraints
1.20/1.29 c
1.29/1.30 c presolving:
1.29/1.30 c (round 1) 15 del vars, 412 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4494 impls, 100 clqs
1.29/1.31 c (round 2) 15 del vars, 444 del conss, 0 chg bounds, 27 chg sides, 0 chg coeffs, 0 upgd conss, 4494 impls, 100 clqs
1.29/1.31 c (round 3) 15 del vars, 445 del conss, 0 chg bounds, 27 chg sides, 0 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.32 c (round 4) 15 del vars, 445 del conss, 0 chg bounds, 27 chg sides, 18 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.32 c (round 5) 15 del vars, 445 del conss, 0 chg bounds, 28 chg sides, 65 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.33 c (round 6) 15 del vars, 445 del conss, 0 chg bounds, 28 chg sides, 72 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.33 c (round 7) 15 del vars, 445 del conss, 0 chg bounds, 28 chg sides, 77 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.34 c (round 8) 15 del vars, 445 del conss, 0 chg bounds, 29 chg sides, 88 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.34 c (round 9) 15 del vars, 445 del conss, 0 chg bounds, 29 chg sides, 94 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.34 c (round 10) 15 del vars, 445 del conss, 0 chg bounds, 29 chg sides, 99 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.34 c (round 11) 15 del vars, 445 del conss, 0 chg bounds, 29 chg sides, 100 chg coeffs, 86 upgd conss, 4494 impls, 100 clqs
1.29/1.34 c presolving (12 rounds):
1.29/1.34 c 15 deleted vars, 445 deleted constraints, 0 tightened bounds, 0 added holes, 29 changed sides, 100 changed coefficients
1.29/1.34 c 4494 implications, 100 cliques
1.29/1.34 c presolved problem has 35 variables (35 bin, 0 int, 0 impl, 0 cont) and 424 constraints
1.29/1.34 c 10 constraints of type <knapsack>
1.29/1.34 c 76 constraints of type <setppc>
1.29/1.34 c 338 constraints of type <logicor>
1.29/1.34 c transformed objective value is always integral (scale: 1)
1.29/1.34 c Presolving Time: 0.15
1.29/1.35 c
1.29/1.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.35 c 1.2s| 1 | 0 | 1204 | - |2084k| 0 | 27 | 35 | 424 | 35 | 424 | 0 | 0 | 42 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.39/1.40 c 1.2s| 1 | 0 | 1237 | - |2209k| 0 | 31 | 35 | 424 | 35 | 429 | 5 | 0 | 42 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.50 c 1.3s| 1 | 0 | 1294 | - |2204k| 0 | 24 | 35 | 423 | 35 | 429 | 5 | 0 | 52 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.55 c 1.4s| 1 | 0 | 1294 | - |2200k| 0 | - | 35 | 423 | 35 | 429 | 5 | 0 | 59 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.55 c (run 2, node 1) restarting after 10 global fixings of integer variables
1.49/1.55 c
1.49/1.55 c (restart) converted 5 cuts from the global cut pool into linear constraints
1.49/1.55 c
1.49/1.55 c presolving:
1.49/1.56 c (round 1) 10 del vars, 224 del conss, 0 chg bounds, 18 chg sides, 96 chg coeffs, 5 upgd conss, 4494 impls, 76 clqs
1.49/1.57 c (round 2) 10 del vars, 231 del conss, 0 chg bounds, 20 chg sides, 127 chg coeffs, 5 upgd conss, 4494 impls, 77 clqs
1.49/1.57 c (round 3) 10 del vars, 234 del conss, 0 chg bounds, 23 chg sides, 154 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.57 c (round 4) 10 del vars, 234 del conss, 0 chg bounds, 23 chg sides, 162 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.58 c (round 5) 10 del vars, 234 del conss, 0 chg bounds, 24 chg sides, 171 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.58 c (round 6) 10 del vars, 234 del conss, 0 chg bounds, 24 chg sides, 175 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.58 c (round 7) 10 del vars, 234 del conss, 0 chg bounds, 24 chg sides, 176 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.58 c (round 8) 10 del vars, 234 del conss, 0 chg bounds, 24 chg sides, 177 chg coeffs, 5 upgd conss, 4494 impls, 78 clqs
1.49/1.59 c presolving (9 rounds):
1.49/1.59 c 10 deleted vars, 234 deleted constraints, 0 tightened bounds, 0 added holes, 24 changed sides, 177 changed coefficients
1.49/1.59 c 4494 implications, 78 cliques
1.49/1.59 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 218 constraints
1.49/1.59 c 9 constraints of type <knapsack>
1.49/1.59 c 50 constraints of type <setppc>
1.49/1.59 c 159 constraints of type <logicor>
1.49/1.59 c transformed objective value is always integral (scale: 1)
1.49/1.59 c Presolving Time: 0.18
1.49/1.59 c
1.49/1.59 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.59 c 1.4s| 1 | 0 | 1307 | - |1930k| 0 | 0 | 25 | 218 | 25 | 218 | 0 | 0 | 59 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.59 c 1.4s| 1 | 0 | 1307 | - |1929k| 0 | 0 | 25 | 218 | 25 | 200 | 0 | 0 | 59 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.59 o -6
1.49/1.59 c * 1.4s| 1 | 0 | 1307 | - |1930k| 0 | - | 25 | 218 | 25 | 200 | 0 | 0 | 59 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.49/1.59 c
1.49/1.59 c SCIP Status : problem is solved [optimal solution found]
1.49/1.59 c Solving Time (sec) : 1.38
1.49/1.59 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.49/1.59 c Primal Bound : -6.00000000000000e+00 (8 solutions)
1.49/1.59 c Dual Bound : -6.00000000000000e+00
1.49/1.59 c Gap : 0.00 %
1.49/1.59 s OPTIMUM FOUND
1.49/1.59 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.49/1.59 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.49/1.59 c SCIP Status : problem is solved [optimal solution found]
1.49/1.59 c Solving Time : 1.38
1.49/1.59 c Original Problem :
1.49/1.59 c Problem name : HOME/instance-2665267-1276663558.opb
1.49/1.59 c Variables : 799 (799 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.59 c Constraints : 799 initial, 799 maximal
1.49/1.59 c Presolved Problem :
1.49/1.59 c Problem name : t_HOME/instance-2665267-1276663558.opb
1.49/1.59 c Variables : 25 (25 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.59 c Constraints : 218 initial, 218 maximal
1.49/1.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.59 c trivial : 0.00 25 0 0 0 0 0 0 0
1.49/1.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c probing : 0.01 0 0 0 0 0 0 0 0
1.49/1.59 c knapsack : 0.03 0 0 0 0 0 2 26 277
1.49/1.59 c setppc : 0.01 0 0 0 0 0 53 0 0
1.49/1.59 c linear : 0.00 749 0 0 749 0 83 27 0
1.49/1.59 c logicor : 0.02 0 0 0 0 0 591 0 0
1.49/1.59 c root node : - 26 - - 26 - - - -
1.49/1.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.59 c integral : 0 0 0 6 0 0 25 0 0 0
1.49/1.59 c knapsack : 9 2 4 0 0 0 0 0 0 0
1.49/1.59 c setppc : 50 2 4 0 0 0 0 0 0 0
1.49/1.59 c logicor : 159 24 103 1 0 0 0 1 0 0
1.49/1.59 c countsols : 0 0 0 1 0 0 0 0 0 0
1.49/1.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.59 c integral : 0.37 0.00 0.00 0.37 0.00
1.49/1.59 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c setppc : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c logicor : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c Propagators : Time Calls Cutoffs DomReds
1.49/1.59 c vbounds : 0.00 4 0 0
1.49/1.59 c rootredcost : 0.00 0 0 0
1.49/1.59 c pseudoobj : 0.00 23 0 0
1.49/1.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.59 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.59 c applied globally : - - - 0 0.0 - - -
1.49/1.59 c applied locally : - - - 0 0.0 - - -
1.49/1.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.59 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.59 c redcost : 0.00 24 0 1 0 0
1.49/1.59 c impliedbounds : 0.00 23 0 0 2 0
1.49/1.59 c intobj : 0.00 0 0 0 0 0
1.49/1.59 c cgmip : 0.00 0 0 0 0 0
1.49/1.59 c gomory : 0.31 23 0 0 5275 0
1.49/1.59 c strongcg : 0.24 21 0 0 5482 0
1.49/1.59 c cmir : 0.03 11 0 0 0 0
1.49/1.59 c flowcover : 0.04 11 0 0 0 0
1.49/1.59 c clique : 0.02 23 0 0 193 0
1.49/1.59 c zerohalf : 0.00 0 0 0 0 0
1.49/1.59 c mcf : 0.00 2 0 0 0 0
1.49/1.59 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.59 c Pricers : Time Calls Vars
1.49/1.59 c problem variables: 0.00 0 0
1.49/1.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.59 c relpscost : 0.37 5 0 25 0 0 0
1.49/1.59 c pscost : 0.00 0 0 0 0 0 0
1.49/1.59 c inference : 0.00 0 0 0 0 0 0
1.49/1.59 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.59 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.59 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c random : 0.00 0 0 0 0 0 0
1.49/1.59 c Primal Heuristics : Time Calls Found
1.49/1.59 c LP solutions : 0.00 - 1
1.49/1.59 c pseudo solutions : 0.00 - 0
1.49/1.59 c oneopt : 0.00 2 1
1.49/1.59 c trivial : 0.00 2 2
1.49/1.59 c simplerounding : 0.00 28 1
1.49/1.59 c zirounding : 0.00 1 1
1.49/1.59 c rounding : 0.00 28 1
1.49/1.59 c shifting : 0.01 28 1
1.49/1.59 c intshifting : 0.00 0 0
1.49/1.59 c twoopt : 0.00 0 0
1.49/1.59 c fixandinfer : 0.00 0 0
1.49/1.59 c feaspump : 0.00 0 0
1.49/1.59 c coefdiving : 0.00 0 0
1.49/1.59 c pscostdiving : 0.00 0 0
1.49/1.59 c fracdiving : 0.00 0 0
1.49/1.59 c veclendiving : 0.00 0 0
1.49/1.59 c intdiving : 0.00 0 0
1.49/1.59 c actconsdiving : 0.00 0 0
1.49/1.59 c objpscostdiving : 0.00 0 0
1.49/1.59 c rootsoldiving : 0.00 0 0
1.49/1.59 c linesearchdiving : 0.00 0 0
1.49/1.59 c guideddiving : 0.00 0 0
1.49/1.59 c octane : 0.00 0 0
1.49/1.59 c rens : 0.00 0 0
1.49/1.59 c rins : 0.00 0 0
1.49/1.59 c localbranching : 0.00 0 0
1.49/1.59 c mutation : 0.00 0 0
1.49/1.59 c crossover : 0.00 0 0
1.49/1.59 c dins : 0.00 0 0
1.49/1.59 c undercover : 0.00 0 0
1.49/1.59 c nlp : 0.00 0 0
1.49/1.59 c trysol : 0.00 0 0
1.49/1.59 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.59 c primal LP : 0.01 0 0 0.00 0.00
1.49/1.59 c dual LP : 0.13 29 1307 45.07 10053.85
1.49/1.59 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.59 c barrier LP : 0.00 0 0 0.00 -
1.49/1.59 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.59 c strong branching : 0.37 59 5376 91.12 14529.73
1.49/1.59 c (at root node) : - 59 5376 91.12 -
1.49/1.59 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.59 c B&B Tree :
1.49/1.59 c number of runs : 3
1.49/1.59 c nodes : 1
1.49/1.59 c nodes (total) : 3
1.49/1.59 c nodes left : 0
1.49/1.59 c max depth : 0
1.49/1.59 c max depth (total): 0
1.49/1.59 c backtracks : 0 (0.0%)
1.49/1.59 c delayed cutoffs : 0
1.49/1.59 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.49/1.59 c avg switch length: 2.00
1.49/1.59 c switching time : 0.00
1.49/1.59 c Solution :
1.49/1.59 c Solutions found : 8 (5 improvements)
1.49/1.59 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.49/1.59 c Primal Bound : -6.00000000000000e+00 (in run 3, after 1 nodes, 1.38 seconds, depth 0, found by <relaxation>)
1.49/1.59 c Dual Bound : -6.00000000000000e+00
1.49/1.59 c Gap : 0.00 %
1.49/1.59 c Root Dual Bound : -6.00000000000000e+00
1.49/1.59 c Root Iterations : 1307
1.59/1.60 c Time complete: 1.6.