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-1868144-1245115819.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.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 | 102 | 593k| 0 | 45 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 137 | 790k| 0 | 50 | 169 | 73 | 73 | 169 | 80 | 7 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 158 |1014k| 0 | 52 | 169 | 73 | 73 | 169 | 86 | 13 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 191 |1111k| 0 | 56 | 169 | 73 | 73 | 169 | 91 | 18 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 218 |1144k| 0 | 60 | 169 | 73 | 73 | 169 | 95 | 22 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 247 |1173k| 0 | 54 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 0 | 1.300000e+01 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 280 |1173k| 0 | 57 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 37 | 1.300000e+01 | -- | Inf
0.59/0.68 c 0.7s| 1 | 0 | 306 |1173k| 0 | 53 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 46 | 1.300000e+01 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 327 |1173k| 0 | 53 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 58 | 1.300000e+01 | -- | Inf
0.79/0.90 c 0.9s| 1 | 0 | 349 |1173k| 0 | 53 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 64 | 1.300000e+01 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 368 |1173k| 0 | 53 | 169 | 73 | 73 | 169 | 98 | 25 | 0 | 70 | 1.300000e+01 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 393 |1173k| 0 | 52 | 169 | 73 | 73 | 169 | 97 | 25 | 0 | 76 | 1.300000e+01 | -- | Inf
1.09/1.10 c 1.1s| 1 | 0 | 393 |1173k| 0 | - | 169 | 73 | 73 | 169 | 97 | 25 | 0 | 81 | 1.300000e+01 | -- | Inf
1.09/1.10 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.09/1.10 c
1.09/1.10 (restart) converted 23 cuts from the global cut pool into linear constraints
1.09/1.11 c
1.09/1.11 presolving:
1.09/1.11 c (round 1) 34 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 23 upgd conss, 10 impls, 83 clqs
1.09/1.12 c presolving (2 rounds):
1.09/1.12 c 34 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.09/1.12 c 10 implications, 83 cliques
1.09/1.12 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 96 constraints
1.09/1.12 c 8 constraints of type <knapsack>
1.09/1.12 c 84 constraints of type <setppc>
1.09/1.12 c 4 constraints of type <logicor>
1.09/1.12 c transformed objective value is always integral (scale: 1)
1.09/1.12 c Presolving Time: 0.02
1.09/1.12 c
1.09/1.12 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.12 c 1.1s| 1 | 0 | 485 | 721k| 0 | 46 | 135 | 96 | 96 | 135 | 96 | 0 | 0 | 81 | 1.300000e+01 | -- | Inf
1.09/1.14 c 1.1s| 1 | 0 | 519 | 973k| 0 | 52 | 135 | 96 | 96 | 135 | 108 | 12 | 0 | 81 | 1.300000e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 546 | 973k| 0 | 54 | 135 | 96 | 96 | 135 | 108 | 12 | 0 | 103 | 1.300000e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 592 | 973k| 0 | 52 | 135 | 96 | 96 | 135 | 108 | 12 | 0 | 126 | 1.300000e+01 | -- | Inf
1.69/1.75 c 1.7s| 1 | 0 | 619 | 972k| 0 | 49 | 135 | 95 | 95 | 135 | 108 | 12 | 0 | 135 | 1.300000e+01 | -- | Inf
1.79/1.83 c 1.8s| 1 | 0 | 655 | 972k| 0 | 48 | 135 | 95 | 95 | 135 | 108 | 12 | 0 | 143 | 1.300000e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 666 | 972k| 0 | 47 | 135 | 95 | 95 | 135 | 108 | 12 | 0 | 150 | 1.300000e+01 | -- | Inf
1.89/1.91 c 1.9s| 1 | 0 | 666 | 972k| 0 | - | 135 | 95 | 95 | 135 | 108 | 12 | 0 | 155 | 1.300000e+01 | -- | Inf
1.89/1.91 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.89/1.91 c
1.89/1.91 (restart) converted 12 cuts from the global cut pool into linear constraints
1.89/1.92 c
1.89/1.92 presolving:
1.89/1.92 c (round 1) 30 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 32 impls, 74 clqs
1.89/1.92 c (round 2) 30 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 32 impls, 74 clqs
1.89/1.93 c (round 3) 30 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 32 impls, 74 clqs
1.89/1.93 c presolving (4 rounds):
1.89/1.93 c 30 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
1.89/1.93 c 32 implications, 74 cliques
1.89/1.93 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 97 constraints
1.89/1.93 c 15 constraints of type <knapsack>
1.89/1.93 c 79 constraints of type <setppc>
1.89/1.93 c 3 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.04
1.89/1.93 c
1.89/1.93 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.93 c 1.9s| 1 | 0 | 750 | 772k| 0 | 46 | 105 | 97 | 97 | 105 | 97 | 0 | 0 | 155 | 1.300000e+01 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 786 | 977k| 0 | 52 | 105 | 97 | 97 | 105 | 109 | 12 | 0 | 155 | 1.300000e+01 | -- | Inf
2.09/2.11 c 2.0s| 1 | 0 | 850 | 977k| 0 | 46 | 105 | 97 | 97 | 105 | 109 | 12 | 0 | 169 | 1.300000e+01 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 890 | 977k| 0 | 45 | 105 | 97 | 97 | 105 | 109 | 12 | 0 | 181 | 1.300000e+01 | -- | Inf
2.09/2.20 c 2.1s| 1 | 0 | 912 | 976k| 0 | 42 | 105 | 96 | 96 | 105 | 109 | 12 | 0 | 188 | 1.300000e+01 | -- | Inf
2.20/2.22 c 2.1s| 1 | 0 | 912 | 976k| 0 | 42 | 105 | 96 | 96 | 105 | 109 | 12 | 0 | 192 | -- | -- | 0.00%
2.20/2.22 c
2.20/2.22 c SCIP Status : problem is solved [infeasible]
2.20/2.22 c Solving Time (sec) : 2.15
2.20/2.22 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.20/2.22 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.20/2.22 c Dual Bound : +1.00000000000000e+20
2.20/2.22 c Gap : 0.00 %
2.20/2.22 c NODE 1
2.20/2.22 c DUAL BOUND 1e+20
2.20/2.22 c PRIMAL BOUND 1e+20
2.20/2.22 c GAP 0
2.20/2.22 s UNSATISFIABLE
2.20/2.22 c SCIP Status : problem is solved [infeasible]
2.20/2.22 c Solving Time : 2.15
2.20/2.22 c Original Problem :
2.20/2.22 c Problem name : HOME/instance-1868144-1245115819.opb
2.20/2.22 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.22 c Constraints : 101 initial, 101 maximal
2.20/2.22 c Presolved Problem :
2.20/2.22 c Problem name : t_HOME/instance-1868144-1245115819.opb
2.20/2.22 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.22 c Constraints : 97 initial, 97 maximal
2.20/2.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.20/2.22 c trivial : 0.00 64 0 0 0 0 0 0 0
2.20/2.22 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.20/2.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.20/2.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.20/2.22 c implics : 0.00 0 0 0 0 0 0 0 0
2.20/2.22 c probing : 0.00 0 0 0 0 0 0 0 0
2.20/2.22 c knapsack : 0.01 0 0 0 0 0 0 0 1
2.20/2.22 c setppc : 0.01 0 0 0 0 0 7 0 0
2.20/2.22 c linear : 0.00 0 0 0 0 0 29 0 0
2.20/2.22 c logicor : 0.01 0 0 0 0 0 2 0 0
2.20/2.22 c root node : - 79 - - 79 - - - -
2.20/2.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.20/2.22 c integral : 0 0 0 17 0 1 79 0 0 0
2.20/2.22 c knapsack : 15 7 17 0 0 0 0 0 0 0
2.20/2.22 c setppc : 79 7 17 0 0 0 0 0 0 0
2.20/2.22 c logicor : 3 7 3 0 0 0 0 0 0 0
2.20/2.22 c countsols : 0 0 0 0 0 0 0 0 0 0
2.20/2.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.20/2.22 c integral : 1.92 0.00 0.00 1.92 0.00
2.20/2.22 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c setppc : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c logicor : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c countsols : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c Propagators : Time Calls Cutoffs DomReds
2.20/2.22 c rootredcost : 0.00 0 0 0
2.20/2.22 c pseudoobj : 0.00 20 0 0
2.20/2.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.20/2.22 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.22 c applied globally : - - - 0 0.0 - - -
2.20/2.22 c applied locally : - - - 0 0.0 - - -
2.20/2.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.20/2.22 c cut pool : 0.00 0 - - 0 - (maximal pool size: 80)
2.20/2.22 c redcost : 0.00 7 0 0 0 0
2.20/2.22 c impliedbounds : 0.00 7 0 0 0 0
2.20/2.22 c intobj : 0.00 0 0 0 0 0
2.20/2.22 c gomory : 0.05 7 0 0 6 0
2.20/2.22 c strongcg : 0.04 7 0 0 297 0
2.20/2.22 c cmir : 0.00 0 0 0 0 0
2.20/2.22 c flowcover : 0.00 0 0 0 0 0
2.20/2.22 c clique : 0.01 7 0 0 36 0
2.20/2.22 c zerohalf : 0.00 0 0 0 0 0
2.20/2.22 c mcf : 0.00 3 0 0 0 0
2.20/2.22 c Pricers : Time Calls Vars
2.20/2.22 c problem variables: 0.00 0 0
2.20/2.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.20/2.22 c relpscost : 1.92 17 1 79 0 0 0
2.20/2.22 c pscost : 0.00 0 0 0 0 0 0
2.20/2.22 c inference : 0.00 0 0 0 0 0 0
2.20/2.22 c mostinf : 0.00 0 0 0 0 0 0
2.20/2.22 c leastinf : 0.00 0 0 0 0 0 0
2.20/2.22 c fullstrong : 0.00 0 0 0 0 0 0
2.20/2.22 c allfullstrong : 0.00 0 0 0 0 0 0
2.20/2.22 c random : 0.00 0 0 0 0 0 0
2.20/2.22 c Primal Heuristics : Time Calls Found
2.20/2.22 c LP solutions : 0.00 - 0
2.20/2.22 c pseudo solutions : 0.00 - 0
2.20/2.22 c simplerounding : 0.00 0 0
2.20/2.22 c rounding : 0.00 0 0
2.20/2.22 c shifting : 0.00 0 0
2.20/2.22 c intshifting : 0.00 0 0
2.20/2.22 c oneopt : 0.00 0 0
2.20/2.22 c fixandinfer : 0.00 0 0
2.20/2.22 c feaspump : 0.00 0 0
2.20/2.22 c coefdiving : 0.00 0 0
2.20/2.22 c pscostdiving : 0.00 0 0
2.20/2.22 c fracdiving : 0.00 0 0
2.20/2.22 c veclendiving : 0.00 0 0
2.20/2.22 c intdiving : 0.00 0 0
2.20/2.22 c actconsdiving : 0.00 0 0
2.20/2.22 c objpscostdiving : 0.00 0 0
2.20/2.22 c rootsoldiving : 0.00 0 0
2.20/2.22 c linesearchdiving : 0.00 0 0
2.20/2.22 c guideddiving : 0.00 0 0
2.20/2.22 c octane : 0.00 0 0
2.20/2.22 c rens : 0.00 0 0
2.20/2.22 c rins : 0.00 0 0
2.20/2.22 c localbranching : 0.00 0 0
2.20/2.22 c mutation : 0.00 0 0
2.20/2.22 c crossover : 0.00 0 0
2.20/2.22 c dins : 0.00 0 0
2.20/2.22 c LP : Time Calls Iterations Iter/call Iter/sec
2.20/2.22 c primal LP : 0.00 0 0 0.00 -
2.20/2.22 c dual LP : 0.08 24 912 38.00 11400.00
2.20/2.22 c barrier LP : 0.00 0 0 0.00 -
2.20/2.22 c diving/probing LP: 0.00 0 0 0.00 -
2.20/2.22 c strong branching : 1.92 192 21164 110.23 11022.92
2.20/2.22 c (at root node) : - 192 21164 110.23 -
2.20/2.22 c conflict analysis: 0.00 0 0 0.00 -
2.20/2.22 c B&B Tree :
2.20/2.22 c number of runs : 3
2.20/2.22 c nodes : 1
2.20/2.22 c nodes (total) : 3
2.20/2.22 c nodes left : 0
2.20/2.22 c max depth : 0
2.20/2.22 c max depth (total): 0
2.20/2.22 c backtracks : 0 (0.0%)
2.20/2.22 c delayed cutoffs : 0
2.20/2.22 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.20/2.22 c avg switch length: 2.00
2.20/2.22 c switching time : 0.00
2.20/2.22 c Solution :
2.20/2.22 c Solutions found : 0 (0 improvements)
2.20/2.22 c Primal Bound : infeasible
2.20/2.22 c Dual Bound : -
2.20/2.22 c Gap : 0.00 %
2.20/2.22 c Root Dual Bound : -
2.20/2.23 c Time complete: 2.22.