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-2665260-1276662671.opb>
0.00/0.01 c original problem has 790 variables (790 bin, 0 int, 0 impl, 0 cont) and 790 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.09/0.19 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.19/0.21 c presolving (2 rounds):
0.19/0.21 c 740 deleted vars, 50 deleted constraints, 740 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.21 c 4440 implications, 0 cliques
0.19/0.21 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 740 constraints
0.19/0.21 c 740 constraints of type <logicor>
0.19/0.21 c transformed objective value is always integral (scale: 1)
0.19/0.21 c Presolving Time: 0.10
0.19/0.21 c - non default parameters ----------------------------------------------------------------------
0.19/0.21 c # SCIP version 1.2.1.2
0.19/0.21 c
0.19/0.21 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.21 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c conflict/interconss = 0
0.19/0.22 c
0.19/0.22 c # should binary conflicts be preferred?
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c conflict/preferbinary = TRUE
0.19/0.22 c
0.19/0.22 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22 c constraints/agelimit = 1
0.19/0.22 c
0.19/0.22 c # should enforcement of pseudo solution be disabled?
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/disableenfops = TRUE
0.19/0.22 c
0.19/0.22 c # frequency for displaying node information lines
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.22 c display/freq = 10000
0.19/0.22 c
0.19/0.22 c # maximal time in seconds to run
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/time = 1799.99
0.19/0.22 c
0.19/0.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/memory = 1620
0.19/0.22 c
0.19/0.22 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c lp/solvefreq = 0
0.19/0.22 c
0.19/0.22 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.22 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.22 c lp/pricing = a
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify inequalities
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/linear/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify knapsacks
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # priority of node selection rule <dfs> in standard mode
0.19/0.22 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.22 c nodeselection/dfs/stdpriority = 1000000
0.19/0.22 c
0.19/0.22 c -----------------------------------------------------------------------------------------------
0.19/0.22 c start solving
0.19/0.22 c
0.19/0.22 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.22 c t 0.1s| 1 | 0 | 50 | - |2197k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.19/0.22 o -1
0.19/0.22 c R 0.1s| 1 | 0 | 50 | - |2198k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.19/0.22 o -2
0.19/0.22 c s 0.1s| 1 | 0 | 50 | - |2198k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.19/0.24 c 0.1s| 1 | 0 | 84 | - |2204k| 0 | 40 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.000000e+01 |-2.000000e+00 | 90.00%
0.19/0.24 o -4
0.19/0.24 c b 0.1s| 1 | 0 | 84 | - |2205k| 0 | 40 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.000000e+01 |-4.000000e+00 | 80.00%
0.19/0.27 c 0.1s| 1 | 0 | 130 | - |2209k| 0 | 32 | 50 | 740 | 50 | 747 | 7 | 0 | 0 |-1.600000e+01 |-4.000000e+00 | 75.00%
0.29/0.30 c 0.2s| 1 | 0 | 208 | - |2215k| 0 | 23 | 50 | 740 | 50 | 754 | 14 | 0 | 0 |-1.150000e+01 |-4.000000e+00 | 65.22%
0.29/0.33 c 0.2s| 1 | 0 | 267 | - |2220k| 0 | 28 | 50 | 740 | 50 | 762 | 22 | 0 | 0 |-1.028571e+01 |-4.000000e+00 | 61.11%
0.29/0.38 c 0.3s| 1 | 0 | 325 | - |2232k| 0 | 27 | 50 | 740 | 50 | 769 | 29 | 0 | 0 |-9.666667e+00 |-4.000000e+00 | 58.62%
0.39/0.44 c 0.3s| 1 | 0 | 374 | - |2384k| 0 | 31 | 50 | 740 | 50 | 778 | 38 | 0 | 0 |-8.851852e+00 |-4.000000e+00 | 54.81%
0.49/0.51 c 0.4s| 1 | 0 | 395 | - |2435k| 0 | 30 | 50 | 740 | 50 | 784 | 44 | 0 | 0 |-8.000000e+00 |-4.000000e+00 | 50.00%
0.49/0.51 o -4
0.49/0.51 c s 0.4s| 1 | 0 | 395 | - |2435k| 0 | 30 | 50 | 740 | 50 | 784 | 44 | 0 | 0 |-8.000000e+00 |-4.000000e+00 | 50.00%
0.49/0.58 c 0.5s| 1 | 0 | 469 | - |2626k| 0 | 32 | 50 | 740 | 50 | 793 | 53 | 0 | 0 |-8.000000e+00 |-4.000000e+00 | 50.00%
0.49/0.58 o -5
0.49/0.58 c b 0.5s| 1 | 0 | 469 | - |2627k| 0 | 32 | 50 | 740 | 50 | 793 | 53 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.59/0.69 c 0.6s| 1 | 0 | 533 | - |3208k| 0 | 35 | 50 | 740 | 50 | 801 | 61 | 0 | 0 |-7.844626e+00 |-5.000000e+00 | 36.26%
0.79/0.80 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.80 c 0.7s| 1 | 0 | 578 | - |3960k| 0 | 36 | 50 | 740 | 50 | 808 | 68 | 0 | 0 |-7.677820e+00 |-5.000000e+00 | 34.88%
0.79/0.89 c 0.8s| 1 | 0 | 606 | - |4258k| 0 | 39 | 50 | 740 | 50 | 119 | 73 | 0 | 0 |-7.580245e+00 |-5.000000e+00 | 34.04%
0.89/0.90 c 0.8s| 1 | 0 | 638 | - |4325k| 0 | 40 | 50 | 740 | 50 | 127 | 81 | 0 | 0 |-7.463926e+00 |-5.000000e+00 | 33.01%
0.89/0.92 c 0.8s| 1 | 0 | 681 | - |4432k| 0 | 39 | 50 | 740 | 50 | 135 | 89 | 0 | 0 |-7.359224e+00 |-5.000000e+00 | 32.06%
0.89/0.94 c 0.8s| 1 | 0 | 717 | - |4530k| 0 | 43 | 50 | 740 | 50 | 143 | 97 | 0 | 0 |-7.305669e+00 |-5.000000e+00 | 31.56%
0.89/0.96 c 0.8s| 1 | 0 | 754 | - |4753k| 0 | 44 | 50 | 740 | 50 | 149 | 103 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.98 c 0.8s| 1 | 0 | 776 | - |4972k| 0 | 46 | 50 | 740 | 50 | 157 | 111 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/1.00 c 0.9s| 1 | 0 | 803 | - |5218k| 0 | 46 | 50 | 740 | 50 | 110 | 118 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.00/1.02 c 0.9s| 1 | 0 | 840 | - |5379k| 0 | 45 | 50 | 740 | 50 | 114 | 122 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.00/1.04 c 0.9s| 1 | 0 | 870 | - |5539k| 0 | 45 | 50 | 740 | 50 | 122 | 130 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.00/1.06 c 0.9s| 1 | 0 | 912 | - |5717k| 0 | 48 | 50 | 740 | 50 | 131 | 139 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.19/1.27 c 1.1s| 1 | 0 | 973 | - |5713k| 0 | 42 | 50 | 740 | 50 | 131 | 139 | 0 | 18 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.19/1.29 c 1.1s| 1 | 0 | 1023 | - |5722k| 0 | 39 | 50 | 740 | 50 | 139 | 147 | 0 | 18 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.39/1.44 c 1.3s| 1 | 0 | 1077 | - |5717k| 0 | 30 | 50 | 740 | 50 | 113 | 147 | 0 | 37 |-6.947368e+00 |-5.000000e+00 | 28.03%
1.39/1.45 c 1.3s| 1 | 0 | 1109 | - |5801k| 0 | 24 | 50 | 740 | 50 | 119 | 153 | 0 | 37 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.39/1.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.46 c 1.3s| 1 | 0 | 1109 | - |5797k| 0 | - | 50 | 740 | 50 | 119 | 153 | 0 | 41 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.39/1.46 c (run 1, node 1) restarting after 14 global fixings of integer variables
1.39/1.46 c
1.39/1.46 c (restart) converted 119 cuts from the global cut pool into linear constraints
1.39/1.46 c
1.39/1.46 c presolving:
1.39/1.47 c (round 1) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 4440 impls, 104 clqs
1.39/1.47 c (round 2) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 0 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.39/1.48 c (round 3) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 12 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.39/1.49 c (round 4) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 23 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.39/1.49 c (round 5) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 33 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.39/1.49 c (round 6) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 41 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.39/1.50 c (round 7) 14 del vars, 402 del conss, 0 chg bounds, 20 chg sides, 43 chg coeffs, 95 upgd conss, 4440 impls, 104 clqs
1.49/1.50 c presolving (8 rounds):
1.49/1.50 c 14 deleted vars, 402 deleted constraints, 0 tightened bounds, 0 added holes, 20 changed sides, 43 changed coefficients
1.49/1.50 c 4440 implications, 104 cliques
1.49/1.50 c presolved problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 457 constraints
1.49/1.50 c 11 constraints of type <knapsack>
1.49/1.50 c 84 constraints of type <setppc>
1.49/1.50 c 362 constraints of type <logicor>
1.49/1.50 c transformed objective value is always integral (scale: 1)
1.49/1.50 c Presolving Time: 0.12
1.49/1.50 c
1.49/1.50 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.50 c 1.3s| 1 | 0 | 1139 | - |2103k| 0 | 19 | 36 | 457 | 36 | 457 | 0 | 0 | 41 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.49/1.54 c 1.4s| 1 | 0 | 1154 | - |2127k| 0 | 18 | 36 | 457 | 36 | 462 | 5 | 0 | 41 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.62 c 1.4s| 1 | 0 | 1165 | - |2125k| 0 | 16 | 36 | 457 | 36 | 462 | 5 | 0 | 59 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.63 c 1.4s| 1 | 0 | 1166 | - |2124k| 0 | 13 | 36 | 457 | 36 | 462 | 5 | 0 | 62 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.63 c 1.4s| 1 | 2 | 1166 | - |2124k| 0 | 13 | 36 | 457 | 36 | 462 | 5 | 0 | 62 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.63 c (run 2, node 1) restarting after 4 global fixings of integer variables
1.59/1.63 c
1.59/1.63 c (restart) converted 3 cuts from the global cut pool into linear constraints
1.59/1.63 c
1.59/1.63 c presolving:
1.59/1.64 c (round 1) 4 del vars, 93 del conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 3 upgd conss, 4440 impls, 100 clqs
1.59/1.65 c (round 2) 4 del vars, 94 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 3 upgd conss, 4440 impls, 100 clqs
1.59/1.65 c (round 3) 4 del vars, 94 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 3 upgd conss, 4440 impls, 100 clqs
1.59/1.65 c (round 4) 4 del vars, 94 del conss, 0 chg bounds, 0 chg sides, 31 chg coeffs, 3 upgd conss, 4440 impls, 100 clqs
1.59/1.66 c presolving (5 rounds):
1.59/1.66 c 4 deleted vars, 94 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 31 changed coefficients
1.59/1.66 c 4440 implications, 100 cliques
1.59/1.66 c presolved problem has 32 variables (32 bin, 0 int, 0 impl, 0 cont) and 366 constraints
1.59/1.66 c 11 constraints of type <knapsack>
1.59/1.66 c 77 constraints of type <setppc>
1.59/1.66 c 278 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.14
1.59/1.66 c
1.59/1.66 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.66 c 1.5s| 1 | 0 | 1198 | - |2036k| 0 | 15 | 32 | 366 | 32 | 366 | 0 | 0 | 62 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.69 c 1.5s| 1 | 0 | 1199 | - |2045k| 0 | 0 | 32 | 366 | 32 | 370 | 4 | 0 | 62 |-6.000000e+00 |-5.000000e+00 | 16.67%
1.59/1.69 o -6
1.59/1.69 c * 1.5s| 1 | 0 | 1199 | - |2046k| 0 | - | 32 | 366 | 32 | 370 | 4 | 0 | 62 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.59/1.69 c
1.59/1.69 c SCIP Status : problem is solved [optimal solution found]
1.59/1.69 c Solving Time (sec) : 1.49
1.59/1.69 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.59/1.69 c Primal Bound : -6.00000000000000e+00 (15 solutions)
1.59/1.69 c Dual Bound : -6.00000000000000e+00
1.59/1.69 c Gap : 0.00 %
1.59/1.69 s OPTIMUM FOUND
1.59/1.69 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.59/1.69 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.59/1.69 c SCIP Status : problem is solved [optimal solution found]
1.59/1.69 c Solving Time : 1.49
1.59/1.69 c Original Problem :
1.59/1.69 c Problem name : HOME/instance-2665260-1276662671.opb
1.59/1.69 c Variables : 790 (790 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.69 c Constraints : 790 initial, 790 maximal
1.59/1.69 c Presolved Problem :
1.59/1.69 c Problem name : t_HOME/instance-2665260-1276662671.opb
1.59/1.69 c Variables : 32 (32 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.69 c Constraints : 366 initial, 366 maximal
1.59/1.69 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.69 c trivial : 0.00 18 0 0 0 0 0 0 0
1.59/1.69 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.69 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.69 c knapsack : 0.02 0 0 0 0 0 0 0 74
1.59/1.69 c setppc : 0.00 0 0 0 0 0 9 0 0
1.59/1.69 c linear : 0.01 740 0 0 740 0 74 20 0
1.59/1.69 c logicor : 0.01 0 0 0 0 0 463 0 0
1.59/1.69 c root node : - 18 - - 18 - - - -
1.59/1.69 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.69 c integral : 0 0 0 7 0 0 18 0 0 2
1.59/1.69 c knapsack : 11 2 4 0 0 0 0 0 0 0
1.59/1.69 c setppc : 77 2 4 0 0 0 0 0 0 0
1.59/1.69 c logicor : 278 24 103 1 0 0 0 0 0 0
1.59/1.69 c countsols : 0 0 0 1 0 0 0 0 0 0
1.59/1.69 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.69 c integral : 0.42 0.00 0.00 0.42 0.00
1.59/1.69 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c setppc : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c logicor : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.69 c Propagators : Time Calls Cutoffs DomReds
1.59/1.69 c vbounds : 0.00 4 0 0
1.59/1.69 c rootredcost : 0.00 0 0 0
1.59/1.69 c pseudoobj : 0.00 26 0 0
1.59/1.69 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.69 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.69 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.69 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.69 c applied globally : - - - 0 0.0 - - -
1.59/1.69 c applied locally : - - - 0 0.0 - - -
1.59/1.69 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.69 c cut pool : 0.00 0 - - 0 - (maximal pool size: 10)
1.59/1.69 c redcost : 0.00 24 0 0 0 0
1.59/1.69 c impliedbounds : 0.00 24 0 0 0 0
1.59/1.69 c intobj : 0.00 0 0 0 0 0
1.59/1.69 c cgmip : 0.00 0 0 0 0 0
1.59/1.69 c gomory : 0.37 24 0 0 4649 0
1.59/1.69 c strongcg : 0.23 22 0 0 5889 0
1.59/1.69 c cmir : 0.05 12 0 0 0 0
1.59/1.69 c flowcover : 0.03 12 0 0 0 0
1.59/1.69 c clique : 0.00 24 0 0 203 0
1.59/1.69 c zerohalf : 0.00 0 0 0 0 0
1.59/1.69 c mcf : 0.00 3 0 0 0 0
1.59/1.69 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.69 c Pricers : Time Calls Vars
1.59/1.69 c problem variables: 0.00 0 0
1.59/1.69 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.69 c relpscost : 0.42 6 0 18 0 0 2
1.59/1.69 c pscost : 0.00 0 0 0 0 0 0
1.59/1.69 c inference : 0.00 0 0 0 0 0 0
1.59/1.69 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.69 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.69 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.69 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.69 c random : 0.00 0 0 0 0 0 0
1.59/1.69 c Primal Heuristics : Time Calls Found
1.59/1.69 c LP solutions : 0.00 - 1
1.59/1.69 c pseudo solutions : 0.00 - 0
1.59/1.69 c oneopt : 0.00 4 2
1.59/1.69 c trivial : 0.00 2 2
1.59/1.69 c simplerounding : 0.00 30 2
1.59/1.69 c zirounding : 0.00 1 1
1.59/1.69 c rounding : 0.00 30 1
1.59/1.69 c shifting : 0.01 30 6
1.59/1.69 c intshifting : 0.00 0 0
1.59/1.69 c twoopt : 0.00 0 0
1.59/1.69 c fixandinfer : 0.00 0 0
1.59/1.69 c feaspump : 0.00 0 0
1.59/1.69 c coefdiving : 0.00 0 0
1.59/1.69 c pscostdiving : 0.00 0 0
1.59/1.69 c fracdiving : 0.00 0 0
1.59/1.69 c veclendiving : 0.00 0 0
1.59/1.69 c intdiving : 0.00 0 0
1.59/1.69 c actconsdiving : 0.00 0 0
1.59/1.69 c objpscostdiving : 0.00 0 0
1.59/1.69 c rootsoldiving : 0.00 0 0
1.59/1.69 c linesearchdiving : 0.00 0 0
1.59/1.69 c guideddiving : 0.00 0 0
1.59/1.69 c octane : 0.00 0 0
1.59/1.69 c rens : 0.01 0 0
1.59/1.69 c rins : 0.00 0 0
1.59/1.69 c localbranching : 0.00 0 0
1.59/1.69 c mutation : 0.00 0 0
1.59/1.69 c crossover : 0.00 0 0
1.59/1.69 c dins : 0.00 0 0
1.59/1.69 c undercover : 0.00 0 0
1.59/1.69 c nlp : 0.00 0 0
1.59/1.69 c trysol : 0.00 0 0
1.59/1.69 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.69 c primal LP : 0.00 0 0 0.00 -
1.59/1.69 c dual LP : 0.17 31 1199 38.68 7052.94
1.59/1.69 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.69 c barrier LP : 0.00 0 0 0.00 -
1.59/1.69 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.69 c strong branching : 0.42 62 6559 105.79 15616.67
1.59/1.69 c (at root node) : - 62 6559 105.79 -
1.59/1.69 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.69 c B&B Tree :
1.59/1.69 c number of runs : 3
1.59/1.69 c nodes : 1
1.59/1.69 c nodes (total) : 3
1.59/1.69 c nodes left : 0
1.59/1.69 c max depth : 0
1.59/1.69 c max depth (total): 0
1.59/1.69 c backtracks : 0 (0.0%)
1.59/1.69 c delayed cutoffs : 0
1.59/1.69 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.59/1.69 c avg switch length: 2.00
1.59/1.69 c switching time : 0.00
1.59/1.69 c Solution :
1.59/1.69 c Solutions found : 15 (7 improvements)
1.59/1.69 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.59/1.69 c Primal Bound : -6.00000000000000e+00 (in run 3, after 1 nodes, 1.49 seconds, depth 0, found by <relaxation>)
1.59/1.69 c Dual Bound : -6.00000000000000e+00
1.59/1.69 c Gap : 0.00 %
1.59/1.69 c Root Dual Bound : -6.00000000000000e+00
1.59/1.69 c Root Iterations : 1199
1.69/1.70 c Time complete: 1.69.