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: a3bf3a4-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-3690593-1338022644.opb>
0.19/0.21 c original problem has 24684 variables (24684 bin, 0 int, 0 impl, 0 cont) and 81656 constraints
0.19/0.21 c problem read in 0.21
0.19/0.21 c No objective function, only one solution is needed.
0.19/0.21 c presolving settings loaded
0.49/0.50 c presolving:
2.29/2.31 c (round 1) 5837 del vars, 16179 del conss, 0 add conss, 4321 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4875508 impls, 0 clqs
2.99/3.04 c (round 2) 12194 del vars, 41995 del conss, 0 add conss, 10137 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4917601 impls, 0 clqs
3.09/3.18 c (round 3) 14858 del vars, 52577 del conss, 0 add conss, 11900 chg bounds, 28 chg sides, 30 chg coeffs, 0 upgd conss, 4934117 impls, 0 clqs
3.19/3.25 c (round 4) 16042 del vars, 56828 del conss, 0 add conss, 12777 chg bounds, 66 chg sides, 86 chg coeffs, 0 upgd conss, 4944901 impls, 0 clqs
3.30/3.31 c (round 5) 17350 del vars, 60734 del conss, 0 add conss, 13728 chg bounds, 80 chg sides, 107 chg coeffs, 0 upgd conss, 4958508 impls, 0 clqs
3.30/3.34 c (round 6) 17968 del vars, 63015 del conss, 0 add conss, 14154 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4964062 impls, 0 clqs
3.30/3.37 c (round 7) 18272 del vars, 64171 del conss, 0 add conss, 14349 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4967243 impls, 0 clqs
3.30/3.38 c (round 8) 18457 del vars, 64909 del conss, 0 add conss, 14469 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4969390 impls, 0 clqs
3.39/3.40 c (round 9) 18568 del vars, 65380 del conss, 0 add conss, 14541 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970626 impls, 0 clqs
3.39/3.41 c (round 10) 18604 del vars, 65568 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970900 impls, 0 clqs
3.39/3.41 c (round 11) 18605 del vars, 65585 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970910 impls, 0 clqs
3.39/3.49 c (round 12) 18605 del vars, 65586 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 16070 upgd conss, 4970910 impls, 0 clqs
3.59/3.61 c (round 13) 18605 del vars, 65586 del conss, 0 add conss, 14563 chg bounds, 123 chg sides, 183 chg coeffs, 16078 upgd conss, 4970910 impls, 0 clqs
3.59/3.63 c (round 14) 18605 del vars, 65589 del conss, 0 add conss, 14563 chg bounds, 129 chg sides, 226 chg coeffs, 16078 upgd conss, 4970910 impls, 2 clqs
3.59/3.68 c (round 15) 18605 del vars, 73914 del conss, 2701 add conss, 14563 chg bounds, 129 chg sides, 239 chg coeffs, 16078 upgd conss, 4970910 impls, 3 clqs
3.68/3.71 c (round 16) 18605 del vars, 76393 del conss, 5180 add conss, 14563 chg bounds, 129 chg sides, 247 chg coeffs, 16078 upgd conss, 4970910 impls, 224 clqs
3.68/3.77 c presolving (17 rounds):
3.68/3.77 c 18605 deleted vars, 76393 deleted constraints, 5180 added constraints, 14563 tightened bounds, 0 added holes, 129 changed sides, 249 changed coefficients
3.68/3.77 c 4970910 implications, 2703 cliques
3.68/3.77 c presolved problem has 6079 variables (6079 bin, 0 int, 0 impl, 0 cont) and 10443 constraints
3.68/3.77 c 340 constraints of type <knapsack>
3.68/3.77 c 10103 constraints of type <setppc>
3.68/3.77 c transformed objective value is always integral (scale: 1)
3.68/3.77 c Presolving Time: 3.47
3.68/3.77 c - non default parameters ----------------------------------------------------------------------
3.68/3.77 c # SCIP version 2.1.1.4
3.68/3.77 c
3.68/3.77 c # maximal time in seconds to run
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.68/3.77 c limits/time = 1797
3.68/3.77 c
3.68/3.77 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.68/3.77 c limits/memory = 13950
3.68/3.77 c
3.68/3.77 c # solving stops, if the given number of solutions were found (-1: no limit)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: -1]
3.68/3.77 c limits/solutions = 1
3.68/3.77 c
3.68/3.77 c # maximal number of separation rounds per node (-1: unlimited)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 5]
3.68/3.77 c separating/maxrounds = 1
3.68/3.77 c
3.68/3.77 c # maximal number of separation rounds in the root node (-1: unlimited)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: -1]
3.68/3.77 c separating/maxroundsroot = 5
3.68/3.77 c
3.68/3.77 c # default clock type (1: CPU user seconds, 2: wall clock time)
3.68/3.77 c # [type: int, range: [1,2], default: 1]
3.68/3.77 c timing/clocktype = 2
3.68/3.77 c
3.68/3.77 c # belongs reading time to solving time?
3.68/3.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.68/3.77 c timing/reading = TRUE
3.68/3.77 c
3.68/3.77 c # should disaggregation of knapsack constraints be allowed in preprocessing?
3.68/3.77 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
3.68/3.77 c constraints/knapsack/disaggregation = FALSE
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/coefdiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/coefdiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/coefdiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 30]
3.68/3.77 c heuristics/crossover/freq = -1
3.68/3.77 c
3.68/3.77 c # number of nodes added to the contingent of the total nodes
3.68/3.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.68/3.77 c heuristics/crossover/nodesofs = 750
3.68/3.77 c
3.68/3.77 c # number of nodes without incumbent change that heuristic should wait
3.68/3.77 c # [type: longint, range: [0,9223372036854775807], default: 200]
3.68/3.77 c heuristics/crossover/nwaitingnodes = 100
3.68/3.77 c
3.68/3.77 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
3.68/3.77 c # [type: real, range: [0,1], default: 0.1]
3.68/3.77 c heuristics/crossover/nodesquot = 0.15
3.68/3.77 c
3.68/3.77 c # minimum percentage of integer variables that have to be fixed
3.68/3.77 c # [type: real, range: [0,1], default: 0.666]
3.68/3.77 c heuristics/crossover/minfixingrate = 0.5
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 20]
3.68/3.77 c heuristics/feaspump/freq = -1
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/feaspump/maxlpiterofs = 2000
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/fracdiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/fracdiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/fracdiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/guideddiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/guideddiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/guideddiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/intdiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/intshifting/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/linesearchdiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/linesearchdiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/linesearchdiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 20]
3.68/3.77 c heuristics/objpscostdiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to total iteration number
3.68/3.77 c # [type: real, range: [0,1], default: 0.01]
3.68/3.77 c heuristics/objpscostdiving/maxlpiterquot = 0.015
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/objpscostdiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/oneopt/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/pscostdiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/pscostdiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/pscostdiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c heuristics/rens/freq = -1
3.68/3.77 c
3.68/3.77 c # minimum percentage of integer variables that have to be fixable
3.68/3.77 c # [type: real, range: [0,1], default: 0.5]
3.68/3.77 c heuristics/rens/minfixingrate = 0.3
3.68/3.77 c
3.68/3.77 c # number of nodes added to the contingent of the total nodes
3.68/3.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.68/3.77 c heuristics/rens/nodesofs = 2000
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 20]
3.68/3.77 c heuristics/rootsoldiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
3.68/3.77 c heuristics/rootsoldiving/maxlpiterquot = 0.015
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/rootsoldiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/rounding/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c heuristics/shiftandpropagate/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/shifting/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/simplerounding/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/subnlp/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c heuristics/trivial/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/trysol/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c heuristics/undercover/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 10]
3.68/3.77 c heuristics/veclendiving/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal fraction of diving LP iterations compared to node LP iterations
3.68/3.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.68/3.77 c heuristics/veclendiving/maxlpiterquot = 0.075
3.68/3.77 c
3.68/3.77 c # additional number of allowed LP iterations
3.68/3.77 c # [type: int, range: [0,2147483647], default: 1000]
3.68/3.77 c heuristics/veclendiving/maxlpiterofs = 1500
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/zirounding/freq = -1
3.68/3.77 c
3.68/3.77 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: -1]
3.68/3.77 c propagating/probing/maxprerounds = 0
3.68/3.77 c
3.68/3.77 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c separating/cmir/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 0]
3.68/3.77 c separating/flowcover/freq = -1
3.68/3.77 c
3.68/3.77 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: -1]
3.68/3.77 c separating/rapidlearning/freq = 0
3.68/3.77 c
3.68/3.77 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
3.68/3.77 c # [type: int, range: [-1,2147483647], default: 1]
3.68/3.77 c heuristics/indoneopt/freq = -1
3.68/3.77 c
3.68/3.77 c -----------------------------------------------------------------------------------------------
3.68/3.77 c start solving
3.68/3.77 c
21.48/21.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
21.48/21.53 c 21.5s| 1 | 0 | 14780 | - | 116M| 0 | - |6079 | 10k|6079 | 10k| 0 | 0 | 0 | cutoff | -- | 0.00%
21.48/21.53 c 21.5s| 1 | 0 | 14780 | - | 116M| 0 | - |6079 | 10k|6079 | 10k| 0 | 0 | 0 | cutoff | -- | 0.00%
21.48/21.53 c
21.48/21.53 c SCIP Status : problem is solved [infeasible]
21.48/21.53 c Solving Time (sec) : 21.53
21.48/21.53 c Solving Nodes : 1
21.48/21.53 c Primal Bound : +1.00000000000000e+20 (0 solutions)
21.48/21.53 c Dual Bound : +1.00000000000000e+20
21.48/21.53 c Gap : 0.00 %
21.48/21.53 s UNSATISFIABLE
21.48/21.53 c SCIP Status : problem is solved [infeasible]
21.48/21.53 c Total Time : 21.53
21.48/21.53 c solving : 21.53
21.48/21.53 c presolving : 3.47 (included in solving)
21.48/21.53 c reading : 0.21 (included in solving)
21.48/21.53 c copying : 0.00 (0 times copied the problem)
21.48/21.53 c Original Problem :
21.48/21.53 c Problem name : HOME/instance-3690593-1338022644.opb
21.48/21.53 c Variables : 24684 (24684 binary, 0 integer, 0 implicit integer, 0 continuous)
21.48/21.53 c Constraints : 81656 initial, 81656 maximal
21.48/21.53 c Objective sense : minimize
21.48/21.53 c Presolved Problem :
21.48/21.53 c Problem name : t_HOME/instance-3690593-1338022644.opb
21.48/21.53 c Variables : 6079 (6079 binary, 0 integer, 0 implicit integer, 0 continuous)
21.48/21.53 c Constraints : 10443 initial, 10443 maximal
21.48/21.53 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
21.48/21.53 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c trivial : 0.01 0.00 653 0 0 0 0 0 0 0 0
21.48/21.53 c dualfix : 0.02 0.00 120 0 0 0 0 0 0 0 0
21.48/21.53 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c gateextraction : 0.03 0.00 0 0 0 0 0 8325 2701 0 0
21.48/21.53 c implics : 0.04 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c components : 0.01 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c knapsack : 0.11 0.00 0 0 0 0 0 0 0 42 136
21.48/21.53 c setppc : 0.06 0.00 0 0 0 0 0 3 0 0 0
21.48/21.53 c and : 0.02 0.00 0 0 0 0 0 2479 2479 0 0
21.48/21.53 c linear : 2.87 0.00 13910 3922 0 14563 0 65586 0 87 113
21.48/21.53 c logicor : 0.03 0.00 0 0 0 0 0 0 0 0 0
21.48/21.53 c root node : - - 0 - - 0 - - - - -
21.48/21.53 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
21.48/21.53 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
21.48/21.53 c knapsack : 340 340 0 1 0 0 0 0 0 0 0 0 0
21.48/21.53 c setppc : 10103 10103 0 1 0 0 0 0 0 0 0 0 0
21.48/21.53 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
21.48/21.53 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
21.48/21.53 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c Propagators : #Propagate #ResProp Cutoffs DomReds
21.48/21.53 c rootredcost : 0 0 0 0
21.48/21.53 c pseudoobj : 0 0 0 0
21.48/21.53 c vbounds : 0 0 0 0
21.48/21.53 c redcost : 0 0 0 0
21.48/21.53 c probing : 0 0 0 0
21.48/21.53 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
21.48/21.53 c rootredcost : 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c vbounds : 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c redcost : 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c probing : 0.00 0.00 0.00 0.00 0.00
21.48/21.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.48/21.53 c propagation : 0.00 0 0 0 0.0 0 0.0 -
21.48/21.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.48/21.53 c applied globally : - - - 0 0.0 - - -
21.48/21.53 c applied locally : - - - 0 0.0 - - -
21.48/21.53 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
21.48/21.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
21.48/21.53 c clique : 0.00 0.00 0 0 0 0 0
21.48/21.53 c closecuts : 0.00 0.00 0 0 0 0 0
21.48/21.53 c cgmip : 0.00 0.00 0 0 0 0 0
21.48/21.53 c cmir : 0.00 0.00 0 0 0 0 0
21.48/21.53 c flowcover : 0.00 0.00 0 0 0 0 0
21.48/21.53 c gomory : 0.00 0.00 0 0 0 0 0
21.48/21.53 c impliedbounds : 0.00 0.00 0 0 0 0 0
21.48/21.53 c intobj : 0.00 0.00 0 0 0 0 0
21.48/21.53 c mcf : 0.00 0.00 0 0 0 0 0
21.48/21.53 c oddcycle : 0.00 0.00 0 0 0 0 0
21.48/21.53 c rapidlearning : 0.00 0.00 0 0 0 0 0
21.48/21.53 c strongcg : 0.00 0.00 0 0 0 0 0
21.48/21.53 c zerohalf : 0.00 0.00 0 0 0 0 0
21.48/21.53 c Pricers : ExecTime SetupTime Calls Vars
21.48/21.53 c problem variables: 0.00 - 0 0
21.48/21.53 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
21.48/21.53 c pscost : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c inference : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c mostinf : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c leastinf : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c fullstrong : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c random : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c relpscost : 0.00 0.00 0 0 0 0 0 0
21.48/21.53 c Primal Heuristics : ExecTime SetupTime Calls Found
21.48/21.53 c LP solutions : 0.00 - - 0
21.48/21.53 c pseudo solutions : 0.00 - - 0
21.48/21.53 c smallcard : 0.00 0.00 0 0
21.48/21.53 c trivial : 0.02 0.00 1 0
21.48/21.53 c shiftandpropagate: 0.00 0.00 0 0
21.48/21.53 c simplerounding : 0.00 0.00 0 0
21.48/21.53 c zirounding : 0.00 0.00 0 0
21.48/21.53 c rounding : 0.00 0.00 0 0
21.48/21.53 c shifting : 0.00 0.00 0 0
21.48/21.53 c intshifting : 0.00 0.00 0 0
21.48/21.53 c oneopt : 0.00 0.00 0 0
21.48/21.53 c twoopt : 0.00 0.00 0 0
21.48/21.53 c indtwoopt : 0.00 0.00 0 0
21.48/21.53 c indoneopt : 0.00 0.00 0 0
21.48/21.53 c fixandinfer : 0.00 0.00 0 0
21.48/21.53 c feaspump : 0.00 0.00 0 0
21.48/21.53 c clique : 0.00 0.00 0 0
21.48/21.53 c indrounding : 0.00 0.00 0 0
21.48/21.53 c indcoefdiving : 0.00 0.00 0 0
21.48/21.53 c coefdiving : 0.00 0.00 0 0
21.48/21.53 c pscostdiving : 0.00 0.00 0 0
21.48/21.53 c nlpdiving : 0.00 0.00 0 0
21.48/21.53 c fracdiving : 0.00 0.00 0 0
21.48/21.53 c veclendiving : 0.00 0.00 0 0
21.48/21.53 c intdiving : 0.00 0.00 0 0
21.48/21.53 c actconsdiving : 0.00 0.00 0 0
21.48/21.53 c objpscostdiving : 0.00 0.00 0 0
21.48/21.53 c rootsoldiving : 0.00 0.00 0 0
21.48/21.53 c linesearchdiving : 0.00 0.00 0 0
21.48/21.53 c guideddiving : 0.00 0.00 0 0
21.48/21.53 c octane : 0.00 0.00 0 0
21.48/21.53 c rens : 0.00 0.00 0 0
21.48/21.53 c rins : 0.00 0.00 0 0
21.48/21.53 c localbranching : 0.00 0.00 0 0
21.48/21.53 c mutation : 0.00 0.00 0 0
21.48/21.53 c crossover : 0.00 0.00 0 0
21.48/21.53 c dins : 0.00 0.00 0 0
21.48/21.53 c vbounds : 0.00 0.00 0 0
21.48/21.53 c undercover : 0.00 0.00 0 0
21.48/21.53 c subnlp : 0.00 0.00 0 0
21.48/21.53 c trysol : 0.00 0.00 0 0
21.48/21.53 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
21.48/21.53 c primal LP : 0.00 0 0 0.00 - 0.00 0
21.48/21.53 c dual LP : 17.73 1 14780 14780.00 833.39 0.00 0
21.48/21.53 c lex dual LP : 0.00 0 0 0.00 -
21.48/21.53 c barrier LP : 0.00 0 0 0.00 - 0.00 0
21.48/21.53 c diving/probing LP: 0.00 0 0 0.00 -
21.48/21.53 c strong branching : 0.00 0 0 0.00 -
21.48/21.53 c (at root node) : - 0 0 0.00 -
21.48/21.53 c conflict analysis: 0.00 0 0 0.00 -
21.48/21.53 c B&B Tree :
21.48/21.53 c number of runs : 1
21.48/21.53 c nodes : 1
21.48/21.53 c nodes (total) : 1
21.48/21.53 c nodes left : 0
21.48/21.53 c max depth : 0
21.48/21.53 c max depth (total): 0
21.48/21.53 c backtracks : 0 (0.0%)
21.48/21.53 c delayed cutoffs : 0
21.48/21.53 c repropagations : 0 (0 domain reductions, 0 cutoffs)
21.48/21.53 c avg switch length: 2.00
21.48/21.53 c switching time : 0.00
21.48/21.53 c Solution :
21.48/21.53 c Solutions found : 0 (0 improvements)
21.48/21.53 c Primal Bound : infeasible
21.48/21.53 c Dual Bound : -
21.48/21.53 c Gap : 0.00 %
21.48/21.53 c Root Dual Bound : -
21.48/21.53 c Root Iterations : 14780
21.59/21.65 c Time complete: 21.64.