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-3488355-1307778345.opb>
0.00/0.00 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 253 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 10 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1776 impls, 0 clqs
0.00/0.01 c (round 2) 31 del vars, 25 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 0 upgd conss, 2396 impls, 0 clqs
0.00/0.01 c (round 3) 53 del vars, 54 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 0 upgd conss, 2908 impls, 0 clqs
0.00/0.01 c (round 4) 73 del vars, 81 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 0 upgd conss, 3320 impls, 0 clqs
0.00/0.01 c (round 5) 92 del vars, 106 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 69 chg coeffs, 0 upgd conss, 3664 impls, 0 clqs
0.00/0.01 c (round 6) 111 del vars, 131 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 0 upgd conss, 3940 impls, 0 clqs
0.00/0.01 c (round 7) 130 del vars, 156 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 0 upgd conss, 4148 impls, 0 clqs
0.00/0.01 c (round 8) 149 del vars, 181 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 96 chg coeffs, 0 upgd conss, 4288 impls, 0 clqs
0.00/0.01 c (round 9) 168 del vars, 206 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 105 chg coeffs, 0 upgd conss, 4360 impls, 0 clqs
0.00/0.01 c (round 10) 186 del vars, 232 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 114 chg coeffs, 0 upgd conss, 4360 impls, 0 clqs
0.00/0.01 c (round 11) 189 del vars, 238 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 114 chg coeffs, 9 upgd conss, 4360 impls, 0 clqs
0.00/0.02 c (round 12) 190 del vars, 238 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 114 chg coeffs, 9 upgd conss, 4416 impls, 0 clqs
0.00/0.02 c presolving (13 rounds):
0.00/0.02 c 190 deleted vars, 238 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 114 changed coefficients
0.00/0.02 c 4416 implications, 0 cliques
0.00/0.02 c presolved problem has 170 variables (170 bin, 0 int, 0 impl, 0 cont) and 102 constraints
0.00/0.02 c 75 constraints of type <and>
0.00/0.02 c 9 constraints of type <linear>
0.00/0.02 c 9 constraints of type <logicor>
0.00/0.02 c 9 constraints of type <pseudoboolean>
0.00/0.02 c transformed objective value is always integral (scale: 4)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.5
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 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 | 35 | - |1194k| 0 | 28 | 170 | 109 | 170 | 168 | 0 | 7 | 0 | 3.000000e+00 | -- | Inf
0.07/0.08 o 11
0.07/0.08 c y 0.1s| 1 | 0 | 285 | - |1274k| 0 | 28 | 170 | 109 | 170 | 168 | 0 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.07/0.09 c 0.1s| 1 | 0 | 309 | - |1288k| 0 | 36 | 170 | 140 | 170 | 193 | 25 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.07/0.09 c 0.1s| 1 | 0 | 335 | - |1364k| 0 | 53 | 170 | 134 | 170 | 204 | 48 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.10 c 0.1s| 1 | 0 | 367 | - |1453k| 0 | 67 | 170 | 134 | 170 | 223 | 67 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.12 c 0.1s| 1 | 0 | 399 | - |1513k| 0 | 70 | 170 | 134 | 170 | 244 | 88 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.13 c 0.1s| 1 | 0 | 445 | - |1593k| 0 | 80 | 170 | 134 | 170 | 268 | 112 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.15 c 0.2s| 1 | 0 | 490 | - |1675k| 0 | 86 | 170 | 134 | 170 | 287 | 131 | 7 | 0 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.17 c 0.2s| 1 | 2 | 490 | - |1675k| 0 | 86 | 170 | 134 | 170 | 287 | 131 | 7 | 10 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.17 c (run 1, node 1) restarting after 10 global fixings of integer variables
0.09/0.17 c
0.09/0.17 c (restart) converted 55 cuts from the global cut pool into linear constraints
0.09/0.17 c
0.09/0.18 c presolving:
0.09/0.18 c (round 1) 10 del vars, 10 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 3 chg coeffs, 0 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 2) 10 del vars, 17 del conss, 0 add conss, 0 chg bounds, 7 chg sides, 3 chg coeffs, 0 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 3) 10 del vars, 17 del conss, 0 add conss, 0 chg bounds, 7 chg sides, 3 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 4) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 50 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 5) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 55 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 6) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 58 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 7) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 60 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 8) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 61 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c (round 9) 10 del vars, 17 del conss, 2 add conss, 0 chg bounds, 13 chg sides, 63 chg coeffs, 79 upgd conss, 4416 impls, 0 clqs
0.09/0.18 c presolving (10 rounds):
0.09/0.18 c 10 deleted vars, 17 deleted constraints, 2 added constraints, 0 tightened bounds, 0 added holes, 13 changed sides, 63 changed coefficients
0.09/0.18 c 4416 implications, 0 cliques
0.09/0.18 c presolved problem has 160 variables (160 bin, 0 int, 0 impl, 0 cont) and 180 constraints
0.09/0.18 c 30 constraints of type <knapsack>
0.09/0.18 c 13 constraints of type <setppc>
0.09/0.18 c 69 constraints of type <and>
0.09/0.18 c 9 constraints of type <linear>
0.09/0.18 c 50 constraints of type <logicor>
0.09/0.18 c 9 constraints of type <pseudoboolean>
0.09/0.18 c transformed objective value is always integral (scale: 4)
0.09/0.18 c Presolving Time: 0.02
0.09/0.18 c
0.09/0.18 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.18 c 0.2s| 1 | 0 | 534 | - |1436k| 0 | 27 | 160 | 180 | 160 | 212 | 0 | 7 | 10 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.09/0.19 c 0.2s| 1 | 0 | 573 | - |1552k| 0 | 56 | 160 | 180 | 160 | 239 | 27 | 7 | 10 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.19/0.21 c 0.2s| 1 | 2 | 573 | - |1553k| 0 | 56 | 160 | 180 | 160 | 239 | 27 | 7 | 27 | 3.000000e+00 | 1.100000e+01 | 266.67%
0.29/0.38 o 3
0.29/0.38 c * 0.4s| 86 | 0 | 1048 | 5.5 |1557k| 37 | - | 160 | 218 | 160 | 96 | 121 | 45 | 483 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.29/0.38 c
0.29/0.38 c SCIP Status : problem is solved [optimal solution found]
0.29/0.38 c Solving Time (sec) : 0.38
0.29/0.38 c Solving Nodes : 86 (total of 87 nodes in 2 runs)
0.29/0.38 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.29/0.38 c Dual Bound : +3.00000000000000e+00
0.29/0.38 c Gap : 0.00 %
0.29/0.39 s OPTIMUM FOUND
0.29/0.39 v -x135 -x134 -x133 -x132 x131 -x130 -x129 x128 -x127 -x126 -x90 -x89 x88 x87 x86 -x125 -x124 -x123 -x122 -x121 -x85 x84 x83 x82
0.29/0.39 v x81 -x120 -x119 x118 x117 -x116 -x80 -x79 -x78 x77 x76 -x115 -x114 -x113 -x112 -x111 -x75 x74 x73 x72 x71 -x110 x109 x108 x107
0.29/0.39 v x106 -x70 -x69 -x68 x67 x66 -x105 -x104 -x103 x102 -x101 x65 -x64 x63 x62 x61 -x100 -x99 x98 x97 -x96 -x60 -x59 -x58 x57 x56
0.29/0.39 v -x95 -x94 -x93 -x92 -x91 -x55 x54 x53 x52 x51 -x50 -x49 x48 -x47 x46 -x45 x44 -x43 -x42 x41 -x40 -x39 x38 -x37 x36 -x35 x34
0.29/0.39 v x33 -x32 x31 -x30 -x29 x28 -x27 x26 x25 -x24 x23 -x22 x21 x20 x19 x18 -x17 x16 -x15 x14 x13 -x12 x11 -x10 -x9 x8 -x7 x6 -x5
0.29/0.39 v -x4 -x3 x2 x1
0.29/0.39 c SCIP Status : problem is solved [optimal solution found]
0.29/0.39 c Total Time : 0.38
0.29/0.39 c solving : 0.38
0.29/0.39 c presolving : 0.02 (included in solving)
0.29/0.39 c reading : 0.00 (included in solving)
0.29/0.39 c Original Problem :
0.29/0.39 c Problem name : HOME/instance-3488355-1307778345.opb
0.29/0.39 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.39 c Constraints : 253 initial, 253 maximal
0.29/0.39 c Presolved Problem :
0.29/0.39 c Problem name : t_HOME/instance-3488355-1307778345.opb
0.29/0.39 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.39 c Constraints : 180 initial, 218 maximal
0.29/0.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.29/0.39 c trivial : 0.00 10 0 0 0 0 0 0 0 0
0.29/0.39 c dualfix : 0.00 9 0 0 0 0 0 0 0 0
0.29/0.39 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c probing : 0.00 0 1 0 0 0 0 0 0 0
0.29/0.39 c knapsack : 0.00 0 0 0 0 0 0 2 6 60
0.29/0.39 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.29/0.39 c and : 0.01 72 87 0 0 0 87 0 0 84
0.29/0.39 c linear : 0.00 1 20 0 0 0 8 0 7 33
0.29/0.39 c logicor : 0.00 0 0 0 0 0 4 0 0 0
0.29/0.39 c pseudoboolean : 0.00 0 0 0 0 0 156 0 0 0
0.29/0.39 c root node : - 10 - - 10 - - - - -
0.29/0.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.29/0.39 c integral : 0 0 0 80 0 8 0 0 8 0 0 144
0.29/0.39 c knapsack : 30 1 302 0 0 0 8 0 5 20 0 0
0.29/0.39 c setppc : 13 1 281 0 0 0 5 0 14 0 0 0
0.29/0.39 c and : 69 137 825 1 0 0 256 5 145 116 0 0
0.29/0.39 c linear : 9 8 820 1 0 4 183 21 146 11 0 0
0.29/0.39 c logicor : 50+ 7 229 1 0 2 38 13 34 7 0 0
0.29/0.39 c pseudoboolean : 9 0 0 1 0 1 0 0 0 0 0 0
0.29/0.39 c countsols : 0 0 0 1 0 3 0 0 0 0 0 0
0.29/0.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.29/0.39 c integral : 0.16 0.00 0.00 0.16 0.00 0.00 0.00
0.29/0.39 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.39 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.29/0.39 c vbounds : 0 0 0 0
0.29/0.39 c rootredcost : 0 0 0 0
0.29/0.39 c pseudoobj : 455 0 0 0
0.29/0.39 c Propagator Timings : TotalTime Propagate Resprop
0.29/0.39 c vbounds : 0.00 0.00 0.00
0.29/0.39 c rootredcost : 0.00 0.00 0.00
0.29/0.39 c pseudoobj : 0.00 0.00 0.00
0.29/0.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.39 c propagation : 0.00 39 30 123 13.2 5 14.8 -
0.29/0.39 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.39 c applied globally : - - - 45 8.1 - - -
0.29/0.39 c applied locally : - - - 0 0.0 - - -
0.29/0.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.39 c cut pool : 0.00 0 - - 0 - (maximal pool size: 103)
0.29/0.39 c redcost : 0.00 137 0 2 0 0
0.29/0.39 c impliedbounds : 0.00 7 0 0 55 0
0.29/0.39 c intobj : 0.00 0 0 0 0 0
0.29/0.39 c gomory : 0.02 7 0 0 204 0
0.29/0.39 c cgmip : 0.00 0 0 0 0 0
0.29/0.39 c closecuts : 0.00 0 0 0 0 0
0.29/0.39 c strongcg : 0.01 7 0 0 402 0
0.29/0.39 c cmir : 0.01 7 0 0 120 0
0.29/0.39 c flowcover : 0.02 7 0 0 260 0
0.29/0.39 c clique : 0.00 2 0 0 0 0
0.29/0.39 c zerohalf : 0.00 0 0 0 0 0
0.29/0.39 c mcf : 0.00 2 0 0 0 0
0.29/0.39 c oddcycle : 0.00 0 0 0 0 0
0.29/0.39 c rapidlearning : 0.02 1 0 0 0 31
0.29/0.39 c Pricers : Time Calls Vars
0.29/0.39 c problem variables: 0.00 0 0
0.29/0.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.39 c relpscost : 0.16 79 0 8 0 0 144
0.29/0.39 c pscost : 0.00 0 0 0 0 0 0
0.29/0.39 c inference : 0.00 0 0 0 0 0 0
0.29/0.39 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.39 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.39 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.39 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.39 c random : 0.00 0 0 0 0 0 0
0.29/0.39 c Primal Heuristics : Time Calls Found
0.29/0.39 c LP solutions : 0.00 - 1
0.29/0.39 c pseudo solutions : 0.00 - 0
0.29/0.39 c crossover : 0.00 0 0
0.29/0.39 c fracdiving : 0.00 0 0
0.29/0.39 c veclendiving : 0.00 0 0
0.29/0.39 c objpscostdiving : 0.00 0 0
0.29/0.39 c rootsoldiving : 0.00 0 0
0.29/0.39 c linesearchdiving : 0.00 0 0
0.29/0.39 c guideddiving : 0.00 0 0
0.29/0.39 c intshifting : 0.00 0 0
0.29/0.39 c oneopt : 0.00 1 0
0.29/0.39 c coefdiving : 0.00 1 0
0.29/0.39 c pscostdiving : 0.00 1 0
0.29/0.39 c feaspump : 0.00 1 0
0.29/0.39 c trivial : 0.00 2 0
0.29/0.39 c shiftandpropagate: 0.00 1 0
0.29/0.39 c simplerounding : 0.00 0 0
0.29/0.39 c zirounding : 0.00 0 0
0.29/0.39 c rounding : 0.00 121 0
0.29/0.39 c shifting : 0.00 19 0
0.29/0.39 c twoopt : 0.00 0 0
0.29/0.39 c fixandinfer : 0.00 0 0
0.29/0.39 c clique : 0.00 0 0
0.29/0.39 c intdiving : 0.00 0 0
0.29/0.39 c actconsdiving : 0.00 0 0
0.29/0.39 c octane : 0.00 0 0
0.29/0.39 c rens : 0.02 1 0
0.29/0.39 c rins : 0.00 0 0
0.29/0.39 c localbranching : 0.00 0 0
0.29/0.39 c mutation : 0.00 0 0
0.29/0.39 c dins : 0.00 0 0
0.29/0.39 c vbounds : 0.00 0 0
0.29/0.39 c undercover : 0.04 1 0
0.29/0.39 c subnlp : 0.00 0 0
0.29/0.39 c trysol : 0.00 0 0
0.29/0.39 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.39 c primal LP : 0.00 0 0 0.00 -
0.29/0.39 c dual LP : 0.02 134 698 5.21 31933.39
0.29/0.39 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.39 c barrier LP : 0.00 0 0 0.00 -
0.29/0.39 c diving/probing LP: 0.01 60 350 5.83 -
0.29/0.39 c strong branching : 0.16 483 4978 10.31 31542.66
0.29/0.39 c (at root node) : - 27 662 24.52 -
0.29/0.39 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.39 c B&B Tree :
0.29/0.39 c number of runs : 2
0.29/0.39 c nodes : 86
0.29/0.39 c nodes (total) : 87
0.29/0.39 c nodes left : 0
0.29/0.39 c max depth : 37
0.29/0.39 c max depth (total): 37
0.29/0.39 c backtracks : 7 (8.1%)
0.29/0.39 c delayed cutoffs : 4
0.29/0.39 c repropagations : 35 (58 domain reductions, 3 cutoffs)
0.29/0.39 c avg switch length: 2.84
0.29/0.39 c switching time : 0.00
0.29/0.39 c Solution :
0.29/0.39 c Solutions found : 2 (2 improvements)
0.29/0.39 c First Solution : +1.10000000000000e+01 (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trysol>)
0.29/0.39 c Primal Bound : +3.00000000000000e+00 (in run 2, after 86 nodes, 0.38 seconds, depth 33, found by <relaxation>)
0.29/0.39 c Dual Bound : +3.00000000000000e+00
0.29/0.39 c Gap : 0.00 %
0.29/0.39 c Root Dual Bound : +3.00000000000000e+00
0.29/0.39 c Root Iterations : 573
0.29/0.39 c Time complete: 0.38.