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-3690587-1338022680.opb>
0.09/0.13 c original problem has 14924 variables (14924 bin, 0 int, 0 impl, 0 cont) and 46889 constraints
0.09/0.13 c problem read in 0.13
0.09/0.13 c No objective function, only one solution is needed.
0.09/0.13 c presolving settings loaded
0.29/0.30 c presolving:
1.28/1.31 c (round 1) 3476 del vars, 9809 del conss, 0 add conss, 2369 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2562450 impls, 0 clqs
1.69/1.76 c (round 2) 7897 del vars, 25310 del conss, 0 add conss, 6358 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2586217 impls, 0 clqs
1.78/1.84 c (round 3) 9069 del vars, 30738 del conss, 0 add conss, 7024 chg bounds, 47 chg sides, 38 chg coeffs, 0 upgd conss, 2593541 impls, 0 clqs
1.78/1.88 c (round 4) 9689 del vars, 32757 del conss, 0 add conss, 7376 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2599224 impls, 0 clqs
1.88/1.91 c (round 5) 10074 del vars, 34022 del conss, 0 add conss, 7621 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2603341 impls, 0 clqs
1.88/1.93 c (round 6) 10325 del vars, 34811 del conss, 0 add conss, 7758 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2606579 impls, 0 clqs
1.88/1.95 c (round 7) 10530 del vars, 35527 del conss, 0 add conss, 7886 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2608615 impls, 0 clqs
1.88/1.97 c (round 8) 10621 del vars, 35865 del conss, 0 add conss, 7934 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2609367 impls, 0 clqs
1.88/1.98 c (round 9) 10677 del vars, 36053 del conss, 0 add conss, 7954 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2611109 impls, 0 clqs
1.88/1.99 c (round 10) 10695 del vars, 36145 del conss, 0 add conss, 7963 chg bounds, 80 chg sides, 67 chg coeffs, 0 upgd conss, 2611243 impls, 0 clqs
1.99/2.00 c (round 11) 10701 del vars, 36176 del conss, 0 add conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611255 impls, 0 clqs
1.99/2.01 c (round 12) 10704 del vars, 36189 del conss, 0 add conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611269 impls, 0 clqs
1.99/2.08 c (round 13) 10704 del vars, 36190 del conss, 0 add conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 10699 upgd conss, 2611269 impls, 0 clqs
2.09/2.13 c (round 14) 10704 del vars, 36190 del conss, 0 add conss, 7966 chg bounds, 95 chg sides, 111 chg coeffs, 10702 upgd conss, 2611409 impls, 100 clqs
2.09/2.17 c (round 15) 10704 del vars, 36190 del conss, 0 add conss, 7966 chg bounds, 99 chg sides, 126 chg coeffs, 10702 upgd conss, 2611409 impls, 102 clqs
2.19/2.21 c (round 16) 10704 del vars, 42096 del conss, 1874 add conss, 7966 chg bounds, 99 chg sides, 129 chg coeffs, 10702 upgd conss, 2611409 impls, 103 clqs
2.19/2.24 c (round 17) 10704 del vars, 43686 del conss, 3464 add conss, 7966 chg bounds, 99 chg sides, 131 chg coeffs, 10702 upgd conss, 2611409 impls, 387 clqs
2.19/2.27 c presolving (18 rounds):
2.19/2.27 c 10704 deleted vars, 43686 deleted constraints, 3464 added constraints, 7966 tightened bounds, 0 added holes, 99 changed sides, 133 changed coefficients
2.19/2.27 c 2611409 implications, 1978 cliques
2.19/2.27 c presolved problem has 4220 variables (4220 bin, 0 int, 0 impl, 0 cont) and 6667 constraints
2.19/2.27 c 261 constraints of type <knapsack>
2.19/2.27 c 6392 constraints of type <setppc>
2.19/2.27 c 14 constraints of type <logicor>
2.19/2.27 c transformed objective value is always integral (scale: 1)
2.19/2.27 c Presolving Time: 2.09
2.19/2.27 c - non default parameters ----------------------------------------------------------------------
2.19/2.27 c # SCIP version 2.1.1.4
2.19/2.27 c
2.19/2.27 c # maximal time in seconds to run
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.19/2.27 c limits/time = 1797
2.19/2.27 c
2.19/2.27 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.19/2.27 c limits/memory = 13950
2.19/2.27 c
2.19/2.27 c # solving stops, if the given number of solutions were found (-1: no limit)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c limits/solutions = 1
2.19/2.27 c
2.19/2.27 c # maximal number of separation rounds per node (-1: unlimited)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 5]
2.19/2.27 c separating/maxrounds = 1
2.19/2.27 c
2.19/2.27 c # maximal number of separation rounds in the root node (-1: unlimited)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c separating/maxroundsroot = 5
2.19/2.27 c
2.19/2.27 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.19/2.27 c # [type: int, range: [1,2], default: 1]
2.19/2.27 c timing/clocktype = 2
2.19/2.27 c
2.19/2.27 c # belongs reading time to solving time?
2.19/2.27 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.19/2.27 c timing/reading = TRUE
2.19/2.27 c
2.19/2.27 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.19/2.27 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.19/2.27 c constraints/knapsack/disaggregation = FALSE
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/coefdiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/coefdiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/coefdiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 30]
2.19/2.27 c heuristics/crossover/freq = -1
2.19/2.27 c
2.19/2.27 c # number of nodes added to the contingent of the total nodes
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.19/2.27 c heuristics/crossover/nodesofs = 750
2.19/2.27 c
2.19/2.27 c # number of nodes without incumbent change that heuristic should wait
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.19/2.27 c heuristics/crossover/nwaitingnodes = 100
2.19/2.27 c
2.19/2.27 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.19/2.27 c # [type: real, range: [0,1], default: 0.1]
2.19/2.27 c heuristics/crossover/nodesquot = 0.15
2.19/2.27 c
2.19/2.27 c # minimum percentage of integer variables that have to be fixed
2.19/2.27 c # [type: real, range: [0,1], default: 0.666]
2.19/2.27 c heuristics/crossover/minfixingrate = 0.5
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/feaspump/freq = -1
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/feaspump/maxlpiterofs = 2000
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/fracdiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/fracdiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/fracdiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/guideddiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/guideddiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/guideddiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/intdiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/intshifting/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/linesearchdiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/objpscostdiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to total iteration number
2.19/2.27 c # [type: real, range: [0,1], default: 0.01]
2.19/2.27 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/oneopt/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/pscostdiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/pscostdiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c heuristics/rens/freq = -1
2.19/2.27 c
2.19/2.27 c # minimum percentage of integer variables that have to be fixable
2.19/2.27 c # [type: real, range: [0,1], default: 0.5]
2.19/2.27 c heuristics/rens/minfixingrate = 0.3
2.19/2.27 c
2.19/2.27 c # number of nodes added to the contingent of the total nodes
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.19/2.27 c heuristics/rens/nodesofs = 2000
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/rootsoldiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.19/2.27 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/rounding/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c heuristics/shiftandpropagate/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/shifting/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/simplerounding/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/subnlp/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c heuristics/trivial/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/trysol/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c heuristics/undercover/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/veclendiving/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/veclendiving/maxlpiterquot = 0.075
2.19/2.27 c
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/veclendiving/maxlpiterofs = 1500
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/zirounding/freq = -1
2.19/2.27 c
2.19/2.27 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c propagating/probing/maxprerounds = 0
2.19/2.27 c
2.19/2.27 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c separating/cmir/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c separating/flowcover/freq = -1
2.19/2.27 c
2.19/2.27 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c separating/rapidlearning/freq = 0
2.19/2.27 c
2.19/2.27 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/indoneopt/freq = -1
2.19/2.27 c
2.19/2.27 c -----------------------------------------------------------------------------------------------
2.19/2.27 c start solving
2.19/2.27 c
10.58/10.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
10.58/10.66 c 10.7s| 1 | 0 | 11576 | - | 69M| 0 | - |4220 |6667 |4220 |6667 | 0 | 0 | 0 | cutoff | -- | 0.00%
10.58/10.66 c 10.7s| 1 | 0 | 11576 | - | 69M| 0 | - |4220 |6667 |4220 |6667 | 0 | 0 | 0 | cutoff | -- | 0.00%
10.58/10.66 c
10.58/10.66 c SCIP Status : problem is solved [infeasible]
10.58/10.66 c Solving Time (sec) : 10.66
10.58/10.66 c Solving Nodes : 1
10.58/10.66 c Primal Bound : +1.00000000000000e+20 (0 solutions)
10.58/10.66 c Dual Bound : +1.00000000000000e+20
10.58/10.66 c Gap : 0.00 %
10.58/10.66 s UNSATISFIABLE
10.58/10.66 c SCIP Status : problem is solved [infeasible]
10.58/10.66 c Total Time : 10.66
10.58/10.66 c solving : 10.66
10.58/10.66 c presolving : 2.09 (included in solving)
10.58/10.66 c reading : 0.13 (included in solving)
10.58/10.66 c copying : 0.00 (0 times copied the problem)
10.58/10.66 c Original Problem :
10.58/10.66 c Problem name : HOME/instance-3690587-1338022680.opb
10.58/10.66 c Variables : 14924 (14924 binary, 0 integer, 0 implicit integer, 0 continuous)
10.58/10.66 c Constraints : 46889 initial, 46889 maximal
10.58/10.66 c Objective sense : minimize
10.58/10.66 c Presolved Problem :
10.58/10.66 c Problem name : t_HOME/instance-3690587-1338022680.opb
10.58/10.66 c Variables : 4220 (4220 binary, 0 integer, 0 implicit integer, 0 continuous)
10.58/10.66 c Constraints : 6667 initial, 6667 maximal
10.58/10.66 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
10.58/10.66 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c trivial : 0.01 0.00 488 0 0 0 0 0 0 0 0
10.58/10.66 c dualfix : 0.01 0.00 83 0 0 0 0 0 0 0 0
10.58/10.66 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c gateextraction : 0.02 0.00 0 0 0 0 0 5906 1874 0 0
10.58/10.66 c implics : 0.02 0.00 0 12 0 0 0 0 0 0 0
10.58/10.66 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c knapsack : 0.04 0.00 0 0 0 0 0 0 0 15 63
10.58/10.66 c setppc : 0.07 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c and : 0.01 0.00 0 0 0 0 0 1590 1590 0 0
10.58/10.66 c linear : 1.70 0.00 7478 2643 0 7966 0 36190 0 84 70
10.58/10.66 c logicor : 0.03 0.00 0 0 0 0 0 0 0 0 0
10.58/10.66 c root node : - - 0 - - 0 - - - - -
10.58/10.66 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
10.58/10.66 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
10.58/10.66 c knapsack : 261 261 0 1 0 0 0 0 0 0 0 0 0
10.58/10.66 c setppc : 6392 6392 0 1 0 0 0 0 0 0 0 0 0
10.58/10.66 c logicor : 14 14 0 1 0 0 0 0 0 0 0 0 0
10.58/10.66 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
10.58/10.66 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
10.58/10.66 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c Propagators : #Propagate #ResProp Cutoffs DomReds
10.58/10.66 c rootredcost : 0 0 0 0
10.58/10.66 c pseudoobj : 0 0 0 0
10.58/10.66 c vbounds : 0 0 0 0
10.58/10.66 c redcost : 0 0 0 0
10.58/10.66 c probing : 0 0 0 0
10.58/10.66 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
10.58/10.66 c rootredcost : 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c vbounds : 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c redcost : 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c probing : 0.00 0.00 0.00 0.00 0.00
10.58/10.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.58/10.66 c propagation : 0.00 0 0 0 0.0 0 0.0 -
10.58/10.66 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
10.58/10.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.58/10.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.58/10.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.58/10.66 c applied globally : - - - 0 0.0 - - -
10.58/10.66 c applied locally : - - - 0 0.0 - - -
10.58/10.66 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
10.58/10.66 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
10.58/10.66 c clique : 0.00 0.00 0 0 0 0 0
10.58/10.66 c closecuts : 0.00 0.00 0 0 0 0 0
10.58/10.66 c cgmip : 0.00 0.00 0 0 0 0 0
10.58/10.66 c cmir : 0.00 0.00 0 0 0 0 0
10.58/10.66 c flowcover : 0.00 0.00 0 0 0 0 0
10.58/10.66 c gomory : 0.00 0.00 0 0 0 0 0
10.58/10.66 c impliedbounds : 0.00 0.00 0 0 0 0 0
10.58/10.66 c intobj : 0.00 0.00 0 0 0 0 0
10.58/10.66 c mcf : 0.00 0.00 0 0 0 0 0
10.58/10.66 c oddcycle : 0.00 0.00 0 0 0 0 0
10.58/10.66 c rapidlearning : 0.00 0.00 0 0 0 0 0
10.58/10.66 c strongcg : 0.00 0.00 0 0 0 0 0
10.58/10.66 c zerohalf : 0.00 0.00 0 0 0 0 0
10.58/10.66 c Pricers : ExecTime SetupTime Calls Vars
10.58/10.66 c problem variables: 0.00 - 0 0
10.58/10.66 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
10.58/10.66 c pscost : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c inference : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c mostinf : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c leastinf : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c fullstrong : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c random : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c relpscost : 0.00 0.00 0 0 0 0 0 0
10.58/10.66 c Primal Heuristics : ExecTime SetupTime Calls Found
10.58/10.66 c LP solutions : 0.00 - - 0
10.58/10.66 c pseudo solutions : 0.00 - - 0
10.58/10.66 c smallcard : 0.00 0.00 0 0
10.58/10.66 c trivial : 0.01 0.00 1 0
10.58/10.66 c shiftandpropagate: 0.00 0.00 0 0
10.58/10.66 c simplerounding : 0.00 0.00 0 0
10.58/10.66 c zirounding : 0.00 0.00 0 0
10.58/10.66 c rounding : 0.00 0.00 0 0
10.58/10.66 c shifting : 0.00 0.00 0 0
10.58/10.66 c intshifting : 0.00 0.00 0 0
10.58/10.66 c oneopt : 0.00 0.00 0 0
10.58/10.66 c twoopt : 0.00 0.00 0 0
10.58/10.66 c indtwoopt : 0.00 0.00 0 0
10.58/10.66 c indoneopt : 0.00 0.00 0 0
10.58/10.66 c fixandinfer : 0.00 0.00 0 0
10.58/10.66 c feaspump : 0.00 0.00 0 0
10.58/10.66 c clique : 0.00 0.00 0 0
10.58/10.66 c indrounding : 0.00 0.00 0 0
10.58/10.66 c indcoefdiving : 0.00 0.00 0 0
10.58/10.66 c coefdiving : 0.00 0.00 0 0
10.58/10.66 c pscostdiving : 0.00 0.00 0 0
10.58/10.66 c nlpdiving : 0.00 0.00 0 0
10.58/10.66 c fracdiving : 0.00 0.00 0 0
10.58/10.66 c veclendiving : 0.00 0.00 0 0
10.58/10.66 c intdiving : 0.00 0.00 0 0
10.58/10.66 c actconsdiving : 0.00 0.00 0 0
10.58/10.66 c objpscostdiving : 0.00 0.00 0 0
10.58/10.66 c rootsoldiving : 0.00 0.00 0 0
10.58/10.66 c linesearchdiving : 0.00 0.00 0 0
10.58/10.66 c guideddiving : 0.00 0.00 0 0
10.58/10.66 c octane : 0.00 0.00 0 0
10.58/10.66 c rens : 0.00 0.00 0 0
10.58/10.66 c rins : 0.00 0.00 0 0
10.58/10.66 c localbranching : 0.00 0.00 0 0
10.58/10.66 c mutation : 0.00 0.00 0 0
10.58/10.66 c crossover : 0.00 0.00 0 0
10.58/10.66 c dins : 0.00 0.00 0 0
10.58/10.66 c vbounds : 0.00 0.00 0 0
10.58/10.66 c undercover : 0.00 0.00 0 0
10.58/10.66 c subnlp : 0.00 0.00 0 0
10.58/10.66 c trysol : 0.00 0.00 0 0
10.58/10.66 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
10.58/10.66 c primal LP : 0.00 0 0 0.00 - 0.00 0
10.58/10.66 c dual LP : 8.37 1 11576 11576.00 1382.31 0.00 0
10.58/10.66 c lex dual LP : 0.00 0 0 0.00 -
10.58/10.66 c barrier LP : 0.00 0 0 0.00 - 0.00 0
10.58/10.66 c diving/probing LP: 0.00 0 0 0.00 -
10.58/10.66 c strong branching : 0.00 0 0 0.00 -
10.58/10.66 c (at root node) : - 0 0 0.00 -
10.58/10.66 c conflict analysis: 0.00 0 0 0.00 -
10.58/10.66 c B&B Tree :
10.58/10.66 c number of runs : 1
10.58/10.66 c nodes : 1
10.58/10.66 c nodes (total) : 1
10.58/10.66 c nodes left : 0
10.58/10.66 c max depth : 0
10.58/10.66 c max depth (total): 0
10.58/10.66 c backtracks : 0 (0.0%)
10.58/10.66 c delayed cutoffs : 0
10.58/10.66 c repropagations : 0 (0 domain reductions, 0 cutoffs)
10.58/10.66 c avg switch length: 2.00
10.58/10.66 c switching time : 0.00
10.58/10.66 c Solution :
10.58/10.66 c Solutions found : 0 (0 improvements)
10.58/10.66 c Primal Bound : infeasible
10.58/10.66 c Dual Bound : -
10.58/10.66 c Gap : 0.00 %
10.58/10.66 c Root Dual Bound : -
10.58/10.66 c Root Iterations : 11576
10.68/10.73 c Time complete: 10.72.