0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3450595-1307102042.opb>
0.00/0.01 c original problem has 1548 variables (1548 bin, 0 int, 0 impl, 0 cont) and 1598 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 50
0.00/0.01 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.00/0.01 c presolving:
0.00/0.06 c (round 1) 0 del vars, 1548 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 95174 impls, 0 clqs
0.06/0.06 c (round 2) 1498 del vars, 1548 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 95174 impls, 0 clqs
0.06/0.06 c presolving (3 rounds):
0.06/0.06 c 1498 deleted vars, 1548 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.06/0.06 c 95174 implications, 0 cliques
0.06/0.06 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.06/0.06 c 50 constraints of type <logicor>
0.06/0.06 c transformed objective value is always integral (scale: 1)
0.06/0.06 c Presolving Time: 0.05
0.06/0.06 c - non default parameters ----------------------------------------------------------------------
0.06/0.06 c # SCIP version 2.0.1.5
0.06/0.06 c
0.06/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.06/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.06 c conflict/interconss = 0
0.06/0.06 c
0.06/0.06 c # should binary conflicts be preferred?
0.06/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.06 c conflict/preferbinary = TRUE
0.06/0.06 c
0.06/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.06/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.06 c constraints/agelimit = 1
0.06/0.06 c
0.06/0.06 c # should enforcement of pseudo solution be disabled?
0.06/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.06 c constraints/disableenfops = TRUE
0.06/0.06 c
0.06/0.06 c # frequency for displaying node information lines
0.06/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.06 c display/freq = 10000
0.06/0.06 c
0.06/0.06 c # maximal time in seconds to run
0.06/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.06 c limits/time = 1800
0.06/0.06 c
0.06/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.07 c limits/memory = 13950
0.06/0.07 c
0.06/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.06/0.07 c # [type: int, range: [1,2], default: 1]
0.06/0.07 c timing/clocktype = 2
0.06/0.07 c
0.06/0.07 c # belongs reading time to solving time?
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c timing/reading = TRUE
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify inequalities
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/linear/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/indicator/addCouplingCons = TRUE
0.06/0.07 c
0.06/0.07 c # should presolving try to simplify knapsacks
0.06/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.07 c
0.06/0.07 c -----------------------------------------------------------------------------------------------
0.06/0.07 c start solving
0.06/0.07 c
0.06/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.07 c t 0.1s| 1 | 0 | 197 | - |3567k| 0 | 29 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.611924e+00 | 5.000000e+01 |3001.88%
0.06/0.07 o 29
0.06/0.07 c r 0.1s| 1 | 0 | 197 | - |3568k| 0 | 29 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.611924e+00 | 2.900000e+01 |1699.09%
0.06/0.07 o 28
0.06/0.07 c R 0.1s| 1 | 0 | 197 | - |3570k| 0 | 29 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.611924e+00 | 2.800000e+01 |1637.05%
0.06/0.07 o 27
0.06/0.07 c s 0.1s| 1 | 0 | 197 | - |3571k| 0 | 29 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.611924e+00 | 2.700000e+01 |1575.02%
0.06/0.07 c 0.1s| 1 | 0 | 231 | - |3636k| 0 | 23 | 50 | 50 | 50 | 51 | 1 | 0 | 0 | 1.672419e+00 | 2.700000e+01 |1514.43%
0.06/0.07 o 4
0.06/0.07 c b 0.1s| 1 | 0 | 231 | - |3637k| 0 | 23 | 50 | 50 | 50 | 51 | 1 | 0 | 0 | 1.672419e+00 | 4.000000e+00 | 139.17%
0.06/0.08 c 0.1s| 1 | 0 | 301 | - |3693k| 0 | 25 | 50 | 50 | 50 | 52 | 2 | 0 | 0 | 2.000000e+00 | 4.000000e+00 | 100.00%
0.06/0.08 o 3
0.06/0.08 c R 0.1s| 1 | 0 | 301 | - |3694k| 0 | 25 | 50 | 50 | 50 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.06/0.08 c 0.1s| 1 | 0 | 326 | - |3769k| 0 | 25 | 50 | 50 | 50 | 53 | 3 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.06/0.08 o 3
0.06/0.08 c s 0.1s| 1 | 0 | 326 | - |3771k| 0 | 25 | 50 | 50 | 50 | 53 | 3 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.06/0.09 c 0.1s| 1 | 0 | 347 | - |3837k| 0 | 24 | 50 | 50 | 50 | 54 | 4 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.06/0.09 c 0.1s| 1 | 0 | 370 | - |3878k| 0 | 25 | 50 | 50 | 50 | 55 | 5 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 392 | - |3900k| 0 | 25 | 50 | 50 | 50 | 56 | 6 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 405 | - |3902k| 0 | 26 | 50 | 50 | 50 | 57 | 7 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 c 0.1s| 1 | 0 | 450 | - |3904k| 0 | 23 | 50 | 50 | 50 | 57 | 7 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 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.12 c 0.1s| 1 | 0 | 462 | - |3918k| 0 | 25 | 50 | 50 | 50 | 58 | 8 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 o 3
0.09/0.12 c s 0.1s| 1 | 0 | 462 | - |3919k| 0 | 25 | 50 | 50 | 50 | 58 | 8 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.13 c 0.1s| 1 | 0 | 503 | - |3919k| 0 | 21 | 50 | 50 | 50 | 58 | 8 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 c 0.1s| 1 | 0 | 520 | - |4016k| 0 | 21 | 50 | 50 | 50 | 59 | 9 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 o 3
0.09/0.14 c s 0.1s| 1 | 0 | 520 | - |4017k| 0 | 21 | 50 | 50 | 50 | 59 | 9 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 c 0.1s| 1 | 0 | 520 | - |4017k| 0 | - | 50 | 50 | 50 | 59 | 9 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 c (run 1, node 1) restarting after 15 global fixings of integer variables
0.09/0.14 c
0.09/0.14 c (restart) converted 9 cuts from the global cut pool into linear constraints
0.09/0.14 c
0.09/0.15 c presolving:
0.09/0.15 c (round 1) 15 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 95174 impls, 0 clqs
0.09/0.15 c presolving (2 rounds):
0.09/0.15 c 15 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 95174 implications, 0 cliques
0.09/0.15 c presolved problem has 35 variables (35 bin, 0 int, 0 impl, 0 cont) and 59 constraints
0.09/0.15 c 9 constraints of type <knapsack>
0.09/0.15 c 50 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c
0.09/0.15 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.15 c 0.1s| 1 | 0 | 535 | - |3597k| 0 | 13 | 35 | 59 | 35 | 59 | 0 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 c 0.2s| 1 | 0 | 553 | - |3698k| 0 | 18 | 35 | 59 | 35 | 60 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 o 3
0.09/0.15 c s 0.2s| 1 | 0 | 553 | - |3700k| 0 | 18 | 35 | 59 | 35 | 60 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c 0.2s| 1 | 0 | 580 | - |3700k| 0 | 17 | 35 | 59 | 35 | 60 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c 0.2s| 1 | 0 | 580 | - |3700k| 0 | - | 35 | 59 | 35 | 60 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.09/0.16 c
0.09/0.16 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.09/0.16 c
0.09/0.16 c presolving:
0.09/0.16 c (round 1) 10 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 95174 impls, 0 clqs
0.09/0.16 c presolving (2 rounds):
0.09/0.16 c 10 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.16 c 95174 implications, 0 cliques
0.09/0.16 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 60 constraints
0.09/0.16 c 10 constraints of type <knapsack>
0.09/0.16 c 50 constraints of type <logicor>
0.09/0.16 c transformed objective value is always integral (scale: 1)
0.09/0.16 c Presolving Time: 0.06
0.09/0.16 c
0.09/0.17 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.17 c 0.2s| 1 | 0 | 592 | - |3580k| 0 | 9 | 25 | 60 | 25 | 60 | 0 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 c 0.2s| 1 | 0 | 604 | - |3601k| 0 | 15 | 25 | 60 | 25 | 61 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 o 3
0.09/0.17 c s 0.2s| 1 | 0 | 604 | - |3602k| 0 | 15 | 25 | 60 | 25 | 61 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 c 0.2s| 1 | 0 | 622 | - |3602k| 0 | 14 | 25 | 60 | 25 | 61 | 1 | 0 | 30 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 c 0.2s| 1 | 0 | 622 | - |3603k| 0 | - | 25 | 60 | 25 | 61 | 1 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 c (run 3, node 1) restarting after 10 global fixings of integer variables
0.09/0.17 c
0.09/0.17 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.09/0.17 c
0.09/0.17 c presolving:
0.09/0.18 c (round 1) 10 del vars, 22 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 95174 impls, 0 clqs
0.09/0.18 c presolving (2 rounds):
0.09/0.18 c 10 deleted vars, 22 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.18 c 95174 implications, 0 cliques
0.09/0.18 c presolved problem has 15 variables (15 bin, 0 int, 0 impl, 0 cont) and 39 constraints
0.09/0.18 c 11 constraints of type <knapsack>
0.09/0.18 c 28 constraints of type <logicor>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.06
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 | 641 | - |3531k| 0 | - | 15 | 39 | 15 | 39 | 0 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.18 c 0.2s| 1 | 0 | 641 | - |3531k| 0 | - | 15 | 39 | 15 | 39 | 0 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.09/0.18 c
0.09/0.18 c SCIP Status : problem is solved [optimal solution found]
0.09/0.18 c Solving Time (sec) : 0.18
0.09/0.18 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.09/0.18 c Primal Bound : +3.00000000000000e+00 (30 solutions)
0.09/0.18 c Dual Bound : +3.00000000000000e+00
0.09/0.18 c Gap : 0.00 %
0.09/0.18 s OPTIMUM FOUND
0.09/0.18 v -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25
0.09/0.18 v -x24 x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
0.09/0.18 c SCIP Status : problem is solved [optimal solution found]
0.09/0.18 c Total Time : 0.18
0.09/0.18 c solving : 0.18
0.09/0.18 c presolving : 0.06 (included in solving)
0.09/0.18 c reading : 0.01 (included in solving)
0.09/0.18 c Original Problem :
0.09/0.18 c Problem name : HOME/instance-3450595-1307102042.opb
0.09/0.18 c Variables : 1548 (1548 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18 c Constraints : 1598 initial, 1598 maximal
0.09/0.18 c Presolved Problem :
0.09/0.18 c Problem name : t_HOME/instance-3450595-1307102042.opb
0.09/0.18 c Variables : 15 (15 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18 c Constraints : 39 initial, 39 maximal
0.09/0.18 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.18 c trivial : 0.00 35 0 0 0 0 0 0 0 0
0.09/0.18 c dualfix : 0.01 1498 0 0 0 0 0 0 0 0
0.09/0.18 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.18 c logicor : 0.00 0 0 0 0 0 22 0 0 0
0.09/0.18 c pseudoboolean : 0.00 0 0 0 0 0 1548 0 0 0
0.09/0.18 c root node : - 35 - - 35 - - - - -
0.09/0.18 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.18 c integral : 0 0 0 7 0 37 0 0 35 0 0 0
0.09/0.18 c knapsack : 11 2 5 0 0 0 0 0 0 0 0 0
0.09/0.18 c logicor : 28 11 46 0 0 30 0 0 0 0 0 0
0.09/0.18 c countsols : 0 0 0 0 0 33 0 0 0 0 0 0
0.09/0.18 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.18 c integral : 0.03 0.00 0.00 0.03 0.00 0.00 0.00
0.09/0.18 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.18 c vbounds : 0 0 0 0
0.09/0.18 c rootredcost : 0 0 0 0
0.09/0.18 c pseudoobj : 13 0 0 0
0.09/0.18 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.18 c vbounds : 0.00 0.00 0.00
0.09/0.18 c rootredcost : 0.00 0.00 0.00
0.09/0.18 c pseudoobj : 0.00 0.00 0.00
0.09/0.18 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.18 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.18 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.18 c applied globally : - - - 0 0.0 - - -
0.09/0.18 c applied locally : - - - 0 0.0 - - -
0.09/0.18 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.18 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.18 c redcost : 0.00 11 0 0 0 0
0.09/0.18 c impliedbounds : 0.00 11 0 0 0 0
0.09/0.18 c intobj : 0.00 0 0 0 0 0
0.09/0.18 c gomory : 0.01 11 0 0 109 0
0.09/0.18 c cgmip : 0.00 0 0 0 0 0
0.09/0.18 c closecuts : 0.00 0 0 0 0 0
0.09/0.18 c strongcg : 0.01 11 0 0 331 0
0.09/0.18 c cmir : 0.01 11 0 0 4 0
0.09/0.18 c flowcover : 0.01 11 0 0 3 0
0.09/0.18 c clique : 0.00 3 0 0 0 0
0.09/0.18 c zerohalf : 0.00 0 0 0 0 0
0.09/0.18 c mcf : 0.00 3 0 0 0 0
0.09/0.18 c oddcycle : 0.00 0 0 0 0 0
0.09/0.18 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.18 c Pricers : Time Calls Vars
0.09/0.18 c problem variables: 0.00 0 0
0.09/0.18 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.18 c relpscost : 0.03 7 0 35 0 0 0
0.09/0.18 c pscost : 0.00 0 0 0 0 0 0
0.09/0.18 c inference : 0.00 0 0 0 0 0 0
0.09/0.18 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.18 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.18 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.18 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.18 c random : 0.00 0 0 0 0 0 0
0.09/0.18 c Primal Heuristics : Time Calls Found
0.09/0.18 c LP solutions : 0.00 - 0
0.09/0.18 c pseudo solutions : 0.00 - 0
0.09/0.18 c oneopt : 0.00 7 1
0.09/0.18 c trivial : 0.00 2 2
0.09/0.18 c shiftandpropagate: 0.00 0 0
0.09/0.18 c simplerounding : 0.00 18 18
0.09/0.18 c zirounding : 0.00 1 1
0.09/0.18 c rounding : 0.00 18 2
0.09/0.18 c shifting : 0.00 18 6
0.09/0.18 c intshifting : 0.00 0 0
0.09/0.18 c twoopt : 0.00 0 0
0.09/0.18 c fixandinfer : 0.00 0 0
0.09/0.18 c feaspump : 0.00 0 0
0.09/0.18 c clique : 0.00 0 0
0.09/0.18 c coefdiving : 0.00 0 0
0.09/0.18 c pscostdiving : 0.00 0 0
0.09/0.18 c fracdiving : 0.00 0 0
0.09/0.18 c veclendiving : 0.00 0 0
0.09/0.18 c intdiving : 0.00 0 0
0.09/0.18 c actconsdiving : 0.00 0 0
0.09/0.18 c objpscostdiving : 0.00 0 0
0.09/0.18 c rootsoldiving : 0.00 0 0
0.09/0.18 c linesearchdiving : 0.00 0 0
0.09/0.18 c guideddiving : 0.00 0 0
0.09/0.18 c octane : 0.00 0 0
0.09/0.18 c rens : 0.01 0 0
0.09/0.18 c rins : 0.00 0 0
0.09/0.18 c localbranching : 0.00 0 0
0.09/0.18 c mutation : 0.00 0 0
0.09/0.18 c crossover : 0.00 0 0
0.09/0.18 c dins : 0.00 0 0
0.09/0.18 c vbounds : 0.00 0 0
0.09/0.18 c undercover : 0.00 0 0
0.09/0.18 c subnlp : 0.00 0 0
0.09/0.18 c trysol : 0.00 0 0
0.09/0.18 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.18 c primal LP : 0.00 0 0 0.00 -
0.09/0.18 c dual LP : 0.01 19 641 33.74 43442.90
0.09/0.18 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.18 c barrier LP : 0.00 0 0 0.00 -
0.09/0.18 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.18 c strong branching : 0.03 35 1546 44.17 47305.77
0.09/0.18 c (at root node) : - 35 1546 44.17 -
0.09/0.18 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.18 c B&B Tree :
0.09/0.18 c number of runs : 4
0.09/0.18 c nodes : 1
0.09/0.18 c nodes (total) : 4
0.09/0.18 c nodes left : 0
0.09/0.18 c max depth : 0
0.09/0.18 c max depth (total): 0
0.09/0.18 c backtracks : 0 (0.0%)
0.09/0.18 c delayed cutoffs : 0
0.09/0.18 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.18 c avg switch length: 2.00
0.09/0.18 c switching time : 0.00
0.09/0.18 c Solution :
0.09/0.18 c Solutions found : 30 (11 improvements)
0.09/0.18 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.09/0.18 c Primal Bound : +3.00000000000000e+00 (in run 3, after 1 nodes, 0.17 seconds, depth 0, found by <shifting>)
0.09/0.18 c Dual Bound : +3.00000000000000e+00
0.09/0.18 c Gap : 0.00 %
0.09/0.18 c Root Dual Bound : +3.00000000000000e+00
0.09/0.18 c Root Iterations : 641
0.09/0.18 c Time complete: 0.17.