0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2666203-1276592987.opb>
0.00/0.03 c original problem has 363 variables (363 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 o 363
0.00/0.04 c feasible solution found by trivial heuristic, objective value 3.630000e+02
0.00/0.04 c presolving:
0.00/0.05 c (round 1) 1 del vars, 12 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.06 c (round 2) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.06 c (round 3) 1 del vars, 32 del conss, 1 chg bounds, 20 chg sides, 0 chg coeffs, 46 upgd conss, 0 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 101/362 (27.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (4 rounds):
0.00/0.07 c 1 deleted vars, 32 deleted constraints, 1 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.00/0.07 c 0 implications, 0 cliques
0.00/0.07 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 46 constraints
0.00/0.07 c 46 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.02
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c conflict/interconss = 0
0.00/0.07 c
0.00/0.07 c # should binary conflicts be preferred?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c conflict/preferbinary = TRUE
0.00/0.07 c
0.00/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c constraints/agelimit = 1
0.00/0.07 c
0.00/0.07 c # should enforcement of pseudo solution be disabled?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/disableenfops = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
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 = 1799.98
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 = 1620
0.00/0.07 c
0.00/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = 0
0.00/0.07 c
0.00/0.07 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.07 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.07 c lp/pricing = a
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # priority of node selection rule <dfs> in standard mode
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.07 c nodeselection/dfs/stdpriority = 1000000
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.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.0s| 1 | 0 | 14 | - |1863k| 0 | 8 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 3.630000e+02 |7160.00%
0.00/0.07 o 9
0.00/0.07 c r 0.0s| 1 | 0 | 14 | - |1866k| 0 | 8 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 9.000000e+00 | 80.00%
0.00/0.07 o 8
0.00/0.07 c R 0.0s| 1 | 0 | 14 | - |1869k| 0 | 8 | 362 | 46 | 362 | 46 | 0 | 0 | 0 | 5.000000e+00 | 8.000000e+00 | 60.00%
0.00/0.09 c 0.1s| 1 | 0 | 15 | - |1913k| 0 | 4 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 8.000000e+00 | 60.00%
0.00/0.09 o 6
0.00/0.09 c b 0.1s| 1 | 0 | 15 | - |1916k| 0 | 4 | 362 | 46 | 362 | 47 | 1 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.10 c 0.1s| 1 | 0 | 18 | - |1924k| 0 | 6 | 362 | 46 | 362 | 48 | 2 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.11 c 0.1s| 1 | 0 | 24 | - |1989k| 0 | 13 | 362 | 46 | 362 | 49 | 3 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.14 c 0.1s| 1 | 0 | 30 | - |2243k| 0 | 11 | 362 | 46 | 362 | 50 | 4 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.09/0.17 c 0.1s| 1 | 0 | 32 | - |2382k| 0 | 11 | 362 | 46 | 362 | 51 | 5 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.20 c 0.1s| 1 | 0 | 34 | - |2412k| 0 | 8 | 362 | 46 | 362 | 52 | 6 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.25 c 0.2s| 1 | 0 | 34 | - |2426k| 0 | - | 362 | 46 | 362 | 52 | 6 | 0 | 8 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.19/0.25 c (run 1, node 1) restarting after 137 global fixings of integer variables
0.19/0.25 c
0.19/0.25 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.19/0.25 c
0.19/0.25 c presolving:
0.19/0.26 c (round 1) 137 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 0 impls, 0 clqs
0.19/0.26 c presolving (2 rounds):
0.19/0.26 c 137 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.26 c 0 implications, 0 cliques
0.19/0.26 c presolved problem has 225 variables (225 bin, 0 int, 0 impl, 0 cont) and 51 constraints
0.19/0.26 c 6 constraints of type <knapsack>
0.19/0.26 c 45 constraints of type <logicor>
0.19/0.26 c transformed objective value is always integral (scale: 1)
0.19/0.26 c Presolving Time: 0.04
0.19/0.26 c
0.19/0.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.27 c 0.2s| 1 | 0 | 87 | - |2027k| 0 | 20 | 225 | 51 | 225 | 51 | 0 | 0 | 8 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.33 c 0.3s| 1 | 0 | 92 | - |2334k| 0 | 15 | 225 | 51 | 225 | 52 | 1 | 0 | 8 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.38 c 0.3s| 1 | 0 | 92 | - |2339k| 0 | - | 225 | 51 | 225 | 52 | 1 | 0 | 23 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.29/0.38 c (run 2, node 1) restarting after 66 global fixings of integer variables
0.29/0.38 c
0.29/0.38 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.29/0.38 c
0.29/0.38 c presolving:
0.29/0.39 c (round 1) 66 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 66 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 0 implications, 0 cliques
0.29/0.39 c presolved problem has 159 variables (159 bin, 0 int, 0 impl, 0 cont) and 52 constraints
0.29/0.39 c 7 constraints of type <knapsack>
0.29/0.39 c 45 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.05
0.29/0.39 c
0.29/0.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.40 c 0.3s| 1 | 0 | 131 | - |1952k| 0 | 15 | 159 | 52 | 159 | 52 | 0 | 0 | 23 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.38/0.43 c 0.3s| 1 | 0 | 150 | - |2162k| 0 | 16 | 159 | 52 | 159 | 53 | 1 | 0 | 23 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.38/0.47 c 0.4s| 1 | 0 | 169 | - |2167k| 0 | 20 | 159 | 52 | 159 | 53 | 1 | 0 | 35 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.48/0.51 c 0.4s| 1 | 0 | 194 | - |2171k| 0 | 22 | 159 | 52 | 159 | 53 | 1 | 0 | 45 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.48/0.52 c 0.4s| 1 | 0 | 202 | - |2176k| 0 | 23 | 159 | 52 | 159 | 53 | 1 | 0 | 50 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.48/0.55 c 0.5s| 1 | 0 | 218 | - |2181k| 0 | 22 | 159 | 52 | 159 | 53 | 1 | 0 | 57 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.48/0.57 c 0.5s| 1 | 0 | 228 | - |2185k| 0 | 22 | 159 | 52 | 159 | 53 | 1 | 0 | 63 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.48/0.59 c 0.5s| 1 | 0 | 242 | - |2190k| 0 | 19 | 159 | 52 | 159 | 53 | 1 | 0 | 69 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.59/0.61 c 0.5s| 1 | 0 | 242 | - |2195k| 0 | - | 159 | 52 | 159 | 53 | 1 | 0 | 76 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.59/0.61 c (run 3, node 1) restarting after 35 global fixings of integer variables
0.59/0.61 c
0.59/0.61 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.59/0.61 c
0.59/0.62 c presolving:
0.59/0.62 c (round 1) 35 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.59/0.63 c presolving (2 rounds):
0.59/0.63 c 35 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.63 c 0 implications, 0 cliques
0.59/0.63 c presolved problem has 124 variables (124 bin, 0 int, 0 impl, 0 cont) and 53 constraints
0.59/0.63 c 8 constraints of type <knapsack>
0.59/0.63 c 45 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.06
0.59/0.63 c
0.59/0.63 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.63 c 0.5s| 1 | 0 | 308 | - |1946k| 0 | 13 | 124 | 53 | 124 | 53 | 0 | 0 | 76 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.59/0.66 c 0.6s| 1 | 0 | 313 | - |2078k| 0 | 16 | 124 | 53 | 124 | 54 | 1 | 0 | 76 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.59/0.69 c 0.6s| 1 | 0 | 316 | - |2083k| 0 | 17 | 124 | 53 | 124 | 54 | 1 | 0 | 92 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.70 c 0.6s| 1 | 0 | 321 | - |2087k| 0 | 16 | 124 | 53 | 124 | 54 | 1 | 0 | 96 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.71 c 0.6s| 1 | 0 | 325 | - |2097k| 0 | 19 | 124 | 53 | 124 | 54 | 1 | 0 | 100 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.73 c 0.6s| 1 | 0 | 328 | - |2101k| 0 | 18 | 124 | 53 | 124 | 54 | 1 | 0 | 105 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.73 c 0.6s| 1 | 0 | 343 | - |2106k| 0 | 17 | 124 | 53 | 124 | 54 | 1 | 0 | 108 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.75 c 0.6s| 1 | 0 | 351 | - |2111k| 0 | 17 | 124 | 53 | 124 | 54 | 1 | 0 | 114 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.76 c 0.6s| 1 | 0 | 354 | - |2115k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 119 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.77 c 0.7s| 1 | 0 | 356 | - |2120k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 122 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.77 c 0.7s| 1 | 0 | 358 | - |2125k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 123 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.77 c 0.7s| 1 | 2 | 358 | - |2130k| 0 | 15 | 124 | 53 | 124 | 54 | 1 | 0 | 124 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.69/0.77 c (run 4, node 1) restarting after 16 global fixings of integer variables
0.69/0.77 c
0.69/0.77 c presolving:
0.69/0.78 c (round 1) 16 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.69/0.78 c presolving (2 rounds):
0.69/0.78 c 16 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.78 c 0 implications, 0 cliques
0.69/0.78 c presolved problem has 108 variables (108 bin, 0 int, 0 impl, 0 cont) and 51 constraints
0.69/0.78 c 8 constraints of type <knapsack>
0.69/0.78 c 43 constraints of type <logicor>
0.69/0.78 c transformed objective value is always integral (scale: 1)
0.69/0.78 c Presolving Time: 0.07
0.69/0.78 c
0.69/0.79 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.79 c 0.7s| 1 | 0 | 406 | - |1966k| 0 | 17 | 108 | 51 | 108 | 51 | 0 | 0 | 124 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.81 c 0.7s| 1 | 0 | 411 | - |2113k| 0 | 16 | 108 | 51 | 108 | 52 | 1 | 0 | 124 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.83 c 0.7s| 1 | 0 | 416 | - |2118k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 140 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.83 c 0.7s| 1 | 0 | 422 | - |2123k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 143 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.84 c 0.7s| 1 | 0 | 427 | - |2127k| 0 | 13 | 108 | 51 | 108 | 52 | 1 | 0 | 148 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.84 c 0.7s| 1 | 0 | 431 | - |2132k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 150 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.85 c 0.7s| 1 | 0 | 433 | - |2137k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 153 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.85 o 6
0.79/0.85 c s 0.7s| 1 | 0 | 433 | - |2146k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 153 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.85 c 0.7s| 1 | 0 | 435 | - |2146k| 0 | 14 | 108 | 51 | 108 | 52 | 1 | 0 | 154 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.79/0.85 o 5
0.79/0.85 c b 0.7s| 1 | 0 | 435 | - |2155k| 0 | - | 108 | 51 | 108 | 52 | 1 | 0 | 154 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.79/0.85 c 0.7s| 1 | 0 | 435 | - |2151k| 0 | - | 108 | 51 | 108 | 52 | 1 | 0 | 154 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.79/0.85 c
0.79/0.85 c SCIP Status : problem is solved [optimal solution found]
0.79/0.85 c Solving Time (sec) : 0.72
0.79/0.85 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
0.79/0.85 c Primal Bound : +5.00000000000000e+00 (48 solutions)
0.79/0.85 c Dual Bound : +5.00000000000000e+00
0.79/0.85 c Gap : 0.00 %
0.79/0.85 s OPTIMUM FOUND
0.79/0.85 v -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342
0.79/0.85 v -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322
0.79/0.85 v -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301
0.79/0.85 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280
0.79/0.85 v -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259
0.79/0.85 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238
0.79/0.85 v -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217
0.79/0.85 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 x199 -x198 -x197 -x196
0.79/0.85 v -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176
0.79/0.85 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155
0.79/0.85 v -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134
0.79/0.85 v -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113
0.79/0.85 v -x112 -x111 x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91
0.79/0.85 v -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65
0.79/0.85 v -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40
0.79/0.85 v -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15
0.79/0.85 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.79/0.85 c SCIP Status : problem is solved [optimal solution found]
0.79/0.85 c Solving Time : 0.72
0.79/0.85 c Original Problem :
0.79/0.85 c Problem name : HOME/instance-2666203-1276592987.opb
0.79/0.85 c Variables : 363 (363 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.85 c Constraints : 78 initial, 78 maximal
0.79/0.85 c Presolved Problem :
0.79/0.85 c Problem name : t_HOME/instance-2666203-1276592987.opb
0.79/0.85 c Variables : 108 (108 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.85 c Constraints : 51 initial, 51 maximal
0.79/0.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.85 c trivial : 0.00 254 0 0 0 0 0 0 0
0.79/0.85 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.85 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.85 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.85 c probing : 0.01 0 0 0 0 0 0 0 0
0.79/0.85 c knapsack : 0.03 0 0 0 0 0 0 0 0
0.79/0.85 c linear : 0.02 1 0 0 1 0 32 20 0
0.79/0.85 c logicor : 0.00 0 0 0 0 0 3 0 0
0.79/0.85 c root node : - 266 - - 266 - - - -
0.79/0.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.85 c integral : 0 0 0 25 0 0 68 0 0 2
0.79/0.85 c knapsack : 8 4 26 0 0 0 0 0 0 0
0.79/0.85 c logicor : 43 10 24 0 0 0 0 0 0 0
0.79/0.85 c countsols : 0 0 0 0 0 0 0 0 0 0
0.79/0.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.85 c integral : 0.35 0.00 0.00 0.35 0.00
0.79/0.85 c knapsack : 0.07 0.07 0.00 0.00 0.00
0.79/0.85 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.85 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.85 c Propagators : Time Calls Cutoffs DomReds
0.79/0.85 c vbounds : 0.00 6 0 0
0.79/0.85 c rootredcost : 0.00 0 0 0
0.79/0.85 c pseudoobj : 0.00 33 0 0
0.79/0.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.85 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.85 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.85 c applied globally : - - - 0 0.0 - - -
0.79/0.85 c applied locally : - - - 0 0.0 - - -
0.79/0.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.85 c cut pool : 0.00 0 - - 0 - (maximal pool size: 46)
0.79/0.85 c redcost : 0.00 10 0 198 0 0
0.79/0.85 c impliedbounds : 0.00 10 0 0 0 0
0.79/0.85 c intobj : 0.00 0 0 0 0 0
0.79/0.85 c cgmip : 0.00 0 0 0 0 0
0.79/0.85 c gomory : 0.05 10 0 0 278 0
0.79/0.85 c strongcg : 0.05 10 0 0 268 0
0.79/0.85 c cmir : 0.00 10 0 0 0 0
0.79/0.85 c flowcover : 0.06 10 0 0 0 0
0.79/0.85 c clique : 0.01 5 0 0 0 0
0.79/0.85 c zerohalf : 0.00 0 0 0 0 0
0.79/0.85 c mcf : 0.00 5 0 0 0 0
0.79/0.85 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.85 c Pricers : Time Calls Vars
0.79/0.85 c problem variables: 0.00 0 0
0.79/0.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.85 c relpscost : 0.35 25 0 68 0 0 2
0.79/0.85 c pscost : 0.00 0 0 0 0 0 0
0.79/0.85 c inference : 0.00 0 0 0 0 0 0
0.79/0.85 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.85 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.85 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.85 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.85 c random : 0.00 0 0 0 0 0 0
0.79/0.85 c Primal Heuristics : Time Calls Found
0.79/0.85 c LP solutions : 0.00 - 0
0.79/0.85 c pseudo solutions : 0.00 - 0
0.79/0.85 c trivial : 0.00 2 3
0.79/0.85 c simplerounding : 0.00 35 35
0.79/0.85 c zirounding : 0.00 1 1
0.79/0.85 c rounding : 0.00 35 1
0.79/0.85 c shifting : 0.00 35 5
0.79/0.85 c intshifting : 0.00 0 0
0.79/0.85 c oneopt : 0.00 3 2
0.79/0.85 c twoopt : 0.00 0 0
0.79/0.85 c fixandinfer : 0.00 0 0
0.79/0.85 c feaspump : 0.00 0 0
0.79/0.85 c coefdiving : 0.00 0 0
0.79/0.85 c pscostdiving : 0.00 0 0
0.79/0.85 c fracdiving : 0.00 0 0
0.79/0.85 c veclendiving : 0.00 0 0
0.79/0.85 c intdiving : 0.00 0 0
0.79/0.85 c actconsdiving : 0.00 0 0
0.79/0.85 c objpscostdiving : 0.00 0 0
0.79/0.85 c rootsoldiving : 0.00 0 0
0.79/0.85 c linesearchdiving : 0.00 0 0
0.79/0.85 c guideddiving : 0.00 0 0
0.79/0.85 c octane : 0.00 0 0
0.79/0.85 c rens : 0.02 1 1
0.79/0.85 c rins : 0.00 0 0
0.79/0.85 c localbranching : 0.00 0 0
0.79/0.85 c mutation : 0.00 0 0
0.79/0.85 c crossover : 0.00 0 0
0.79/0.85 c dins : 0.00 0 0
0.79/0.85 c undercover : 0.00 0 0
0.79/0.85 c nlp : 0.00 0 0
0.79/0.85 c trysol : 0.00 0 0
0.79/0.85 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.85 c primal LP : 0.00 0 0 0.00 -
0.79/0.85 c dual LP : 0.02 36 435 12.08 21750.00
0.79/0.85 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.85 c barrier LP : 0.00 0 0 0.00 -
0.79/0.85 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.85 c strong branching : 0.35 154 6093 39.56 17408.57
0.79/0.85 c (at root node) : - 154 6093 39.56 -
0.79/0.85 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.85 c B&B Tree :
0.79/0.85 c number of runs : 5
0.79/0.85 c nodes : 1
0.79/0.85 c nodes (total) : 5
0.79/0.85 c nodes left : 0
0.79/0.85 c max depth : 0
0.79/0.85 c max depth (total): 0
0.79/0.85 c backtracks : 0 (0.0%)
0.79/0.85 c delayed cutoffs : 0
0.79/0.85 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.85 c avg switch length: 2.00
0.79/0.85 c switching time : 0.00
0.79/0.85 c Solution :
0.79/0.85 c Solutions found : 48 (6 improvements)
0.79/0.85 c First Solution : +3.63000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.79/0.85 c Primal Bound : +5.00000000000000e+00 (in run 5, after 1 nodes, 0.72 seconds, depth 0, found by <oneopt>)
0.79/0.85 c Dual Bound : +5.00000000000000e+00
0.79/0.85 c Gap : 0.00 %
0.79/0.85 c Root Dual Bound : +5.00000000000000e+00
0.79/0.85 c Root Iterations : 435
0.79/0.86 c Time complete: 0.85.