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-1868108-1245115724.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.02/0.03 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.02/0.03 c presolving (3 rounds):
0.02/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03 c 8 implications, 68 cliques
0.02/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.03 c 1 constraints of type <knapsack>
0.02/0.03 c 68 constraints of type <setppc>
0.02/0.03 c 4 constraints of type <logicor>
0.02/0.03 c transformed objective value is always integral (scale: 1)
0.02/0.03 c Presolving Time: 0.01
0.02/0.03 c SATUNSAT-LIN
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/flowcover/freq = c -1
0.02/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/cmir/freq = c -1
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/veclendiving/maxlpiterofs = c 1500
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.02/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/veclendiving/freq = c -1
0.02/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/simplerounding/freq = c -1
0.02/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/shifting/freq = c -1
0.02/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/rounding/freq = c -1
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.02/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/rootsoldiving/freq = c -1
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/rens/nodesofs = c 2000
0.02/0.03 c # minimum percentage of integer variables that have to be fixable
0.02/0.03 c # [type: real, range: [0,1], default: 0.5]
0.02/0.03 c heuristics/rens/minfixingrate = c 0.3
0.02/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/rens/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.02/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/pscostdiving/freq = c -1
0.02/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/oneopt/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.04 c # [type: real, range: [0,1], default: 0.01]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.02/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/objpscostdiving/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.02/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/linesearchdiving/freq = c -1
0.02/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/intshifting/freq = c -1
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/intdiving/maxlpiterquot = c 0.075
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/guideddiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.02/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/guideddiving/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/fracdiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.02/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/fracdiving/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/feaspump/maxlpiterofs = c 2000
0.02/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/feaspump/freq = c -1
0.02/0.04 c # minimum percentage of integer variables that have to be fixed
0.02/0.04 c # [type: real, range: [0,1], default: 0.666]
0.02/0.04 c heuristics/crossover/minfixingrate = c 0.5
0.02/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.04 c # [type: real, range: [0,1], default: 0.1]
0.02/0.04 c heuristics/crossover/nodesquot = c 0.15
0.02/0.04 c # number of nodes without incumbent change that heuristic should wait
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.04 c heuristics/crossover/nwaitingnodes = c 100
0.02/0.04 c # number of nodes added to the contingent of the total nodes
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04 c heuristics/crossover/nodesofs = c 750
0.02/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.04 c heuristics/crossover/freq = c -1
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/coefdiving/maxlpiterofs = c 1500
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.02/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/coefdiving/freq = c -1
0.02/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c presolving/probing/maxrounds = c 0
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = c TRUE
0.02/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.04 c constraints/knapsack/disaggregation = c FALSE
0.02/0.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c constraints/knapsack/maxnumcardlift = c 0
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = c TRUE
0.02/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/maxroundsroot = c 5
0.02/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.04 c separating/maxrounds = c 1
0.02/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c limits/solutions = c 1
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = c 1620
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = c 1791
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = c 10000
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving problem
0.02/0.04 c
0.02/0.04 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.04 c 0.0s| 1 | 0 | 103 | 593k| 0 | 42 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.06 c 0.0s| 1 | 0 | 147 | 806k| 0 | 53 | 169 | 73 | 73 | 169 | 86 | 13 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 178 | 905k| 0 | 58 | 169 | 73 | 73 | 169 | 94 | 21 | 0 | 0 | 1.300000e+01 | -- | Inf
0.02/0.10 c 0.1s| 1 | 0 | 206 | 932k| 0 | 63 | 169 | 73 | 73 | 169 | 99 | 26 | 0 | 0 | 1.300000e+01 | -- | Inf
0.08/0.12 c 0.1s| 1 | 0 | 252 |1013k| 0 | 61 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.08/0.14 c 0.1s| 1 | 0 | 265 |1030k| 0 | 64 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 0 | 1.300000e+01 | -- | Inf
0.98/1.04 c 1.0s| 1 | 0 | 352 |1030k| 0 | 57 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 34 | 1.300000e+01 | -- | Inf
1.17/1.28 c 1.2s| 1 | 0 | 476 |1030k| 0 | 46 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 45 | 1.300000e+01 | -- | Inf
1.37/1.40 c 1.4s| 1 | 0 | 535 |1030k| 0 | 44 | 169 | 72 | 72 | 169 | 109 | 36 | 0 | 55 | 1.300000e+01 | -- | Inf
1.47/1.50 c 1.4s| 1 | 0 | 546 |1030k| 0 | 47 | 169 | 72 | 72 | 169 | 109 | 36 | 0 | 64 | 1.300000e+01 | -- | Inf
1.47/1.55 c 1.5s| 1 | 0 | 552 |1030k| 0 | 45 | 169 | 72 | 72 | 169 | 109 | 36 | 0 | 70 | 1.300000e+01 | -- | Inf
1.57/1.60 c 1.5s| 1 | 0 | 562 |1030k| 0 | 46 | 169 | 72 | 72 | 169 | 109 | 36 | 0 | 75 | 1.300000e+01 | -- | Inf
1.57/1.63 c 1.6s| 1 | 0 | 562 |1030k| 0 | - | 169 | 72 | 72 | 169 | 109 | 36 | 0 | 80 | 1.300000e+01 | -- | Inf
1.57/1.63 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.57/1.63 c
1.57/1.63 (restart) converted 36 cuts from the global cut pool into linear constraints
1.57/1.63 c
1.57/1.63 presolving:
1.57/1.64 c (round 1) 34 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 82 clqs
1.57/1.64 c (round 2) 34 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 33 upgd conss, 20 impls, 82 clqs
1.57/1.65 c (round 3) 34 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 1 chg coeffs, 33 upgd conss, 20 impls, 82 clqs
1.57/1.65 c presolving (4 rounds):
1.57/1.65 c 34 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 1 changed coefficients
1.57/1.65 c 20 implications, 82 cliques
1.57/1.65 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 104 constraints
1.57/1.65 c 16 constraints of type <knapsack>
1.57/1.65 c 83 constraints of type <setppc>
1.57/1.65 c 5 constraints of type <logicor>
1.57/1.65 c transformed objective value is always integral (scale: 1)
1.57/1.65 c Presolving Time: 0.03
1.57/1.65 c
1.57/1.66 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.57/1.66 c 1.6s| 1 | 0 | 671 | 854k| 0 | 43 | 135 | 104 | 104 | 135 | 104 | 0 | 0 | 80 | 1.300000e+01 | -- | Inf
1.57/1.68 c 1.6s| 1 | 0 | 707 |1111k| 0 | 48 | 135 | 104 | 104 | 135 | 113 | 9 | 0 | 80 | 1.300000e+01 | -- | Inf
1.87/1.99 c 1.9s| 1 | 0 | 761 |1110k| 0 | 42 | 135 | 103 | 103 | 135 | 113 | 9 | 0 | 116 | 1.300000e+01 | -- | Inf
1.98/2.06 c 2.0s| 1 | 0 | 796 |1110k| 0 | 45 | 135 | 103 | 103 | 135 | 113 | 9 | 0 | 126 | 1.300000e+01 | -- | Inf
1.98/2.10 c 2.0s| 1 | 0 | 828 |1110k| 0 | 41 | 135 | 102 | 102 | 135 | 113 | 9 | 0 | 132 | 1.300000e+01 | -- | Inf
2.08/2.13 c 2.0s| 1 | 0 | 842 |1110k| 0 | 43 | 135 | 102 | 102 | 135 | 113 | 9 | 0 | 140 | 1.300000e+01 | -- | Inf
2.08/2.17 c 2.1s| 1 | 0 | 856 |1110k| 0 | 43 | 135 | 101 | 101 | 135 | 113 | 9 | 0 | 147 | 1.300000e+01 | -- | Inf
2.08/2.20 c 2.1s| 1 | 0 | 856 |1109k| 0 | - | 135 | 101 | 101 | 135 | 113 | 9 | 0 | 152 | 1.300000e+01 | -- | Inf
2.08/2.20 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.08/2.20 c
2.08/2.20 (restart) converted 9 cuts from the global cut pool into linear constraints
2.08/2.20 c
2.08/2.20 presolving:
2.17/2.21 c (round 1) 30 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 75 clqs
2.17/2.21 c (round 2) 30 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 34 impls, 75 clqs
2.17/2.21 c presolving (3 rounds):
2.17/2.21 c 30 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.17/2.21 c 34 implications, 75 cliques
2.17/2.21 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 104 constraints
2.17/2.21 c 21 constraints of type <knapsack>
2.17/2.21 c 78 constraints of type <setppc>
2.17/2.21 c 5 constraints of type <logicor>
2.17/2.21 c transformed objective value is always integral (scale: 1)
2.17/2.21 c Presolving Time: 0.04
2.17/2.21 c
2.17/2.22 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.17/2.22 c 2.1s| 1 | 0 | 932 | 852k| 0 | 42 | 105 | 104 | 104 | 105 | 104 | 0 | 0 | 152 | 1.300000e+01 | -- | Inf
2.17/2.25 c 2.2s| 1 | 0 | 1048 |1138k| 0 | 47 | 105 | 104 | 104 | 105 | 115 | 11 | 0 | 152 | 1.300000e+01 | -- | Inf
2.27/2.32 c 2.2s| 1 | 0 | 1108 |1137k| 0 | 38 | 105 | 104 | 104 | 105 | 115 | 11 | 0 | 159 | 1.300000e+01 | -- | Inf
2.27/2.37 c 2.3s| 1 | 0 | 1152 |1136k| 0 | - | 105 | 103 | 103 | 105 | 115 | 11 | 0 | 164 | -- | -- | 0.00%
2.27/2.37 c 2.3s| 1 | 0 | 1152 |1136k| 0 | - | 105 | 103 | 103 | 105 | 115 | 11 | 0 | 164 | -- | -- | 0.00%
2.27/2.37 c
2.27/2.37 c SCIP Status : problem is solved [infeasible]
2.27/2.37 c Solving Time (sec) : 2.28
2.27/2.37 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.27/2.37 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.27/2.37 c Dual Bound : +1.00000000000000e+20
2.27/2.37 c Gap : 0.00 %
2.27/2.37 c NODE 1
2.27/2.37 c DUAL BOUND 1e+20
2.27/2.37 c PRIMAL BOUND 1e+20
2.27/2.37 c GAP 0
2.27/2.37 s UNSATISFIABLE
2.27/2.37 c SCIP Status : problem is solved [infeasible]
2.27/2.37 c Solving Time : 2.28
2.27/2.37 c Original Problem :
2.27/2.37 c Problem name : HOME/instance-1868108-1245115724.opb
2.27/2.37 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.27/2.37 c Constraints : 101 initial, 101 maximal
2.27/2.37 c Presolved Problem :
2.27/2.37 c Problem name : t_HOME/instance-1868108-1245115724.opb
2.27/2.37 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
2.27/2.37 c Constraints : 104 initial, 104 maximal
2.27/2.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.27/2.37 c trivial : 0.00 64 0 0 0 0 0 0 0
2.27/2.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.27/2.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.27/2.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.27/2.37 c implics : 0.00 0 0 0 0 0 0 0 0
2.27/2.37 c probing : 0.00 0 0 0 0 0 0 0 0
2.27/2.37 c knapsack : 0.01 0 0 0 0 0 0 0 1
2.27/2.37 c setppc : 0.01 0 0 0 0 0 4 0 0
2.27/2.37 c linear : 0.01 0 0 0 0 0 32 3 0
2.27/2.37 c logicor : 0.01 0 0 0 0 0 2 0 0
2.27/2.37 c root node : - 74 - - 74 - - - -
2.27/2.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.27/2.37 c integral : 0 0 0 15 0 0 74 0 0 0
2.27/2.37 c knapsack : 21 7 16 0 0 0 0 0 0 0
2.27/2.37 c setppc : 78 7 16 0 0 0 0 0 0 0
2.27/2.37 c logicor : 5 7 3 0 0 0 0 0 0 0
2.27/2.37 c countsols : 0 0 0 0 0 0 0 0 0 0
2.27/2.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.27/2.37 c integral : 2.05 0.00 0.00 2.05 0.00
2.27/2.37 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.27/2.37 c setppc : 0.00 0.00 0.00 0.00 0.00
2.27/2.37 c logicor : 0.00 0.00 0.00 0.00 0.00
2.27/2.37 c countsols : 0.00 0.00 0.00 0.00 0.00
2.27/2.37 c Propagators : Time Calls Cutoffs DomReds
2.27/2.37 c rootredcost : 0.00 0 0 0
2.27/2.37 c pseudoobj : 0.00 20 1 0
2.27/2.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.27/2.37 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.27/2.37 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.27/2.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.27/2.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.27/2.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.27/2.37 c applied globally : - - - 0 0.0 - - -
2.27/2.37 c applied locally : - - - 0 0.0 - - -
2.27/2.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.27/2.37 c cut pool : 0.00 0 - - 0 - (maximal pool size: 108)
2.27/2.37 c redcost : 0.00 7 0 0 0 0
2.27/2.37 c impliedbounds : 0.00 7 0 0 0 0
2.27/2.37 c intobj : 0.00 0 0 0 0 0
2.27/2.37 c gomory : 0.06 7 0 0 37 0
2.27/2.37 c strongcg : 0.06 7 0 0 267 0
2.27/2.37 c cmir : 0.00 0 0 0 0 0
2.27/2.37 c flowcover : 0.00 0 0 0 0 0
2.27/2.37 c clique : 0.00 7 0 0 32 0
2.27/2.37 c zerohalf : 0.00 0 0 0 0 0
2.27/2.37 c mcf : 0.00 3 0 0 0 0
2.27/2.37 c Pricers : Time Calls Vars
2.27/2.37 c problem variables: 0.00 0 0
2.27/2.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.27/2.37 c relpscost : 2.05 15 0 74 0 0 0
2.27/2.37 c pscost : 0.00 0 0 0 0 0 0
2.27/2.37 c inference : 0.00 0 0 0 0 0 0
2.27/2.37 c mostinf : 0.00 0 0 0 0 0 0
2.27/2.37 c leastinf : 0.00 0 0 0 0 0 0
2.27/2.37 c fullstrong : 0.00 0 0 0 0 0 0
2.27/2.37 c allfullstrong : 0.00 0 0 0 0 0 0
2.27/2.37 c random : 0.00 0 0 0 0 0 0
2.27/2.37 c Primal Heuristics : Time Calls Found
2.27/2.37 c LP solutions : 0.00 - 0
2.27/2.37 c pseudo solutions : 0.00 - 0
2.27/2.37 c simplerounding : 0.00 0 0
2.27/2.37 c rounding : 0.00 0 0
2.27/2.37 c shifting : 0.00 0 0
2.27/2.37 c intshifting : 0.00 0 0
2.27/2.37 c oneopt : 0.00 0 0
2.27/2.37 c fixandinfer : 0.00 0 0
2.27/2.37 c feaspump : 0.00 0 0
2.27/2.37 c coefdiving : 0.00 0 0
2.27/2.37 c pscostdiving : 0.00 0 0
2.27/2.37 c fracdiving : 0.00 0 0
2.27/2.37 c veclendiving : 0.00 0 0
2.27/2.37 c intdiving : 0.00 0 0
2.27/2.37 c actconsdiving : 0.00 0 0
2.27/2.37 c objpscostdiving : 0.00 0 0
2.27/2.37 c rootsoldiving : 0.00 0 0
2.27/2.37 c linesearchdiving : 0.00 0 0
2.27/2.37 c guideddiving : 0.00 0 0
2.27/2.37 c octane : 0.00 0 0
2.27/2.37 c rens : 0.00 0 0
2.27/2.37 c rins : 0.00 0 0
2.27/2.37 c localbranching : 0.00 0 0
2.27/2.37 c mutation : 0.00 0 0
2.27/2.37 c crossover : 0.00 0 0
2.27/2.37 c dins : 0.00 0 0
2.27/2.38 c LP : Time Calls Iterations Iter/call Iter/sec
2.27/2.38 c primal LP : 0.00 0 0 0.00 -
2.27/2.38 c dual LP : 0.06 23 1152 50.09 19200.00
2.27/2.38 c barrier LP : 0.00 0 0 0.00 -
2.27/2.38 c diving/probing LP: 0.00 0 0 0.00 -
2.27/2.38 c strong branching : 2.05 164 21589 131.64 10531.22
2.27/2.38 c (at root node) : - 164 21589 131.64 -
2.27/2.38 c conflict analysis: 0.00 0 0 0.00 -
2.27/2.38 c B&B Tree :
2.27/2.38 c number of runs : 3
2.27/2.38 c nodes : 1
2.27/2.38 c nodes (total) : 3
2.27/2.38 c nodes left : 0
2.27/2.38 c max depth : 0
2.27/2.38 c max depth (total): 0
2.27/2.38 c backtracks : 0 (0.0%)
2.27/2.38 c delayed cutoffs : 0
2.27/2.38 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.27/2.38 c avg switch length: 2.00
2.27/2.38 c switching time : 0.00
2.27/2.38 c Solution :
2.27/2.38 c Solutions found : 0 (0 improvements)
2.27/2.38 c Primal Bound : infeasible
2.27/2.38 c Dual Bound : -
2.27/2.38 c Gap : 0.00 %
2.27/2.38 c Root Dual Bound : -
2.27/2.38 c Time complete: 2.36.