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-3717602-1338203742.wbo>
0.00/0.00 c original problem has 555 variables (555 bin, 0 int, 0 impl, 0 cont) and 436 constraints
0.00/0.00 c problem read in 0.00
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 add conss, 405 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 30 clqs
0.00/0.02 c (round 2) 0 del vars, 0 del conss, 0 add conss, 405 chg bounds, 0 chg sides, 0 chg coeffs, 31 upgd conss, 0 impls, 30 clqs
0.00/0.07 c (0.1s) probing: 456/555 (82.2%) - 0 fixings, 0 aggregations, 405 implications, 0 bound changes
0.00/0.07 c (0.1s) probing aborted: 50/50 successive totally useless probings
0.00/0.07 c presolving (3 rounds):
0.00/0.07 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 405 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 405 implications, 30 cliques
0.00/0.07 c presolved problem has 960 variables (555 bin, 0 int, 405 impl, 0 cont) and 841 constraints
0.00/0.07 c 1 constraints of type <knapsack>
0.00/0.07 c 30 constraints of type <setppc>
0.00/0.07 c 405 constraints of type <linear>
0.00/0.07 c 405 constraints of type <indicator>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.06
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 2.1.1.4
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1797
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 13950
0.00/0.07 c
0.00/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
0.00/0.07 c
0.00/0.07 c # belongs reading time to solving time?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c timing/reading = TRUE
0.00/0.07 c
0.00/0.07 c # force restart if we have a max FS instance and gap is 1?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/indicator/forcerestart = TRUE
0.00/0.07 c
0.00/0.07 c # priority of branching rule <inference>
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.07 c branching/inference/priority = 1000000
0.00/0.07 c
0.00/0.07 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.07 c heuristics/coefdiving/freqofs = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/shiftandpropagate/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/undercover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/indrounding/freq = 1
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/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.00/0.08 c 0.1s| 1 | 0 | 61 | - |3613k| 0 | 60 | 960 | 841 | 960 | 840 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.2s| 1 | 0 | 354 | - |3687k| 0 | 60 | 960 | 841 | 960 | 848 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 375 | - |3695k| 0 | 60 | 960 | 841 | 960 | 853 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 412 | - |3703k| 0 | 65 | 960 | 841 | 960 | 858 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.20 c 0.2s| 1 | 0 | 454 | - |3732k| 0 | 68 | 960 | 841 | 960 | 864 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.22 c 0.2s| 1 | 0 | 487 | - |3793k| 0 | 72 | 960 | 841 | 960 | 872 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.25 c 0.2s| 1 | 0 | 533 | - |3915k| 0 | 73 | 960 | 841 | 960 | 880 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.28 o 3
0.18/0.28 c c 0.3s| 1 | 0 | 808 | - |4010k| 0 | - | 960 | 841 | 960 | 880 | 40 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.30 c 0.3s| 1 | 0 | 808 | - |3955k| 0 | 73 | 960 | 841 | 960 | 880 | 40 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.33 c 0.3s| 1 | 0 | 852 | - |4147k| 0 | 79 | 960 | 841 | 960 | 887 | 47 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.33 c 0.3s| 1 | 2 | 852 | - |4147k| 0 | 79 | 960 | 841 | 960 | 887 | 47 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.35 o 2
0.29/0.35 c c 0.4s| 11 | 12 | 1075 | 49.8 |4214k| 10 | - | 960 | 841 | 960 | 866 | 47 | 0 | 0 | 0.000000e+00 | 2.000000e+00 | Inf
0.29/0.37 o 1
0.29/0.37 c Forcing restart, since the absolute gap is 1.000000.
0.29/0.37 c p 0.4s| 16 | 11 | 1176 | 39.9 |4279k| 13 | - | 960 | 845 | 960 | 866 | 47 | 4 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.29/0.37 c (run 1, node 16) performing user restart
0.29/0.37 c
0.29/0.37 c (restart) converted 431 cuts from the global cut pool into linear constraints
0.29/0.37 c
0.29/0.37 c presolving:
0.29/0.38 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 405 upgd conss, 405 impls, 30 clqs
0.29/0.38 c (round 2) 0 del vars, 0 del conss, 0 add conss, 405 chg bounds, 0 chg sides, 0 chg coeffs, 405 upgd conss, 405 impls, 30 clqs
0.29/0.39 c (round 3) 810 del vars, 811 del conss, 0 add conss, 810 chg bounds, 0 chg sides, 0 chg coeffs, 407 upgd conss, 1215 impls, 44 clqs
0.29/0.40 c (round 4) 810 del vars, 856 del conss, 0 add conss, 810 chg bounds, 44 chg sides, 0 chg coeffs, 407 upgd conss, 1215 impls, 44 clqs
0.39/0.40 c (round 5) 810 del vars, 856 del conss, 0 add conss, 810 chg bounds, 44 chg sides, 0 chg coeffs, 794 upgd conss, 1215 impls, 44 clqs
0.39/0.40 c (round 6) 810 del vars, 901 del conss, 22 add conss, 810 chg bounds, 64 chg sides, 51 chg coeffs, 794 upgd conss, 1215 impls, 52 clqs
0.39/0.40 c (round 7) 810 del vars, 903 del conss, 22 add conss, 810 chg bounds, 64 chg sides, 52 chg coeffs, 794 upgd conss, 1215 impls, 52 clqs
0.39/0.40 c (round 8) 810 del vars, 903 del conss, 22 add conss, 810 chg bounds, 64 chg sides, 53 chg coeffs, 794 upgd conss, 1215 impls, 52 clqs
0.39/0.40 c (round 9) 810 del vars, 903 del conss, 22 add conss, 810 chg bounds, 64 chg sides, 54 chg coeffs, 794 upgd conss, 1215 impls, 52 clqs
0.39/0.40 c presolving (10 rounds):
0.39/0.40 c 810 deleted vars, 903 deleted constraints, 22 added constraints, 810 tightened bounds, 0 added holes, 64 changed sides, 54 changed coefficients
0.39/0.40 c 1215 implications, 52 cliques
0.39/0.40 c presolved problem has 150 variables (150 bin, 0 int, 0 impl, 0 cont) and 395 constraints
0.39/0.40 c 8 constraints of type <knapsack>
0.39/0.40 c 385 constraints of type <setppc>
0.39/0.40 c 2 constraints of type <logicor>
0.39/0.40 c transformed objective value is always integral (scale: 1)
0.39/0.40 c Presolving Time: 0.10
0.39/0.40 c
0.39/0.41 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.41 c 0.4s| 1 | 0 | 1268 | - |2962k| 0 | 65 | 150 | 395 | 150 | 393 | 0 | 4 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.42 c 0.4s| 1 | 0 | 1316 | - |3029k| 0 | 71 | 150 | 395 | 150 | 405 | 12 | 4 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.42 c 0.4s| 1 | 2 | 1386 | - |3034k| 0 | 71 | 150 | 397 | 150 | 405 | 12 | 6 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.48 c
0.39/0.48 c SCIP Status : problem is solved [optimal solution found]
0.39/0.48 c Solving Time (sec) : 0.48
0.39/0.48 c Solving Nodes : 93 (total of 109 nodes in 2 runs)
0.39/0.48 c Primal Bound : +1.00000000000000e+00 (3 solutions)
0.39/0.48 c Dual Bound : +1.00000000000000e+00
0.39/0.48 c Gap : 0.00 %
0.39/0.48 s OPTIMUM FOUND
0.39/0.48 v -x150 -x149 x148 -x147 -x146 -x145 -x144 -x143 x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129
0.39/0.48 v x128 -x127 -x126 -x125 -x124 -x123 x122 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 x111 x110 -x109 -x108 -x107
0.39/0.48 v -x106 -x105 -x104 -x103 x102 -x101 x100 -x99 -x98 -x97 -x96 -x95 x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 x85 -x84 -x83
0.39/0.48 v -x82 -x81 -x80 x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 x66 -x65 -x64 -x63 -x62 x61 x60 -x59 -x58 -x57
0.39/0.48 v -x56 -x55 -x54 -x53 -x52 x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31
0.39/0.48 v 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 -x4 -x3
0.39/0.48 v -x2 x1
0.39/0.48 c SCIP Status : problem is solved [optimal solution found]
0.39/0.48 c Total Time : 0.48
0.39/0.48 c solving : 0.48
0.39/0.48 c presolving : 0.10 (included in solving)
0.39/0.48 c reading : 0.00 (included in solving)
0.39/0.48 c copying : 0.01 (2 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.39/0.48 c Original Problem :
0.39/0.48 c Problem name : HOME/instance-3717602-1338203742.wbo
0.39/0.48 c Variables : 555 (555 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.48 c Constraints : 436 initial, 436 maximal
0.39/0.48 c Objective sense : minimize
0.39/0.48 c Presolved Problem :
0.39/0.48 c Problem name : t_HOME/instance-3717602-1338203742.wbo
0.39/0.48 c Variables : 150 (150 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.48 c Constraints : 395 initial, 481 maximal
0.39/0.48 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.39/0.48 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c trivial : 0.00 0.00 405 0 0 0 0 0 0 0 0
0.39/0.48 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c pseudoobj : 0.00 0.00 0 0 0 405 0 0 0 0 0
0.39/0.48 c probing : 0.05 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c varbound : 0.00 0.00 0 0 0 405 0 405 0 0 0
0.39/0.48 c knapsack : 0.01 0.00 0 0 0 0 0 5 22 20 54
0.39/0.48 c setppc : 0.00 0.00 0 0 0 0 0 44 0 0 0
0.39/0.48 c linear : 0.03 0.00 405 0 0 405 0 44 0 44 0
0.39/0.48 c indicator : 0.00 0.00 0 0 0 0 0 405 0 0 0
0.39/0.48 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.48 c root node : - - 30 - - 30 - - - - -
0.39/0.48 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.39/0.48 c integral : 0 0 0 0 67 0 84 0 0 0 0 0 134
0.39/0.48 c knapsack : 8 8 1 1455 0 0 28 6 0 1 0 0 0
0.39/0.48 c setppc : 385 385 8 1469 0 0 78 487 21 732 0 0 0
0.39/0.48 c logicor : 2+ 91 1 145 0 0 0 68 7 66 0 0 0
0.39/0.48 c countsols : 0 0 0 0 0 0 5 0 0 0 0 0 0
0.39/0.48 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.39/0.48 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c setppc : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.39/0.48 c rootredcost : 1 0 0 0
0.39/0.48 c pseudoobj : 158 2 0 0
0.39/0.48 c vbounds : 8 17 0 770
0.39/0.48 c redcost : 79 0 0 775
0.39/0.48 c probing : 0 0 0 0
0.39/0.48 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.39/0.48 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c redcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.48 c probing : 0.05 0.00 0.05 0.00 0.00
0.39/0.48 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.48 c propagation : 0.00 29 25 54 6.5 0 0.0 -
0.39/0.48 c infeasible LP : 0.00 28 27 70 6.2 0 0.0 0
0.39/0.48 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.48 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.48 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.48 c applied globally : - - - 103 6.1 - - -
0.39/0.48 c applied locally : - - - 0 0.0 - - -
0.39/0.48 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.39/0.48 c cut pool : 0.00 0 - - 0 - (maximal pool size: 78)
0.39/0.48 c closecuts : 0.00 0.00 0 0 0 0 0
0.39/0.48 c impliedbounds : 0.00 0.00 8 0 0 0 0
0.39/0.48 c intobj : 0.00 0.00 0 0 0 0 0
0.39/0.48 c gomory : 0.01 0.00 8 0 0 400 0
0.39/0.48 c cgmip : 0.00 0.00 0 0 0 0 0
0.39/0.48 c strongcg : 0.03 0.00 8 0 0 1458 0
0.39/0.48 c cmir : 0.05 0.00 8 0 0 0 0
0.39/0.48 c flowcover : 0.04 0.00 8 0 0 0 0
0.39/0.48 c clique : 0.00 0.00 8 0 0 7 0
0.39/0.48 c zerohalf : 0.00 0.00 0 0 0 0 0
0.39/0.48 c mcf : 0.00 0.00 2 0 0 0 0
0.39/0.48 c oddcycle : 0.00 0.00 0 0 0 0 0
0.39/0.48 c rapidlearning : 0.05 0.00 1 0 0 0 0
0.39/0.48 c Pricers : ExecTime SetupTime Calls Vars
0.39/0.48 c problem variables: 0.00 - 0 0
0.39/0.48 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.39/0.48 c inference : 0.00 0.00 67 0 0 0 0 134
0.39/0.48 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c pscost : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c random : 0.00 0.00 0 0 0 0 0 0
0.39/0.48 c Primal Heuristics : ExecTime SetupTime Calls Found
0.39/0.48 c LP solutions : 0.00 - - 0
0.39/0.48 c pseudo solutions : 0.00 - - 0
0.39/0.48 c crossover : 0.00 0.00 0 0
0.39/0.48 c rootsoldiving : 0.00 0.00 0 0
0.39/0.48 c linesearchdiving : 0.00 0.00 0 0
0.39/0.48 c guideddiving : 0.00 0.00 0 0
0.39/0.48 c intshifting : 0.00 0.00 0 0
0.39/0.48 c oneopt : 0.00 0.00 2 0
0.39/0.48 c pscostdiving : 0.00 0.00 1 1
0.39/0.48 c fracdiving : 0.00 0.00 1 0
0.39/0.48 c veclendiving : 0.00 0.00 1 0
0.39/0.48 c objpscostdiving : 0.01 0.00 1 0
0.39/0.48 c smallcard : 0.00 0.00 0 0
0.39/0.48 c trivial : 0.00 0.00 2 0
0.39/0.48 c shiftandpropagate: 0.00 0.00 0 0
0.39/0.48 c simplerounding : 0.00 0.00 0 0
0.39/0.48 c zirounding : 0.00 0.00 0 0
0.39/0.48 c rounding : 0.00 0.00 76 0
0.39/0.48 c shifting : 0.00 0.00 13 0
0.39/0.48 c twoopt : 0.00 0.00 0 0
0.39/0.48 c indtwoopt : 0.00 0.00 0 0
0.39/0.48 c indoneopt : 0.00 0.00 3 0
0.39/0.48 c fixandinfer : 0.00 0.00 0 0
0.39/0.48 c feaspump : 0.01 0.00 1 0
0.39/0.48 c clique : 0.00 0.00 0 0
0.39/0.48 c coefdiving : 0.05 0.00 4 2
0.39/0.48 c indrounding : 0.00 0.00 66 0
0.39/0.48 c indcoefdiving : 0.00 0.00 0 0
0.39/0.48 c nlpdiving : 0.00 0.00 0 0
0.39/0.48 c intdiving : 0.00 0.00 0 0
0.39/0.48 c actconsdiving : 0.00 0.00 0 0
0.39/0.48 c octane : 0.00 0.00 0 0
0.39/0.48 c rens : 0.02 0.00 1 0
0.39/0.48 c rins : 0.00 0.00 0 0
0.39/0.48 c localbranching : 0.00 0.00 0 0
0.39/0.48 c mutation : 0.00 0.00 0 0
0.39/0.48 c dins : 0.00 0.00 0 0
0.39/0.48 c vbounds : 0.00 0.00 0 0
0.39/0.48 c undercover : 0.00 0.00 0 0
0.39/0.48 c subnlp : 0.00 0.00 0 0
0.39/0.48 c trysol : 0.00 0.00 0 0
0.39/0.48 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.39/0.48 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.39/0.48 c dual LP : 0.04 106 1054 10.87 25396.98 0.00 9
0.39/0.48 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.48 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.39/0.48 c diving/probing LP: 0.05 183 1006 5.50 19207.64
0.39/0.48 c strong branching : 0.00 0 0 0.00 -
0.39/0.48 c (at root node) : - 0 0 0.00 -
0.39/0.48 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.48 c B&B Tree :
0.39/0.48 c number of runs : 2
0.39/0.48 c nodes : 93
0.39/0.48 c nodes (total) : 109
0.39/0.48 c nodes left : 0
0.39/0.48 c max depth : 10
0.39/0.48 c max depth (total): 13
0.39/0.48 c backtracks : 29 (31.2%)
0.39/0.48 c delayed cutoffs : 11
0.39/0.48 c repropagations : 91 (152 domain reductions, 7 cutoffs)
0.39/0.48 c avg switch length: 3.81
0.39/0.48 c switching time : 0.00
0.39/0.48 c Solution :
0.39/0.48 c Solutions found : 3 (3 improvements)
0.39/0.48 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.28 seconds, depth 62, found by <coefdiving>)
0.39/0.48 c Primal Bound : +1.00000000000000e+00 (in run 1, after 16 nodes, 0.37 seconds, depth 19, found by <pscostdiving>)
0.39/0.48 c Dual Bound : +1.00000000000000e+00
0.39/0.48 c Gap : 0.00 %
0.39/0.48 c Root Dual Bound : +0.00000000000000e+00
0.39/0.48 c Root Iterations : 717
0.39/0.48 c Time complete: 0.47.