0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-2704557-1278561629.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 100
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.02 c 50 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
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 = 1790
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 = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
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 # 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 # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
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.03 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.03 c t 0.0s| 1 | 0 | 142 | - | 432k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 6.324984e+00 | 1.000000e+02 |1481.03%
0.00/0.03 o 39
0.00/0.03 c r 0.0s| 1 | 0 | 142 | - | 434k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 6.324984e+00 | 3.900000e+01 | 516.60%
0.00/0.03 o 38
0.00/0.03 c R 0.0s| 1 | 0 | 142 | - | 437k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 6.324984e+00 | 3.800000e+01 | 500.79%
0.00/0.03 o 37
0.00/0.03 c s 0.0s| 1 | 0 | 142 | - | 439k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 6.324984e+00 | 3.700000e+01 | 484.98%
0.00/0.04 c 0.0s| 1 | 0 | 163 | - | 565k| 0 | 36 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 6.376137e+00 | 3.700000e+01 | 480.29%
0.00/0.04 o 11
0.00/0.04 c b 0.0s| 1 | 0 | 163 | - | 568k| 0 | 36 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 6.376137e+00 | 1.100000e+01 | 72.52%
0.00/0.05 c 0.0s| 1 | 0 | 194 | - | 714k| 0 | 37 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 6.417234e+00 | 1.100000e+01 | 71.41%
0.00/0.06 c 0.1s| 1 | 0 | 212 | - | 849k| 0 | 36 | 100 | 50 | 100 | 53 | 3 | 0 | 0 | 6.437281e+00 | 1.100000e+01 | 70.88%
0.07/0.07 c 0.1s| 1 | 0 | 226 | - | 984k| 0 | 36 | 100 | 50 | 100 | 54 | 4 | 0 | 0 | 6.455208e+00 | 1.100000e+01 | 70.41%
0.07/0.09 c 0.1s| 1 | 0 | 243 | - |1067k| 0 | 36 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 6.469070e+00 | 1.100000e+01 | 70.04%
0.09/0.10 c 0.1s| 1 | 0 | 252 | - |1088k| 0 | 39 | 100 | 50 | 100 | 56 | 6 | 0 | 0 | 6.472281e+00 | 1.100000e+01 | 69.96%
0.09/0.11 c 0.1s| 1 | 0 | 263 | - |1095k| 0 | 38 | 100 | 50 | 100 | 57 | 7 | 0 | 0 | 6.483149e+00 | 1.100000e+01 | 69.67%
0.09/0.13 c 0.1s| 1 | 0 | 276 | - |1108k| 0 | 37 | 100 | 50 | 100 | 58 | 8 | 0 | 0 | 6.486287e+00 | 1.100000e+01 | 69.59%
0.09/0.14 c 0.1s| 1 | 0 | 288 | - |1124k| 0 | 37 | 100 | 50 | 100 | 59 | 9 | 0 | 0 | 6.494411e+00 | 1.100000e+01 | 69.38%
0.09/0.16 c 0.1s| 1 | 0 | 296 | - |1128k| 0 | 36 | 100 | 50 | 100 | 60 | 10 | 0 | 0 | 6.497030e+00 | 1.100000e+01 | 69.31%
0.39/0.48 o 8
0.39/0.48 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.49 c E 0.5s| 1 | 0 | 296 | - |1133k| 0 | 36 | 100 | 50 | 100 | 60 | 10 | 0 | 0 | 6.497030e+00 | 8.000000e+00 | 23.13%
0.39/0.49 c 0.5s| 1 | 0 | 296 | - |1133k| 0 | 36 | 100 | 50 | 100 | 60 | 10 | 0 | 0 | 6.497030e+00 | 8.000000e+00 | 23.13%
0.49/0.50 c 0.5s| 1 | 0 | 296 | - |1133k| 0 | 36 | 100 | 50 | 100 | 60 | 10 | 0 | 0 | 6.497030e+00 | 8.000000e+00 | 23.13%
0.49/0.59 c 0.6s| 1 | 2 | 296 | - |1134k| 0 | 36 | 100 | 50 | 100 | 60 | 10 | 0 | 19 | 6.497030e+00 | 8.000000e+00 | 23.13%
0.49/0.59 c (run 1, node 1) restarting after 11 global fixings of integer variables
0.49/0.59 c
0.49/0.59 c (restart) converted 8 cuts from the global cut pool into linear constraints
0.49/0.59 c
0.59/0.60 c presolving:
0.59/0.60 c (round 1) 11 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 0 impls, 0 clqs
0.59/0.60 c presolving (2 rounds):
0.59/0.60 c 11 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.60 c 0 implications, 0 cliques
0.59/0.60 c presolved problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 58 constraints
0.59/0.60 c 8 constraints of type <knapsack>
0.59/0.60 c 50 constraints of type <logicor>
0.59/0.60 c transformed objective value is always integral (scale: 1)
0.59/0.60 c Presolving Time: 0.01
0.59/0.60 c
0.59/0.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.61 c 0.6s| 1 | 0 | 417 | - | 630k| 0 | 36 | 89 | 58 | 89 | 58 | 0 | 0 | 19 | 6.497030e+00 | 8.000000e+00 | 23.13%
0.69/0.71 c 0.7s| 1 | 0 | 422 | - | 631k| 0 | 37 | 89 | 58 | 89 | 58 | 0 | 0 | 37 | 6.497828e+00 | 8.000000e+00 | 23.12%
0.79/0.80 c 0.8s| 1 | 0 | 429 | - | 633k| 0 | 35 | 89 | 58 | 89 | 58 | 0 | 0 | 57 | 6.498677e+00 | 8.000000e+00 | 23.10%
0.79/0.81 c 0.8s| 1 | 0 | 433 | - | 634k| 0 | 35 | 89 | 58 | 89 | 58 | 0 | 0 | 60 | 6.499381e+00 | 8.000000e+00 | 23.09%
0.79/0.81 c 0.8s| 1 | 0 | 436 | - | 636k| 0 | 35 | 89 | 58 | 89 | 58 | 0 | 0 | 62 | 6.499517e+00 | 8.000000e+00 | 23.09%
0.79/0.82 c 0.8s| 1 | 0 | 439 | - | 637k| 0 | 35 | 89 | 58 | 89 | 58 | 0 | 0 | 64 | 6.499653e+00 | 8.000000e+00 | 23.08%
0.79/0.82 c 0.8s| 1 | 0 | 440 | - | 639k| 0 | 34 | 89 | 58 | 89 | 58 | 0 | 0 | 65 | 6.499654e+00 | 8.000000e+00 | 23.08%
0.79/0.82 c 0.8s| 1 | 2 | 440 | - | 641k| 0 | 34 | 89 | 58 | 89 | 58 | 0 | 0 | 65 | 6.499654e+00 | 8.000000e+00 | 23.08%
0.79/0.82 c (run 2, node 1) restarting after 11 global fixings of integer variables
0.79/0.82 c
0.79/0.82 c presolving:
0.79/0.83 c (round 1) 11 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.79/0.83 c presolving (2 rounds):
0.79/0.83 c 11 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.79/0.83 c 0 implications, 0 cliques
0.79/0.83 c presolved problem has 78 variables (78 bin, 0 int, 0 impl, 0 cont) and 58 constraints
0.79/0.83 c 8 constraints of type <knapsack>
0.79/0.83 c 50 constraints of type <logicor>
0.79/0.83 c transformed objective value is always integral (scale: 1)
0.79/0.83 c Presolving Time: 0.02
0.79/0.83 c
0.79/0.83 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.83 c 0.8s| 1 | 0 | 550 | - | 629k| 0 | 34 | 78 | 58 | 78 | 58 | 0 | 0 | 65 | 6.499654e+00 | 8.000000e+00 | 23.08%
0.79/0.85 c 0.8s| 1 | 0 | 577 | - | 635k| 0 | 34 | 78 | 58 | 78 | 59 | 1 | 0 | 65 | 6.523926e+00 | 8.000000e+00 | 22.63%
0.89/0.94 c 0.9s| 1 | 0 | 604 | - | 637k| 0 | 32 | 78 | 58 | 78 | 59 | 1 | 0 | 86 | 6.551287e+00 | 8.000000e+00 | 22.11%
0.89/0.96 c 0.9s| 1 | 0 | 631 | - | 638k| 0 | 29 | 78 | 58 | 78 | 59 | 1 | 0 | 91 | 6.626654e+00 | 8.000000e+00 | 20.72%
0.89/0.97 c 1.0s| 1 | 0 | 657 | - | 640k| 0 | 28 | 78 | 58 | 78 | 59 | 1 | 0 | 96 | 6.729738e+00 | 8.000000e+00 | 18.88%
0.89/0.97 c 1.0s| 1 | 0 | 657 | - | 641k| 0 | - | 78 | 58 | 78 | 59 | 1 | 0 | 101 | 6.729738e+00 | 8.000000e+00 | 18.88%
0.89/0.97 c (run 3, node 1) restarting after 20 global fixings of integer variables
0.89/0.97 c
0.89/0.97 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.89/0.97 c
0.89/0.97 c presolving:
0.89/0.98 c (round 1) 20 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.89/0.98 c presolving (2 rounds):
0.89/0.98 c 20 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.89/0.98 c 0 implications, 0 cliques
0.89/0.98 c presolved problem has 58 variables (58 bin, 0 int, 0 impl, 0 cont) and 59 constraints
0.89/0.98 c 9 constraints of type <knapsack>
0.89/0.98 c 50 constraints of type <logicor>
0.89/0.98 c transformed objective value is always integral (scale: 1)
0.89/0.98 c Presolving Time: 0.02
0.89/0.98 c
0.89/0.98 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.98 c 1.0s| 1 | 0 | 729 | - | 624k| 0 | 21 | 58 | 59 | 58 | 59 | 0 | 0 | 101 | 6.777778e+00 | 8.000000e+00 | 18.03%
0.99/1.00 c 1.0s| 1 | 0 | 753 | - | 773k| 0 | 26 | 58 | 59 | 58 | 60 | 1 | 0 | 101 | 6.983573e+00 | 8.000000e+00 | 14.55%
0.99/1.00 c 1.0s| 1 | 0 | 753 | - | 774k| 0 | 26 | 58 | 59 | 58 | 60 | 1 | 0 | 102 | 8.000000e+00 | 8.000000e+00 | 0.00%
0.99/1.00 c
0.99/1.00 c SCIP Status : problem is solved [optimal solution found]
0.99/1.00 c Solving Time (sec) : 0.99
0.99/1.00 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.99/1.00 c Primal Bound : +8.00000000000000e+00 (33 solutions)
0.99/1.00 c Dual Bound : +8.00000000000000e+00
0.99/1.00 c Gap : 0.00 %
0.99/1.00 s OPTIMUM FOUND
0.99/1.00 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.99/1.00 v -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 x51 -x50
0.99/1.00 v -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 -x24
0.99/1.00 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.99/1.00 c SCIP Status : problem is solved [optimal solution found]
0.99/1.00 c Solving Time : 0.99
0.99/1.00 c Original Problem :
0.99/1.00 c Problem name : HOME/instance-2704557-1278561629.opb
0.99/1.00 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.00 c Constraints : 50 initial, 50 maximal
0.99/1.00 c Presolved Problem :
0.99/1.00 c Problem name : t_HOME/instance-2704557-1278561629.opb
0.99/1.00 c Variables : 58 (58 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.00 c Constraints : 59 initial, 59 maximal
0.99/1.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.99/1.00 c trivial : 0.00 42 0 0 0 0 0 0 0
0.99/1.00 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c implics : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c probing : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c knapsack : 0.01 0 0 0 0 0 0 0 0
0.99/1.00 c logicor : 0.00 0 0 0 0 0 0 0 0
0.99/1.00 c root node : - 67 - - 67 - - - -
0.99/1.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.99/1.00 c integral : 0 0 0 13 0 1 30 0 0 4
0.99/1.00 c knapsack : 9 3 14 0 0 0 0 0 0 0
0.99/1.00 c logicor : 50 15 96 0 0 0 0 0 0 0
0.99/1.00 c countsols : 0 0 0 0 0 0 0 0 0 0
0.99/1.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.99/1.00 c integral : 0.40 0.00 0.00 0.40 0.00
0.99/1.00 c knapsack : 0.02 0.02 0.00 0.00 0.00
0.99/1.00 c logicor : 0.00 0.00 0.00 0.00 0.00
0.99/1.00 c countsols : 0.00 0.00 0.00 0.00 0.00
0.99/1.00 c Propagators : Time Calls Cutoffs DomReds
0.99/1.00 c vbounds : 0.00 5 0 0
0.99/1.00 c rootredcost : 0.00 0 0 0
0.99/1.00 c pseudoobj : 0.00 42 0 0
0.99/1.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.00 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.00 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.00 c applied globally : - - - 0 0.0 - - -
0.99/1.00 c applied locally : - - - 0 0.0 - - -
0.99/1.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.99/1.00 c cut pool : 0.00 0 - - 0 - (maximal pool size: 84)
0.99/1.00 c redcost : 0.00 15 0 37 0 0
0.99/1.00 c impliedbounds : 0.00 15 0 0 0 0
0.99/1.00 c intobj : 0.00 0 0 0 0 0
0.99/1.00 c cgmip : 0.00 0 0 0 0 0
0.99/1.00 c gomory : 0.05 15 0 0 51 0
0.99/1.00 c strongcg : 0.05 15 0 0 267 0
0.99/1.00 c cmir : 0.03 13 0 0 0 0
0.99/1.00 c flowcover : 0.04 13 0 0 0 0
0.99/1.00 c clique : 0.00 4 0 0 0 0
0.99/1.00 c zerohalf : 0.00 0 0 0 0 0
0.99/1.00 c mcf : 0.00 4 0 0 0 0
0.99/1.00 c rapidlearning : 0.00 0 0 0 0 0
0.99/1.00 c Pricers : Time Calls Vars
0.99/1.00 c problem variables: 0.00 0 0
0.99/1.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.99/1.00 c relpscost : 0.40 13 1 30 0 0 4
0.99/1.00 c pscost : 0.00 0 0 0 0 0 0
0.99/1.00 c inference : 0.00 0 0 0 0 0 0
0.99/1.00 c mostinf : 0.00 0 0 0 0 0 0
0.99/1.00 c leastinf : 0.00 0 0 0 0 0 0
0.99/1.00 c fullstrong : 0.00 0 0 0 0 0 0
0.99/1.00 c allfullstrong : 0.00 0 0 0 0 0 0
0.99/1.00 c random : 0.00 0 0 0 0 0 0
0.99/1.00 c Primal Heuristics : Time Calls Found
0.99/1.00 c LP solutions : 0.00 - 0
0.99/1.00 c pseudo solutions : 0.00 - 0
0.99/1.00 c oneopt : 0.00 3 1
0.99/1.00 c trivial : 0.00 2 3
0.99/1.00 c simplerounding : 0.00 25 25
0.99/1.00 c zirounding : 0.00 1 1
0.99/1.00 c rounding : 0.00 25 1
0.99/1.00 c shifting : 0.00 25 1
0.99/1.00 c intshifting : 0.00 0 0
0.99/1.00 c twoopt : 0.00 0 0
0.99/1.00 c fixandinfer : 0.00 0 0
0.99/1.00 c feaspump : 0.00 0 0
0.99/1.00 c coefdiving : 0.00 0 0
0.99/1.00 c pscostdiving : 0.00 0 0
0.99/1.00 c fracdiving : 0.00 0 0
0.99/1.00 c veclendiving : 0.00 0 0
0.99/1.00 c intdiving : 0.00 0 0
0.99/1.00 c actconsdiving : 0.00 0 0
0.99/1.00 c objpscostdiving : 0.00 0 0
0.99/1.00 c rootsoldiving : 0.00 0 0
0.99/1.00 c linesearchdiving : 0.00 0 0
0.99/1.00 c guideddiving : 0.00 0 0
0.99/1.00 c octane : 0.00 0 0
0.99/1.00 c rens : 0.33 1 1
0.99/1.00 c rins : 0.00 0 0
0.99/1.00 c localbranching : 0.00 0 0
0.99/1.00 c mutation : 0.00 0 0
0.99/1.00 c crossover : 0.00 0 0
0.99/1.00 c dins : 0.00 0 0
0.99/1.00 c undercover : 0.00 0 0
0.99/1.00 c nlp : 0.00 0 0
0.99/1.00 c trysol : 0.00 0 0
0.99/1.00 c LP : Time Calls Iterations Iter/call Iter/sec
0.99/1.00 c primal LP : 0.00 0 0 0.00 -
0.99/1.00 c dual LP : 0.04 25 753 30.12 19002.68
0.99/1.00 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.00 c barrier LP : 0.00 0 0 0.00 -
0.99/1.00 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.00 c strong branching : 0.40 102 5976 58.59 15100.25
0.99/1.00 c (at root node) : - 102 5976 58.59 -
0.99/1.00 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.00 c B&B Tree :
0.99/1.00 c number of runs : 4
0.99/1.00 c nodes : 1
0.99/1.00 c nodes (total) : 4
0.99/1.00 c nodes left : 0
0.99/1.00 c max depth : 0
0.99/1.00 c max depth (total): 0
0.99/1.00 c backtracks : 0 (0.0%)
0.99/1.00 c delayed cutoffs : 0
0.99/1.00 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.00 c avg switch length: 2.00
0.99/1.00 c switching time : 0.00
0.99/1.00 c Solution :
0.99/1.00 c Solutions found : 33 (6 improvements)
0.99/1.00 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.99/1.00 c Primal Bound : +8.00000000000000e+00 (in run 1, after 1 nodes, 0.48 seconds, depth 0, found by <rens>)
0.99/1.00 c Dual Bound : +8.00000000000000e+00
0.99/1.00 c Gap : 0.00 %
0.99/1.00 c Root Dual Bound : +8.00000000000000e+00
0.99/1.00 c Root Iterations : 753
0.99/1.01 c Time complete: 1.01.