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-2703234-1278568435.opb>
0.00/0.02 c original problem has 783 variables (783 bin, 0 int, 0 impl, 0 cont) and 783 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.01/0.02 o 0
0.01/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.01/0.02 c presolving:
0.01/0.09 c (round 1) 733 del vars, 50 del conss, 733 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2932 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 733 deleted vars, 50 deleted constraints, 733 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 4398 implications, 0 cliques
0.09/0.11 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 733 constraints
0.09/0.11 c 733 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.99
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 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.09/0.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
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 t 0.1s| 1 | 0 | 51 | - |2178k| 0 | 50 | 50 | 733 | 50 | 733 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.09/0.12 o -1
0.09/0.12 c R 0.1s| 1 | 0 | 51 | - |2178k| 0 | 50 | 50 | 733 | 50 | 733 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.09/0.12 o -2
0.09/0.12 c s 0.1s| 1 | 0 | 51 | - |2179k| 0 | 50 | 50 | 733 | 50 | 733 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.09/0.14 c 0.1s| 1 | 0 | 110 | - |2186k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-2.000000e+00 | 88.57%
0.09/0.14 o -5
0.09/0.14 c b 0.1s| 1 | 0 | 110 | - |2187k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-5.000000e+00 | 71.43%
0.09/0.18 c 0.2s| 1 | 0 | 146 | - |2192k| 0 | 30 | 50 | 733 | 50 | 744 | 11 | 0 | 0 |-1.500000e+01 |-5.000000e+00 | 66.67%
0.19/0.22 c 0.2s| 1 | 0 | 217 | - |2198k| 0 | 24 | 50 | 733 | 50 | 748 | 15 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.19/0.26 c 0.2s| 1 | 0 | 252 | - |2202k| 0 | 22 | 50 | 733 | 50 | 753 | 20 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.29/0.30 c 0.3s| 1 | 0 | 294 | - |2207k| 0 | 25 | 50 | 733 | 50 | 760 | 27 | 0 | 0 |-1.000000e+01 |-5.000000e+00 | 50.00%
0.29/0.35 c 0.3s| 1 | 0 | 314 | - |2237k| 0 | 28 | 50 | 733 | 50 | 766 | 33 | 0 | 0 |-9.500000e+00 |-5.000000e+00 | 47.37%
0.39/0.43 c 0.4s| 1 | 0 | 373 | - |2346k| 0 | 34 | 50 | 733 | 50 | 775 | 42 | 0 | 0 |-9.155556e+00 |-5.000000e+00 | 45.39%
0.49/0.51 c 0.5s| 1 | 0 | 413 | - |2712k| 0 | 33 | 50 | 733 | 50 | 784 | 51 | 0 | 0 |-8.729167e+00 |-5.000000e+00 | 42.72%
0.59/0.60 c 0.6s| 1 | 0 | 450 | - |3006k| 0 | 31 | 50 | 733 | 50 | 791 | 58 | 0 | 0 |-8.389972e+00 |-5.000000e+00 | 40.41%
0.69/0.70 c 0.7s| 1 | 0 | 514 | - |3158k| 0 | 32 | 50 | 733 | 50 | 799 | 66 | 0 | 0 |-7.955102e+00 |-5.000000e+00 | 37.15%
0.69/0.78 c 0.8s| 1 | 0 | 543 | - |3449k| 0 | 35 | 50 | 733 | 50 | 113 | 72 | 0 | 0 |-7.894553e+00 |-5.000000e+00 | 36.67%
0.79/0.80 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.80 c 0.8s| 1 | 0 | 581 | - |3540k| 0 | 35 | 50 | 733 | 50 | 119 | 78 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.79/0.81 c 0.8s| 1 | 0 | 610 | - |3625k| 0 | 41 | 50 | 733 | 50 | 131 | 90 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.79/0.83 c 0.8s| 1 | 0 | 637 | - |3706k| 0 | 42 | 50 | 733 | 50 | 138 | 97 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.79/0.85 c 0.8s| 1 | 0 | 667 | - |3748k| 0 | 38 | 50 | 733 | 50 | 144 | 103 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.79/0.87 c 0.9s| 1 | 0 | 757 | - |3766k| 0 | 42 | 50 | 733 | 50 | 150 | 109 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.79/0.89 c 0.9s| 1 | 0 | 828 | - |3780k| 0 | 38 | 50 | 733 | 50 | 119 | 116 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.29/1.33 c 1.3s| 1 | 0 | 842 | - |3778k| 0 | 36 | 50 | 733 | 50 | 119 | 116 | 0 | 38 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.29/1.35 c 1.3s| 1 | 0 | 878 | - |3843k| 0 | 43 | 50 | 733 | 50 | 125 | 122 | 0 | 38 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.39/1.44 c 1.4s| 1 | 0 | 920 | - |3839k| 0 | 36 | 50 | 733 | 50 | 125 | 122 | 0 | 47 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.39/1.46 c 1.4s| 1 | 0 | 978 | - |3898k| 0 | 38 | 50 | 733 | 50 | 134 | 131 | 0 | 47 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.39/1.49 c 1.5s| 1 | 2 | 978 | - |3899k| 0 | 38 | 50 | 733 | 50 | 134 | 131 | 0 | 49 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.39/1.49 c (run 1, node 1) restarting after 7 global fixings of integer variables
1.39/1.49 c
1.39/1.49 c (restart) converted 38 cuts from the global cut pool into linear constraints
1.39/1.49 c
1.39/1.49 c presolving:
1.39/1.49 c (round 1) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.49/1.50 c (round 2) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.49/1.50 c (round 3) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 7 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.49/1.51 c (round 4) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.49/1.51 c presolving (5 rounds):
1.49/1.51 c 7 deleted vars, 220 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 8 changed coefficients
1.49/1.51 c 4398 implications, 35 cliques
1.49/1.51 c presolved problem has 43 variables (43 bin, 0 int, 0 impl, 0 cont) and 551 constraints
1.49/1.51 c 3 constraints of type <knapsack>
1.49/1.51 c 35 constraints of type <setppc>
1.49/1.51 c 513 constraints of type <logicor>
1.49/1.51 c transformed objective value is always integral (scale: 1)
1.49/1.51 c Presolving Time: 0.10
1.49/1.51 c
1.49/1.52 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.52 c 1.5s| 1 | 0 | 1075 | - |2098k| 0 | 27 | 43 | 551 | 43 | 551 | 0 | 0 | 49 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.59 c 1.6s| 1 | 0 | 1098 | - |2453k| 0 | 35 | 43 | 551 | 43 | 557 | 6 | 0 | 49 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.69/1.80 c 1.8s| 1 | 0 | 1120 | - |2449k| 0 | 31 | 43 | 551 | 43 | 557 | 6 | 0 | 77 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.89/1.90 c 1.9s| 1 | 0 | 1130 | - |2446k| 0 | 32 | 43 | 551 | 43 | 557 | 6 | 0 | 89 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.89/1.91 c 1.9s| 1 | 0 | 1130 | - |2444k| 0 | - | 43 | 551 | 43 | 557 | 6 | 0 | 92 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.89/1.91 c (run 2, node 1) restarting after 9 global fixings of integer variables
1.89/1.91 c
1.89/1.91 c (restart) converted 6 cuts from the global cut pool into linear constraints
1.89/1.91 c
1.89/1.92 c presolving:
1.89/1.92 c (round 1) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
1.89/1.92 c (round 2) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
1.89/1.93 c (round 3) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
1.89/1.93 c presolving (4 rounds):
1.89/1.93 c 9 deleted vars, 227 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 5 changed coefficients
1.89/1.93 c 4398 implications, 40 cliques
1.89/1.93 c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 330 constraints
1.89/1.93 c 4 constraints of type <knapsack>
1.89/1.93 c 39 constraints of type <setppc>
1.89/1.93 c 287 constraints of type <logicor>
1.89/1.93 c transformed objective value is always integral (scale: 1)
1.89/1.93 c Presolving Time: 0.12
1.89/1.93 c
1.89/1.93 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.93 c 1.9s| 1 | 0 | 1220 | - |1958k| 0 | 31 | 34 | 330 | 34 | 330 | 0 | 0 | 92 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.89/1.99 c 2.0s| 1 | 0 | 1267 | - |2338k| 0 | 30 | 34 | 330 | 34 | 337 | 7 | 0 | 92 |-7.000000e+00 |-5.000000e+00 | 28.57%
2.10/2.10 c 2.1s| 1 | 0 | 1288 | - |2335k| 0 | 23 | 34 | 330 | 34 | 337 | 7 | 0 | 113 |-6.923077e+00 |-5.000000e+00 | 27.78%
2.10/2.12 c 2.1s| 1 | 0 | 1288 | - |2331k| 0 | - | 34 | 330 | 34 | 337 | 7 | 0 | 124 |-6.923077e+00 |-5.000000e+00 | 27.78%
2.10/2.12 c (run 3, node 1) restarting after 8 global fixings of integer variables
2.10/2.12 c
2.10/2.12 c (restart) converted 7 cuts from the global cut pool into linear constraints
2.10/2.12 c
2.10/2.12 c presolving:
2.10/2.13 c (round 1) 8 del vars, 139 del conss, 0 chg bounds, 1 chg sides, 9 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.10/2.13 c (round 2) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 20 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.10/2.13 c (round 3) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 23 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.10/2.13 c (round 4) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 26 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.10/2.14 c (round 5) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 27 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.10/2.14 c presolving (6 rounds):
2.10/2.14 c 8 deleted vars, 142 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 27 changed coefficients
2.10/2.14 c 4398 implications, 36 cliques
2.10/2.14 c presolved problem has 26 variables (26 bin, 0 int, 0 impl, 0 cont) and 197 constraints
2.10/2.14 c 5 constraints of type <knapsack>
2.10/2.14 c 34 constraints of type <setppc>
2.10/2.14 c 158 constraints of type <logicor>
2.10/2.14 c transformed objective value is always integral (scale: 1)
2.10/2.14 c Presolving Time: 0.13
2.10/2.14 c
2.10/2.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.14 c 2.1s| 1 | 0 | 1355 | - |1868k| 0 | 20 | 26 | 197 | 26 | 197 | 0 | 0 | 124 |-6.826680e+00 |-5.000000e+00 | 26.76%
2.10/2.17 c 2.1s| 1 | 0 | 1365 | - |1887k| 0 | 20 | 26 | 197 | 26 | 201 | 4 | 0 | 124 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.10/2.20 c 2.2s| 1 | 0 | 1387 | - |1883k| 0 | 8 | 26 | 196 | 26 | 201 | 4 | 0 | 143 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.10/2.20 c 2.2s| 1 | 2 | 1387 | - |1884k| 0 | 8 | 26 | 196 | 26 | 201 | 4 | 0 | 146 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.10/2.20 c (run 4, node 1) restarting after 5 global fixings of integer variables
2.10/2.20 c
2.10/2.20 c (restart) converted 2 cuts from the global cut pool into linear constraints
2.10/2.20 c
2.10/2.20 c presolving:
2.20/2.21 c (round 1) 5 del vars, 73 del conss, 0 chg bounds, 1 chg sides, 10 chg coeffs, 2 upgd conss, 4398 impls, 26 clqs
2.20/2.21 c (round 2) 5 del vars, 76 del conss, 0 chg bounds, 3 chg sides, 21 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.20/2.21 c (round 3) 5 del vars, 77 del conss, 0 chg bounds, 5 chg sides, 30 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.20/2.21 c (round 4) 5 del vars, 77 del conss, 0 chg bounds, 5 chg sides, 31 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.20/2.21 c presolving (5 rounds):
2.20/2.21 c 5 deleted vars, 77 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 31 changed coefficients
2.20/2.21 c 4398 implications, 28 cliques
2.20/2.21 c presolved problem has 21 variables (21 bin, 0 int, 0 impl, 0 cont) and 126 constraints
2.20/2.21 c 6 constraints of type <knapsack>
2.20/2.21 c 29 constraints of type <setppc>
2.20/2.21 c 91 constraints of type <logicor>
2.20/2.21 c transformed objective value is always integral (scale: 1)
2.20/2.21 c Presolving Time: 0.14
2.20/2.22 c
2.20/2.22 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.20/2.22 c 2.2s| 1 | 0 | 1449 | - |1821k| 0 | 15 | 21 | 126 | 21 | 126 | 0 | 0 | 146 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.20/2.23 c 2.2s| 1 | 0 | 1458 | - |1835k| 0 | 16 | 21 | 126 | 21 | 129 | 3 | 0 | 146 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.20/2.25 c 2.2s| 1 | 2 | 1458 | - |1836k| 0 | 16 | 21 | 126 | 21 | 129 | 3 | 0 | 162 |-6.000000e+00 |-5.000000e+00 | 16.67%
2.20/2.25 o -6
2.20/2.25 c * 2.2s| 4 | 0 | 1458 | 0.0 |1838k| 3 | - | 21 | 126 | 0 | 0 | 3 | 0 | 162 |-6.000000e+00 |-6.000000e+00 | 0.00%
2.20/2.25 c
2.20/2.25 c SCIP Status : problem is solved [optimal solution found]
2.20/2.25 c Solving Time (sec) : 2.23
2.20/2.25 c Solving Nodes : 4 (total of 8 nodes in 5 runs)
2.20/2.25 c Primal Bound : -6.00000000000000e+00 (14 solutions)
2.20/2.25 c Dual Bound : -6.00000000000000e+00
2.20/2.25 c Gap : 0.00 %
2.20/2.25 s OPTIMUM FOUND
2.20/2.25 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 -x24
2.20/2.25 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.20/2.25 c SCIP Status : problem is solved [optimal solution found]
2.20/2.25 c Solving Time : 2.23
2.20/2.25 c Original Problem :
2.20/2.25 c Problem name : HOME/instance-2703234-1278568435.opb
2.20/2.25 c Variables : 783 (783 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.25 c Constraints : 783 initial, 783 maximal
2.20/2.25 c Presolved Problem :
2.20/2.25 c Problem name : t_HOME/instance-2703234-1278568435.opb
2.20/2.25 c Variables : 21 (21 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.25 c Constraints : 126 initial, 126 maximal
2.20/2.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.20/2.25 c trivial : 0.00 29 0 0 0 0 0 0 0
2.20/2.25 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.20/2.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.20/2.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.20/2.25 c implics : 0.00 0 0 0 0 0 0 0 0
2.20/2.25 c probing : 0.01 0 0 0 0 0 0 0 0
2.20/2.25 c knapsack : 0.03 0 0 0 0 0 0 7 71
2.20/2.25 c setppc : 0.01 0 0 0 0 0 24 0 0
2.20/2.25 c linear : 0.01 733 0 0 733 0 50 0 0
2.20/2.25 c logicor : 0.01 0 0 0 0 0 642 0 0
2.20/2.25 c root node : - 29 - - 29 - - - -
2.20/2.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.20/2.25 c integral : 0 0 0 11 0 0 29 0 0 6
2.20/2.25 c knapsack : 6 4 15 0 0 0 0 0 0 0
2.20/2.25 c setppc : 29 4 14 0 0 0 14 0 0 0
2.20/2.25 c logicor : 91 23 109 0 1 0 1 1 0 0
2.20/2.25 c countsols : 0 0 0 0 1 0 0 0 0 0
2.20/2.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.20/2.25 c integral : 1.04 0.00 0.00 1.04 0.00
2.20/2.25 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.20/2.25 c setppc : 0.00 0.00 0.00 0.00 0.00
2.20/2.25 c logicor : 0.00 0.00 0.00 0.00 0.00
2.20/2.25 c countsols : 0.00 0.00 0.00 0.00 0.00
2.20/2.25 c Propagators : Time Calls Cutoffs DomReds
2.20/2.25 c vbounds : 0.00 6 0 0
2.20/2.25 c rootredcost : 0.00 0 0 0
2.20/2.25 c pseudoobj : 0.00 37 0 3
2.20/2.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.20/2.25 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.25 c applied globally : - - - 0 0.0 - - -
2.20/2.25 c applied locally : - - - 0 0.0 - - -
2.20/2.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.20/2.25 c cut pool : 0.00 0 - - 0 - (maximal pool size: 17)
2.20/2.25 c redcost : 0.00 23 0 0 0 0
2.20/2.25 c impliedbounds : 0.00 23 0 0 2 0
2.20/2.25 c intobj : 0.00 0 0 0 0 0
2.20/2.25 c cgmip : 0.00 0 0 0 0 0
2.20/2.25 c gomory : 0.38 23 0 0 4712 0
2.20/2.25 c strongcg : 0.32 23 0 0 5573 0
2.20/2.25 c cmir : 0.03 14 0 0 0 0
2.20/2.25 c flowcover : 0.06 14 0 0 0 0
2.20/2.25 c clique : 0.01 23 0 0 187 0
2.20/2.25 c zerohalf : 0.00 0 0 0 0 0
2.20/2.25 c mcf : 0.00 5 0 0 0 0
2.20/2.25 c rapidlearning : 0.00 0 0 0 0 0
2.20/2.25 c Pricers : Time Calls Vars
2.20/2.25 c problem variables: 0.00 0 0
2.20/2.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.20/2.25 c relpscost : 1.04 11 0 29 0 0 6
2.20/2.25 c pscost : 0.00 0 0 0 0 0 0
2.20/2.25 c inference : 0.00 2 0 0 0 0 4
2.20/2.25 c mostinf : 0.00 0 0 0 0 0 0
2.20/2.25 c leastinf : 0.00 0 0 0 0 0 0
2.20/2.25 c fullstrong : 0.00 0 0 0 0 0 0
2.20/2.25 c allfullstrong : 0.00 0 0 0 0 0 0
2.20/2.25 c random : 0.00 0 0 0 0 0 0
2.20/2.25 c Primal Heuristics : Time Calls Found
2.20/2.25 c LP solutions : 0.00 - 0
2.20/2.25 c pseudo solutions : 0.00 - 1
2.20/2.25 c crossover : 0.00 0 0
2.20/2.25 c oneopt : 0.00 2 1
2.20/2.25 c trivial : 0.00 2 2
2.20/2.25 c simplerounding : 0.00 34 5
2.20/2.25 c zirounding : 0.00 2 2
2.20/2.25 c rounding : 0.01 34 1
2.20/2.25 c shifting : 0.01 34 2
2.20/2.25 c intshifting : 0.00 0 0
2.20/2.25 c twoopt : 0.00 0 0
2.20/2.25 c fixandinfer : 0.00 0 0
2.20/2.25 c feaspump : 0.00 0 0
2.20/2.25 c coefdiving : 0.00 0 0
2.20/2.25 c pscostdiving : 0.00 0 0
2.20/2.25 c fracdiving : 0.00 0 0
2.20/2.25 c veclendiving : 0.00 0 0
2.20/2.25 c intdiving : 0.00 0 0
2.20/2.25 c actconsdiving : 0.00 0 0
2.20/2.25 c objpscostdiving : 0.00 0 0
2.20/2.25 c rootsoldiving : 0.00 0 0
2.20/2.25 c linesearchdiving : 0.00 0 0
2.20/2.25 c guideddiving : 0.00 0 0
2.20/2.25 c octane : 0.00 0 0
2.20/2.25 c rens : 0.02 0 0
2.20/2.25 c rins : 0.00 0 0
2.20/2.25 c localbranching : 0.00 0 0
2.20/2.25 c mutation : 0.00 0 0
2.20/2.25 c dins : 0.00 0 0
2.20/2.25 c undercover : 0.00 0 0
2.20/2.25 c nlp : 0.00 0 0
2.20/2.25 c trysol : 0.00 0 0
2.20/2.25 c LP : Time Calls Iterations Iter/call Iter/sec
2.20/2.25 c primal LP : 0.00 0 0 0.00 -
2.20/2.25 c dual LP : 0.14 34 1458 42.88 10196.52
2.20/2.25 c lex dual LP : 0.00 0 0 0.00 -
2.20/2.25 c barrier LP : 0.00 0 0 0.00 -
2.20/2.25 c diving/probing LP: 0.00 0 0 0.00 -
2.20/2.25 c strong branching : 1.04 162 11006 67.94 10613.87
2.20/2.25 c (at root node) : - 162 11006 67.94 -
2.20/2.25 c conflict analysis: 0.00 0 0 0.00 -
2.20/2.25 c B&B Tree :
2.20/2.25 c number of runs : 5
2.20/2.25 c nodes : 4
2.20/2.25 c nodes (total) : 8
2.20/2.25 c nodes left : 0
2.20/2.25 c max depth : 3
2.20/2.25 c max depth (total): 3
2.20/2.25 c backtracks : 0 (0.0%)
2.20/2.25 c delayed cutoffs : 0
2.20/2.25 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.20/2.25 c avg switch length: 2.00
2.20/2.25 c switching time : 0.00
2.20/2.25 c Solution :
2.20/2.25 c Solutions found : 14 (5 improvements)
2.20/2.25 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
2.20/2.25 c Primal Bound : -6.00000000000000e+00 (in run 5, after 4 nodes, 2.23 seconds, depth 3, found by <relaxation>)
2.20/2.25 c Dual Bound : -6.00000000000000e+00
2.20/2.25 c Gap : 0.00 %
2.20/2.25 c Root Dual Bound : -6.00000000000000e+00
2.20/2.25 c Root Iterations : 1458
2.20/2.26 c Time complete: 2.25.