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-2665311-1276670865.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 2718 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 | 23 | - | 490k| 0 | 20 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.04/0.09 o -1
0.04/0.09 c u 0.1s| 1 | 0 | 23 | - | 492k| 0 | 20 | 66 | 77 | 66 | 123 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.09/0.18 o -3
0.09/0.18 c y 0.1s| 1 | 0 | 23 | - | 534k| 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 | 70 | - | 704k| 0 | 41 | 66 | 287 | 66 | 111 | 2 | 0 | 0 |-4.862361e+00 |-3.000000e+00 | 38.30%
0.19/0.21 c 0.1s| 1 | 0 | 115 | - | 795k| 0 | 38 | 66 | 287 | 66 | 145 | 36 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.22 c 0.2s| 1 | 0 | 137 | - | 872k| 0 | 33 | 66 | 287 | 66 | 170 | 61 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.24 c 0.2s| 1 | 0 | 151 | - | 989k| 0 | 31 | 66 | 287 | 66 | 182 | 73 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.26 c 0.2s| 1 | 0 | 187 | - |1046k| 0 | 33 | 66 | 287 | 66 | 186 | 77 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.29 c 0.2s| 1 | 0 | 273 | - |1076k| 0 | 32 | 66 | 287 | 66 | 199 | 90 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.32 c 0.2s| 1 | 0 | 379 | - |1087k| 0 | 37 | 66 | 287 | 66 | 213 | 104 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.29/0.34 c 0.3s| 1 | 0 | 409 | - |1099k| 0 | 41 | 66 | 287 | 66 | 221 | 112 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.29/0.35 o -3
0.29/0.35 c s 0.3s| 1 | 0 | 409 | - |1100k| 0 | 41 | 66 | 287 | 66 | 221 | 112 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.29/0.38 c 0.3s| 1 | 0 | 452 | - |1199k| 0 | 44 | 66 | 287 | 66 | 230 | 121 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.42 c 0.3s| 1 | 0 | 482 | - |1349k| 0 | 43 | 66 | 287 | 66 | 186 | 127 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.45 c 0.4s| 1 | 0 | 553 | - |1589k| 0 | 38 | 66 | 287 | 66 | 192 | 133 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.47 c 0.4s| 1 | 0 | 603 | - |1596k| 0 | 45 | 66 | 287 | 66 | 200 | 141 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.66 c 0.6s| 1 | 2 | 603 | - |1596k| 0 | 45 | 66 | 287 | 66 | 200 | 141 | 0 | 9 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.66 c (run 1, node 1) restarting after 7 global fixings of integer variables
0.59/0.66 c
0.59/0.66 c (restart) converted 34 cuts from the global cut pool into linear constraints
0.59/0.66 c
0.59/0.66 c presolving:
0.59/0.67 c (round 1) 7 del vars, 43 del conss, 0 chg bounds, 40 chg sides, 0 chg coeffs, 0 upgd conss, 2718 impls, 45 clqs
0.59/0.68 c (round 2) 7 del vars, 48 del conss, 0 chg bounds, 40 chg sides, 0 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.59/0.68 c (round 3) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 16 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.59/0.69 c (round 4) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 28 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.59/0.69 c (round 5) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 45 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.59/0.69 c (round 6) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 63 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.59/0.69 c (round 7) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 80 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.70 c (round 8) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 101 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.70 c (round 9) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 122 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.70 c (round 10) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 145 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.71 c (round 11) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 159 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.71 c (round 12) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 173 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.71 c (round 13) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 186 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.71 c (round 14) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 194 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.72 c (round 15) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 202 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.72 c (round 16) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 209 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.72 c (round 17) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 214 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.72 c (round 18) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 218 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.73 c (round 19) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 222 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.73 c (round 20) 7 del vars, 50 del conss, 0 chg bounds, 42 chg sides, 224 chg coeffs, 209 upgd conss, 2718 impls, 45 clqs
0.69/0.73 c presolving (21 rounds):
0.69/0.73 c 7 deleted vars, 50 deleted constraints, 0 tightened bounds, 0 added holes, 42 changed sides, 224 changed coefficients
0.69/0.73 c 2718 implications, 45 cliques
0.69/0.73 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 273 constraints
0.69/0.73 c 8 constraints of type <knapsack>
0.69/0.73 c 44 constraints of type <setppc>
0.69/0.73 c 40 constraints of type <and>
0.69/0.73 c 1 constraints of type <linear>
0.69/0.73 c 180 constraints of type <logicor>
0.69/0.73 c transformed objective value is always integral (scale: 1)
0.69/0.73 c Presolving Time: 0.06
0.69/0.73 c
0.69/0.74 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.74 c 0.6s| 1 | 0 | 669 | - | 700k| 0 | 36 | 59 | 273 | 59 | 142 | 0 | 0 | 9 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.69/0.77 c 0.7s| 1 | 0 | 717 | - | 709k| 0 | 41 | 59 | 273 | 59 | 148 | 6 | 0 | 9 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.89/0.95 c 0.8s| 1 | 0 | 832 | - | 678k| 0 | 38 | 59 | 248 | 59 | 148 | 6 | 0 | 28 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.89/0.99 c 0.9s| 1 | 0 | 832 | - | 673k| 0 | - | 59 | 248 | 59 | 148 | 6 | 0 | 36 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.89/0.99 c (run 2, node 1) restarting after 18 global fixings of integer variables
0.89/0.99 c
0.89/0.99 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.89/0.99 c
0.89/1.00 c presolving:
0.89/1.00 c (round 1) 18 del vars, 29 del conss, 0 chg bounds, 1 chg sides, 16 chg coeffs, 0 upgd conss, 2728 impls, 36 clqs
1.00/1.01 c (round 2) 18 del vars, 58 del conss, 0 chg bounds, 1 chg sides, 27 chg coeffs, 4 upgd conss, 2728 impls, 36 clqs
1.00/1.01 c (round 3) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 37 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.01 c (round 4) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 45 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.02 c (round 5) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 50 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.02 c (round 6) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 57 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.02 c (round 7) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 60 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.02 c (round 8) 18 del vars, 59 del conss, 0 chg bounds, 1 chg sides, 61 chg coeffs, 4 upgd conss, 2728 impls, 37 clqs
1.00/1.03 c presolving (9 rounds):
1.00/1.03 c 18 deleted vars, 59 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 61 changed coefficients
1.00/1.03 c 2728 implications, 37 cliques
1.00/1.03 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 195 constraints
1.00/1.03 c 8 constraints of type <knapsack>
1.00/1.03 c 37 constraints of type <setppc>
1.00/1.03 c 24 constraints of type <and>
1.00/1.03 c 1 constraints of type <linear>
1.00/1.03 c 125 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.08
1.00/1.03 c
1.00/1.03 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.03 c 0.9s| 1 | 0 | 895 | - | 615k| 0 | 32 | 41 | 195 | 41 | 109 | 0 | 0 | 36 |-4.000000e+00 |-3.000000e+00 | 25.00%
1.00/1.05 c 0.9s| 1 | 0 | 921 | - | 623k| 0 | 30 | 41 | 195 | 41 | 115 | 6 | 0 | 36 |-4.000000e+00 |-3.000000e+00 | 25.00%
1.09/1.13 c 1.0s| 1 | 2 | 921 | - | 625k| 0 | 30 | 41 | 195 | 41 | 115 | 6 | 0 | 53 |-4.000000e+00 |-3.000000e+00 | 25.00%
1.09/1.13 o -4
1.09/1.13 c * 1.0s| 2 | 0 | 976 | 55.0 | 618k| 1 | - | 41 | 195 | 41 | 59 | 17 | 0 | 53 |-4.000000e+00 |-4.000000e+00 | 0.00%
1.09/1.13 c
1.09/1.13 c SCIP Status : problem is solved [optimal solution found]
1.09/1.13 c Solving Time (sec) : 0.99
1.09/1.13 c Solving Nodes : 2 (total of 4 nodes in 3 runs)
1.09/1.13 c Primal Bound : -4.00000000000000e+00 (18 solutions)
1.09/1.13 c Dual Bound : -4.00000000000000e+00
1.09/1.13 c Gap : 0.00 %
1.09/1.13 s OPTIMUM FOUND
1.09/1.13 v x13 -x16 -x18 -x11 -x20 x19 x17 x15 -x14 -x12 x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 -x1
1.09/1.13 c SCIP Status : problem is solved [optimal solution found]
1.09/1.13 c Solving Time : 0.99
1.09/1.13 c Original Problem :
1.09/1.13 c Problem name : HOME/instance-2665311-1276670865.opb
1.09/1.13 c Variables : 66 (66 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 77 initial, 77 maximal
1.09/1.13 c Presolved Problem :
1.09/1.13 c Problem name : t_HOME/instance-2665311-1276670865.opb
1.09/1.13 c Variables : 41 (41 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 195 initial, 195 maximal
1.09/1.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.09/1.13 c trivial : 0.00 25 0 0 0 0 0 0 0
1.09/1.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c implics : 0.00 0 0 0 0 0 0 0 0
1.09/1.13 c probing : 0.01 0 0 0 0 0 0 0 0
1.09/1.13 c knapsack : 0.05 0 0 0 0 0 0 3 285
1.09/1.13 c setppc : 0.00 0 0 0 0 0 10 0 0
1.09/1.13 c and : 0.01 0 0 0 0 0 0 0 0
1.09/1.13 c linear : 0.00 0 0 0 0 0 43 40 0
1.09/1.13 c logicor : 0.01 0 0 0 0 0 56 0 0
1.09/1.13 c root node : - 25 - - 25 - - - -
1.09/1.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.09/1.13 c integral : 0 0 0 5 0 0 7 0 0 4
1.09/1.13 c knapsack : 8 2 7 0 0 0 0 0 0 0
1.09/1.13 c setppc : 37 15 245 1 0 0 3 0 0 0
1.09/1.13 c and : 24 20 245 1 0 0 16 38 0 0
1.09/1.13 c linear : 1 15 245 1 0 0 0 5 0 0
1.09/1.13 c logicor : 125 15 139 1 0 0 1 0 0 0
1.09/1.13 c countsols : 0 0 0 1 0 0 0 0 0 0
1.09/1.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.09/1.13 c integral : 0.47 0.00 0.00 0.47 0.00
1.09/1.13 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c setppc : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c and : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c linear : 0.01 0.01 0.00 0.00 0.00
1.09/1.13 c logicor : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c countsols : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c Propagators : Time Calls Cutoffs DomReds
1.09/1.13 c vbounds : 0.00 4 0 0
1.09/1.13 c rootredcost : 0.00 0 0 0
1.09/1.13 c pseudoobj : 0.00 33 0 0
1.09/1.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.09/1.13 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.13 c applied globally : - - - 0 0.0 - - -
1.09/1.13 c applied locally : - - - 0 0.0 - - -
1.09/1.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.09/1.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 9)
1.09/1.13 c redcost : 0.00 19 0 0 0 0
1.09/1.13 c impliedbounds : 0.00 14 0 0 152 0
1.09/1.13 c intobj : 0.00 0 0 0 0 0
1.09/1.13 c cgmip : 0.00 0 0 0 0 0
1.09/1.13 c gomory : 0.10 14 0 0 245 0
1.09/1.13 c strongcg : 0.08 14 0 0 808 0
1.09/1.13 c cmir : 0.00 12 0 0 19 0
1.09/1.13 c flowcover : 0.06 12 0 0 47 0
1.09/1.13 c clique : 0.01 14 0 0 98 0
1.09/1.13 c zerohalf : 0.00 0 0 0 0 0
1.09/1.13 c mcf : 0.00 3 0 0 0 0
1.09/1.13 c rapidlearning : 0.07 1 0 7 0 280
1.09/1.13 c Pricers : Time Calls Vars
1.09/1.13 c problem variables: 0.00 0 0
1.09/1.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.09/1.13 c relpscost : 0.47 4 0 7 0 0 4
1.09/1.13 c pscost : 0.00 0 0 0 0 0 0
1.09/1.13 c inference : 0.00 0 0 0 0 0 0
1.09/1.13 c mostinf : 0.00 0 0 0 0 0 0
1.09/1.13 c leastinf : 0.00 0 0 0 0 0 0
1.09/1.13 c fullstrong : 0.00 0 0 0 0 0 0
1.09/1.13 c allfullstrong : 0.00 0 0 0 0 0 0
1.09/1.13 c random : 0.00 0 0 0 0 0 0
1.09/1.13 c Primal Heuristics : Time Calls Found
1.09/1.13 c LP solutions : 0.00 - 1
1.09/1.13 c pseudo solutions : 0.00 - 0
1.09/1.13 c crossover : 0.00 0 0
1.09/1.13 c oneopt : 0.00 2 0
1.09/1.13 c trivial : 0.00 2 3
1.09/1.13 c simplerounding : 0.00 0 0
1.09/1.13 c zirounding : 0.00 2 0
1.09/1.13 c rounding : 0.00 22 0
1.09/1.13 c shifting : 0.00 18 12
1.09/1.13 c intshifting : 0.00 0 0
1.09/1.13 c twoopt : 0.00 0 0
1.09/1.13 c fixandinfer : 0.00 0 0
1.09/1.13 c feaspump : 0.00 0 0
1.09/1.13 c coefdiving : 0.00 0 0
1.09/1.13 c pscostdiving : 0.00 0 0
1.09/1.13 c fracdiving : 0.00 0 0
1.09/1.13 c veclendiving : 0.00 0 0
1.09/1.13 c intdiving : 0.00 0 0
1.09/1.13 c actconsdiving : 0.00 0 0
1.09/1.13 c objpscostdiving : 0.00 0 0
1.09/1.13 c rootsoldiving : 0.00 0 0
1.09/1.13 c linesearchdiving : 0.00 0 0
1.09/1.13 c guideddiving : 0.00 0 0
1.09/1.13 c octane : 0.00 0 0
1.09/1.13 c rens : 0.00 0 0
1.09/1.13 c rins : 0.00 0 0
1.09/1.13 c localbranching : 0.00 0 0
1.09/1.13 c mutation : 0.00 0 0
1.09/1.13 c dins : 0.00 0 0
1.09/1.13 c undercover : 0.04 1 1
1.09/1.13 c nlp : 0.00 0 0
1.09/1.13 c trysol : 0.00 0 0
1.09/1.13 c LP : Time Calls Iterations Iter/call Iter/sec
1.09/1.13 c primal LP : 0.00 0 0 0.00 -
1.09/1.13 c dual LP : 0.07 24 976 40.67 13942.86
1.09/1.13 c lex dual LP : 0.00 0 0 0.00 -
1.09/1.13 c barrier LP : 0.00 0 0 0.00 -
1.09/1.13 c diving/probing LP: 0.00 0 0 0.00 -
1.09/1.13 c strong branching : 0.47 53 8798 166.00 18719.15
1.09/1.13 c (at root node) : - 53 8798 166.00 -
1.09/1.13 c conflict analysis: 0.00 0 0 0.00 -
1.09/1.13 c B&B Tree :
1.09/1.13 c number of runs : 3
1.09/1.13 c nodes : 2
1.09/1.13 c nodes (total) : 4
1.09/1.13 c nodes left : 0
1.09/1.13 c max depth : 1
1.09/1.13 c max depth (total): 1
1.09/1.13 c backtracks : 0 (0.0%)
1.09/1.13 c delayed cutoffs : 0
1.09/1.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.09/1.13 c avg switch length: 2.00
1.09/1.13 c switching time : 0.00
1.09/1.13 c Solution :
1.09/1.13 c Solutions found : 18 (5 improvements)
1.09/1.13 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.09/1.13 c Primal Bound : -4.00000000000000e+00 (in run 3, after 2 nodes, 0.99 seconds, depth 1, found by <relaxation>)
1.09/1.13 c Dual Bound : -4.00000000000000e+00
1.09/1.13 c Gap : 0.00 %
1.09/1.13 c Root Dual Bound : -4.00000000000000e+00
1.09/1.13 c Root Iterations : 921
1.09/1.14 c Time complete: 1.13.