0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3737219-1338725542.opb>
0.00/0.01 c original problem has 788 variables (788 bin, 0 int, 0 impl, 0 cont) and 838 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 738 del vars, 100 del conss, 0 add conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2952 impls, 0 clqs
0.00/0.04 c (round 2) 738 del vars, 100 del conss, 0 add conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 738 upgd conss, 2952 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 738 deleted vars, 100 deleted constraints, 0 added constraints, 738 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 4426 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 738 constraints
0.00/0.04 c 738 constraints of type <setppc>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.5
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1797
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/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.00/0.05 c t 0.0s| 1 | 0 | 51 | - |2567k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.05 o -1
0.00/0.05 c R 0.0s| 1 | 0 | 51 | - |2568k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.05 o -2
0.00/0.05 c s 0.0s| 1 | 0 | 51 | - |2569k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.05/0.08 o -5
0.05/0.08 c y 0.1s| 1 | 0 | 51 | - |2620k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-5.000000e+00 | 80.00%
0.05/0.09 c 0.1s| 1 | 0 | 116 | - |2508k| 0 | 32 | 50 | 634 | 50 | 637 | 4 | 0 | 0 |-1.600000e+01 |-5.000000e+00 | 68.75%
0.09/0.10 c 0.1s| 1 | 0 | 174 | - |2514k| 0 | 27 | 50 | 634 | 50 | 642 | 9 | 0 | 0 |-1.350000e+01 |-5.000000e+00 | 62.96%
0.09/0.11 c 0.1s| 1 | 0 | 197 | - |2520k| 0 | 25 | 50 | 634 | 50 | 650 | 17 | 0 | 0 |-1.250000e+01 |-5.000000e+00 | 60.00%
0.09/0.13 c 0.1s| 1 | 0 | 256 | - |2526k| 0 | 22 | 50 | 634 | 50 | 657 | 24 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.09/0.14 c 0.1s| 1 | 0 | 297 | - |2535k| 0 | 25 | 50 | 634 | 50 | 662 | 29 | 0 | 0 |-9.600000e+00 |-5.000000e+00 | 47.92%
0.09/0.16 c 0.2s| 1 | 0 | 343 | - |2566k| 0 | 25 | 50 | 634 | 50 | 668 | 35 | 0 | 0 |-8.875000e+00 |-5.000000e+00 | 43.66%
0.09/0.18 c 0.2s| 1 | 0 | 362 | - |2591k| 0 | 29 | 50 | 634 | 50 | 675 | 42 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.18/0.21 c 0.2s| 1 | 0 | 394 | - |2994k| 0 | 33 | 50 | 634 | 50 | 686 | 53 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.18/0.25 c 0.3s| 1 | 0 | 425 | - |3687k| 0 | 34 | 50 | 634 | 50 | 693 | 60 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.29/0.30 c 0.3s| 1 | 0 | 458 | - |4284k| 0 | 37 | 50 | 634 | 50 | 137 | 67 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.29/0.31 c 0.3s| 1 | 0 | 497 | - |4627k| 0 | 33 | 50 | 634 | 50 | 144 | 74 | 0 | 0 |-7.889262e+00 |-5.000000e+00 | 36.62%
0.29/0.32 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.32 c 0.3s| 1 | 0 | 524 | - |4911k| 0 | 38 | 50 | 634 | 50 | 151 | 81 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.33 c 0.3s| 1 | 0 | 539 | - |4988k| 0 | 39 | 50 | 634 | 50 | 161 | 91 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.33 c 0.3s| 1 | 0 | 559 | - |5086k| 0 | 42 | 50 | 634 | 50 | 168 | 98 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.34 c 0.3s| 1 | 0 | 575 | - |5205k| 0 | 41 | 50 | 634 | 50 | 174 | 104 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.35 c 0.3s| 1 | 0 | 600 | - |5329k| 0 | 43 | 50 | 634 | 50 | 107 | 111 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.36 c 0.4s| 1 | 0 | 639 | - |5375k| 0 | 42 | 50 | 634 | 50 | 116 | 120 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.38/0.42 c 0.4s| 1 | 0 | 686 | - |5277k| 0 | 37 | 50 | 489 | 50 | 116 | 120 | 0 | 16 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.38/0.43 c 0.4s| 1 | 0 | 703 | - |5375k| 0 | 34 | 50 | 489 | 50 | 120 | 124 | 0 | 16 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.38/0.46 c 0.5s| 1 | 0 | 703 | - |5372k| 0 | - | 50 | 489 | 50 | 120 | 124 | 0 | 29 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.38/0.46 c (run 1, node 1) restarting after 11 global fixings of integer variables
0.38/0.46 c
0.38/0.46 c (restart) converted 113 cuts from the global cut pool into linear constraints
0.38/0.46 c
0.38/0.47 c presolving:
0.38/0.47 c (round 1) 11 del vars, 80 del conss, 0 add conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 4426 impls, 100 clqs
0.38/0.47 c (round 2) 11 del vars, 80 del conss, 0 add conss, 0 chg bounds, 5 chg sides, 0 chg coeffs, 107 upgd conss, 4426 impls, 100 clqs
0.38/0.47 c (round 3) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 28 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.47 c (round 4) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 41 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.48 c (round 5) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 47 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.48 c (round 6) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 55 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.48 c (round 7) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 57 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.48 c (round 8) 11 del vars, 445 del conss, 1 add conss, 0 chg bounds, 6 chg sides, 58 chg coeffs, 107 upgd conss, 4428 impls, 100 clqs
0.38/0.48 c presolving (9 rounds):
0.38/0.48 c 11 deleted vars, 445 deleted constraints, 1 added constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 58 changed coefficients
0.38/0.48 c 4428 implications, 100 cliques
0.38/0.48 c presolved problem has 39 variables (39 bin, 0 int, 0 impl, 0 cont) and 158 constraints
0.38/0.48 c 11 constraints of type <knapsack>
0.38/0.48 c 147 constraints of type <setppc>
0.38/0.48 c transformed objective value is always integral (scale: 1)
0.38/0.48 c Presolving Time: 0.04
0.38/0.48 c
0.38/0.48 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.38/0.48 c 0.5s| 1 | 0 | 796 | - |2303k| 0 | 34 | 39 | 158 | 39 | 158 | 0 | 0 | 29 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.38/0.49 c 0.5s| 1 | 0 | 814 | - |2521k| 0 | 36 | 39 | 158 | 39 | 162 | 4 | 0 | 29 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.48/0.51 c 0.5s| 1 | 0 | 846 | - |2513k| 0 | 30 | 39 | 139 | 39 | 162 | 4 | 0 | 36 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.48/0.53 c 0.5s| 1 | 0 | 846 | - |2508k| 0 | - | 39 | 139 | 39 | 162 | 4 | 0 | 55 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.48/0.53 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.48/0.53 c
0.48/0.53 c (restart) converted 4 cuts from the global cut pool into linear constraints
0.48/0.53 c
0.48/0.53 c presolving:
0.48/0.53 c (round 1) 10 del vars, 15 del conss, 12 add conss, 0 chg bounds, 12 chg sides, 69 chg coeffs, 4 upgd conss, 4428 impls, 83 clqs
0.48/0.53 c (round 2) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 104 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 3) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 126 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 4) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 136 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 5) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 144 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 6) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 150 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 7) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 154 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 8) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 155 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c (round 9) 10 del vars, 62 del conss, 14 add conss, 0 chg bounds, 14 chg sides, 156 chg coeffs, 4 upgd conss, 4428 impls, 85 clqs
0.48/0.54 c presolving (10 rounds):
0.48/0.54 c 10 deleted vars, 62 deleted constraints, 14 added constraints, 0 tightened bounds, 0 added holes, 14 changed sides, 156 changed coefficients
0.48/0.54 c 4428 implications, 85 cliques
0.48/0.54 c presolved problem has 29 variables (29 bin, 0 int, 0 impl, 0 cont) and 95 constraints
0.48/0.54 c 12 constraints of type <knapsack>
0.48/0.54 c 83 constraints of type <setppc>
0.48/0.54 c transformed objective value is always integral (scale: 1)
0.48/0.54 c Presolving Time: 0.05
0.48/0.54 c
0.48/0.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.48/0.54 c 0.5s| 1 | 0 | 932 | - |2234k| 0 | 23 | 29 | 95 | 29 | 95 | 0 | 0 | 55 |-6.923077e+00 |-5.000000e+00 | 27.78%
0.48/0.55 c 0.5s| 1 | 0 | 949 | - |2255k| 0 | 20 | 29 | 95 | 29 | 102 | 7 | 0 | 55 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.48/0.56 c 0.6s| 1 | 0 | 961 | - |2253k| 0 | 23 | 29 | 93 | 29 | 102 | 7 | 0 | 75 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.48/0.56 c 0.6s| 1 | 0 | 964 | - |2249k| 0 | 20 | 29 | 89 | 29 | 102 | 7 | 0 | 81 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.48/0.56 c 0.6s| 1 | 2 | 964 | - |2250k| 0 | 20 | 29 | 89 | 29 | 102 | 7 | 0 | 81 |-6.000000e+00 |-5.000000e+00 | 16.67%
0.48/0.56 c (run 3, node 1) restarting after 5 global fixings of integer variables
0.48/0.56 c
0.48/0.56 c (restart) converted 4 cuts from the global cut pool into linear constraints
0.48/0.56 c
0.48/0.56 c presolving:
0.48/0.56 c (round 1) 5 del vars, 21 del conss, 4 add conss, 0 chg bounds, 4 chg sides, 40 chg coeffs, 4 upgd conss, 4428 impls, 62 clqs
0.48/0.57 c (round 2) 5 del vars, 30 del conss, 10 add conss, 0 chg bounds, 10 chg sides, 80 chg coeffs, 4 upgd conss, 4428 impls, 62 clqs
0.48/0.57 c (round 3) 5 del vars, 31 del conss, 11 add conss, 0 chg bounds, 11 chg sides, 95 chg coeffs, 4 upgd conss, 4428 impls, 62 clqs
0.48/0.57 c (round 4) 5 del vars, 31 del conss, 11 add conss, 0 chg bounds, 11 chg sides, 99 chg coeffs, 4 upgd conss, 4428 impls, 62 clqs
0.48/0.57 c presolving (5 rounds):
0.48/0.57 c 5 deleted vars, 31 deleted constraints, 11 added constraints, 0 tightened bounds, 0 added holes, 11 changed sides, 99 changed coefficients
0.48/0.57 c 4428 implications, 62 cliques
0.48/0.57 c presolved problem has 24 variables (24 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.48/0.57 c 12 constraints of type <knapsack>
0.48/0.57 c 61 constraints of type <setppc>
0.48/0.57 c transformed objective value is always integral (scale: 1)
0.48/0.57 c Presolving Time: 0.06
0.48/0.57 c
0.48/0.57 o -6
0.48/0.57 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.48/0.57 c * 0.6s| 1 | 0 | 1000 | - |2203k| 0 | - | 24 | 73 | 24 | 73 | 0 | 0 | 81 |-2.400000e+01 |-6.000000e+00 | 75.00%
0.48/0.57 c 0.6s| 1 | 0 | 1000 | - |2203k| 0 | - | 24 | 73 | 24 | 73 | 0 | 0 | 81 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.48/0.57 c
0.48/0.57 c SCIP Status : problem is solved [optimal solution found]
0.48/0.57 c Solving Time (sec) : 0.57
0.48/0.57 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.48/0.57 c Primal Bound : -6.00000000000000e+00 (7 solutions)
0.48/0.57 c Dual Bound : -6.00000000000000e+00
0.48/0.57 c Gap : 0.00 %
0.48/0.57 s OPTIMUM FOUND
0.48/0.57 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
0.48/0.57 v -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.48/0.57 c SCIP Status : problem is solved [optimal solution found]
0.48/0.57 c Total Time : 0.57
0.48/0.57 c solving : 0.57
0.48/0.57 c presolving : 0.06 (included in solving)
0.48/0.57 c reading : 0.01 (included in solving)
0.48/0.57 c Original Problem :
0.48/0.57 c Problem name : HOME/instance-3737219-1338725542.opb
0.48/0.57 c Variables : 788 (788 binary, 0 integer, 0 implicit integer, 0 continuous)
0.48/0.57 c Constraints : 838 initial, 838 maximal
0.48/0.57 c Presolved Problem :
0.48/0.57 c Problem name : t_HOME/instance-3737219-1338725542.opb
0.48/0.57 c Variables : 24 (24 binary, 0 integer, 0 implicit integer, 0 continuous)
0.48/0.57 c Constraints : 73 initial, 73 maximal
0.48/0.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.48/0.57 c trivial : 0.00 26 0 0 0 0 0 0 0 0
0.48/0.57 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.48/0.57 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.48/0.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.48/0.57 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.48/0.57 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.48/0.57 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.48/0.57 c knapsack : 0.02 0 0 0 0 0 1 26 26 313
0.48/0.57 c setppc : 0.01 0 0 0 0 0 531 0 0 0
0.48/0.57 c and : 0.02 0 0 0 0 0 0 0 0 0
0.48/0.57 c linear : 0.00 738 0 0 738 0 56 0 5 0
0.48/0.57 c pseudoboolean : 0.00 0 0 0 0 0 50 0 0 0
0.48/0.57 c root node : - 26 - - 26 - - - - -
0.48/0.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.48/0.57 c integral : 0 0 0 7 0 13 0 0 23 0 0 2
0.48/0.57 c knapsack : 12 2 6 0 0 0 0 0 0 0 0 0
0.48/0.57 c setppc : 61 21 61 0 0 7 0 0 0 1 0 0
0.48/0.57 c countsols : 0 0 0 0 0 9 0 0 0 0 0 0
0.48/0.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.48/0.57 c integral : 0.14 0.00 0.00 0.14 0.00 0.00 0.00
0.48/0.57 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.57 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.57 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.57 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.48/0.57 c vbounds : 0 0 0 0
0.48/0.57 c rootredcost : 0 0 0 0
0.48/0.57 c pseudoobj : 22 0 0 0
0.48/0.57 c Propagator Timings : TotalTime Propagate Resprop
0.48/0.57 c vbounds : 0.00 0.00 0.00
0.48/0.57 c rootredcost : 0.00 0.00 0.00
0.48/0.57 c pseudoobj : 0.00 0.00 0.00
0.48/0.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.48/0.57 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.48/0.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.48/0.57 c applied globally : - - - 0 0.0 - - -
0.48/0.57 c applied locally : - - - 0 0.0 - - -
0.48/0.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.48/0.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.48/0.57 c redcost : 0.00 20 0 0 0 0
0.48/0.57 c impliedbounds : 0.00 20 0 0 2 0
0.48/0.57 c intobj : 0.00 0 0 0 0 0
0.48/0.57 c gomory : 0.13 20 0 0 4054 0
0.48/0.57 c cgmip : 0.00 0 0 0 0 0
0.48/0.57 c closecuts : 0.00 0 0 0 0 0
0.48/0.57 c strongcg : 0.09 20 0 0 4603 0
0.48/0.57 c cmir : 0.01 12 0 0 0 0
0.48/0.57 c flowcover : 0.02 12 0 0 0 0
0.48/0.57 c clique : 0.01 20 0 0 174 0
0.48/0.57 c zerohalf : 0.00 0 0 0 0 0
0.48/0.57 c mcf : 0.00 3 0 0 0 0
0.48/0.57 c oddcycle : 0.00 0 0 0 0 0
0.48/0.57 c rapidlearning : 0.02 1 0 3 0 1
0.48/0.57 c Pricers : Time Calls Vars
0.48/0.57 c problem variables: 0.00 0 0
0.48/0.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.48/0.57 c relpscost : 0.14 7 0 23 0 0 2
0.48/0.57 c pscost : 0.00 0 0 0 0 0 0
0.48/0.57 c inference : 0.00 0 0 0 0 0 0
0.48/0.57 c mostinf : 0.00 0 0 0 0 0 0
0.48/0.57 c leastinf : 0.00 0 0 0 0 0 0
0.48/0.57 c fullstrong : 0.00 0 0 0 0 0 0
0.48/0.57 c allfullstrong : 0.00 0 0 0 0 0 0
0.48/0.57 c random : 0.00 0 0 0 0 0 0
0.48/0.57 c Primal Heuristics : Time Calls Found
0.48/0.57 c LP solutions : 0.00 - 0
0.48/0.57 c pseudo solutions : 0.00 - 0
0.48/0.57 c oneopt : 0.00 1 1
0.48/0.57 c trivial : 0.00 2 1
0.48/0.57 c shiftandpropagate: 0.00 0 0
0.48/0.57 c simplerounding : 0.00 27 0
0.48/0.57 c zirounding : 0.00 1 1
0.48/0.57 c rounding : 0.00 27 1
0.48/0.57 c shifting : 0.00 27 1
0.48/0.57 c intshifting : 0.00 0 0
0.48/0.57 c twoopt : 0.00 0 0
0.48/0.57 c fixandinfer : 0.00 0 0
0.48/0.57 c feaspump : 0.00 0 0
0.48/0.57 c clique : 0.00 0 0
0.48/0.57 c coefdiving : 0.00 0 0
0.48/0.57 c pscostdiving : 0.00 0 0
0.48/0.57 c fracdiving : 0.00 0 0
0.48/0.57 c veclendiving : 0.00 0 0
0.48/0.57 c intdiving : 0.00 0 0
0.48/0.57 c actconsdiving : 0.00 0 0
0.48/0.57 c objpscostdiving : 0.00 0 0
0.48/0.57 c rootsoldiving : 0.00 0 0
0.48/0.57 c linesearchdiving : 0.00 0 0
0.48/0.57 c guideddiving : 0.00 0 0
0.48/0.57 c octane : 0.00 0 0
0.48/0.57 c rens : 0.01 0 0
0.48/0.57 c rins : 0.00 0 0
0.48/0.57 c localbranching : 0.00 0 0
0.48/0.57 c mutation : 0.00 0 0
0.48/0.57 c crossover : 0.00 0 0
0.48/0.57 c dins : 0.00 0 0
0.48/0.57 c vbounds : 0.00 0 0
0.48/0.57 c undercover : 0.01 1 0
0.48/0.57 c subnlp : 0.00 0 0
0.48/0.57 c trysol : 0.00 0 0
0.48/0.57 c LP : Time Calls Iterations Iter/call Iter/sec
0.48/0.57 c primal LP : 0.00 0 0 0.00 -
0.48/0.57 c dual LP : 0.03 29 1000 34.48 31527.84
0.48/0.57 c lex dual LP : 0.00 0 0 0.00 -
0.48/0.57 c barrier LP : 0.00 0 0 0.00 -
0.48/0.57 c diving/probing LP: 0.00 0 0 0.00 -
0.48/0.57 c strong branching : 0.14 81 5066 62.54 36588.45
0.48/0.57 c (at root node) : - 81 5066 62.54 -
0.48/0.57 c conflict analysis: 0.00 0 0 0.00 -
0.48/0.57 c B&B Tree :
0.48/0.57 c number of runs : 4
0.48/0.57 c nodes : 1
0.48/0.57 c nodes (total) : 4
0.48/0.57 c nodes left : 0
0.48/0.57 c max depth : 0
0.48/0.57 c max depth (total): 0
0.48/0.57 c backtracks : 0 (0.0%)
0.48/0.57 c delayed cutoffs : 0
0.48/0.57 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.48/0.57 c avg switch length: 2.00
0.48/0.57 c switching time : 0.00
0.48/0.57 c Solution :
0.48/0.57 c Solutions found : 7 (5 improvements)
0.48/0.57 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.48/0.57 c Primal Bound : -6.00000000000000e+00 (in run 4, after 1 nodes, 0.57 seconds, depth 0, found by <relaxation>)
0.48/0.57 c Dual Bound : -6.00000000000000e+00
0.48/0.57 c Gap : 0.00 %
0.48/0.57 c Root Dual Bound : -6.00000000000000e+00
0.48/0.57 c Root Iterations : 1000
0.48/0.58 c Time complete: 0.57.