0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-3739865-1338732284.opb>
0.29/0.32 c original problem has 14924 variables (14924 bin, 0 int, 0 impl, 0 cont) and 46889 constraints
0.29/0.32 c problem read
0.29/0.32 c No objective function, only one solution is needed.
0.29/0.32 c presolving settings loaded
0.39/0.41 c presolving:
1.29/1.32 c (round 1) 3476 del vars, 9809 del conss, 2369 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2562450 impls, 0 clqs
1.59/1.65 c (round 2) 7897 del vars, 25310 del conss, 6358 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2586217 impls, 0 clqs
1.69/1.70 c (round 3) 9069 del vars, 30738 del conss, 7024 chg bounds, 47 chg sides, 38 chg coeffs, 0 upgd conss, 2593541 impls, 0 clqs
1.69/1.72 c (round 4) 9689 del vars, 32757 del conss, 7376 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2599224 impls, 0 clqs
1.69/1.74 c (round 5) 10074 del vars, 34022 del conss, 7621 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2603341 impls, 0 clqs
1.69/1.75 c (round 6) 10325 del vars, 34811 del conss, 7758 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2606579 impls, 0 clqs
1.69/1.76 c (round 7) 10530 del vars, 35527 del conss, 7886 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2608615 impls, 0 clqs
1.69/1.77 c (round 8) 10621 del vars, 35865 del conss, 7934 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2609367 impls, 0 clqs
1.69/1.77 c (round 9) 10677 del vars, 36053 del conss, 7954 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2611109 impls, 0 clqs
1.69/1.78 c (round 10) 10695 del vars, 36145 del conss, 7963 chg bounds, 80 chg sides, 67 chg coeffs, 0 upgd conss, 2611243 impls, 0 clqs
1.69/1.78 c (round 11) 10701 del vars, 36176 del conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611255 impls, 0 clqs
1.69/1.78 c (round 12) 10704 del vars, 36189 del conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611269 impls, 0 clqs
1.79/1.82 c (round 13) 10704 del vars, 36190 del conss, 7966 chg bounds, 84 chg sides, 70 chg coeffs, 10699 upgd conss, 2611269 impls, 0 clqs
1.79/1.86 c (round 14) 10704 del vars, 36190 del conss, 7966 chg bounds, 95 chg sides, 111 chg coeffs, 10699 upgd conss, 2611409 impls, 100 clqs
1.79/1.89 c presolving (15 rounds):
1.79/1.89 c 10704 deleted vars, 36190 deleted constraints, 7966 tightened bounds, 0 added holes, 95 changed sides, 115 changed coefficients
1.79/1.89 c 2611409 implications, 102 cliques
1.79/1.89 c presolved problem has 4220 variables (4220 bin, 0 int, 0 impl, 0 cont) and 10699 constraints
1.79/1.89 c 261 constraints of type <knapsack>
1.79/1.89 c 8547 constraints of type <setppc>
1.79/1.89 c 1891 constraints of type <logicor>
1.79/1.89 c transformed objective value is always integral (scale: 1)
1.79/1.89 c Presolving Time: 1.50
1.79/1.89 c - non default parameters ----------------------------------------------------------------------
1.79/1.89 c # SCIP version 1.2.1.3
1.79/1.89 c
1.79/1.89 c # frequency for displaying node information lines
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 100]
1.79/1.89 c display/freq = 10000
1.79/1.89 c
1.79/1.89 c # maximal time in seconds to run
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.89 c limits/time = 1789.69
1.79/1.89 c
1.79/1.89 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.89 c limits/memory = 13950
1.79/1.89 c
1.79/1.89 c # solving stops, if the given number of solutions were found (-1: no limit)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c limits/solutions = 1
1.79/1.89 c
1.79/1.89 c # maximal number of separation rounds per node (-1: unlimited)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 5]
1.79/1.89 c separating/maxrounds = 1
1.79/1.89 c
1.79/1.89 c # maximal number of separation rounds in the root node (-1: unlimited)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c separating/maxroundsroot = 5
1.79/1.89 c
1.79/1.89 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.79/1.89 c # [type: int, range: [1,2], default: 1]
1.79/1.89 c timing/clocktype = 2
1.79/1.89 c
1.79/1.89 c # should presolving try to simplify inequalities
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.89 c constraints/linear/simplifyinequalities = TRUE
1.79/1.89 c
1.79/1.89 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.89 c constraints/indicator/addCouplingCons = TRUE
1.79/1.89 c
1.79/1.89 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.79/1.89 c constraints/knapsack/disaggregation = FALSE
1.79/1.89 c
1.79/1.89 c # should presolving try to simplify knapsacks
1.79/1.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.89 c constraints/knapsack/simplifyinequalities = TRUE
1.79/1.89 c
1.79/1.89 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c presolving/probing/maxrounds = 0
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/coefdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/coefdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/coefdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 30]
1.79/1.89 c heuristics/crossover/freq = -1
1.79/1.89 c
1.79/1.89 c # number of nodes added to the contingent of the total nodes
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.89 c heuristics/crossover/nodesofs = 750
1.79/1.89 c
1.79/1.89 c # number of nodes without incumbent change that heuristic should wait
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.79/1.89 c heuristics/crossover/nwaitingnodes = 100
1.79/1.89 c
1.79/1.89 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.79/1.89 c # [type: real, range: [0,1], default: 0.1]
1.79/1.89 c heuristics/crossover/nodesquot = 0.15
1.79/1.89 c
1.79/1.89 c # minimum percentage of integer variables that have to be fixed
1.79/1.89 c # [type: real, range: [0,1], default: 0.666]
1.79/1.89 c heuristics/crossover/minfixingrate = 0.5
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/feaspump/freq = -1
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/feaspump/maxlpiterofs = 2000
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/fracdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/fracdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/fracdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/guideddiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/guideddiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/guideddiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/intdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/intshifting/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/linesearchdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/nlp/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/objpscostdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to total iteration number
1.79/1.89 c # [type: real, range: [0,1], default: 0.01]
1.79/1.89 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/oneopt/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/pscostdiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/pscostdiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c heuristics/rens/freq = -1
1.79/1.89 c
1.79/1.89 c # minimum percentage of integer variables that have to be fixable
1.79/1.89 c # [type: real, range: [0,1], default: 0.5]
1.79/1.89 c heuristics/rens/minfixingrate = 0.3
1.79/1.89 c
1.79/1.89 c # number of nodes added to the contingent of the total nodes
1.79/1.89 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.89 c heuristics/rens/nodesofs = 2000
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.89 c heuristics/rootsoldiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.79/1.89 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/rounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/shifting/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/simplerounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c heuristics/trivial/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/trysol/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.89 c heuristics/veclendiving/freq = -1
1.79/1.89 c
1.79/1.89 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.89 c heuristics/veclendiving/maxlpiterquot = 0.075
1.79/1.89 c
1.79/1.89 c # additional number of allowed LP iterations
1.79/1.89 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.89 c heuristics/veclendiving/maxlpiterofs = 1500
1.79/1.89 c
1.79/1.89 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.89 c heuristics/zirounding/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c separating/cmir/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.89 c separating/flowcover/freq = -1
1.79/1.89 c
1.79/1.89 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.79/1.89 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.89 c separating/rapidlearning/freq = 0
1.79/1.89 c
1.79/1.89 c -----------------------------------------------------------------------------------------------
1.79/1.89 c start solving
1.79/1.89 c
7.29/7.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
7.29/7.34 c 7.0s| 1 | 0 | 7585 | - | 71M| 0 | - |4220 | 10k|4220 | 10k| 0 | 0 | 0 | -- | -- | 0.00%
7.29/7.34 c 7.0s| 1 | 0 | 7585 | - | 71M| 0 | - |4220 | 10k|4220 | 10k| 0 | 0 | 0 | -- | -- | 0.00%
7.29/7.34 c
7.29/7.34 c SCIP Status : problem is solved [infeasible]
7.29/7.34 c Solving Time (sec) : 7.03
7.29/7.34 c Solving Nodes : 1
7.29/7.34 c Primal Bound : +1.00000000000000e+20 (0 solutions)
7.29/7.34 c Dual Bound : +1.00000000000000e+20
7.29/7.34 c Gap : 0.00 %
7.29/7.34 s UNSATISFIABLE
7.29/7.34 c SCIP Status : problem is solved [infeasible]
7.29/7.34 c Solving Time : 7.03
7.29/7.34 c Original Problem :
7.29/7.34 c Problem name : HOME/instance-3739865-1338732284.opb
7.29/7.34 c Variables : 14924 (14924 binary, 0 integer, 0 implicit integer, 0 continuous)
7.29/7.34 c Constraints : 46889 initial, 46889 maximal
7.29/7.34 c Presolved Problem :
7.29/7.34 c Problem name : t_HOME/instance-3739865-1338732284.opb
7.29/7.34 c Variables : 4220 (4220 binary, 0 integer, 0 implicit integer, 0 continuous)
7.29/7.34 c Constraints : 10699 initial, 10699 maximal
7.29/7.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.29/7.34 c trivial : 0.01 488 0 0 0 0 0 0 0
7.29/7.34 c dualfix : 0.01 83 0 0 0 0 0 0 0
7.29/7.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.29/7.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.29/7.34 c implics : 0.02 0 12 0 0 0 0 0 0
7.29/7.34 c probing : 0.00 0 0 0 0 0 0 0 0
7.29/7.34 c knapsack : 0.03 0 0 0 0 0 0 11 45
7.29/7.34 c setppc : 0.02 0 0 0 0 0 0 0 0
7.29/7.34 c linear : 1.34 7478 2643 0 7966 0 36190 84 70
7.29/7.34 c logicor : 0.01 0 0 0 0 0 0 0 0
7.29/7.34 c root node : - 0 - - 0 - - - -
7.29/7.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.29/7.34 c integral : 0 0 0 0 0 0 0 0 0 0
7.29/7.34 c knapsack : 261 0 1 0 0 0 0 0 0 0
7.29/7.34 c setppc : 8547 0 1 0 0 0 0 0 0 0
7.29/7.34 c logicor : 1891 0 1 0 0 0 0 0 0 0
7.29/7.34 c countsols : 0 0 0 0 0 0 0 0 0 0
7.29/7.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.29/7.34 c integral : 0.00 0.00 0.00 0.00 0.00
7.29/7.34 c knapsack : 0.00 0.00 0.00 0.00 0.00
7.29/7.34 c setppc : 0.00 0.00 0.00 0.00 0.00
7.29/7.34 c logicor : 0.00 0.00 0.00 0.00 0.00
7.29/7.34 c countsols : 0.00 0.00 0.00 0.00 0.00
7.29/7.34 c Propagators : Time Calls Cutoffs DomReds
7.29/7.34 c vbounds : 0.00 1 0 0
7.29/7.34 c rootredcost : 0.00 0 0 0
7.29/7.34 c pseudoobj : 0.00 0 0 0
7.29/7.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.29/7.34 c propagation : 0.00 0 0 0 0.0 0 0.0 -
7.29/7.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
7.29/7.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.29/7.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.29/7.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.29/7.34 c applied globally : - - - 0 0.0 - - -
7.29/7.34 c applied locally : - - - 0 0.0 - - -
7.29/7.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.29/7.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
7.29/7.34 c redcost : 0.00 0 0 0 0 0
7.29/7.34 c impliedbounds : 0.00 0 0 0 0 0
7.29/7.34 c intobj : 0.00 0 0 0 0 0
7.29/7.34 c cgmip : 0.00 0 0 0 0 0
7.29/7.34 c gomory : 0.00 0 0 0 0 0
7.29/7.34 c strongcg : 0.00 0 0 0 0 0
7.29/7.34 c cmir : 0.00 0 0 0 0 0
7.29/7.34 c flowcover : 0.00 0 0 0 0 0
7.29/7.34 c clique : 0.00 0 0 0 0 0
7.29/7.34 c zerohalf : 0.00 0 0 0 0 0
7.29/7.34 c mcf : 0.00 0 0 0 0 0
7.29/7.34 c rapidlearning : 0.00 0 0 0 0 0
7.29/7.34 c Pricers : Time Calls Vars
7.29/7.34 c problem variables: 0.00 0 0
7.29/7.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.29/7.34 c pscost : 0.00 0 0 0 0 0 0
7.29/7.34 c inference : 0.00 0 0 0 0 0 0
7.29/7.34 c mostinf : 0.00 0 0 0 0 0 0
7.29/7.34 c leastinf : 0.00 0 0 0 0 0 0
7.29/7.34 c fullstrong : 0.00 0 0 0 0 0 0
7.29/7.34 c allfullstrong : 0.00 0 0 0 0 0 0
7.29/7.34 c random : 0.00 0 0 0 0 0 0
7.29/7.34 c relpscost : 0.00 0 0 0 0 0 0
7.29/7.34 c Primal Heuristics : Time Calls Found
7.29/7.34 c LP solutions : 0.00 - 0
7.29/7.34 c pseudo solutions : 0.00 - 0
7.29/7.34 c trivial : 0.01 1 0
7.29/7.34 c simplerounding : 0.00 0 0
7.29/7.34 c zirounding : 0.00 0 0
7.29/7.34 c rounding : 0.00 0 0
7.29/7.34 c shifting : 0.00 0 0
7.29/7.34 c intshifting : 0.00 0 0
7.29/7.34 c oneopt : 0.00 0 0
7.29/7.34 c twoopt : 0.00 0 0
7.29/7.34 c fixandinfer : 0.00 0 0
7.29/7.34 c feaspump : 0.00 0 0
7.29/7.34 c coefdiving : 0.00 0 0
7.29/7.34 c pscostdiving : 0.00 0 0
7.29/7.34 c fracdiving : 0.00 0 0
7.29/7.34 c veclendiving : 0.00 0 0
7.29/7.34 c intdiving : 0.00 0 0
7.29/7.34 c actconsdiving : 0.00 0 0
7.29/7.34 c objpscostdiving : 0.00 0 0
7.29/7.34 c rootsoldiving : 0.00 0 0
7.29/7.34 c linesearchdiving : 0.00 0 0
7.29/7.34 c guideddiving : 0.00 0 0
7.29/7.34 c octane : 0.00 0 0
7.29/7.34 c rens : 0.00 0 0
7.29/7.34 c rins : 0.00 0 0
7.29/7.34 c localbranching : 0.00 0 0
7.29/7.34 c mutation : 0.00 0 0
7.29/7.34 c crossover : 0.00 0 0
7.29/7.34 c dins : 0.00 0 0
7.29/7.34 c undercover : 0.00 0 0
7.29/7.34 c nlp : 0.00 0 0
7.29/7.34 c trysol : 0.00 0 0
7.29/7.34 c LP : Time Calls Iterations Iter/call Iter/sec
7.29/7.34 c primal LP : 0.00 0 0 0.00 -
7.29/7.34 c dual LP : 5.43 1 7585 7585.00 1395.86
7.29/7.34 c lex dual LP : 0.00 0 0 0.00 -
7.29/7.34 c barrier LP : 0.00 0 0 0.00 -
7.29/7.34 c diving/probing LP: 0.00 0 0 0.00 -
7.29/7.34 c strong branching : 0.00 0 0 0.00 -
7.29/7.34 c (at root node) : - 0 0 0.00 -
7.29/7.34 c conflict analysis: 0.00 0 0 0.00 -
7.29/7.34 c B&B Tree :
7.29/7.34 c number of runs : 1
7.29/7.34 c nodes : 1
7.29/7.34 c nodes (total) : 1
7.29/7.34 c nodes left : 0
7.29/7.34 c max depth : 0
7.29/7.34 c max depth (total): 0
7.29/7.34 c backtracks : 0 (0.0%)
7.29/7.34 c delayed cutoffs : 0
7.29/7.34 c repropagations : 0 (0 domain reductions, 0 cutoffs)
7.29/7.34 c avg switch length: 2.00
7.29/7.34 c switching time : 0.00
7.29/7.34 c Solution :
7.29/7.34 c Solutions found : 0 (0 improvements)
7.29/7.34 c Primal Bound : infeasible
7.29/7.34 c Dual Bound : -
7.29/7.34 c Gap : 0.00 %
7.29/7.34 c Root Dual Bound : -
7.29/7.34 c Root Iterations : 7585
7.39/7.41 c Time complete: 7.4.