0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868048-1245115515.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 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 SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = c 0.15
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = c 750
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
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 = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
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 = c 1620
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 = c 1791
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 = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 121 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.03/0.05 c 0.0s| 1 | 0 | 148 | 803k| 0 | 46 | 169 | 73 | 73 | 169 | 86 | 13 | 0 | 0 | 1.300000e+01 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 201 |1011k| 0 | 56 | 169 | 73 | 73 | 169 | 94 | 21 | 0 | 0 | 1.300000e+01 | -- | Inf
0.03/0.09 c 0.1s| 1 | 0 | 260 |1186k| 0 | 57 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 308 |1312k| 0 | 58 | 169 | 73 | 73 | 169 | 104 | 31 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 394 |1404k| 0 | 55 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 0 | 1.300000e+01 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 471 |1404k| 0 | 53 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 29 | 1.300000e+01 | -- | Inf
0.88/0.90 c 0.9s| 1 | 0 | 535 |1404k| 0 | 50 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 38 | 1.300000e+01 | -- | Inf
0.99/1.02 c 1.0s| 1 | 0 | 592 |1404k| 0 | 47 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 45 | 1.300000e+01 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 637 |1404k| 0 | 48 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 50 | 1.300000e+01 | -- | Inf
1.09/1.15 c 1.1s| 1 | 0 | 657 |1404k| 0 | 47 | 169 | 73 | 73 | 169 | 108 | 35 | 0 | 56 | 1.300000e+01 | -- | Inf
1.09/1.19 c 1.1s| 1 | 0 | 676 |1404k| 0 | 42 | 169 | 73 | 73 | 169 | 105 | 35 | 0 | 61 | 1.300000e+01 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 676 |1404k| 0 | - | 169 | 73 | 73 | 169 | 105 | 35 | 0 | 67 | 1.300000e+01 | -- | Inf
1.19/1.24 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.19/1.24 c
1.19/1.24 (restart) converted 32 cuts from the global cut pool into linear constraints
1.19/1.24 c
1.19/1.24 presolving:
1.19/1.25 c (round 1) 36 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 84 clqs
1.19/1.25 c (round 2) 36 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 31 upgd conss, 18 impls, 84 clqs
1.19/1.26 c (round 3) 36 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 31 upgd conss, 18 impls, 84 clqs
1.19/1.26 c presolving (4 rounds):
1.19/1.26 c 36 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.19/1.26 c 18 implications, 84 cliques
1.19/1.26 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 100 constraints
1.19/1.26 c 11 constraints of type <knapsack>
1.19/1.26 c 82 constraints of type <setppc>
1.19/1.26 c 7 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.02
1.19/1.26 c
1.19/1.26 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.26 c 1.2s| 1 | 0 | 807 | 777k| 0 | 43 | 133 | 100 | 100 | 133 | 100 | 0 | 0 | 67 | 1.300000e+01 | -- | Inf
1.19/1.28 c 1.2s| 1 | 0 | 841 | 983k| 0 | 45 | 133 | 100 | 100 | 133 | 104 | 4 | 0 | 67 | 1.300000e+01 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 877 | 972k| 0 | 0 | 133 | 63 | 63 | 133 | 104 | 4 | 0 | 72 | 1.300000e+01 | -- | Inf
1.29/1.32 c (run 2, node 1) restarting after 92 global fixings of integer variables
1.29/1.32 c
1.29/1.32 (restart) converted 4 cuts from the global cut pool into linear constraints
1.29/1.32 c
1.29/1.32 presolving:
1.29/1.32 c (round 1) 92 del vars, 12 del conss, 0 chg bounds, 3 chg sides, 13 chg coeffs, 0 upgd conss, 42 impls, 37 clqs
1.29/1.32 c (round 2) 92 del vars, 12 del conss, 0 chg bounds, 4 chg sides, 21 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.32 c (round 3) 92 del vars, 12 del conss, 0 chg bounds, 6 chg sides, 28 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.32 c (round 4) 92 del vars, 12 del conss, 0 chg bounds, 6 chg sides, 33 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 5) 92 del vars, 12 del conss, 0 chg bounds, 7 chg sides, 38 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 6) 92 del vars, 12 del conss, 0 chg bounds, 8 chg sides, 42 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 7) 92 del vars, 12 del conss, 0 chg bounds, 8 chg sides, 44 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 8) 92 del vars, 12 del conss, 0 chg bounds, 8 chg sides, 46 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 9) 92 del vars, 12 del conss, 0 chg bounds, 8 chg sides, 48 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c (round 10) 92 del vars, 12 del conss, 0 chg bounds, 8 chg sides, 49 chg coeffs, 2 upgd conss, 42 impls, 37 clqs
1.29/1.33 c presolving (11 rounds):
1.29/1.33 c 92 deleted vars, 12 deleted constraints, 0 tightened bounds, 0 added holes, 8 changed sides, 49 changed coefficients
1.29/1.33 c 42 implications, 37 cliques
1.29/1.33 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 55 constraints
1.29/1.33 c 12 constraints of type <knapsack>
1.29/1.33 c 42 constraints of type <setppc>
1.29/1.33 c 1 constraints of type <logicor>
1.29/1.33 c transformed objective value is always integral (scale: 1)
1.29/1.33 c Presolving Time: 0.03
1.29/1.33 c
1.29/1.33 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.33 c 1.3s| 1 | 0 | 928 | 645k| 0 | 0 | 41 | 55 | 55 | 41 | 55 | 0 | 0 | 72 | 1.300000e+01 | -- | Inf
1.29/1.33 c * 1.3s| 1 | 0 | 928 | 647k| 0 | - | 41 | 55 | 55 | 41 | 55 | 0 | 0 | 72 | 1.300000e+01 | 1.300000e+01 | 0.00%
1.29/1.33 c
1.29/1.33 c SCIP Status : problem is solved [optimal solution found]
1.29/1.33 c Solving Time (sec) : 1.28
1.29/1.33 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.29/1.33 c Primal Bound : +1.30000000000000e+01 (1 solutions)
1.29/1.33 c Dual Bound : +1.30000000000000e+01
1.29/1.33 c Gap : 0.00 %
1.29/1.33 c NODE 1
1.29/1.33 c DUAL BOUND 13
1.29/1.33 c PRIMAL BOUND 13
1.29/1.33 c GAP 0
1.29/1.33 s SATISFIABLE
1.29/1.33 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.29/1.33 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
1.29/1.33 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
1.29/1.33 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
1.29/1.33 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
1.29/1.33 v -x56 -x55 x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31
1.29/1.33 v -x30 -x29 -x28 -x27 x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5
1.29/1.33 v -x4 -x3 -x2 -x1
1.29/1.33 c SCIP Status : problem is solved [optimal solution found]
1.29/1.33 c Solving Time : 1.28
1.29/1.33 c Original Problem :
1.29/1.33 c Problem name : HOME/instance-1868048-1245115515.opb
1.29/1.33 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.33 c Constraints : 101 initial, 101 maximal
1.29/1.33 c Presolved Problem :
1.29/1.33 c Problem name : t_HOME/instance-1868048-1245115515.opb
1.29/1.33 c Variables : 41 (41 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.33 c Constraints : 55 initial, 55 maximal
1.29/1.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.33 c trivial : 0.00 127 0 0 0 0 0 0 0
1.29/1.33 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c knapsack : 0.02 0 0 0 0 0 0 8 49
1.29/1.33 c setppc : 0.00 0 1 0 0 0 10 0 0
1.29/1.33 c linear : 0.01 0 0 0 0 0 31 1 0
1.29/1.33 c logicor : 0.00 0 0 0 0 0 4 0 0
1.29/1.33 c root node : - 127 - - 127 - - - -
1.29/1.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.33 c integral : 0 0 0 10 0 0 40 0 0 0
1.29/1.33 c knapsack : 12 7 11 2 0 0 0 0 0 0
1.29/1.33 c setppc : 42 7 11 2 0 0 87 0 0 0
1.29/1.33 c logicor : 1 7 4 2 0 0 0 0 0 0
1.29/1.33 c countsols : 0 0 0 2 0 0 0 0 0 0
1.29/1.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.33 c integral : 1.07 0.00 0.00 1.07 0.00
1.29/1.33 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c Propagators : Time Calls Cutoffs DomReds
1.29/1.33 c rootredcost : 0.00 0 0 0
1.29/1.33 c pseudoobj : 0.00 14 0 0
1.29/1.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.33 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.33 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.33 c applied globally : - - - 0 0.0 - - -
1.29/1.33 c applied locally : - - - 0 0.0 - - -
1.29/1.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.33 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.29/1.33 c redcost : 0.00 7 0 0 0 0
1.29/1.33 c impliedbounds : 0.00 6 0 0 0 0
1.29/1.33 c intobj : 0.00 0 0 0 0 0
1.29/1.33 c gomory : 0.05 7 0 0 5 0
1.29/1.33 c strongcg : 0.03 7 0 0 250 0
1.29/1.33 c cmir : 0.00 0 0 0 0 0
1.29/1.33 c flowcover : 0.00 0 0 0 0 0
1.29/1.33 c clique : 0.00 7 0 0 30 0
1.29/1.33 c zerohalf : 0.00 0 0 0 0 0
1.29/1.33 c mcf : 0.00 3 0 0 0 0
1.29/1.33 c Pricers : Time Calls Vars
1.29/1.33 c problem variables: 0.00 0 0
1.29/1.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.33 c relpscost : 1.07 8 0 40 0 0 0
1.29/1.33 c pscost : 0.00 0 0 0 0 0 0
1.29/1.33 c inference : 0.00 0 0 0 0 0 0
1.29/1.33 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.33 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.33 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.33 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.33 c random : 0.00 0 0 0 0 0 0
1.29/1.33 c Primal Heuristics : Time Calls Found
1.29/1.33 c LP solutions : 0.00 - 1
1.29/1.33 c pseudo solutions : 0.00 - 0
1.29/1.33 c simplerounding : 0.00 0 0
1.29/1.33 c rounding : 0.00 0 0
1.29/1.33 c shifting : 0.00 0 0
1.29/1.33 c intshifting : 0.00 0 0
1.29/1.33 c oneopt : 0.00 0 0
1.29/1.33 c fixandinfer : 0.00 0 0
1.29/1.33 c feaspump : 0.00 0 0
1.29/1.33 c coefdiving : 0.00 0 0
1.29/1.33 c pscostdiving : 0.00 0 0
1.29/1.33 c fracdiving : 0.00 0 0
1.29/1.33 c veclendiving : 0.00 0 0
1.29/1.33 c intdiving : 0.00 0 0
1.29/1.33 c actconsdiving : 0.00 0 0
1.29/1.33 c objpscostdiving : 0.00 0 0
1.29/1.33 c rootsoldiving : 0.00 0 0
1.29/1.33 c linesearchdiving : 0.00 0 0
1.29/1.33 c guideddiving : 0.00 0 0
1.29/1.33 c octane : 0.00 0 0
1.29/1.33 c rens : 0.00 0 0
1.29/1.33 c rins : 0.00 0 0
1.29/1.33 c localbranching : 0.00 0 0
1.29/1.33 c mutation : 0.00 0 0
1.29/1.33 c crossover : 0.00 0 0
1.29/1.33 c dins : 0.00 0 0
1.29/1.33 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.33 c primal LP : 0.00 0 0 0.00 -
1.29/1.33 c dual LP : 0.07 16 928 58.00 13257.14
1.29/1.33 c barrier LP : 0.00 0 0 0.00 -
1.29/1.33 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.33 c strong branching : 1.07 72 11058 153.58 10334.58
1.29/1.33 c (at root node) : - 72 11058 153.58 -
1.29/1.33 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.33 c B&B Tree :
1.29/1.33 c number of runs : 3
1.29/1.33 c nodes : 1
1.29/1.33 c nodes (total) : 3
1.29/1.33 c nodes left : 0
1.29/1.33 c max depth : 0
1.29/1.33 c max depth (total): 0
1.29/1.33 c backtracks : 0 (0.0%)
1.29/1.33 c delayed cutoffs : 0
1.29/1.33 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.33 c avg switch length: 2.00
1.29/1.33 c switching time : 0.00
1.29/1.33 c Solution :
1.29/1.33 c Solutions found : 1 (1 improvements)
1.29/1.33 c Primal Bound : +1.30000000000000e+01 (in run 3, after 1 nodes, 1.28 seconds, depth 0, found by <relaxation>)
1.29/1.33 c Dual Bound : +1.30000000000000e+01
1.29/1.33 c Gap : 0.00 %
1.29/1.33 c Root Dual Bound : +1.30000000000000e+01
1.29/1.34 c Time complete: 1.33.