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-3736867-1338723015.opb>
0.00/0.01 c original problem has 1516 variables (1516 bin, 0 int, 0 impl, 0 cont) and 1566 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, 1566 del conss, 50 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 91338 impls, 0 clqs
0.00/0.06 c (round 2) 1466 del vars, 1566 del conss, 50 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 91338 impls, 0 clqs
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 1466 deleted vars, 1566 deleted constraints, 50 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 91338 implications, 0 cliques
0.00/0.06 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.06 c 50 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.05
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.0.1.5
0.00/0.06 c
0.00/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c conflict/interconss = 0
0.00/0.06 c
0.00/0.06 c # should binary conflicts be preferred?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c conflict/preferbinary = TRUE
0.00/0.06 c
0.00/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c constraints/agelimit = 1
0.00/0.06 c
0.00/0.06 c # should enforcement of pseudo solution be disabled?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/disableenfops = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1797
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/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.00/0.07 c t 0.1s| 1 | 0 | 139 | - |3499k| 0 | 26 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.592144e+00 | 5.000000e+01 |3040.42%
0.00/0.07 o 26
0.00/0.07 c r 0.1s| 1 | 0 | 139 | - |3501k| 0 | 26 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.592144e+00 | 2.600000e+01 |1533.02%
0.00/0.07 o 25
0.00/0.07 c R 0.1s| 1 | 0 | 139 | - |3502k| 0 | 26 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.592144e+00 | 2.500000e+01 |1470.21%
0.00/0.07 o 24
0.00/0.07 c s 0.1s| 1 | 0 | 139 | - |3504k| 0 | 26 | 50 | 50 | 50 | 50 | 0 | 0 | 0 | 1.592144e+00 | 2.400000e+01 |1407.40%
0.00/0.07 c 0.1s| 1 | 0 | 180 | - |3556k| 0 | 22 | 50 | 50 | 50 | 51 | 1 | 0 | 0 | 1.636443e+00 | 2.400000e+01 |1366.60%
0.00/0.07 o 4
0.00/0.07 c b 0.1s| 1 | 0 | 180 | - |3557k| 0 | 22 | 50 | 50 | 50 | 51 | 1 | 0 | 0 | 1.636443e+00 | 4.000000e+00 | 144.43%
0.00/0.07 o 3
0.00/0.07 c R 0.1s| 1 | 0 | 180 | - |3558k| 0 | 22 | 50 | 50 | 50 | 51 | 1 | 0 | 0 | 1.636443e+00 | 3.000000e+00 | 83.32%
0.00/0.08 c 0.1s| 1 | 0 | 248 | - |3630k| 0 | 24 | 50 | 50 | 50 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.08 c 0.1s| 1 | 0 | 262 | - |3704k| 0 | 24 | 50 | 50 | 50 | 53 | 3 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.07/0.08 c 0.1s| 1 | 0 | 283 | - |3785k| 0 | 26 | 50 | 50 | 50 | 54 | 4 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.07/0.09 c 0.1s| 1 | 0 | 309 | - |3823k| 0 | 27 | 50 | 50 | 50 | 55 | 5 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.07/0.09 c 0.1s| 1 | 0 | 329 | - |3881k| 0 | 28 | 50 | 50 | 50 | 56 | 6 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 349 | - |3902k| 0 | 27 | 50 | 50 | 50 | 57 | 7 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 c 0.1s| 1 | 0 | 379 | - |3905k| 0 | 24 | 50 | 50 | 50 | 57 | 7 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 c 0.1s| 1 | 0 | 392 | - |3930k| 0 | 26 | 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 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 s 0.1s| 1 | 0 | 392 | - |3932k| 0 | 26 | 50 | 50 | 50 | 58 | 8 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.13 c 0.1s| 1 | 0 | 392 | - |3932k| 0 | - | 50 | 50 | 50 | 58 | 8 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.13 c (run 1, node 1) restarting after 11 global fixings of integer variables
0.09/0.13 c
0.09/0.13 c (restart) converted 8 cuts from the global cut pool into linear constraints
0.09/0.13 c
0.09/0.13 c presolving:
0.09/0.13 c (round 1) 11 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 91338 impls, 0 clqs
0.09/0.13 c presolving (2 rounds):
0.09/0.13 c 11 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 91338 implications, 0 cliques
0.09/0.13 c presolved problem has 39 variables (39 bin, 0 int, 0 impl, 0 cont) and 58 constraints
0.09/0.13 c 8 constraints of type <knapsack>
0.09/0.13 c 50 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.05
0.09/0.13 c
0.09/0.13 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.13 c 0.1s| 1 | 0 | 399 | - |3538k| 0 | 6 | 39 | 58 | 39 | 58 | 0 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 c 0.1s| 1 | 0 | 410 | - |3545k| 0 | 16 | 39 | 58 | 39 | 59 | 1 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.14 c 0.1s| 1 | 0 | 434 | - |3547k| 0 | 17 | 39 | 58 | 39 | 59 | 1 | 0 | 16 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 c 0.1s| 1 | 0 | 434 | - |3548k| 0 | - | 39 | 58 | 39 | 59 | 1 | 0 | 21 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.09/0.15 c
0.09/0.15 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.09/0.15 c
0.09/0.15 c presolving:
0.09/0.15 c (round 1) 10 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 91338 impls, 0 clqs
0.09/0.15 c presolving (2 rounds):
0.09/0.15 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.15 c 91338 implications, 0 cliques
0.09/0.15 c presolved problem has 29 variables (29 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 | 451 | - |3523k| 0 | 14 | 29 | 59 | 29 | 59 | 0 | 0 | 21 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 o 3
0.09/0.15 c s 0.1s| 1 | 0 | 451 | - |3524k| 0 | 14 | 29 | 59 | 29 | 59 | 0 | 0 | 21 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 c 0.2s| 1 | 0 | 472 | - |3633k| 0 | 15 | 29 | 59 | 29 | 60 | 1 | 0 | 21 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c 0.2s| 1 | 0 | 493 | - |3635k| 0 | 18 | 29 | 59 | 29 | 60 | 1 | 0 | 27 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c 0.2s| 1 | 0 | 493 | - |3636k| 0 | - | 29 | 59 | 29 | 60 | 1 | 0 | 32 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.16 c (run 3, 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, 13 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 91338 impls, 0 clqs
0.09/0.16 c presolving (2 rounds):
0.09/0.16 c 10 deleted vars, 13 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.16 c 91338 implications, 0 cliques
0.09/0.16 c presolved problem has 19 variables (19 bin, 0 int, 0 impl, 0 cont) and 47 constraints
0.09/0.16 c 10 constraints of type <knapsack>
0.09/0.16 c 37 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.16 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.16 c 0.2s| 1 | 0 | 505 | - |3485k| 0 | 8 | 19 | 47 | 19 | 47 | 0 | 0 | 32 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 c 0.2s| 1 | 0 | 512 | - |3505k| 0 | 0 | 19 | 47 | 19 | 48 | 1 | 0 | 32 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.17 o 2
0.09/0.17 c * 0.2s| 1 | 0 | 512 | - |3505k| 0 | - | 19 | 47 | 19 | 48 | 1 | 0 | 32 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.09/0.17 c
0.09/0.17 c SCIP Status : problem is solved [optimal solution found]
0.09/0.17 c Solving Time (sec) : 0.16
0.09/0.17 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.09/0.17 c Primal Bound : +2.00000000000000e+00 (35 solutions)
0.09/0.17 c Dual Bound : +2.00000000000000e+00
0.09/0.17 c Gap : 0.00 %
0.09/0.17 s OPTIMUM FOUND
0.09/0.17 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.17 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.17 c SCIP Status : problem is solved [optimal solution found]
0.09/0.17 c Total Time : 0.16
0.09/0.17 c solving : 0.16
0.09/0.17 c presolving : 0.06 (included in solving)
0.09/0.17 c reading : 0.01 (included in solving)
0.09/0.17 c Original Problem :
0.09/0.17 c Problem name : HOME/instance-3736867-1338723015.opb
0.09/0.17 c Variables : 1516 (1516 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.17 c Constraints : 1566 initial, 1566 maximal
0.09/0.17 c Presolved Problem :
0.09/0.17 c Problem name : t_HOME/instance-3736867-1338723015.opb
0.09/0.17 c Variables : 19 (19 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.17 c Constraints : 47 initial, 47 maximal
0.09/0.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.17 c trivial : 0.00 31 0 0 0 0 0 0 0 0
0.09/0.17 c dualfix : 0.01 1466 0 0 0 0 0 0 0 0
0.09/0.17 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.17 c logicor : 0.00 0 0 0 0 0 13 0 0 0
0.09/0.17 c pseudoboolean : 0.00 0 0 0 0 0 1566 50 0 0
0.09/0.17 c root node : - 31 - - 31 - - - - -
0.09/0.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.17 c integral : 0 0 0 7 0 42 0 0 30 0 0 0
0.09/0.17 c knapsack : 10 3 5 0 0 0 0 0 0 0 0 0
0.09/0.17 c logicor : 37 11 46 1 0 34 0 0 0 0 0 0
0.09/0.17 c countsols : 0 0 0 1 0 37 0 0 0 0 0 0
0.09/0.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.17 c integral : 0.03 0.00 0.00 0.03 0.00 0.00 0.00
0.09/0.17 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.17 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.17 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.17 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.17 c vbounds : 0 0 0 0
0.09/0.17 c rootredcost : 0 0 0 0
0.09/0.17 c pseudoobj : 14 0 0 0
0.09/0.17 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.17 c vbounds : 0.00 0.00 0.00
0.09/0.17 c rootredcost : 0.00 0.00 0.00
0.09/0.17 c pseudoobj : 0.00 0.00 0.00
0.09/0.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.17 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.17 c applied globally : - - - 0 0.0 - - -
0.09/0.17 c applied locally : - - - 0 0.0 - - -
0.09/0.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.17 c cut pool : 0.00 0 - - 0 - (maximal pool size: 22)
0.09/0.17 c redcost : 0.00 11 0 1 0 0
0.09/0.17 c impliedbounds : 0.00 11 0 0 0 0
0.09/0.17 c intobj : 0.00 0 0 0 0 0
0.09/0.17 c gomory : 0.01 11 0 0 136 0
0.09/0.17 c cgmip : 0.00 0 0 0 0 0
0.09/0.17 c closecuts : 0.00 0 0 0 0 0
0.09/0.17 c strongcg : 0.01 11 0 0 350 0
0.09/0.17 c cmir : 0.01 11 0 0 5 0
0.09/0.17 c flowcover : 0.01 11 0 0 3 0
0.09/0.17 c clique : 0.00 4 0 0 0 0
0.09/0.17 c zerohalf : 0.00 0 0 0 0 0
0.09/0.17 c mcf : 0.00 4 0 0 0 0
0.09/0.17 c oddcycle : 0.00 0 0 0 0 0
0.09/0.17 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.17 c Pricers : Time Calls Vars
0.09/0.17 c problem variables: 0.00 0 0
0.09/0.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.17 c relpscost : 0.03 6 0 30 0 0 0
0.09/0.17 c pscost : 0.00 0 0 0 0 0 0
0.09/0.17 c inference : 0.00 0 0 0 0 0 0
0.09/0.17 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.17 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.17 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.17 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.17 c random : 0.00 0 0 0 0 0 0
0.09/0.17 c Primal Heuristics : Time Calls Found
0.09/0.17 c LP solutions : 0.00 - 1
0.09/0.17 c pseudo solutions : 0.00 - 0
0.09/0.17 c oneopt : 0.00 3 1
0.09/0.17 c trivial : 0.00 2 2
0.09/0.17 c shiftandpropagate: 0.00 0 0
0.09/0.17 c simplerounding : 0.00 17 17
0.09/0.17 c zirounding : 0.00 1 1
0.09/0.17 c rounding : 0.00 17 2
0.09/0.17 c shifting : 0.00 17 11
0.09/0.17 c intshifting : 0.00 0 0
0.09/0.17 c twoopt : 0.00 0 0
0.09/0.17 c fixandinfer : 0.00 0 0
0.09/0.17 c feaspump : 0.00 0 0
0.09/0.17 c clique : 0.00 0 0
0.09/0.17 c coefdiving : 0.00 0 0
0.09/0.17 c pscostdiving : 0.00 0 0
0.09/0.17 c fracdiving : 0.00 0 0
0.09/0.17 c veclendiving : 0.00 0 0
0.09/0.17 c intdiving : 0.00 0 0
0.09/0.17 c actconsdiving : 0.00 0 0
0.09/0.17 c objpscostdiving : 0.00 0 0
0.09/0.17 c rootsoldiving : 0.00 0 0
0.09/0.17 c linesearchdiving : 0.00 0 0
0.09/0.17 c guideddiving : 0.00 0 0
0.09/0.17 c octane : 0.00 0 0
0.09/0.17 c rens : 0.01 0 0
0.09/0.17 c rins : 0.00 0 0
0.09/0.17 c localbranching : 0.00 0 0
0.09/0.17 c mutation : 0.00 0 0
0.09/0.17 c crossover : 0.00 0 0
0.09/0.17 c dins : 0.00 0 0
0.09/0.17 c vbounds : 0.00 0 0
0.09/0.17 c undercover : 0.00 0 0
0.09/0.17 c subnlp : 0.00 0 0
0.09/0.17 c trysol : 0.00 0 0
0.09/0.17 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.17 c primal LP : 0.00 0 0 0.00 -
0.09/0.17 c dual LP : 0.01 18 512 28.44 42464.96
0.09/0.17 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.17 c barrier LP : 0.00 0 0 0.00 -
0.09/0.17 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.17 c strong branching : 0.03 32 1543 48.22 46895.42
0.09/0.17 c (at root node) : - 32 1543 48.22 -
0.09/0.17 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.17 c B&B Tree :
0.09/0.17 c number of runs : 4
0.09/0.17 c nodes : 1
0.09/0.17 c nodes (total) : 4
0.09/0.17 c nodes left : 0
0.09/0.17 c max depth : 0
0.09/0.17 c max depth (total): 0
0.09/0.17 c backtracks : 0 (0.0%)
0.09/0.17 c delayed cutoffs : 0
0.09/0.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.17 c avg switch length: 2.00
0.09/0.17 c switching time : 0.00
0.09/0.17 c Solution :
0.09/0.17 c Solutions found : 35 (9 improvements)
0.09/0.17 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.09/0.17 c Primal Bound : +2.00000000000000e+00 (in run 4, after 1 nodes, 0.16 seconds, depth 0, found by <relaxation>)
0.09/0.17 c Dual Bound : +2.00000000000000e+00
0.09/0.17 c Gap : 0.00 %
0.09/0.17 c Root Dual Bound : +2.00000000000000e+00
0.09/0.17 c Root Iterations : 512
0.09/0.17 c Time complete: 0.17.