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-3693834-1338035244.opb>
0.00/0.00 c original problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 5 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 3 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 328 impls, 0 clqs
0.00/0.00 c (round 2) 17 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 0 upgd conss, 474 impls, 0 clqs
0.00/0.01 c (round 3) 30 del vars, 22 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 3 upgd conss, 474 impls, 0 clqs
0.00/0.01 c (round 4) 31 del vars, 23 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 3 upgd conss, 474 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/77 (66.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 (5 rounds):
0.00/0.01 c 31 deleted vars, 23 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 34 changed coefficients
0.00/0.01 c 474 implications, 0 cliques
0.00/0.01 c presolved problem has 77 variables (77 bin, 0 int, 0 impl, 0 cont) and 52 constraints
0.00/0.01 c 47 constraints of type <and>
0.00/0.01 c 2 constraints of type <linear>
0.00/0.01 c 3 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 2)
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.01 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.01 c 0.0s| 1 | 0 | 6 | - | 486k| 0 | 4 | 77 | 66 | 77 | 99 | 0 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.03 c 0.0s| 1 | 0 | 119 | - | 504k| 0 | 11 | 77 | 67 | 77 | 104 | 5 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.04 c 0.0s| 1 | 0 | 129 | - | 530k| 0 | 14 | 77 | 67 | 77 | 108 | 9 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.04 c 0.0s| 1 | 0 | 138 | - | 557k| 0 | 22 | 77 | 67 | 77 | 116 | 17 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 147 | - | 583k| 0 | 21 | 77 | 67 | 77 | 122 | 23 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.05 c 0.1s| 1 | 0 | 156 | - | 592k| 0 | 24 | 77 | 67 | 77 | 126 | 27 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 162 | - | 600k| 0 | 6 | 77 | 67 | 77 | 133 | 34 | 14 | 0 | 3.000000e+00 | -- | Inf
0.01/0.06 o 5
0.01/0.06 c s 0.1s| 1 | 0 | 162 | - | 601k| 0 | 6 | 77 | 67 | 77 | 133 | 34 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.06 c 0.1s| 1 | 0 | 189 | - | 605k| 0 | 21 | 77 | 67 | 77 | 135 | 36 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.06 c 0.1s| 1 | 0 | 189 | - | 604k| 0 | 21 | 77 | 67 | 77 | 115 | 36 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.07 c 0.1s| 1 | 0 | 218 | - | 568k| 0 | 11 | 77 | 46 | 77 | 96 | 41 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.07 c 0.1s| 1 | 0 | 219 | - | 572k| 0 | 13 | 77 | 46 | 77 | 97 | 42 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.08 c 0.1s| 1 | 0 | 222 | - | 564k| 0 | 13 | 77 | 46 | 62 | 50 | 44 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.08 c 0.1s| 1 | 0 | 222 | - | 564k| 0 | 13 | 77 | 46 | 62 | 50 | 44 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.08 c 0.1s| 1 | 0 | 223 | - | 564k| 0 | 12 | 77 | 46 | 62 | 51 | 45 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.08 c 0.1s| 1 | 0 | 224 | - | 565k| 0 | 13 | 77 | 46 | 62 | 52 | 46 | 14 | 0 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.09 c 0.1s| 1 | 2 | 224 | - | 565k| 0 | 13 | 77 | 46 | 62 | 52 | 46 | 14 | 9 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.01/0.09 c (run 1, node 1) restarting after 29 global fixings of integer variables
0.01/0.09 c
0.01/0.09 c (restart) converted 21 cuts from the global cut pool into linear constraints
0.01/0.09 c
0.01/0.09 c presolving:
0.01/0.09 c (round 1) 36 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 11 chg coeffs, 0 upgd conss, 474 impls, 0 clqs
0.01/0.09 c (round 2) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 11 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.01/0.09 c (round 3) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 25 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.01/0.09 c (round 4) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 41 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.01/0.09 c (round 5) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 56 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.01/0.10 c (round 6) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 70 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 7) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 84 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 8) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 95 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 9) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 106 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 10) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 118 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 11) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 127 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 12) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 135 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 13) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 142 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 14) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 145 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 15) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 147 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 16) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 150 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 17) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 152 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c (round 18) 36 del vars, 17 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 153 chg coeffs, 16 upgd conss, 474 impls, 0 clqs
0.09/0.10 c presolving (19 rounds):
0.09/0.10 c 36 deleted vars, 17 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 153 changed coefficients
0.09/0.10 c 474 implications, 0 cliques
0.09/0.10 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.09/0.10 c 11 constraints of type <knapsack>
0.09/0.10 c 2 constraints of type <setppc>
0.09/0.10 c 22 constraints of type <and>
0.09/0.10 c 2 constraints of type <linear>
0.09/0.10 c 13 constraints of type <logicor>
0.09/0.10 c transformed objective value is always integral (scale: 2)
0.09/0.10 c Presolving Time: 0.02
0.09/0.10 c
0.09/0.10 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.10 c 0.1s| 1 | 0 | 236 | - | 502k| 0 | 9 | 41 | 50 | 41 | 64 | 0 | 14 | 9 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.11 c 0.1s| 1 | 0 | 258 | - | 519k| 0 | 14 | 41 | 50 | 41 | 71 | 7 | 14 | 9 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.11 c 0.1s| 1 | 2 | 258 | - | 520k| 0 | 14 | 41 | 50 | 41 | 71 | 7 | 14 | 19 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.09/0.13 o 3
0.09/0.13 c * 0.1s| 50 | 0 | 511 | 5.1 | 528k| 12 | - | 41 | 86 | 41 | 30 | 78 | 50 | 61 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.13 c
0.09/0.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Solving Time (sec) : 0.13
0.09/0.13 c Solving Nodes : 50 (total of 51 nodes in 2 runs)
0.09/0.13 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.09/0.13 c Dual Bound : +3.00000000000000e+00
0.09/0.13 c Gap : 0.00 %
0.09/0.13 s OPTIMUM FOUND
0.09/0.13 v -x36 -x35 x34 -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
0.09/0.13 v x8 x7 -x6 -x5 -x4 -x3 x2 x1
0.09/0.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Total Time : 0.13
0.09/0.13 c solving : 0.13
0.09/0.13 c presolving : 0.02 (included in solving)
0.09/0.13 c reading : 0.00 (included in solving)
0.09/0.13 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.09/0.13 c Original Problem :
0.09/0.13 c Problem name : HOME/instance-3693834-1338035244.opb
0.09/0.13 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 5 initial, 5 maximal
0.09/0.13 c Objective sense : minimize
0.09/0.13 c Presolved Problem :
0.09/0.13 c Problem name : t_HOME/instance-3693834-1338035244.opb
0.09/0.13 c Variables : 41 (41 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 50 initial, 86 maximal
0.09/0.13 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.13 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c trivial : 0.00 0.00 29 0 0 0 0 0 0 0 0
0.09/0.13 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 3 142
0.09/0.13 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.13 c and : 0.00 0.00 4 28 0 0 0 28 0 0 27
0.09/0.13 c linear : 0.00 0.00 1 5 0 0 0 5 0 0 18
0.09/0.13 c logicor : 0.00 0.00 0 0 0 0 0 7 0 0 0
0.09/0.13 c root node : - - 29 - - 29 - - - - -
0.09/0.13 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.09/0.13 c integral : 0 0 0 0 42 0 10 0 0 2 0 0 78
0.09/0.13 c knapsack : 11 11 1 138 0 0 0 1 0 0 0 0 0
0.09/0.13 c setppc : 2 2 1 58 0 0 0 6 0 2 0 0 0
0.09/0.13 c and : 22 22 88 315 0 0 6 295 5 166 90 0 0
0.09/0.13 c linear : 2 2 14 309 0 0 3 149 23 69 0 0 0
0.09/0.13 c logicor : 13+ 49 14 104 0 0 1 30 5 11 5 0 0
0.09/0.13 c countsols : 0 0 0 0 1 0 3 0 0 0 0 0 0
0.09/0.13 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.09/0.13 c integral : 0.01 0.00 0.00 0.00 0.01 0.00 0.00 0.00
0.09/0.13 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.09/0.13 c rootredcost : 0 0 0 0
0.09/0.13 c pseudoobj : 70 0 0 0
0.09/0.13 c vbounds : 0 0 0 0
0.09/0.13 c redcost : 92 0 0 4
0.09/0.13 c probing : 0 0 0 0
0.09/0.13 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.09/0.13 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c redcost : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c probing : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.13 c propagation : 0.00 33 29 95 14.5 7 5.1 -
0.09/0.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c applied globally : - - - 50 10.6 - - -
0.09/0.13 c applied locally : - - - 0 0.0 - - -
0.09/0.13 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.09/0.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 11)
0.09/0.13 c closecuts : 0.00 0.00 0 0 0 0 0
0.09/0.13 c impliedbounds : 0.00 0.00 14 0 0 17 0
0.09/0.13 c intobj : 0.00 0.00 0 0 0 0 0
0.09/0.13 c gomory : 0.01 0.00 11 0 0 41 0
0.09/0.13 c cgmip : 0.00 0.00 0 0 0 0 0
0.09/0.13 c strongcg : 0.01 0.00 14 0 0 123 0
0.09/0.13 c cmir : 0.01 0.00 11 0 0 43 0
0.09/0.13 c flowcover : 0.01 0.00 11 0 0 95 0
0.09/0.13 c clique : 0.00 0.00 2 0 0 0 0
0.09/0.13 c zerohalf : 0.00 0.00 0 0 0 0 0
0.09/0.13 c mcf : 0.00 0.00 2 0 0 0 0
0.09/0.13 c oddcycle : 0.00 0.00 0 0 0 0 0
0.09/0.13 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.09/0.13 c Pricers : ExecTime SetupTime Calls Vars
0.09/0.13 c problem variables: 0.00 - 0 0
0.09/0.13 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.09/0.13 c relpscost : 0.01 0.00 41 0 2 0 0 78
0.09/0.13 c pscost : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c inference : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c random : 0.00 0.00 0 0 0 0 0 0
0.09/0.13 c Primal Heuristics : ExecTime SetupTime Calls Found
0.09/0.13 c LP solutions : 0.00 - - 1
0.09/0.13 c pseudo solutions : 0.00 - - 0
0.09/0.13 c crossover : 0.00 0.00 0 0
0.09/0.13 c veclendiving : 0.00 0.00 0 0
0.09/0.13 c objpscostdiving : 0.00 0.00 0 0
0.09/0.13 c rootsoldiving : 0.00 0.00 0 0
0.09/0.13 c linesearchdiving : 0.00 0.00 0 0
0.09/0.13 c guideddiving : 0.00 0.00 0 0
0.09/0.13 c oneopt : 0.00 0.00 1 0
0.09/0.13 c pscostdiving : 0.00 0.00 1 0
0.09/0.13 c coefdiving : 0.00 0.00 1 0
0.09/0.13 c smallcard : 0.00 0.00 0 0
0.09/0.13 c trivial : 0.00 0.00 2 0
0.09/0.13 c shiftandpropagate: 0.00 0.00 1 0
0.09/0.13 c simplerounding : 0.00 0.00 0 0
0.09/0.13 c zirounding : 0.00 0.00 0 0
0.09/0.13 c rounding : 0.00 0.00 89 0
0.09/0.13 c shifting : 0.00 0.00 23 1
0.09/0.13 c intshifting : 0.00 0.00 0 0
0.09/0.13 c twoopt : 0.00 0.00 0 0
0.09/0.13 c indoneopt : 0.00 0.00 0 0
0.09/0.13 c indtwoopt : 0.00 0.00 0 0
0.09/0.13 c fixandinfer : 0.00 0.00 0 0
0.09/0.13 c feaspump : 0.00 0.00 1 0
0.09/0.13 c clique : 0.00 0.00 0 0
0.09/0.13 c indcoefdiving : 0.00 0.00 0 0
0.09/0.13 c indrounding : 0.00 0.00 0 0
0.09/0.13 c fracdiving : 0.00 0.00 1 0
0.09/0.13 c nlpdiving : 0.00 0.00 0 0
0.09/0.13 c intdiving : 0.00 0.00 0 0
0.09/0.13 c actconsdiving : 0.00 0.00 0 0
0.09/0.13 c octane : 0.00 0.00 0 0
0.09/0.13 c rens : 0.01 0.00 1 0
0.09/0.13 c rins : 0.00 0.00 0 0
0.09/0.13 c localbranching : 0.00 0.00 0 0
0.09/0.13 c mutation : 0.00 0.00 0 0
0.09/0.13 c dins : 0.00 0.00 0 0
0.09/0.13 c vbounds : 0.00 0.00 0 0
0.09/0.13 c undercover : 0.02 0.00 1 0
0.09/0.13 c subnlp : 0.00 0.00 0 0
0.09/0.13 c trysol : 0.00 0.00 0 0
0.09/0.13 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.09/0.13 c primal LP : 0.00 7 0 0.00 - 0.00 7
0.09/0.13 c dual LP : 0.01 95 385 4.28 - 0.00 5
0.09/0.13 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.13 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.09/0.13 c diving/probing LP: 0.00 23 126 5.48 -
0.09/0.13 c strong branching : 0.01 61 869 14.25 61309.44
0.09/0.13 c (at root node) : - 19 604 31.79 -
0.09/0.13 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.13 c B&B Tree :
0.09/0.13 c number of runs : 2
0.09/0.13 c nodes : 50
0.09/0.13 c nodes (total) : 51
0.09/0.13 c nodes left : 0
0.09/0.13 c max depth : 12
0.09/0.13 c max depth (total): 12
0.09/0.13 c backtracks : 14 (28.0%)
0.09/0.13 c delayed cutoffs : 5
0.09/0.13 c repropagations : 17 (46 domain reductions, 4 cutoffs)
0.09/0.13 c avg switch length: 3.20
0.09/0.13 c switching time : 0.00
0.09/0.13 c Solution :
0.09/0.13 c Solutions found : 2 (2 improvements)
0.09/0.13 c First Solution : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <shifting>)
0.09/0.13 c Primal Bound : +3.00000000000000e+00 (in run 2, after 50 nodes, 0.13 seconds, depth 8, found by <relaxation>)
0.09/0.13 c Dual Bound : +3.00000000000000e+00
0.09/0.13 c Gap : 0.00 %
0.09/0.13 c Root Dual Bound : +3.00000000000000e+00
0.09/0.13 c Root Iterations : 258
0.09/0.14 c Time complete: 0.13.