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-3489545-1307771713.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 515 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 220
0.00/0.01 o 211
0.00/0.01 c feasible solution found by trivial heuristic, objective value 2.110000e+02
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 5 del conss, 0 add conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 47 del conss, 0 add conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 510 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 101/220 (45.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 47 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 0 cliques
0.00/0.03 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 468 constraints
0.00/0.03 c 468 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.5
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 o 189
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 | 0 | - |1538k| 0 | - | 220 | 468 | 0 | 0 | 0 | 0 | 0 | -- | 1.890000e+02 | Inf
0.03/0.04 o 9
0.03/0.04 c b 0.0s| 1 | 0 | 0 | - |2242k| 0 | - | 220 | 468 | 220 | 468 | 0 | 0 | 0 | -- | 9.000000e+00 | Inf
0.03/0.04 c 0.0s| 1 | 0 | 66 | - |2239k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 9.000000e+00 | 197.69%
0.03/0.04 o 9
0.03/0.04 c s 0.0s| 1 | 0 | 66 | - |2247k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 9.000000e+00 | 197.69%
0.03/0.04 o 6
0.03/0.04 c b 0.0s| 1 | 0 | 66 | - |2252k| 0 | 25 | 220 | 468 | 220 | 468 | 0 | 0 | 0 | 3.023256e+00 | 6.000000e+00 | 98.46%
0.09/0.10 c 0.1s| 1 | 0 | 107 | - |2441k| 0 | 42 | 220 | 468 | 220 | 469 | 1 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.09/0.17 c 0.2s| 1 | 0 | 125 | - |2775k| 0 | 46 | 220 | 468 | 220 | 470 | 2 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.19/0.22 c 0.2s| 1 | 0 | 154 | - |2911k| 0 | 43 | 220 | 468 | 220 | 471 | 3 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.19/0.25 c 0.3s| 1 | 0 | 179 | - |2949k| 0 | 33 | 220 | 468 | 220 | 472 | 4 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.29/0.31 c 0.3s| 1 | 0 | 200 | - |2970k| 0 | 34 | 220 | 468 | 220 | 473 | 5 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.29/0.36 c 0.4s| 1 | 0 | 243 | - |2990k| 0 | 41 | 220 | 468 | 220 | 474 | 6 | 0 | 0 | 3.333333e+00 | 6.000000e+00 | 80.00%
0.29/0.39 o 5
0.29/0.39 c E 0.4s| 1 | 0 | 243 | - |2992k| 0 | 41 | 220 | 468 | 220 | 474 | 6 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.29/0.40 c 0.4s| 1 | 0 | 243 | - |2992k| 0 | 41 | 220 | 468 | 220 | 474 | 6 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.39/0.44 c 0.4s| 1 | 0 | 243 | - |2992k| 0 | 41 | 220 | 468 | 220 | 462 | 6 | 0 | 0 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.49/0.57 c 0.6s| 1 | 0 | 283 | - |2990k| 0 | 36 | 220 | 465 | 220 | 462 | 6 | 0 | 9 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.69/0.70 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.70 c 0.7s| 1 | 0 | 312 | - |2990k| 0 | 36 | 220 | 465 | 220 | 462 | 6 | 0 | 16 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.79/0.86 c 0.9s| 1 | 0 | 346 | - |2989k| 0 | 40 | 220 | 463 | 220 | 462 | 6 | 0 | 26 | 3.333333e+00 | 5.000000e+00 | 50.00%
0.89/0.93 c 0.9s| 1 | 0 | 393 | - |2989k| 0 | 44 | 220 | 463 | 220 | 462 | 6 | 0 | 31 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.00/1.02 c 1.0s| 1 | 0 | 421 | - |2989k| 0 | 41 | 220 | 463 | 220 | 462 | 6 | 0 | 37 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.00/1.04 c 1.0s| 1 | 0 | 506 | - |3021k| 0 | 27 | 220 | 463 | 220 | 463 | 7 | 0 | 37 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.00/1.07 c 1.1s| 1 | 0 | 519 | - |3020k| 0 | 25 | 220 | 462 | 220 | 463 | 7 | 0 | 44 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.10/1.14 c 1.1s| 1 | 0 | 540 | - |3259k| 0 | 32 | 220 | 462 | 220 | 464 | 8 | 0 | 44 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.10/1.18 c 1.2s| 1 | 0 | 557 | - |3259k| 0 | 25 | 220 | 462 | 220 | 464 | 8 | 0 | 50 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.19/1.22 c 1.2s| 1 | 0 | 580 | - |3288k| 0 | 25 | 220 | 462 | 220 | 465 | 9 | 0 | 50 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.19/1.25 c 1.3s| 1 | 0 | 580 | - |3288k| 0 | - | 220 | 462 | 220 | 465 | 9 | 0 | 55 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.19/1.25 c (run 1, node 1) restarting after 45 global fixings of integer variables
1.19/1.25 c
1.19/1.25 c (restart) converted 9 cuts from the global cut pool into linear constraints
1.19/1.25 c
1.19/1.25 c presolving:
1.19/1.25 c (round 1) 45 del vars, 103 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
1.19/1.26 c (round 2) 45 del vars, 103 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 9 upgd conss, 0 impls, 0 clqs
1.19/1.26 c presolving (3 rounds):
1.19/1.26 c 45 deleted vars, 103 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 32 changed coefficients
1.19/1.26 c 0 implications, 0 cliques
1.19/1.26 c presolved problem has 175 variables (175 bin, 0 int, 0 impl, 0 cont) and 368 constraints
1.19/1.26 c 9 constraints of type <knapsack>
1.19/1.26 c 359 constraints of type <logicor>
1.19/1.26 c transformed objective value is always integral (scale: 1)
1.19/1.26 c Presolving Time: 0.03
1.19/1.26 c
1.19/1.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.27 c 1.3s| 1 | 0 | 620 | - |2211k| 0 | 17 | 175 | 368 | 175 | 368 | 0 | 0 | 55 | 3.333333e+00 | 5.000000e+00 | 50.00%
1.29/1.34 c 1.3s| 1 | 0 | 641 | - |2511k| 0 | 26 | 175 | 368 | 175 | 369 | 1 | 0 | 55 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.29/1.36 c 1.4s| 1 | 0 | 666 | - |2511k| 0 | 28 | 175 | 368 | 175 | 369 | 1 | 0 | 64 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.29/1.38 c 1.4s| 1 | 0 | 689 | - |2508k| 0 | 31 | 175 | 361 | 175 | 369 | 1 | 0 | 72 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.40 c 1.4s| 1 | 0 | 714 | - |2508k| 0 | 28 | 175 | 361 | 175 | 369 | 1 | 0 | 77 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.42 c 1.4s| 1 | 0 | 741 | - |2508k| 0 | 33 | 175 | 361 | 175 | 369 | 1 | 0 | 83 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.44 c 1.4s| 1 | 0 | 764 | - |2508k| 0 | 26 | 175 | 361 | 175 | 369 | 1 | 0 | 91 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.45 c 1.5s| 1 | 0 | 776 | - |2508k| 0 | 21 | 175 | 361 | 175 | 369 | 1 | 0 | 98 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.46 c 1.5s| 1 | 0 | 783 | - |2508k| 0 | 14 | 175 | 361 | 175 | 369 | 1 | 0 | 104 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.47 c 1.5s| 1 | 0 | 783 | - |2508k| 0 | - | 175 | 361 | 175 | 369 | 1 | 0 | 109 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.39/1.47 c (run 2, node 1) restarting after 40 global fixings of integer variables
1.39/1.47 c
1.39/1.47 c (restart) converted 1 cuts from the global cut pool into linear constraints
1.39/1.47 c
1.39/1.47 c presolving:
1.39/1.48 c (round 1) 40 del vars, 86 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
1.39/1.48 c (round 2) 40 del vars, 87 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
1.39/1.48 c presolving (3 rounds):
1.39/1.48 c 40 deleted vars, 87 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.48 c 0 implications, 0 cliques
1.39/1.48 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 275 constraints
1.39/1.48 c 10 constraints of type <knapsack>
1.39/1.48 c 265 constraints of type <logicor>
1.39/1.48 c transformed objective value is always integral (scale: 1)
1.39/1.48 c Presolving Time: 0.03
1.39/1.48 c
1.39/1.48 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.48 c 1.5s| 1 | 0 | 803 | - |1969k| 0 | 11 | 135 | 275 | 135 | 275 | 0 | 0 | 109 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.51 c 1.5s| 1 | 0 | 815 | - |1983k| 0 | 18 | 135 | 275 | 135 | 276 | 1 | 0 | 109 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.52 c 1.5s| 1 | 0 | 830 | - |1983k| 0 | 19 | 135 | 275 | 135 | 276 | 1 | 0 | 118 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.53 c 1.5s| 1 | 0 | 838 | - |1983k| 0 | 18 | 135 | 275 | 135 | 276 | 1 | 0 | 127 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.54 c 1.5s| 1 | 0 | 848 | - |1980k| 0 | 18 | 135 | 265 | 135 | 276 | 1 | 0 | 132 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.54 c 1.5s| 1 | 0 | 857 | - |1980k| 0 | 16 | 135 | 263 | 135 | 276 | 1 | 0 | 137 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.55 c 1.6s| 1 | 0 | 866 | - |1979k| 0 | 18 | 135 | 262 | 135 | 276 | 1 | 0 | 146 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.56 c 1.6s| 1 | 0 | 866 | - |1979k| 0 | - | 135 | 262 | 135 | 276 | 1 | 0 | 151 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.49/1.56 c (run 3, node 1) restarting after 29 global fixings of integer variables
1.49/1.56 c
1.49/1.56 c (restart) converted 1 cuts from the global cut pool into linear constraints
1.49/1.56 c
1.49/1.56 c presolving:
1.49/1.56 c (round 1) 29 del vars, 38 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.56 c (round 2) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 7 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 3) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 4) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 14 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 5) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 6) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 7) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 8) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 9) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 10) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.57 c (round 11) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 12) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 13) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 14) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 15) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 45 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 16) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c (round 17) 29 del vars, 40 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 1 upgd conss, 68 impls, 0 clqs
1.49/1.58 c presolving (18 rounds):
1.49/1.58 c 29 deleted vars, 40 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 47 changed coefficients
1.49/1.58 c 68 implications, 0 cliques
1.49/1.58 c presolved problem has 106 variables (106 bin, 0 int, 0 impl, 0 cont) and 223 constraints
1.49/1.58 c 11 constraints of type <knapsack>
1.49/1.58 c 212 constraints of type <logicor>
1.49/1.58 c transformed objective value is always integral (scale: 1)
1.49/1.58 c Presolving Time: 0.06
1.49/1.58 c
1.49/1.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.58 c 1.6s| 1 | 0 | 892 | - |1868k| 0 | 17 | 106 | 223 | 106 | 223 | 0 | 0 | 151 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.61 c 1.6s| 1 | 0 | 900 | - |1914k| 0 | 17 | 106 | 223 | 106 | 224 | 1 | 0 | 151 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.63 c 1.6s| 1 | 0 | 912 | - |1913k| 0 | 16 | 106 | 222 | 106 | 224 | 1 | 0 | 168 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.63 c 1.6s| 1 | 0 | 918 | - |1913k| 0 | 12 | 106 | 222 | 106 | 224 | 1 | 0 | 174 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.63 c 1.6s| 1 | 0 | 923 | - |1913k| 0 | 11 | 106 | 222 | 106 | 224 | 1 | 0 | 175 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.63 c 1.6s| 1 | 2 | 923 | - |1914k| 0 | 11 | 106 | 222 | 106 | 224 | 1 | 0 | 176 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.59/1.63 c (run 4, node 1) restarting after 7 global fixings of integer variables
1.59/1.63 c
1.59/1.63 c (restart) converted 1 cuts from the global cut pool into linear constraints
1.59/1.63 c
1.59/1.64 c presolving:
1.59/1.64 c (round 1) 7 del vars, 17 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.64 c (round 2) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 16 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.65 c (round 3) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.65 c (round 4) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.65 c (round 5) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 89 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.66 c (round 6) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 112 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.66 c (round 7) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 134 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.66 c (round 8) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 157 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.67 c (round 9) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 180 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.67 c (round 10) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 201 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.67 c (round 11) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 220 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.67 c (round 12) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 237 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.68 c (round 13) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 253 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.68 c (round 14) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 265 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.68 c (round 15) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 276 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.68 c (round 16) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 282 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 17) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 288 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 18) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 292 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 19) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 295 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 20) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 297 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 21) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 299 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c (round 22) 7 del vars, 20 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 300 chg coeffs, 1 upgd conss, 140 impls, 0 clqs
1.59/1.69 c presolving (23 rounds):
1.59/1.69 c 7 deleted vars, 20 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 300 changed coefficients
1.59/1.69 c 140 implications, 0 cliques
1.59/1.69 c presolved problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 203 constraints
1.59/1.69 c 12 constraints of type <knapsack>
1.59/1.69 c 191 constraints of type <logicor>
1.59/1.69 c transformed objective value is always integral (scale: 1)
1.59/1.69 c Presolving Time: 0.11
1.59/1.69 c
1.59/1.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.69 c 1.7s| 1 | 0 | 946 | - |1848k| 0 | 19 | 99 | 203 | 99 | 203 | 0 | 0 | 176 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.72 c 1.7s| 1 | 0 | 960 | - |1928k| 0 | 22 | 99 | 203 | 99 | 205 | 2 | 0 | 176 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.73 c 1.7s| 1 | 0 | 968 | - |1928k| 0 | 21 | 99 | 203 | 99 | 205 | 2 | 0 | 186 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.73 c 1.7s| 1 | 0 | 980 | - |1927k| 0 | 17 | 99 | 202 | 99 | 205 | 2 | 0 | 191 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.74 c 1.7s| 1 | 0 | 987 | - |1927k| 0 | 16 | 99 | 201 | 99 | 205 | 2 | 0 | 197 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.75 c 1.7s| 1 | 0 | 997 | - |1927k| 0 | 16 | 99 | 201 | 99 | 205 | 2 | 0 | 207 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.75 c 1.8s| 1 | 0 | 1001 | - |1927k| 0 | 11 | 99 | 201 | 99 | 205 | 2 | 0 | 212 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.75 c 1.8s| 1 | 0 | 1005 | - |1926k| 0 | 14 | 99 | 201 | 99 | 205 | 2 | 0 | 214 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.76 c 1.8s| 1 | 0 | 1006 | - |1926k| 0 | 10 | 99 | 201 | 99 | 205 | 2 | 0 | 217 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.76 c 1.8s| 1 | 2 | 1006 | - |1927k| 0 | 10 | 99 | 201 | 99 | 205 | 2 | 0 | 217 | 4.000000e+00 | 5.000000e+00 | 25.00%
1.69/1.76 o 4
1.69/1.76 c * 1.8s| 2 | 0 | 1013 | 1.4 |1932k| 1 | - | 99 | 201 | 99 | 194 | 2 | 0 | 217 | 4.000000e+00 | 4.000000e+00 | 0.00%
1.69/1.76 c
1.69/1.76 c SCIP Status : problem is solved [optimal solution found]
1.69/1.76 c Solving Time (sec) : 1.76
1.69/1.76 c Solving Nodes : 2 (total of 6 nodes in 5 runs)
1.69/1.76 c Primal Bound : +4.00000000000000e+00 (8 solutions)
1.69/1.76 c Dual Bound : +4.00000000000000e+00
1.69/1.76 c Gap : 0.00 %
1.69/1.76 s OPTIMUM FOUND
1.69/1.76 v -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 x204 -x203 -x202 -x201 -x200 -x199
1.69/1.76 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178
1.69/1.76 v -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157
1.69/1.76 v -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137
1.69/1.76 v -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116
1.69/1.76 v -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94
1.69/1.76 v -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69
1.69/1.76 v -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44
1.69/1.76 v -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19
1.69/1.76 v -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
1.69/1.76 c SCIP Status : problem is solved [optimal solution found]
1.69/1.76 c Total Time : 1.76
1.69/1.76 c solving : 1.76
1.69/1.76 c presolving : 0.11 (included in solving)
1.69/1.76 c reading : 0.01 (included in solving)
1.69/1.76 c Original Problem :
1.69/1.76 c Problem name : HOME/instance-3489545-1307771713.opb
1.69/1.76 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.76 c Constraints : 515 initial, 515 maximal
1.69/1.76 c Presolved Problem :
1.69/1.76 c Problem name : t_HOME/instance-3489545-1307771713.opb
1.69/1.76 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.76 c Constraints : 203 initial, 203 maximal
1.69/1.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.69/1.76 c trivial : 0.00 121 0 0 0 0 0 0 0 0
1.69/1.76 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.69/1.76 c knapsack : 0.08 0 0 0 0 0 0 0 0 347
1.69/1.76 c linear : 0.01 0 0 0 0 0 5 0 4 32
1.69/1.76 c logicor : 0.02 0 0 0 0 0 292 0 0 0
1.69/1.76 c root node : - 144 - - 144 - - - - -
1.69/1.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.69/1.76 c integral : 0 0 0 35 0 15 0 0 139 0 0 4
1.69/1.76 c knapsack : 12 4 27 0 0 0 0 0 0 0 0 0
1.69/1.76 c logicor : 191 18 104 1 0 6 0 0 0 0 0 0
1.69/1.76 c countsols : 0 0 0 1 0 9 0 0 0 0 0 0
1.69/1.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.69/1.76 c integral : 0.74 0.00 0.00 0.74 0.00 0.00 0.00
1.69/1.76 c knapsack : 0.05 0.05 0.00 0.00 0.00 0.00 0.00
1.69/1.76 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.69/1.76 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.69/1.76 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.69/1.76 c vbounds : 0 0 0 0
1.69/1.76 c rootredcost : 0 0 0 0
1.69/1.76 c pseudoobj : 44 0 0 0
1.69/1.76 c Propagator Timings : TotalTime Propagate Resprop
1.69/1.76 c vbounds : 0.00 0.00 0.00
1.69/1.76 c rootredcost : 0.00 0.00 0.00
1.69/1.76 c pseudoobj : 0.00 0.00 0.00
1.69/1.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.76 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.76 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.76 c applied globally : - - - 0 0.0 - - -
1.69/1.76 c applied locally : - - - 0 0.0 - - -
1.69/1.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.76 c cut pool : 0.00 0 - - 0 - (maximal pool size: 26)
1.69/1.76 c redcost : 0.00 19 0 5 0 0
1.69/1.76 c impliedbounds : 0.00 18 0 0 0 0
1.69/1.76 c intobj : 0.00 0 0 0 0 0
1.69/1.76 c gomory : 0.33 18 0 0 1617 0
1.69/1.76 c cgmip : 0.00 0 0 0 0 0
1.69/1.76 c closecuts : 0.00 0 0 0 0 0
1.69/1.76 c strongcg : 0.30 18 0 0 2233 0
1.69/1.76 c cmir : 0.03 14 0 0 0 0
1.69/1.76 c flowcover : 0.06 14 0 0 0 0
1.69/1.76 c clique : 0.00 5 0 0 0 0
1.69/1.76 c zerohalf : 0.00 0 0 0 0 0
1.69/1.76 c mcf : 0.00 5 0 0 0 0
1.69/1.76 c oddcycle : 0.00 0 0 0 0 0
1.69/1.76 c rapidlearning : 0.00 0 0 0 0 0
1.69/1.76 c Pricers : Time Calls Vars
1.69/1.76 c problem variables: 0.00 0 0
1.69/1.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.76 c relpscost : 0.74 34 0 139 0 0 4
1.69/1.76 c pscost : 0.00 0 0 0 0 0 0
1.69/1.76 c inference : 0.00 0 0 0 0 0 0
1.69/1.76 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.76 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.76 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.76 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.76 c random : 0.00 0 0 0 0 0 0
1.69/1.76 c Primal Heuristics : Time Calls Found
1.69/1.76 c LP solutions : 0.00 - 1
1.69/1.76 c pseudo solutions : 0.00 - 0
1.69/1.76 c crossover : 0.00 0 0
1.69/1.76 c oneopt : 0.00 4 2
1.69/1.76 c trivial : 0.00 2 3
1.69/1.76 c shiftandpropagate: 0.00 0 0
1.69/1.76 c simplerounding : 0.00 5 0
1.69/1.76 c zirounding : 0.00 2 0
1.69/1.76 c rounding : 0.00 47 0
1.69/1.76 c shifting : 0.00 47 1
1.69/1.76 c intshifting : 0.00 0 0
1.69/1.76 c twoopt : 0.00 0 0
1.69/1.76 c fixandinfer : 0.00 0 0
1.69/1.76 c feaspump : 0.00 0 0
1.69/1.76 c clique : 0.00 0 0
1.69/1.76 c coefdiving : 0.00 0 0
1.69/1.76 c pscostdiving : 0.00 0 0
1.69/1.76 c fracdiving : 0.00 0 0
1.69/1.76 c veclendiving : 0.00 0 0
1.69/1.76 c intdiving : 0.00 0 0
1.69/1.76 c actconsdiving : 0.00 0 0
1.69/1.76 c objpscostdiving : 0.00 0 0
1.69/1.76 c rootsoldiving : 0.00 0 0
1.69/1.76 c linesearchdiving : 0.00 0 0
1.69/1.76 c guideddiving : 0.00 0 0
1.69/1.76 c octane : 0.00 0 0
1.69/1.76 c rens : 0.04 1 1
1.69/1.76 c rins : 0.00 0 0
1.69/1.76 c localbranching : 0.00 0 0
1.69/1.76 c mutation : 0.00 0 0
1.69/1.76 c dins : 0.00 0 0
1.69/1.76 c vbounds : 0.00 0 0
1.69/1.76 c undercover : 0.00 0 0
1.69/1.76 c subnlp : 0.00 0 0
1.69/1.76 c trysol : 0.00 0 0
1.69/1.76 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.76 c primal LP : 0.00 0 0 0.00 -
1.69/1.76 c dual LP : 0.05 48 1013 21.10 18968.26
1.69/1.76 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.76 c barrier LP : 0.00 0 0 0.00 -
1.69/1.76 c diving/probing LP: 0.00 0 0 0.00 -
1.69/1.76 c strong branching : 0.74 217 13993 64.48 18967.31
1.69/1.76 c (at root node) : - 217 13993 64.48 -
1.69/1.76 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.76 c B&B Tree :
1.69/1.76 c number of runs : 5
1.69/1.76 c nodes : 2
1.69/1.76 c nodes (total) : 6
1.69/1.76 c nodes left : 0
1.69/1.76 c max depth : 1
1.69/1.76 c max depth (total): 1
1.69/1.76 c backtracks : 0 (0.0%)
1.69/1.76 c delayed cutoffs : 0
1.69/1.76 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.69/1.76 c avg switch length: 2.00
1.69/1.76 c switching time : 0.00
1.69/1.76 c Solution :
1.69/1.76 c Solutions found : 8 (8 improvements)
1.69/1.76 c First Solution : +2.20000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.69/1.76 c Primal Bound : +4.00000000000000e+00 (in run 5, after 2 nodes, 1.76 seconds, depth 1, found by <relaxation>)
1.69/1.76 c Dual Bound : +4.00000000000000e+00
1.69/1.76 c Gap : 0.00 %
1.69/1.76 c Root Dual Bound : +4.00000000000000e+00
1.69/1.76 c Root Iterations : 1006
1.69/1.76 c Time complete: 1.75.