0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3692784-1338019052.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (0.0s) probing: 51/169 (30.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 112 | - | 884k| 0 | 43 | 169 | 112 | 169 | 73 | 0 | 39 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 2443 | - |1111k| 0 | 53 | 169 | 112 | 169 | 90 | 17 | 39 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 2499 | - |1430k| 0 | 62 | 169 | 112 | 169 | 100 | 27 | 39 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 2522 | - |1499k| 0 | 62 | 169 | 112 | 169 | 105 | 32 | 39 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 2546 | - |1533k| 0 | 61 | 169 | 112 | 169 | 109 | 36 | 39 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 2583 | - |1580k| 0 | 65 | 169 | 112 | 169 | 116 | 43 | 39 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 2600 | - |1589k| 0 | 66 | 169 | 112 | 169 | 120 | 47 | 39 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 2650 | - |1589k| 0 | 60 | 169 | 112 | 169 | 120 | 47 | 39 | 18 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.4s| 1 | 0 | 2698 | - |1972k| 0 | 56 | 169 | 112 | 169 | 126 | 53 | 39 | 18 | 0.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 2703 | - |1972k| 0 | 57 | 169 | 112 | 169 | 126 | 53 | 39 | 34 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 2740 | - |2111k| 0 | 57 | 169 | 112 | 169 | 131 | 58 | 39 | 34 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 2773 | - |2111k| 0 | 57 | 169 | 112 | 169 | 131 | 58 | 39 | 50 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 2813 | - |2167k| 0 | 55 | 169 | 112 | 169 | 136 | 63 | 39 | 50 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 2856 | - |2167k| 0 | 57 | 169 | 111 | 169 | 136 | 63 | 39 | 64 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 2917 | - |2327k| 0 | 55 | 169 | 111 | 169 | 116 | 69 | 39 | 64 | 0.000000e+00 | -- | Inf
0.69/0.75 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.75 c 0.8s| 1 | 0 | 2932 | - |2327k| 0 | 50 | 169 | 111 | 169 | 116 | 69 | 39 | 75 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 0 | 2983 | - |2633k| 0 | 56 | 169 | 111 | 169 | 120 | 73 | 39 | 75 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 2998 | - |2632k| 0 | 59 | 169 | 110 | 169 | 120 | 73 | 39 | 83 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 3052 | - |2923k| 0 | 57 | 169 | 110 | 169 | 125 | 78 | 39 | 83 | 0.000000e+00 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 3060 | - |2923k| 0 | 54 | 169 | 110 | 169 | 125 | 78 | 39 | 96 | 0.000000e+00 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 3091 | - |3031k| 0 | 54 | 169 | 110 | 169 | 101 | 80 | 39 | 96 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 3094 | - |3031k| 0 | 52 | 169 | 110 | 169 | 101 | 80 | 39 | 101 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 3140 | - |3091k| 0 | 58 | 169 | 110 | 169 | 105 | 84 | 39 | 101 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 3154 | - |3091k| 0 | 55 | 169 | 110 | 169 | 105 | 84 | 39 | 109 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 3196 | - |3110k| 0 | 57 | 169 | 110 | 169 | 112 | 91 | 39 | 109 | 0.000000e+00 | -- | Inf
0.99/1.01 c 1.0s| 1 | 0 | 3196 | - |3110k| 0 | - | 169 | 110 | 169 | 112 | 91 | 39 | 115 | 0.000000e+00 | -- | Inf
0.99/1.01 c (run 1, node 1) restarting after 38 global fixings of integer variables
0.99/1.01 c
0.99/1.01 c (restart) converted 39 cuts from the global cut pool into linear constraints
0.99/1.01 c
0.99/1.01 c presolving:
0.99/1.01 c (round 1) 38 del vars, 5 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 97 clqs
0.99/1.01 c (round 2) 38 del vars, 7 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 36 upgd conss, 8 impls, 97 clqs
0.99/1.02 c (round 3) 38 del vars, 11 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 36 upgd conss, 8 impls, 97 clqs
0.99/1.02 c presolving (4 rounds):
0.99/1.02 c 38 deleted vars, 11 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
0.99/1.02 c 8 implications, 97 cliques
0.99/1.02 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 138 constraints
0.99/1.02 c 10 constraints of type <knapsack>
0.99/1.02 c 93 constraints of type <setppc>
0.99/1.02 c 35 constraints of type <logicor>
0.99/1.02 c transformed objective value is always integral (scale: 1)
0.99/1.02 c Presolving Time: 0.02
0.99/1.02 c
0.99/1.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.03 c 1.0s| 1 | 0 | 3302 | - |1068k| 0 | 46 | 131 | 163 | 131 | 103 | 0 | 64 | 115 | 0.000000e+00 | -- | Inf
0.99/1.04 c 1.0s| 1 | 0 | 3325 | - |1340k| 0 | 56 | 131 | 163 | 131 | 114 | 11 | 64 | 115 | 0.000000e+00 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 3357 | - |1340k| 0 | 56 | 131 | 163 | 131 | 114 | 11 | 64 | 130 | 0.000000e+00 | -- | Inf
1.09/1.14 c 1.1s| 1 | 0 | 3376 | - |1340k| 0 | 54 | 131 | 162 | 131 | 114 | 11 | 64 | 149 | 0.000000e+00 | -- | Inf
1.09/1.16 c 1.2s| 1 | 0 | 3390 | - |1340k| 0 | 54 | 131 | 162 | 131 | 114 | 11 | 64 | 161 | 0.000000e+00 | -- | Inf
1.09/1.19 c 1.2s| 1 | 0 | 3409 | - |1340k| 0 | 49 | 131 | 162 | 131 | 114 | 11 | 64 | 175 | 0.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 3416 | - |1340k| 0 | 51 | 131 | 162 | 131 | 114 | 11 | 64 | 186 | 0.000000e+00 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 3416 | - |1340k| 0 | - | 131 | 162 | 131 | 114 | 11 | 64 | 195 | 0.000000e+00 | -- | Inf
1.19/1.22 c (run 2, node 1) restarting after 28 global fixings of integer variables
1.19/1.22 c
1.19/1.22 c (restart) converted 11 cuts from the global cut pool into linear constraints
1.19/1.22 c
1.19/1.22 c presolving:
1.19/1.22 c (round 1) 28 del vars, 41 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 28 impls, 92 clqs
1.19/1.22 c (round 2) 28 del vars, 51 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 28 impls, 92 clqs
1.19/1.23 c presolving (3 rounds):
1.19/1.23 c 28 deleted vars, 51 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.19/1.23 c 28 implications, 92 cliques
1.19/1.23 c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 122 constraints
1.19/1.23 c 15 constraints of type <knapsack>
1.19/1.23 c 91 constraints of type <setppc>
1.19/1.23 c 16 constraints of type <logicor>
1.19/1.23 c transformed objective value is always integral (scale: 1)
1.19/1.23 c Presolving Time: 0.03
1.19/1.23 c
1.19/1.23 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.23 c 1.2s| 1 | 0 | 3494 | - |1074k| 0 | 48 | 103 | 156 | 103 | 106 | 0 | 98 | 195 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 3516 | - |1302k| 0 | 51 | 103 | 156 | 103 | 114 | 8 | 98 | 195 | 0.000000e+00 | -- | Inf
1.19/1.28 c 1.3s| 1 | 0 | 3517 | - |1302k| 0 | 51 | 103 | 156 | 103 | 114 | 8 | 98 | 213 | 0.000000e+00 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 3528 | - |1301k| 0 | 51 | 103 | 154 | 103 | 114 | 8 | 98 | 232 | 0.000000e+00 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 3537 | - |1301k| 0 | 53 | 103 | 154 | 103 | 114 | 8 | 98 | 245 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 3549 | - |1301k| 0 | 51 | 103 | 153 | 103 | 114 | 8 | 98 | 256 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.4s| 1 | 0 | 3556 | - |1300k| 0 | 48 | 103 | 149 | 103 | 114 | 8 | 98 | 265 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.4s| 1 | 0 | 3556 | - |1300k| 0 | - | 103 | 149 | 103 | 114 | 8 | 98 | 267 | 0.000000e+00 | -- | Inf
1.29/1.38 c (run 3, node 1) restarting after 21 global fixings of integer variables
1.29/1.38 c
1.29/1.38 c (restart) converted 8 cuts from the global cut pool into linear constraints
1.29/1.38 c
1.29/1.38 c presolving:
1.29/1.39 c (round 1) 21 del vars, 14 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 36 impls, 88 clqs
1.29/1.39 c (round 2) 21 del vars, 22 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 36 impls, 88 clqs
1.29/1.39 c presolving (3 rounds):
1.29/1.39 c 21 deleted vars, 22 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.39 c 36 implications, 88 cliques
1.29/1.39 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 135 constraints
1.29/1.39 c 21 constraints of type <knapsack>
1.29/1.39 c 88 constraints of type <setppc>
1.29/1.39 c 26 constraints of type <logicor>
1.29/1.39 c transformed objective value is always integral (scale: 1)
1.29/1.39 c Presolving Time: 0.04
1.29/1.39 c
1.38/1.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.38/1.40 c 1.4s| 1 | 0 | 3612 | - |1091k| 0 | 44 | 82 | 158 | 82 | 109 | 0 | 121 | 267 | 0.000000e+00 | -- | Inf
1.38/1.41 c 1.4s| 1 | 0 | 3628 | - |1327k| 0 | 44 | 82 | 158 | 82 | 117 | 8 | 121 | 267 | 0.000000e+00 | -- | Inf
1.38/1.46 c 1.5s| 1 | 0 | 3646 | - |1327k| 0 | 50 | 82 | 158 | 82 | 117 | 8 | 121 | 287 | 0.000000e+00 | -- | Inf
1.38/1.48 c 1.5s| 1 | 0 | 3665 | - |1327k| 0 | 51 | 82 | 158 | 82 | 117 | 8 | 121 | 296 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.5s| 1 | 0 | 3688 | - |1326k| 0 | 45 | 82 | 156 | 82 | 117 | 8 | 121 | 301 | 0.000000e+00 | -- | Inf
1.49/1.51 c 1.5s| 1 | 0 | 3688 | - |1326k| 0 | - | 82 | 156 | 82 | 117 | 8 | 121 | 307 | 0.000000e+00 | -- | Inf
1.49/1.51 c (run 4, node 1) restarting after 18 global fixings of integer variables
1.49/1.51 c
1.49/1.51 c (restart) converted 8 cuts from the global cut pool into linear constraints
1.49/1.51 c
1.49/1.51 c presolving:
1.49/1.52 c (round 1) 23 del vars, 24 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 8 upgd conss, 70 impls, 61 clqs
1.49/1.52 c (round 2) 29 del vars, 36 del conss, 1 add conss, 0 chg bounds, 1 chg sides, 13 chg coeffs, 8 upgd conss, 80 impls, 56 clqs
1.49/1.53 c (round 3) 30 del vars, 61 del conss, 2 add conss, 0 chg bounds, 3 chg sides, 23 chg coeffs, 8 upgd conss, 84 impls, 53 clqs
1.49/1.53 c (round 4) 30 del vars, 61 del conss, 2 add conss, 0 chg bounds, 3 chg sides, 25 chg coeffs, 8 upgd conss, 84 impls, 53 clqs
1.49/1.53 c presolving (5 rounds):
1.49/1.53 c 30 deleted vars, 61 deleted constraints, 2 added constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 25 changed coefficients
1.49/1.53 c 84 implications, 53 cliques
1.49/1.53 c presolved problem has 52 variables (52 bin, 0 int, 0 impl, 0 cont) and 105 constraints
1.49/1.53 c 27 constraints of type <knapsack>
1.49/1.53 c 61 constraints of type <setppc>
1.49/1.53 c 17 constraints of type <logicor>
1.49/1.53 c transformed objective value is always integral (scale: 1)
1.49/1.53 c Presolving Time: 0.05
1.49/1.53 c
1.49/1.53 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.53 c 1.5s| 1 | 0 | 3727 | - |1051k| 0 | 31 | 52 | 123 | 52 | 88 | 0 | 139 | 307 | 0.000000e+00 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 3744 | - |1228k| 0 | 36 | 52 | 123 | 52 | 100 | 12 | 139 | 307 | 0.000000e+00 | -- | Inf
1.49/1.55 c 1.6s| 1 | 0 | 3793 | - |1224k| 0 | - | 52 | 110 | 52 | 100 | 12 | 139 | 312 | cutoff | -- | 0.00%
1.49/1.55 c 1.6s| 1 | 0 | 3793 | - |1224k| 0 | - | 52 | 110 | 52 | 100 | 12 | 139 | 312 | cutoff | -- | 0.00%
1.49/1.55 c
1.49/1.55 c SCIP Status : problem is solved [infeasible]
1.49/1.55 c Solving Time (sec) : 1.55
1.49/1.55 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
1.49/1.55 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.49/1.55 c Dual Bound : +1.00000000000000e+20
1.49/1.55 c Gap : 0.00 %
1.49/1.55 s UNSATISFIABLE
1.49/1.55 c SCIP Status : problem is solved [infeasible]
1.49/1.55 c Total Time : 1.55
1.49/1.55 c solving : 1.55
1.49/1.55 c presolving : 0.05 (included in solving)
1.49/1.55 c reading : 0.00 (included in solving)
1.49/1.55 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
1.49/1.55 c Original Problem :
1.49/1.55 c Problem name : HOME/instance-3692784-1338019052.opb
1.49/1.55 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.55 c Constraints : 101 initial, 101 maximal
1.49/1.55 c Objective sense : minimize
1.49/1.55 c Presolved Problem :
1.49/1.55 c Problem name : t_HOME/instance-3692784-1338019052.opb
1.49/1.55 c Variables : 52 (52 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.55 c Constraints : 105 initial, 123 maximal
1.49/1.55 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.49/1.55 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c trivial : 0.00 0.00 106 0 0 0 0 0 0 0 0
1.49/1.55 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.49/1.55 c knapsack : 0.03 0.00 0 0 0 0 0 0 2 2 25
1.49/1.55 c setppc : 0.00 0.00 9 2 0 0 0 43 0 1 0
1.49/1.55 c linear : 0.00 0.00 0 0 0 0 0 31 0 3 0
1.49/1.55 c logicor : 0.00 0.00 0 0 0 0 0 99 0 0 0
1.49/1.55 c root node : - - 114 - - 114 - - - - -
1.49/1.55 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.49/1.55 c integral : 0 0 0 0 27 0 8 0 0 110 0 0 0
1.49/1.55 c knapsack : 27 27 19 313 0 0 3 48 5 0 0 0 0
1.49/1.55 c setppc : 61 61 19 308 0 0 2 1196 48 4 0 0 0
1.49/1.55 c logicor : 17+ 35 19 98 0 0 0 57 22 0 2 0 0
1.49/1.55 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.49/1.55 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.49/1.55 c integral : 1.10 0.00 0.00 0.00 1.10 0.00 0.00 0.00
1.49/1.55 c knapsack : 0.01 0.00 0.01 0.01 0.00 0.00 0.00 0.00
1.49/1.55 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.49/1.55 c rootredcost : 0 0 0 0
1.49/1.55 c pseudoobj : 0 0 0 0
1.49/1.55 c vbounds : 0 0 0 0
1.49/1.55 c redcost : 46 0 0 0
1.49/1.55 c probing : 0 0 0 0
1.49/1.55 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.49/1.55 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c redcost : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c probing : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.55 c propagation : 0.00 75 70 267 11.7 0 0.0 -
1.49/1.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.55 c applied globally : - - - 139 8.3 - - -
1.49/1.55 c applied locally : - - - 0 0.0 - - -
1.49/1.55 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.49/1.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 112)
1.49/1.55 c closecuts : 0.00 0.00 0 0 0 0 0
1.49/1.55 c impliedbounds : 0.00 0.00 19 0 0 0 0
1.49/1.55 c intobj : 0.00 0.00 0 0 0 0 0
1.49/1.55 c gomory : 0.06 0.00 14 0 0 70 0
1.49/1.55 c cgmip : 0.00 0.00 0 0 0 0 0
1.49/1.55 c strongcg : 0.08 0.00 19 0 0 849 0
1.49/1.55 c cmir : 0.01 0.00 14 0 0 0 0
1.49/1.55 c flowcover : 0.06 0.00 14 0 0 0 0
1.49/1.55 c clique : 0.01 0.00 19 0 0 85 0
1.49/1.55 c zerohalf : 0.00 0.00 0 0 0 0 0
1.49/1.55 c mcf : 0.00 0.00 5 0 0 0 0
1.49/1.55 c oddcycle : 0.00 0.00 0 0 0 0 0
1.49/1.55 c rapidlearning : 0.00 0.00 0 0 0 0 0
1.49/1.55 c Pricers : ExecTime SetupTime Calls Vars
1.49/1.55 c problem variables: 0.00 - 0 0
1.49/1.55 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.49/1.55 c relpscost : 1.10 0.00 27 0 110 0 0 0
1.49/1.55 c pscost : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c inference : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c random : 0.00 0.00 0 0 0 0 0 0
1.49/1.55 c Primal Heuristics : ExecTime SetupTime Calls Found
1.49/1.55 c LP solutions : 0.00 - - 0
1.49/1.55 c pseudo solutions : 0.00 - - 0
1.49/1.55 c oneopt : 0.00 0.00 0 0
1.49/1.55 c smallcard : 0.00 0.00 0 0
1.49/1.55 c trivial : 0.00 0.00 2 0
1.49/1.55 c shiftandpropagate: 0.02 0.00 5 0
1.49/1.55 c simplerounding : 0.00 0.00 0 0
1.49/1.55 c zirounding : 0.00 0.00 0 0
1.49/1.55 c rounding : 0.00 0.00 46 0
1.49/1.55 c shifting : 0.02 0.00 46 0
1.49/1.55 c intshifting : 0.00 0.00 0 0
1.49/1.55 c twoopt : 0.00 0.00 0 0
1.49/1.55 c indtwoopt : 0.00 0.00 0 0
1.49/1.55 c indoneopt : 0.00 0.00 0 0
1.49/1.55 c fixandinfer : 0.00 0.00 0 0
1.49/1.55 c feaspump : 0.04 0.00 1 0
1.49/1.55 c clique : 0.00 0.00 0 0
1.49/1.55 c coefdiving : 0.00 0.00 0 0
1.49/1.55 c indrounding : 0.00 0.00 0 0
1.49/1.55 c indcoefdiving : 0.00 0.00 0 0
1.49/1.55 c pscostdiving : 0.00 0.00 0 0
1.49/1.55 c fracdiving : 0.00 0.00 0 0
1.49/1.55 c nlpdiving : 0.00 0.00 0 0
1.49/1.55 c veclendiving : 0.00 0.00 0 0
1.49/1.55 c intdiving : 0.00 0.00 0 0
1.49/1.55 c actconsdiving : 0.00 0.00 0 0
1.49/1.55 c objpscostdiving : 0.00 0.00 0 0
1.49/1.55 c rootsoldiving : 0.00 0.00 0 0
1.49/1.55 c linesearchdiving : 0.00 0.00 0 0
1.49/1.55 c guideddiving : 0.00 0.00 0 0
1.49/1.55 c octane : 0.00 0.00 0 0
1.49/1.55 c rens : 0.04 0.00 1 0
1.49/1.55 c rins : 0.00 0.00 0 0
1.49/1.55 c localbranching : 0.00 0.00 0 0
1.49/1.55 c mutation : 0.00 0.00 0 0
1.49/1.55 c crossover : 0.00 0.00 0 0
1.49/1.55 c dins : 0.00 0.00 0 0
1.49/1.55 c vbounds : 0.00 0.00 0 0
1.49/1.55 c undercover : 0.00 0.00 0 0
1.49/1.55 c subnlp : 0.00 0.00 0 0
1.49/1.55 c trysol : 0.00 0.00 0 0
1.49/1.55 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.49/1.55 c primal LP : 0.00 2 0 0.00 - 0.00 2
1.49/1.55 c dual LP : 0.05 48 1488 31.66 28552.79 0.00 1
1.49/1.55 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.55 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.49/1.55 c diving/probing LP: 0.04 27 2305 85.37 54518.79
1.49/1.55 c strong branching : 1.10 312 32643 104.62 29767.87
1.49/1.55 c (at root node) : - 312 32643 104.62 -
1.49/1.55 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.55 c B&B Tree :
1.49/1.55 c number of runs : 5
1.49/1.55 c nodes : 1
1.49/1.55 c nodes (total) : 5
1.49/1.55 c nodes left : 0
1.49/1.55 c max depth : 0
1.49/1.55 c max depth (total): 0
1.49/1.55 c backtracks : 0 (0.0%)
1.49/1.55 c delayed cutoffs : 0
1.49/1.55 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.49/1.55 c avg switch length: 2.00
1.49/1.55 c switching time : 0.00
1.49/1.55 c Solution :
1.49/1.55 c Solutions found : 0 (0 improvements)
1.49/1.55 c Primal Bound : infeasible
1.49/1.55 c Dual Bound : -
1.49/1.55 c Gap : 0.00 %
1.49/1.55 c Root Dual Bound : -
1.49/1.55 c Root Iterations : 3793
1.49/1.55 c Time complete: 1.55.