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-1868012-1245115275.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.02
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.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
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/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/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/coefdiving/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.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 | 104 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 129 | 829k| 0 | 53 | 169 | 73 | 73 | 169 | 84 | 11 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 176 |1083k| 0 | 55 | 169 | 73 | 73 | 169 | 90 | 17 | 0 | 0 | 1.300000e+01 | -- | Inf
0.06/0.09 c 0.1s| 1 | 0 | 210 |1182k| 0 | 55 | 169 | 73 | 73 | 169 | 95 | 22 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 251 |1205k| 0 | 60 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 298 |1214k| 0 | 59 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.69/0.79 c 0.8s| 1 | 0 | 377 |1214k| 0 | 54 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 37 | 1.300000e+01 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 391 |1214k| 0 | 50 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 48 | 1.300000e+01 | -- | Inf
0.89/0.99 c 1.0s| 1 | 0 | 406 |1214k| 0 | 51 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 59 | 1.300000e+01 | -- | Inf
0.99/1.02 c 1.0s| 1 | 0 | 414 |1214k| 0 | 49 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 67 | 1.300000e+01 | -- | Inf
0.99/1.06 c 1.0s| 1 | 0 | 429 |1214k| 0 | 49 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 72 | 1.300000e+01 | -- | Inf
0.99/1.10 c 1.1s| 1 | 0 | 441 |1213k| 0 | 48 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 79 | 1.300000e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 441 |1213k| 0 | - | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 84 | 1.300000e+01 | -- | Inf
1.10/1.13 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.10/1.13 c
1.10/1.13 (restart) converted 29 cuts from the global cut pool into linear constraints
1.10/1.13 c
1.10/1.13 presolving:
1.10/1.14 c (round 1) 34 del vars, 5 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 22 impls, 80 clqs
1.10/1.14 c (round 2) 34 del vars, 5 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 27 upgd conss, 22 impls, 80 clqs
1.10/1.15 c (round 3) 34 del vars, 6 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 27 upgd conss, 22 impls, 80 clqs
1.10/1.15 c presolving (4 rounds):
1.10/1.15 c 34 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.10/1.15 c 22 implications, 80 cliques
1.10/1.15 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 96 constraints
1.10/1.15 c 11 constraints of type <knapsack>
1.10/1.15 c 81 constraints of type <setppc>
1.10/1.15 c 4 constraints of type <logicor>
1.10/1.15 c transformed objective value is always integral (scale: 1)
1.10/1.15 c Presolving Time: 0.03
1.10/1.15 c
1.10/1.16 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.16 c 1.1s| 1 | 0 | 590 | 776k| 0 | 47 | 135 | 96 | 96 | 135 | 96 | 0 | 0 | 84 | 1.300000e+01 | -- | Inf
1.10/1.18 c 1.1s| 1 | 0 | 625 |1041k| 0 | 51 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 84 | 1.300000e+01 | -- | Inf
1.49/1.57 c 1.5s| 1 | 0 | 636 |1041k| 0 | 49 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 128 | 1.300000e+01 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 647 |1041k| 0 | 45 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 133 | 1.300000e+01 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 662 |1041k| 0 | 49 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 139 | 1.300000e+01 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 673 |1041k| 0 | 46 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 145 | 1.300000e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 682 |1041k| 0 | 47 | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 151 | 1.300000e+01 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 682 |1041k| 0 | - | 135 | 96 | 96 | 135 | 100 | 4 | 0 | 157 | 1.300000e+01 | -- | Inf
1.69/1.74 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.69/1.74 c
1.69/1.74 (restart) converted 4 cuts from the global cut pool into linear constraints
1.69/1.74 c
1.69/1.74 presolving:
1.69/1.75 c (round 1) 30 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 28 impls, 78 clqs
1.69/1.75 c (round 2) 30 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 28 impls, 78 clqs
1.69/1.75 c presolving (3 rounds):
1.69/1.75 c 30 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.69/1.75 c 28 implications, 78 cliques
1.69/1.75 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 93 constraints
1.69/1.75 c 13 constraints of type <knapsack>
1.69/1.75 c 78 constraints of type <setppc>
1.69/1.75 c 2 constraints of type <logicor>
1.69/1.75 c transformed objective value is always integral (scale: 1)
1.69/1.75 c Presolving Time: 0.04
1.69/1.75 c
1.69/1.76 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.76 c 1.7s| 1 | 0 | 766 | 761k| 0 | 38 | 105 | 93 | 93 | 105 | 93 | 0 | 0 | 157 | 1.300000e+01 | -- | Inf
1.69/1.78 c 1.7s| 1 | 0 | 797 | 992k| 0 | 51 | 105 | 93 | 93 | 105 | 106 | 13 | 0 | 157 | 1.300000e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 858 | 992k| 0 | 50 | 105 | 93 | 93 | 105 | 106 | 13 | 0 | 181 | 1.300000e+01 | -- | Inf
2.10/2.17 c 2.1s| 1 | 0 | 944 | 991k| 0 | 39 | 105 | 92 | 92 | 105 | 106 | 13 | 0 | 194 | 1.300000e+01 | -- | Inf
2.19/2.23 c 2.2s| 1 | 0 | 995 | 988k| 0 | 36 | 105 | 83 | 83 | 105 | 106 | 13 | 0 | 201 | 1.300000e+01 | -- | Inf
2.19/2.23 c 2.2s| 1 | 0 | 995 | 988k| 0 | 36 | 105 | 83 | 83 | 105 | 106 | 13 | 0 | 202 | -- | -- | 0.00%
2.19/2.23 c
2.19/2.23 c SCIP Status : problem is solved [infeasible]
2.19/2.23 c Solving Time (sec) : 2.17
2.19/2.23 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.19/2.23 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.19/2.23 c Dual Bound : +1.00000000000000e+20
2.19/2.23 c Gap : 0.00 %
2.19/2.23 c NODE 1
2.19/2.23 c DUAL BOUND 1e+20
2.19/2.23 c PRIMAL BOUND 1e+20
2.19/2.23 c GAP 0
2.19/2.23 s UNSATISFIABLE
2.19/2.23 c SCIP Status : problem is solved [infeasible]
2.19/2.23 c Solving Time : 2.17
2.19/2.23 c Original Problem :
2.19/2.23 c Problem name : HOME/instance-1868012-1245115275.opb
2.19/2.23 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.23 c Constraints : 101 initial, 101 maximal
2.19/2.23 c Presolved Problem :
2.19/2.23 c Problem name : t_HOME/instance-1868012-1245115275.opb
2.19/2.23 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.23 c Constraints : 93 initial, 93 maximal
2.19/2.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.19/2.23 c trivial : 0.00 64 0 0 0 0 0 0 0
2.19/2.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.19/2.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.19/2.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.19/2.23 c implics : 0.00 0 0 0 0 0 0 0 0
2.19/2.23 c probing : 0.00 0 0 0 0 0 0 0 0
2.19/2.23 c knapsack : 0.01 0 0 0 0 0 0 0 0
2.19/2.23 c setppc : 0.00 0 0 0 0 0 6 0 0
2.19/2.23 c linear : 0.02 0 0 0 0 0 30 2 0
2.19/2.23 c logicor : 0.00 0 0 0 0 0 5 0 0
2.19/2.23 c root node : - 97 - - 97 - - - -
2.19/2.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.19/2.23 c integral : 0 0 0 17 0 1 79 0 0 0
2.19/2.23 c knapsack : 13 7 18 0 0 0 0 0 0 0
2.19/2.23 c setppc : 78 7 18 0 0 0 18 0 0 0
2.19/2.23 c logicor : 2 7 3 0 0 0 0 0 0 0
2.19/2.23 c countsols : 0 0 0 0 0 0 0 0 0 0
2.19/2.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.19/2.23 c integral : 1.94 0.00 0.00 1.94 0.00
2.19/2.23 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.19/2.23 c setppc : 0.00 0.00 0.00 0.00 0.00
2.19/2.23 c logicor : 0.00 0.00 0.00 0.00 0.00
2.19/2.23 c countsols : 0.00 0.00 0.00 0.00 0.00
2.19/2.23 c Propagators : Time Calls Cutoffs DomReds
2.19/2.23 c rootredcost : 0.00 0 0 0
2.19/2.23 c pseudoobj : 0.00 21 0 0
2.19/2.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.19/2.23 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.23 c applied globally : - - - 0 0.0 - - -
2.19/2.23 c applied locally : - - - 0 0.0 - - -
2.19/2.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.19/2.23 c cut pool : 0.00 0 - - 0 - (maximal pool size: 89)
2.19/2.23 c redcost : 0.00 7 0 0 0 0
2.19/2.23 c impliedbounds : 0.00 7 0 0 0 0
2.19/2.23 c intobj : 0.00 0 0 0 0 0
2.19/2.23 c gomory : 0.06 7 0 0 13 0
2.19/2.23 c strongcg : 0.03 7 0 0 300 0
2.19/2.23 c cmir : 0.00 0 0 0 0 0
2.19/2.23 c flowcover : 0.00 0 0 0 0 0
2.19/2.23 c clique : 0.03 7 0 0 26 0
2.19/2.23 c zerohalf : 0.00 0 0 0 0 0
2.19/2.23 c mcf : 0.00 3 0 0 0 0
2.19/2.23 c Pricers : Time Calls Vars
2.19/2.23 c problem variables: 0.00 0 0
2.19/2.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.19/2.23 c relpscost : 1.94 17 1 79 0 0 0
2.19/2.23 c pscost : 0.00 0 0 0 0 0 0
2.19/2.23 c inference : 0.00 0 0 0 0 0 0
2.19/2.23 c mostinf : 0.00 0 0 0 0 0 0
2.19/2.23 c leastinf : 0.00 0 0 0 0 0 0
2.19/2.23 c fullstrong : 0.00 0 0 0 0 0 0
2.19/2.23 c allfullstrong : 0.00 0 0 0 0 0 0
2.19/2.23 c random : 0.00 0 0 0 0 0 0
2.19/2.23 c Primal Heuristics : Time Calls Found
2.19/2.23 c LP solutions : 0.00 - 0
2.19/2.23 c pseudo solutions : 0.00 - 0
2.19/2.23 c simplerounding : 0.00 0 0
2.19/2.23 c rounding : 0.00 0 0
2.19/2.23 c shifting : 0.00 0 0
2.19/2.23 c intshifting : 0.00 0 0
2.19/2.23 c oneopt : 0.00 0 0
2.19/2.23 c fixandinfer : 0.00 0 0
2.19/2.23 c feaspump : 0.00 0 0
2.19/2.23 c coefdiving : 0.00 0 0
2.19/2.23 c pscostdiving : 0.00 0 0
2.19/2.23 c fracdiving : 0.00 0 0
2.19/2.23 c veclendiving : 0.00 0 0
2.19/2.23 c intdiving : 0.00 0 0
2.19/2.23 c actconsdiving : 0.00 0 0
2.19/2.23 c objpscostdiving : 0.00 0 0
2.19/2.23 c rootsoldiving : 0.00 0 0
2.19/2.23 c linesearchdiving : 0.00 0 0
2.19/2.23 c guideddiving : 0.00 0 0
2.19/2.23 c octane : 0.00 0 0
2.19/2.23 c rens : 0.00 0 0
2.19/2.23 c rins : 0.00 0 0
2.19/2.23 c localbranching : 0.00 0 0
2.19/2.23 c mutation : 0.00 0 0
2.19/2.23 c crossover : 0.00 0 0
2.19/2.23 c dins : 0.00 0 0
2.19/2.23 c LP : Time Calls Iterations Iter/call Iter/sec
2.19/2.23 c primal LP : 0.00 0 0 0.00 -
2.19/2.23 c dual LP : 0.07 24 995 41.46 14214.29
2.19/2.23 c barrier LP : 0.00 0 0 0.00 -
2.19/2.23 c diving/probing LP: 0.00 0 0 0.00 -
2.19/2.23 c strong branching : 1.94 202 21397 105.93 11029.38
2.19/2.23 c (at root node) : - 202 21397 105.93 -
2.19/2.23 c conflict analysis: 0.00 0 0 0.00 -
2.19/2.23 c B&B Tree :
2.19/2.23 c number of runs : 3
2.19/2.23 c nodes : 1
2.19/2.23 c nodes (total) : 3
2.19/2.23 c nodes left : 0
2.19/2.23 c max depth : 0
2.19/2.23 c max depth (total): 0
2.19/2.23 c backtracks : 0 (0.0%)
2.19/2.23 c delayed cutoffs : 0
2.19/2.23 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.19/2.23 c avg switch length: 2.00
2.19/2.23 c switching time : 0.00
2.19/2.23 c Solution :
2.19/2.23 c Solutions found : 0 (0 improvements)
2.19/2.23 c Primal Bound : infeasible
2.19/2.23 c Dual Bound : -
2.19/2.23 c Gap : 0.00 %
2.19/2.23 c Root Dual Bound : -
2.19/2.24 c Time complete: 2.23.