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-2665338-1276674819.opb>
0.00/0.01 c original problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 77 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.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 388 impls, 20 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 2742 implications, 20 cliques
0.00/0.03 c presolved problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.00/0.03 c 20 constraints of type <setppc>
0.00/0.03 c 46 constraints of type <and>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c 10 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c heuristics/undercover/freq = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c t 0.0s| 1 | 0 | 22 | - | 488k| 0 | 20 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.09 o -1
0.00/0.09 c u 0.1s| 1 | 0 | 22 | - | 490k| 0 | 20 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.10/0.19 o -3
0.10/0.19 c y 0.1s| 1 | 0 | 22 | - | 532k| 0 | 20 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.19/0.20 c 0.1s| 1 | 0 | 74 | - | 721k| 0 | 34 | 66 | 309 | 66 | 109 | 2 | 0 | 0 |-4.795918e+00 |-3.000000e+00 | 37.45%
0.19/0.21 c 0.1s| 1 | 0 | 111 | - | 783k| 0 | 33 | 66 | 309 | 66 | 133 | 26 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.22 c 0.1s| 1 | 0 | 135 | - | 865k| 0 | 30 | 66 | 309 | 66 | 157 | 50 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.24 c 0.2s| 1 | 0 | 180 | - | 961k| 0 | 29 | 66 | 309 | 66 | 167 | 60 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.24 o -3
0.19/0.24 c s 0.2s| 1 | 0 | 180 | - | 962k| 0 | 29 | 66 | 309 | 66 | 167 | 60 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.26 c 0.2s| 1 | 0 | 216 | - |1034k| 0 | 21 | 66 | 309 | 66 | 178 | 71 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.27 c 0.2s| 1 | 0 | 253 | - |1100k| 0 | 31 | 66 | 309 | 66 | 183 | 76 | 0 | 0 |-4.400000e+00 |-3.000000e+00 | 31.82%
0.19/0.29 c 0.2s| 1 | 0 | 281 | - |1159k| 0 | 32 | 66 | 309 | 66 | 191 | 84 | 0 | 0 |-4.400000e+00 |-3.000000e+00 | 31.82%
0.29/0.32 c 0.2s| 1 | 0 | 385 | - |1176k| 0 | 41 | 66 | 309 | 66 | 198 | 91 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.29/0.35 c 0.3s| 1 | 0 | 457 | - |1247k| 0 | 38 | 66 | 309 | 66 | 218 | 111 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.29/0.39 c 0.3s| 1 | 0 | 568 | - |1260k| 0 | 42 | 66 | 309 | 66 | 169 | 118 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.40/0.41 c 0.3s| 1 | 0 | 606 | - |1274k| 0 | 43 | 66 | 309 | 66 | 175 | 124 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.40/0.43 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.40/0.43 c 0.3s| 1 | 0 | 657 | - |1298k| 0 | 45 | 66 | 309 | 66 | 186 | 135 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.40/0.45 c 0.4s| 1 | 0 | 715 | - |1324k| 0 | 39 | 66 | 309 | 66 | 190 | 139 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.60 c 0.5s| 1 | 0 | 857 | - |1287k| 0 | 28 | 66 | 268 | 66 | 190 | 139 | 0 | 11 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.62 c 0.5s| 1 | 0 | 921 | - |1392k| 0 | 25 | 66 | 268 | 66 | 207 | 156 | 0 | 11 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.69/0.70 c 0.6s| 1 | 0 | 921 | - |1390k| 0 | - | 66 | 268 | 66 | 207 | 156 | 0 | 24 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.69/0.70 c (run 1, node 1) restarting after 16 global fixings of integer variables
0.69/0.70 c
0.69/0.70 c (restart) converted 148 cuts from the global cut pool into linear constraints
0.69/0.70 c
0.69/0.70 c presolving:
0.69/0.71 c (round 1) 16 del vars, 23 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 2746 impls, 66 clqs
0.69/0.72 c (round 2) 16 del vars, 98 del conss, 0 chg bounds, 68 chg sides, 1 chg coeffs, 0 upgd conss, 2746 impls, 66 clqs
0.69/0.72 c (round 3) 16 del vars, 111 del conss, 0 chg bounds, 68 chg sides, 1 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.73 c (round 4) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 71 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.73 c (round 5) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 128 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.74 c (round 6) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 185 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.74 c (round 7) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 247 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.75 c (round 8) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 301 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.75 c (round 9) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 361 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.76 c (round 10) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 412 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.76 c (round 11) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 460 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.77 c (round 12) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 505 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.77 c (round 13) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 550 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.78 c (round 14) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 587 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.78 c (round 15) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 618 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.79 c (round 16) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 641 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.69/0.79 c (round 17) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 655 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.80 c (round 18) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 668 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.80 c (round 19) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 675 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.80 c (round 20) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 679 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.81 c (round 21) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 683 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.81 c (round 22) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 685 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.81 c (round 23) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 686 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.81 c (round 24) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 687 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.82 c (round 25) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 688 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.82 c (round 26) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 689 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.82 c (round 27) 16 del vars, 128 del conss, 0 chg bounds, 76 chg sides, 690 chg coeffs, 257 upgd conss, 2746 impls, 66 clqs
0.79/0.82 c presolving (28 rounds):
0.79/0.82 c 16 deleted vars, 128 deleted constraints, 0 tightened bounds, 0 added holes, 76 changed sides, 690 changed coefficients
0.79/0.82 c 2746 implications, 66 cliques
0.79/0.82 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 296 constraints
0.79/0.82 c 17 constraints of type <knapsack>
0.79/0.82 c 57 constraints of type <setppc>
0.79/0.82 c 32 constraints of type <and>
0.79/0.82 c 1 constraints of type <linear>
0.79/0.82 c 189 constraints of type <logicor>
0.79/0.82 c transformed objective value is always integral (scale: 1)
0.79/0.82 c Presolving Time: 0.11
0.79/0.82 c
0.79/0.83 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.83 c 0.7s| 1 | 0 | 1000 | - | 758k| 0 | 32 | 50 | 296 | 50 | 181 | 0 | 0 | 24 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.79/0.86 c 0.7s| 1 | 0 | 1054 | - | 912k| 0 | 32 | 50 | 295 | 50 | 169 | 7 | 0 | 24 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.89/0.99 c 0.9s| 1 | 0 | 1054 | - | 906k| 0 | - | 50 | 295 | 50 | 169 | 7 | 0 | 45 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.89/0.99 c (run 2, node 1) restarting after 12 global fixings of integer variables
0.89/0.99 c
0.89/0.99 c (restart) converted 7 cuts from the global cut pool into linear constraints
0.89/0.99 c
0.89/0.99 c presolving:
1.00/1.00 c (round 1) 15 del vars, 29 del conss, 0 chg bounds, 0 chg sides, 33 chg coeffs, 0 upgd conss, 2766 impls, 39 clqs
1.00/1.01 c (round 2) 15 del vars, 44 del conss, 0 chg bounds, 3 chg sides, 74 chg coeffs, 5 upgd conss, 2766 impls, 41 clqs
1.00/1.01 c (round 3) 15 del vars, 54 del conss, 0 chg bounds, 4 chg sides, 102 chg coeffs, 5 upgd conss, 2766 impls, 41 clqs
1.00/1.02 c (round 4) 15 del vars, 54 del conss, 0 chg bounds, 5 chg sides, 129 chg coeffs, 5 upgd conss, 2766 impls, 42 clqs
1.00/1.02 c (round 5) 15 del vars, 54 del conss, 0 chg bounds, 6 chg sides, 149 chg coeffs, 5 upgd conss, 2766 impls, 43 clqs
1.00/1.03 c (round 6) 15 del vars, 54 del conss, 0 chg bounds, 6 chg sides, 155 chg coeffs, 5 upgd conss, 2766 impls, 43 clqs
1.00/1.03 c (round 7) 15 del vars, 54 del conss, 0 chg bounds, 6 chg sides, 159 chg coeffs, 5 upgd conss, 2766 impls, 43 clqs
1.00/1.03 c (round 8) 15 del vars, 54 del conss, 0 chg bounds, 6 chg sides, 161 chg coeffs, 5 upgd conss, 2766 impls, 43 clqs
1.00/1.03 c presolving (9 rounds):
1.00/1.03 c 15 deleted vars, 54 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 161 changed coefficients
1.00/1.03 c 2766 implications, 43 cliques
1.00/1.03 c presolved problem has 35 variables (35 bin, 0 int, 0 impl, 0 cont) and 250 constraints
1.00/1.03 c 18 constraints of type <knapsack>
1.00/1.03 c 51 constraints of type <setppc>
1.00/1.03 c 18 constraints of type <and>
1.00/1.03 c 1 constraints of type <linear>
1.00/1.03 c 162 constraints of type <logicor>
1.00/1.03 c transformed objective value is always integral (scale: 1)
1.00/1.03 c Presolving Time: 0.13
1.00/1.04 c
1.00/1.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.04 c 0.9s| 1 | 0 | 1120 | - | 673k| 0 | 24 | 35 | 250 | 35 | 141 | 0 | 0 | 45 |-4.000000e+00 |-3.000000e+00 | 25.00%
1.00/1.06 c 0.9s| 1 | 0 | 1162 | - | 705k| 0 | 0 | 35 | 250 | 35 | 137 | 3 | 0 | 45 |-4.000000e+00 |-3.000000e+00 | 25.00%
1.00/1.06 o -4
1.00/1.06 c * 0.9s| 1 | 0 | 1162 | - | 706k| 0 | - | 35 | 250 | 35 | 137 | 3 | 0 | 45 |-4.000000e+00 |-4.000000e+00 | 0.00%
1.00/1.06 c
1.00/1.06 c SCIP Status : problem is solved [optimal solution found]
1.00/1.06 c Solving Time (sec) : 0.91
1.00/1.06 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.00/1.06 c Primal Bound : -4.00000000000000e+00 (16 solutions)
1.00/1.06 c Dual Bound : -4.00000000000000e+00
1.00/1.06 c Gap : 0.00 %
1.00/1.06 s OPTIMUM FOUND
1.00/1.06 v x18 -x15 -x11 x19 -x14 -x12 -x20 -x17 x13 x16 x10 -x9 -x8 x7 -x6 -x5 x4 -x3 x2 -x1
1.00/1.06 c SCIP Status : problem is solved [optimal solution found]
1.00/1.06 c Solving Time : 0.91
1.00/1.06 c Original Problem :
1.00/1.06 c Problem name : HOME/instance-2665338-1276674819.opb
1.00/1.06 c Variables : 66 (66 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.06 c Constraints : 77 initial, 77 maximal
1.00/1.06 c Presolved Problem :
1.00/1.06 c Problem name : t_HOME/instance-2665338-1276674819.opb
1.00/1.06 c Variables : 35 (35 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.06 c Constraints : 250 initial, 250 maximal
1.00/1.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.06 c trivial : 0.01 28 0 0 0 0 0 0 0
1.00/1.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.06 c implics : 0.00 0 0 0 0 0 0 0 0
1.00/1.06 c probing : 0.01 0 0 0 0 0 0 0 0
1.00/1.06 c knapsack : 0.08 0 0 0 0 0 0 14 850
1.00/1.06 c setppc : 0.00 0 0 0 0 0 30 0 0
1.00/1.06 c and : 0.00 3 0 0 0 0 0 0 0
1.00/1.06 c linear : 0.01 0 0 0 0 0 98 68 1
1.00/1.06 c logicor : 0.01 0 0 0 0 0 54 0 0
1.00/1.06 c root node : - 29 - - 29 - - - -
1.00/1.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.06 c integral : 0 0 0 4 0 0 8 0 0 0
1.00/1.06 c knapsack : 18 2 4 0 0 0 0 0 0 0
1.00/1.06 c setppc : 51 17 242 1 0 0 0 0 0 0
1.00/1.06 c and : 18 17 242 1 0 0 5 29 0 0
1.00/1.06 c linear : 1 17 242 1 0 0 0 2 0 0
1.00/1.06 c logicor : 162 17 137 1 0 0 0 0 0 0
1.00/1.06 c countsols : 0 0 0 1 0 0 0 0 0 0
1.00/1.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.06 c integral : 0.32 0.00 0.00 0.32 0.00
1.00/1.06 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.00/1.06 c setppc : 0.00 0.00 0.00 0.00 0.00
1.00/1.06 c and : 0.01 0.01 0.00 0.00 0.00
1.00/1.06 c linear : 0.03 0.02 0.01 0.00 0.00
1.00/1.06 c logicor : 0.00 0.00 0.00 0.00 0.00
1.00/1.06 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.06 c Propagators : Time Calls Cutoffs DomReds
1.00/1.06 c vbounds : 0.00 4 0 0
1.00/1.06 c rootredcost : 0.00 0 0 0
1.00/1.06 c pseudoobj : 0.00 33 0 0
1.00/1.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.06 c applied globally : - - - 0 0.0 - - -
1.00/1.06 c applied locally : - - - 0 0.0 - - -
1.00/1.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 36)
1.00/1.06 c redcost : 0.01 16 0 8 0 0
1.00/1.06 c impliedbounds : 0.00 16 0 0 158 0
1.00/1.06 c intobj : 0.00 0 0 0 0 0
1.00/1.06 c cgmip : 0.00 0 0 0 0 0
1.00/1.06 c gomory : 0.08 16 0 0 802 0
1.00/1.06 c strongcg : 0.10 16 0 0 1027 0
1.00/1.06 c cmir : 0.01 12 0 0 18 0
1.00/1.06 c flowcover : 0.02 12 0 0 37 0
1.00/1.06 c clique : 0.01 16 0 0 111 0
1.00/1.06 c zerohalf : 0.00 0 0 0 0 0
1.00/1.06 c mcf : 0.00 3 0 0 0 0
1.00/1.06 c rapidlearning : 0.07 1 0 8 0 304
1.00/1.06 c Pricers : Time Calls Vars
1.00/1.06 c problem variables: 0.00 0 0
1.00/1.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.06 c relpscost : 0.32 3 0 8 0 0 0
1.00/1.06 c pscost : 0.00 0 0 0 0 0 0
1.00/1.06 c inference : 0.00 0 0 0 0 0 0
1.00/1.06 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.06 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.06 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.06 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.06 c random : 0.00 0 0 0 0 0 0
1.00/1.06 c Primal Heuristics : Time Calls Found
1.00/1.06 c LP solutions : 0.00 - 1
1.00/1.06 c pseudo solutions : 0.00 - 0
1.00/1.06 c oneopt : 0.00 2 0
1.00/1.06 c trivial : 0.00 2 3
1.00/1.06 c simplerounding : 0.00 0 0
1.00/1.06 c zirounding : 0.00 1 0
1.00/1.06 c rounding : 0.01 19 0
1.00/1.06 c shifting : 0.00 19 10
1.00/1.06 c intshifting : 0.00 0 0
1.00/1.06 c twoopt : 0.00 0 0
1.00/1.06 c fixandinfer : 0.00 0 0
1.00/1.06 c feaspump : 0.00 0 0
1.00/1.06 c coefdiving : 0.00 0 0
1.00/1.06 c pscostdiving : 0.00 0 0
1.00/1.06 c fracdiving : 0.00 0 0
1.00/1.06 c veclendiving : 0.00 0 0
1.00/1.06 c intdiving : 0.00 0 0
1.00/1.06 c actconsdiving : 0.00 0 0
1.00/1.06 c objpscostdiving : 0.00 0 0
1.00/1.06 c rootsoldiving : 0.00 0 0
1.00/1.06 c linesearchdiving : 0.00 0 0
1.00/1.06 c guideddiving : 0.00 0 0
1.00/1.06 c octane : 0.00 0 0
1.00/1.06 c rens : 0.01 0 0
1.00/1.06 c rins : 0.00 0 0
1.00/1.06 c localbranching : 0.00 0 0
1.00/1.06 c mutation : 0.00 0 0
1.00/1.06 c crossover : 0.00 0 0
1.00/1.06 c dins : 0.00 0 0
1.00/1.06 c undercover : 0.03 1 1
1.00/1.06 c nlp : 0.00 0 0
1.00/1.06 c trysol : 0.00 0 0
1.00/1.06 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.06 c primal LP : 0.00 0 0 0.00 -
1.00/1.06 c dual LP : 0.07 21 1162 55.33 16600.00
1.00/1.06 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.06 c barrier LP : 0.00 0 0 0.00 -
1.00/1.06 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.06 c strong branching : 0.32 45 6056 134.58 18925.00
1.00/1.06 c (at root node) : - 45 6056 134.58 -
1.00/1.06 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.06 c B&B Tree :
1.00/1.06 c number of runs : 3
1.00/1.06 c nodes : 1
1.00/1.06 c nodes (total) : 3
1.00/1.06 c nodes left : 0
1.00/1.06 c max depth : 0
1.00/1.06 c max depth (total): 0
1.00/1.06 c backtracks : 0 (0.0%)
1.00/1.06 c delayed cutoffs : 0
1.00/1.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.00/1.06 c avg switch length: 2.00
1.00/1.06 c switching time : 0.00
1.00/1.06 c Solution :
1.00/1.06 c Solutions found : 16 (5 improvements)
1.00/1.06 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.00/1.06 c Primal Bound : -4.00000000000000e+00 (in run 3, after 1 nodes, 0.91 seconds, depth 0, found by <relaxation>)
1.00/1.06 c Dual Bound : -4.00000000000000e+00
1.00/1.06 c Gap : 0.00 %
1.00/1.06 c Root Dual Bound : -4.00000000000000e+00
1.00/1.06 c Root Iterations : 1162
1.00/1.07 c Time complete: 1.06.