0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3691747-1338039400.opb>
0.09/0.16 c original problem has 16198 variables (16198 bin, 0 int, 0 impl, 0 cont) and 55731 constraints
0.09/0.16 c problem read in 0.16
0.09/0.16 c No objective function, only one solution is needed.
0.09/0.16 c presolving settings loaded
0.19/0.28 c presolving:
1.39/1.40 c (round 1) 5967 del vars, 17051 del conss, 0 add conss, 4727 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2760512 impls, 0 clqs
1.79/1.87 c (round 2) 10635 del vars, 36202 del conss, 0 add conss, 9007 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2791185 impls, 0 clqs
1.88/1.95 c (round 3) 12081 del vars, 42941 del conss, 0 add conss, 9942 chg bounds, 45 chg sides, 38 chg coeffs, 0 upgd conss, 2801314 impls, 0 clqs
1.99/2.00 c (round 4) 13157 del vars, 46667 del conss, 0 add conss, 10746 chg bounds, 82 chg sides, 63 chg coeffs, 0 upgd conss, 2811143 impls, 0 clqs
1.99/2.03 c (round 5) 13730 del vars, 48793 del conss, 0 add conss, 11122 chg bounds, 93 chg sides, 76 chg coeffs, 0 upgd conss, 2816830 impls, 0 clqs
1.99/2.05 c (round 6) 14018 del vars, 49827 del conss, 0 add conss, 11336 chg bounds, 101 chg sides, 85 chg coeffs, 0 upgd conss, 2819178 impls, 0 clqs
1.99/2.06 c (round 7) 14199 del vars, 50392 del conss, 0 add conss, 11441 chg bounds, 122 chg sides, 111 chg coeffs, 0 upgd conss, 2821870 impls, 3 clqs
1.99/2.08 c (round 8) 14330 del vars, 50730 del conss, 0 add conss, 11495 chg bounds, 154 chg sides, 139 chg coeffs, 0 upgd conss, 2827832 impls, 4 clqs
1.99/2.08 c (round 9) 14379 del vars, 50923 del conss, 0 add conss, 11518 chg bounds, 159 chg sides, 143 chg coeffs, 0 upgd conss, 2828660 impls, 4 clqs
1.99/2.09 c (round 10) 14402 del vars, 51020 del conss, 0 add conss, 11531 chg bounds, 169 chg sides, 152 chg coeffs, 0 upgd conss, 2829659 impls, 2 clqs
1.99/2.09 c (round 11) 14423 del vars, 51075 del conss, 0 add conss, 11540 chg bounds, 174 chg sides, 158 chg coeffs, 0 upgd conss, 2829778 impls, 2 clqs
1.99/2.10 c (round 12) 14427 del vars, 51110 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829798 impls, 2 clqs
2.10/2.10 c (round 13) 14429 del vars, 51118 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
2.10/2.11 c (round 14) 14429 del vars, 51120 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
2.10/2.14 c (round 15) 14429 del vars, 51132 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 4609 upgd conss, 2829824 impls, 2 clqs
2.10/2.16 c (round 16) 14478 del vars, 51194 del conss, 0 add conss, 11547 chg bounds, 209 chg sides, 292 chg coeffs, 4609 upgd conss, 2831238 impls, 75 clqs
2.10/2.17 c (round 17) 14499 del vars, 51291 del conss, 0 add conss, 11547 chg bounds, 220 chg sides, 366 chg coeffs, 4609 upgd conss, 2832102 impls, 101 clqs
2.10/2.18 c (round 18) 14524 del vars, 51329 del conss, 0 add conss, 11551 chg bounds, 222 chg sides, 405 chg coeffs, 4609 upgd conss, 2833244 impls, 105 clqs
2.10/2.19 c (round 19) 14529 del vars, 51385 del conss, 0 add conss, 11551 chg bounds, 237 chg sides, 474 chg coeffs, 4609 upgd conss, 2833494 impls, 110 clqs
2.10/2.20 c (round 20) 14529 del vars, 51387 del conss, 0 add conss, 11551 chg bounds, 240 chg sides, 507 chg coeffs, 4609 upgd conss, 2833494 impls, 114 clqs
2.20/2.21 c (round 21) 14529 del vars, 51394 del conss, 0 add conss, 11551 chg bounds, 240 chg sides, 520 chg coeffs, 4613 upgd conss, 2833494 impls, 117 clqs
2.20/2.24 c (round 22) 14529 del vars, 53626 del conss, 708 add conss, 11551 chg bounds, 240 chg sides, 527 chg coeffs, 4613 upgd conss, 2833494 impls, 118 clqs
2.20/2.25 c (round 23) 14529 del vars, 54226 del conss, 1308 add conss, 11551 chg bounds, 240 chg sides, 531 chg coeffs, 4613 upgd conss, 2833496 impls, 227 clqs
2.20/2.26 c presolving (24 rounds):
2.20/2.26 c 14529 deleted vars, 54226 deleted constraints, 1308 added constraints, 11551 tightened bounds, 0 added holes, 240 changed sides, 533 changed coefficients
2.20/2.26 c 2833496 implications, 827 cliques
2.20/2.26 c presolved problem has 1669 variables (1669 bin, 0 int, 0 impl, 0 cont) and 2813 constraints
2.20/2.26 c 223 constraints of type <knapsack>
2.20/2.26 c 2583 constraints of type <setppc>
2.20/2.26 c 7 constraints of type <logicor>
2.20/2.26 c transformed objective value is always integral (scale: 1)
2.20/2.26 c Presolving Time: 2.01
2.20/2.26 c - non default parameters ----------------------------------------------------------------------
2.20/2.26 c # SCIP version 2.1.1.4
2.20/2.26 c
2.20/2.26 c # maximal time in seconds to run
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.20/2.26 c limits/time = 1797
2.20/2.26 c
2.20/2.26 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.20/2.26 c limits/memory = 13950
2.20/2.26 c
2.20/2.26 c # solving stops, if the given number of solutions were found (-1: no limit)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.26 c limits/solutions = 1
2.20/2.26 c
2.20/2.26 c # maximal number of separation rounds per node (-1: unlimited)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 5]
2.20/2.26 c separating/maxrounds = 1
2.20/2.26 c
2.20/2.26 c # maximal number of separation rounds in the root node (-1: unlimited)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.26 c separating/maxroundsroot = 5
2.20/2.26 c
2.20/2.26 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.20/2.26 c # [type: int, range: [1,2], default: 1]
2.20/2.26 c timing/clocktype = 2
2.20/2.26 c
2.20/2.26 c # belongs reading time to solving time?
2.20/2.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.20/2.26 c timing/reading = TRUE
2.20/2.26 c
2.20/2.26 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.20/2.26 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.20/2.26 c constraints/knapsack/disaggregation = FALSE
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/coefdiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/coefdiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/coefdiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 30]
2.20/2.26 c heuristics/crossover/freq = -1
2.20/2.26 c
2.20/2.26 c # number of nodes added to the contingent of the total nodes
2.20/2.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.20/2.26 c heuristics/crossover/nodesofs = 750
2.20/2.26 c
2.20/2.26 c # number of nodes without incumbent change that heuristic should wait
2.20/2.26 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.20/2.26 c heuristics/crossover/nwaitingnodes = 100
2.20/2.26 c
2.20/2.26 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.20/2.26 c # [type: real, range: [0,1], default: 0.1]
2.20/2.26 c heuristics/crossover/nodesquot = 0.15
2.20/2.26 c
2.20/2.26 c # minimum percentage of integer variables that have to be fixed
2.20/2.26 c # [type: real, range: [0,1], default: 0.666]
2.20/2.26 c heuristics/crossover/minfixingrate = 0.5
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.26 c heuristics/feaspump/freq = -1
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/feaspump/maxlpiterofs = 2000
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/fracdiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/fracdiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/fracdiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/guideddiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/guideddiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/guideddiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/intdiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/intshifting/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/linesearchdiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.26 c heuristics/objpscostdiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to total iteration number
2.20/2.26 c # [type: real, range: [0,1], default: 0.01]
2.20/2.26 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/oneopt/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/pscostdiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/pscostdiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c heuristics/rens/freq = -1
2.20/2.26 c
2.20/2.26 c # minimum percentage of integer variables that have to be fixable
2.20/2.26 c # [type: real, range: [0,1], default: 0.5]
2.20/2.26 c heuristics/rens/minfixingrate = 0.3
2.20/2.26 c
2.20/2.26 c # number of nodes added to the contingent of the total nodes
2.20/2.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.20/2.26 c heuristics/rens/nodesofs = 2000
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.26 c heuristics/rootsoldiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.20/2.26 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/rounding/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c heuristics/shiftandpropagate/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/shifting/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/simplerounding/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/subnlp/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c heuristics/trivial/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/trysol/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c heuristics/undercover/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.26 c heuristics/veclendiving/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.26 c heuristics/veclendiving/maxlpiterquot = 0.075
2.20/2.26 c
2.20/2.26 c # additional number of allowed LP iterations
2.20/2.26 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.26 c heuristics/veclendiving/maxlpiterofs = 1500
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/zirounding/freq = -1
2.20/2.26 c
2.20/2.26 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.26 c propagating/probing/maxprerounds = 0
2.20/2.26 c
2.20/2.26 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c separating/cmir/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.26 c separating/flowcover/freq = -1
2.20/2.26 c
2.20/2.26 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.26 c separating/rapidlearning/freq = 0
2.20/2.26 c
2.20/2.26 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
2.20/2.26 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.26 c heuristics/indoneopt/freq = -1
2.20/2.26 c
2.20/2.26 c -----------------------------------------------------------------------------------------------
2.20/2.26 c start solving
2.20/2.26 c
2.39/2.41 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.41 c 2.4s| 1 | 0 | 1628 | - | 65M| 0 | 505 |1669 |2813 |1669 |2813 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.94 c 2.9s| 1 | 0 | 1994 | - | 63M| 0 | - |1669 |2833 |1669 |2813 | 0 | 0 | 0 | cutoff | -- | 0.00%
2.89/2.94 c 2.9s| 1 | 0 | 1994 | - | 63M| 0 | - |1669 |2833 |1669 |2813 | 0 | 0 | 0 | cutoff | -- | 0.00%
2.89/2.94 c
2.89/2.94 c SCIP Status : problem is solved [infeasible]
2.89/2.94 c Solving Time (sec) : 2.93
2.89/2.94 c Solving Nodes : 1
2.89/2.94 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.89/2.94 c Dual Bound : +1.00000000000000e+20
2.89/2.94 c Gap : 0.00 %
2.89/2.94 s UNSATISFIABLE
2.89/2.94 c SCIP Status : problem is solved [infeasible]
2.89/2.94 c Total Time : 2.93
2.89/2.94 c solving : 2.93
2.89/2.94 c presolving : 2.01 (included in solving)
2.89/2.94 c reading : 0.16 (included in solving)
2.89/2.94 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
2.89/2.94 c Original Problem :
2.89/2.94 c Problem name : HOME/instance-3691747-1338039400.opb
2.89/2.94 c Variables : 16198 (16198 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.94 c Constraints : 55731 initial, 55731 maximal
2.89/2.94 c Objective sense : minimize
2.89/2.94 c Presolved Problem :
2.89/2.94 c Problem name : t_HOME/instance-3691747-1338039400.opb
2.89/2.94 c Variables : 1669 (1669 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.94 c Constraints : 2813 initial, 2833 maximal
2.89/2.94 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.89/2.94 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c trivial : 0.00 0.00 373 0 0 0 0 0 0 0 0
2.89/2.94 c dualfix : 0.01 0.00 97 0 0 0 0 0 0 0 0
2.89/2.94 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c gateextraction : 0.01 0.00 0 0 0 0 0 2232 708 0 0
2.89/2.94 c implics : 0.02 0.00 0 129 0 0 0 0 0 0 0
2.89/2.94 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.89/2.94 c knapsack : 0.03 0.00 17 0 0 0 0 1 0 64 373
2.89/2.94 c setppc : 0.05 0.00 31 0 0 5 0 220 0 0 0
2.89/2.94 c and : 0.00 0.00 0 0 0 0 0 600 600 0 0
2.89/2.94 c linear : 1.79 0.02 11183 2699 0 11542 0 51132 0 176 160
2.89/2.94 c logicor : 0.03 0.00 0 0 0 4 0 41 0 0 0
2.89/2.94 c root node : - - 769 - - 769 - - - - -
2.89/2.94 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
2.89/2.94 c integral : 0 0 0 0 0 0 1 0 0 0 0 0 0
2.89/2.94 c knapsack : 223 223 1 1 0 0 0 0 0 0 90 0 0
2.89/2.94 c setppc : 2583 2583 1 1 0 0 0 0 0 0 0 0 0
2.89/2.94 c linear : 0+ 20 0 0 0 0 0 0 0 0 0 0 0
2.89/2.94 c logicor : 7 7 1 1 0 0 0 0 0 0 0 0 0
2.89/2.94 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
2.89/2.94 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
2.89/2.94 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c linear : 0.02 0.02 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c Propagators : #Propagate #ResProp Cutoffs DomReds
2.89/2.94 c rootredcost : 0 0 0 0
2.89/2.94 c pseudoobj : 0 0 0 0
2.89/2.94 c vbounds : 0 0 0 0
2.89/2.94 c redcost : 1 0 0 0
2.89/2.94 c probing : 0 0 0 0
2.89/2.94 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
2.89/2.94 c rootredcost : 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c vbounds : 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c redcost : 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c probing : 0.00 0.00 0.00 0.00 0.00
2.89/2.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.94 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.94 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.94 c applied globally : - - - 0 0.0 - - -
2.89/2.94 c applied locally : - - - 0 0.0 - - -
2.89/2.94 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
2.89/2.94 c cut pool : 0.00 0 - - 0 - (maximal pool size: 263)
2.89/2.94 c closecuts : 0.00 0.00 0 0 0 0 0
2.89/2.94 c impliedbounds : 0.00 0.00 1 0 0 3 0
2.89/2.94 c intobj : 0.00 0.00 0 0 0 0 0
2.89/2.94 c gomory : 0.11 0.00 1 0 0 50 0
2.89/2.94 c cgmip : 0.00 0.00 0 0 0 0 0
2.89/2.94 c strongcg : 0.10 0.00 1 0 0 500 0
2.89/2.94 c cmir : 0.00 0.00 0 0 0 0 0
2.89/2.94 c flowcover : 0.00 0.00 0 0 0 0 0
2.89/2.94 c clique : 0.06 0.00 1 0 0 6 0
2.89/2.94 c zerohalf : 0.00 0.00 0 0 0 0 0
2.89/2.94 c mcf : 0.00 0.00 1 0 0 0 0
2.89/2.94 c oddcycle : 0.00 0.00 0 0 0 0 0
2.89/2.94 c rapidlearning : 0.20 0.00 1 0 769 0 20
2.89/2.94 c Pricers : ExecTime SetupTime Calls Vars
2.89/2.94 c problem variables: 0.00 - 0 0
2.89/2.94 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
2.89/2.94 c pscost : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c inference : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c mostinf : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c leastinf : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c fullstrong : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c random : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c relpscost : 0.00 0.00 0 0 0 0 0 0
2.89/2.94 c Primal Heuristics : ExecTime SetupTime Calls Found
2.89/2.94 c LP solutions : 0.00 - - 0
2.89/2.94 c pseudo solutions : 0.00 - - 0
2.89/2.94 c smallcard : 0.00 0.00 0 0
2.89/2.94 c trivial : 0.01 0.00 1 0
2.89/2.94 c shiftandpropagate: 0.00 0.00 0 0
2.89/2.94 c simplerounding : 0.00 0.00 0 0
2.89/2.94 c zirounding : 0.00 0.00 0 0
2.89/2.94 c rounding : 0.00 0.00 0 0
2.89/2.94 c shifting : 0.00 0.00 0 0
2.89/2.94 c intshifting : 0.00 0.00 0 0
2.89/2.94 c oneopt : 0.00 0.00 0 0
2.89/2.94 c twoopt : 0.00 0.00 0 0
2.89/2.94 c indtwoopt : 0.00 0.00 0 0
2.89/2.94 c indoneopt : 0.00 0.00 0 0
2.89/2.94 c fixandinfer : 0.00 0.00 0 0
2.89/2.94 c feaspump : 0.00 0.00 0 0
2.89/2.94 c clique : 0.00 0.00 0 0
2.89/2.94 c indrounding : 0.00 0.00 0 0
2.89/2.94 c indcoefdiving : 0.00 0.00 0 0
2.89/2.94 c coefdiving : 0.00 0.00 0 0
2.89/2.94 c pscostdiving : 0.00 0.00 0 0
2.89/2.94 c nlpdiving : 0.00 0.00 0 0
2.89/2.94 c fracdiving : 0.00 0.00 0 0
2.89/2.94 c veclendiving : 0.00 0.00 0 0
2.89/2.94 c intdiving : 0.00 0.00 0 0
2.89/2.94 c actconsdiving : 0.00 0.00 0 0
2.89/2.94 c objpscostdiving : 0.00 0.00 0 0
2.89/2.94 c rootsoldiving : 0.00 0.00 0 0
2.89/2.94 c linesearchdiving : 0.00 0.00 0 0
2.89/2.94 c guideddiving : 0.00 0.00 0 0
2.89/2.94 c octane : 0.00 0.00 0 0
2.89/2.94 c rens : 0.00 0.00 0 0
2.89/2.94 c rins : 0.00 0.00 0 0
2.89/2.94 c localbranching : 0.00 0.00 0 0
2.89/2.94 c mutation : 0.00 0.00 0 0
2.89/2.94 c crossover : 0.00 0.00 0 0
2.89/2.94 c dins : 0.00 0.00 0 0
2.89/2.94 c vbounds : 0.00 0.00 0 0
2.89/2.94 c undercover : 0.00 0.00 0 0
2.89/2.94 c subnlp : 0.00 0.00 0 0
2.89/2.94 c trysol : 0.00 0.00 0 0
2.89/2.94 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
2.89/2.94 c primal LP : 0.00 0 0 0.00 - 0.00 0
2.89/2.94 c dual LP : 0.19 2 1994 997.00 10354.41 0.00 0
2.89/2.94 c lex dual LP : 0.00 0 0 0.00 -
2.89/2.94 c barrier LP : 0.00 0 0 0.00 - 0.00 0
2.89/2.94 c diving/probing LP: 0.00 0 0 0.00 -
2.89/2.94 c strong branching : 0.00 0 0 0.00 -
2.89/2.94 c (at root node) : - 0 0 0.00 -
2.89/2.94 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.94 c B&B Tree :
2.89/2.94 c number of runs : 1
2.89/2.94 c nodes : 1
2.89/2.94 c nodes (total) : 1
2.89/2.94 c nodes left : 0
2.89/2.94 c max depth : 0
2.89/2.94 c max depth (total): 0
2.89/2.94 c backtracks : 0 (0.0%)
2.89/2.94 c delayed cutoffs : 0
2.89/2.94 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.89/2.94 c avg switch length: 2.00
2.89/2.94 c switching time : 0.00
2.89/2.94 c Solution :
2.89/2.94 c Solutions found : 0 (0 improvements)
2.89/2.94 c Primal Bound : infeasible
2.89/2.94 c Dual Bound : -
2.89/2.94 c Gap : 0.00 %
2.89/2.94 c Root Dual Bound : -
2.89/2.94 c Root Iterations : 1994
2.99/3.00 c Time complete: 3.