0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3489654-1307791278.opb>
0.29/0.32 c original problem has 17836 variables (17836 bin, 0 int, 0 impl, 0 cont) and 61428 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.43 c presolving:
1.79/1.83 c (round 1) 5966 del vars, 17283 del conss, 0 add conss, 4657 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 3313636 impls, 0 clqs
2.30/2.33 c (round 2) 11541 del vars, 38887 del conss, 0 add conss, 9863 chg bounds, 7 chg sides, 7 chg coeffs, 0 upgd conss, 3347439 impls, 0 clqs
2.30/2.39 c (round 3) 13344 del vars, 47830 del conss, 0 add conss, 10988 chg bounds, 119 chg sides, 112 chg coeffs, 0 upgd conss, 3356848 impls, 0 clqs
2.40/2.42 c (round 4) 14157 del vars, 50851 del conss, 0 add conss, 11542 chg bounds, 209 chg sides, 206 chg coeffs, 0 upgd conss, 3363702 impls, 0 clqs
2.40/2.44 c (round 5) 14687 del vars, 52745 del conss, 0 add conss, 11889 chg bounds, 256 chg sides, 262 chg coeffs, 0 upgd conss, 3369059 impls, 0 clqs
2.40/2.44 c presolving (6 rounds):
2.40/2.44 c 14800 deleted vars, 53280 deleted constraints, 0 added constraints, 11950 tightened bounds, 0 added holes, 257 changed sides, 263 changed coefficients
2.40/2.44 c 3370393 implications, 0 cliques
2.40/2.44 c presolving detected infeasibility
2.40/2.44 c Presolving Time: 2.04
2.40/2.44 c - non default parameters ----------------------------------------------------------------------
2.40/2.44 c # SCIP version 2.0.1.5
2.40/2.44 c
2.40/2.44 c # frequency for displaying node information lines
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 100]
2.40/2.44 c display/freq = 10000
2.40/2.44 c
2.40/2.44 c # maximal time in seconds to run
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.40/2.44 c limits/time = 1797
2.40/2.44 c
2.40/2.44 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.40/2.44 c limits/memory = 13950
2.40/2.44 c
2.40/2.44 c # solving stops, if the given number of solutions were found (-1: no limit)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: -1]
2.40/2.44 c limits/solutions = 1
2.40/2.44 c
2.40/2.44 c # maximal number of separation rounds per node (-1: unlimited)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 5]
2.40/2.44 c separating/maxrounds = 1
2.40/2.44 c
2.40/2.44 c # maximal number of separation rounds in the root node (-1: unlimited)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: -1]
2.40/2.44 c separating/maxroundsroot = 5
2.40/2.44 c
2.40/2.44 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.40/2.44 c # [type: int, range: [1,2], default: 1]
2.40/2.44 c timing/clocktype = 2
2.40/2.44 c
2.40/2.44 c # belongs reading time to solving time?
2.40/2.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.40/2.44 c timing/reading = TRUE
2.40/2.44 c
2.40/2.44 c # should presolving try to simplify inequalities
2.40/2.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.40/2.44 c constraints/linear/simplifyinequalities = TRUE
2.40/2.44 c
2.40/2.44 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.40/2.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.40/2.44 c constraints/indicator/addCouplingCons = TRUE
2.40/2.44 c
2.40/2.44 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.40/2.44 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.40/2.44 c constraints/knapsack/disaggregation = FALSE
2.40/2.44 c
2.40/2.44 c # should presolving try to simplify knapsacks
2.40/2.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.40/2.44 c constraints/knapsack/simplifyinequalities = TRUE
2.40/2.44 c
2.40/2.44 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: -1]
2.40/2.44 c presolving/probing/maxrounds = 0
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/coefdiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/coefdiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/coefdiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 30]
2.40/2.44 c heuristics/crossover/freq = -1
2.40/2.44 c
2.40/2.44 c # number of nodes added to the contingent of the total nodes
2.40/2.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.40/2.44 c heuristics/crossover/nodesofs = 750
2.40/2.44 c
2.40/2.44 c # number of nodes without incumbent change that heuristic should wait
2.40/2.44 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.40/2.44 c heuristics/crossover/nwaitingnodes = 100
2.40/2.44 c
2.40/2.44 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.40/2.44 c # [type: real, range: [0,1], default: 0.1]
2.40/2.44 c heuristics/crossover/nodesquot = 0.15
2.40/2.44 c
2.40/2.44 c # minimum percentage of integer variables that have to be fixed
2.40/2.44 c # [type: real, range: [0,1], default: 0.666]
2.40/2.44 c heuristics/crossover/minfixingrate = 0.5
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 20]
2.40/2.44 c heuristics/feaspump/freq = -1
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/feaspump/maxlpiterofs = 2000
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/fracdiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/fracdiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/fracdiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/guideddiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/guideddiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/guideddiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/intdiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/intshifting/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/linesearchdiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 20]
2.40/2.44 c heuristics/objpscostdiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to total iteration number
2.40/2.44 c # [type: real, range: [0,1], default: 0.01]
2.40/2.44 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/oneopt/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/pscostdiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/pscostdiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c heuristics/rens/freq = -1
2.40/2.44 c
2.40/2.44 c # minimum percentage of integer variables that have to be fixable
2.40/2.44 c # [type: real, range: [0,1], default: 0.5]
2.40/2.44 c heuristics/rens/minfixingrate = 0.3
2.40/2.44 c
2.40/2.44 c # number of nodes added to the contingent of the total nodes
2.40/2.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.40/2.44 c heuristics/rens/nodesofs = 2000
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 20]
2.40/2.44 c heuristics/rootsoldiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.40/2.44 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/rounding/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c heuristics/shiftandpropagate/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/shifting/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/simplerounding/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/subnlp/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c heuristics/trivial/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/trysol/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c heuristics/undercover/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 10]
2.40/2.44 c heuristics/veclendiving/freq = -1
2.40/2.44 c
2.40/2.44 c # maximal fraction of diving LP iterations compared to node LP iterations
2.40/2.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.40/2.44 c heuristics/veclendiving/maxlpiterquot = 0.075
2.40/2.44 c
2.40/2.44 c # additional number of allowed LP iterations
2.40/2.44 c # [type: int, range: [0,2147483647], default: 1000]
2.40/2.44 c heuristics/veclendiving/maxlpiterofs = 1500
2.40/2.44 c
2.40/2.44 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 1]
2.40/2.44 c heuristics/zirounding/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c separating/cmir/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: 0]
2.40/2.44 c separating/flowcover/freq = -1
2.40/2.44 c
2.40/2.44 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.40/2.44 c # [type: int, range: [-1,2147483647], default: -1]
2.40/2.44 c separating/rapidlearning/freq = 0
2.40/2.44 c
2.40/2.44 c -----------------------------------------------------------------------------------------------
2.40/2.44 c start solving
2.40/2.44 c
2.40/2.44 c SCIP Status : problem is solved [infeasible]
2.40/2.44 c Solving Time (sec) : 2.44
2.40/2.44 c Solving Nodes : 0
2.40/2.44 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.40/2.44 c Dual Bound : -1.00000000000000e+20
2.40/2.44 c Gap : infinite
2.40/2.44 s UNSATISFIABLE
2.40/2.44 c SCIP Status : problem is solved [infeasible]
2.40/2.44 c Total Time : 2.44
2.40/2.44 c solving : 2.44
2.40/2.44 c presolving : 2.04 (included in solving)
2.40/2.44 c reading : 0.32 (included in solving)
2.40/2.44 c Original Problem :
2.40/2.44 c Problem name : HOME/instance-3489654-1307791278.opb
2.40/2.44 c Variables : 17836 (17836 binary, 0 integer, 0 implicit integer, 0 continuous)
2.40/2.44 c Constraints : 61428 initial, 61428 maximal
2.40/2.44 c Presolved Problem :
2.40/2.44 c Problem name : t_HOME/instance-3489654-1307791278.opb
2.40/2.44 c Variables : 3036 (3036 binary, 0 integer, 0 implicit integer, 0 continuous)
2.40/2.44 c Constraints : 8148 initial, 8148 maximal
2.40/2.44 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.40/2.44 c trivial : 0.00 490 0 0 0 0 0 0 0 0
2.40/2.44 c dualfix : 0.01 89 0 0 0 0 0 0 0 0
2.40/2.44 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.40/2.44 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.40/2.44 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
2.40/2.44 c implics : 0.01 0 0 0 0 0 0 0 0 0
2.40/2.44 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.40/2.44 c linear : 1.95 11458 2763 0 11950 0 53280 0 257 263
2.40/2.44 c root node : - 0 - - 0 - - - - -
2.40/2.44 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.40/2.44 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
2.40/2.44 c linear : 8148 0 0 0 0 0 0 0 0 0 0 0
2.40/2.44 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
2.40/2.44 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.40/2.44 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.40/2.44 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.40/2.44 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.40/2.44 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.40/2.44 c pseudoobj : 0 0 0 0
2.40/2.44 c rootredcost : 0 0 0 0
2.40/2.44 c vbounds : 0 0 0 0
2.40/2.44 c Propagator Timings : TotalTime Propagate Resprop
2.40/2.44 c pseudoobj : 0.00 0.00 0.00
2.40/2.44 c rootredcost : 0.00 0.00 0.00
2.40/2.44 c vbounds : 0.00 0.00 0.00
2.40/2.44 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.40/2.44 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.40/2.44 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.40/2.44 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.40/2.44 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.40/2.44 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.40/2.44 c applied globally : - - - 0 0.0 - - -
2.40/2.44 c applied locally : - - - 0 0.0 - - -
2.40/2.44 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.40/2.44 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.40/2.44 c redcost : 0.00 0 0 0 0 0
2.40/2.44 c impliedbounds : 0.00 0 0 0 0 0
2.40/2.44 c intobj : 0.00 0 0 0 0 0
2.40/2.44 c gomory : 0.00 0 0 0 0 0
2.40/2.44 c cgmip : 0.00 0 0 0 0 0
2.40/2.44 c closecuts : 0.00 0 0 0 0 0
2.40/2.44 c strongcg : 0.00 0 0 0 0 0
2.40/2.44 c cmir : 0.00 0 0 0 0 0
2.40/2.44 c flowcover : 0.00 0 0 0 0 0
2.40/2.44 c clique : 0.00 0 0 0 0 0
2.40/2.44 c zerohalf : 0.00 0 0 0 0 0
2.40/2.44 c mcf : 0.00 0 0 0 0 0
2.40/2.44 c oddcycle : 0.00 0 0 0 0 0
2.40/2.44 c rapidlearning : 0.00 0 0 0 0 0
2.40/2.44 c Pricers : Time Calls Vars
2.40/2.44 c problem variables: 0.00 0 0
2.40/2.44 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.40/2.44 c pscost : 0.00 0 0 0 0 0 0
2.40/2.44 c inference : 0.00 0 0 0 0 0 0
2.40/2.44 c mostinf : 0.00 0 0 0 0 0 0
2.40/2.44 c leastinf : 0.00 0 0 0 0 0 0
2.40/2.44 c fullstrong : 0.00 0 0 0 0 0 0
2.40/2.44 c allfullstrong : 0.00 0 0 0 0 0 0
2.40/2.44 c random : 0.00 0 0 0 0 0 0
2.40/2.44 c relpscost : 0.00 0 0 0 0 0 0
2.40/2.44 c Primal Heuristics : Time Calls Found
2.40/2.44 c LP solutions : 0.00 - 0
2.40/2.44 c pseudo solutions : 0.00 - 0
2.40/2.44 c trivial : 0.01 1 0
2.40/2.44 c shiftandpropagate: 0.00 0 0
2.40/2.44 c simplerounding : 0.00 0 0
2.40/2.44 c zirounding : 0.00 0 0
2.40/2.44 c rounding : 0.00 0 0
2.40/2.44 c shifting : 0.00 0 0
2.40/2.44 c intshifting : 0.00 0 0
2.40/2.44 c oneopt : 0.00 0 0
2.40/2.44 c twoopt : 0.00 0 0
2.40/2.44 c fixandinfer : 0.00 0 0
2.40/2.44 c feaspump : 0.00 0 0
2.40/2.44 c clique : 0.00 0 0
2.40/2.44 c coefdiving : 0.00 0 0
2.40/2.44 c pscostdiving : 0.00 0 0
2.40/2.44 c fracdiving : 0.00 0 0
2.40/2.44 c veclendiving : 0.00 0 0
2.40/2.44 c intdiving : 0.00 0 0
2.40/2.44 c actconsdiving : 0.00 0 0
2.40/2.44 c objpscostdiving : 0.00 0 0
2.40/2.44 c rootsoldiving : 0.00 0 0
2.40/2.44 c linesearchdiving : 0.00 0 0
2.40/2.44 c guideddiving : 0.00 0 0
2.40/2.44 c octane : 0.00 0 0
2.40/2.44 c rens : 0.00 0 0
2.40/2.44 c rins : 0.00 0 0
2.40/2.44 c localbranching : 0.00 0 0
2.40/2.44 c mutation : 0.00 0 0
2.40/2.44 c crossover : 0.00 0 0
2.40/2.44 c dins : 0.00 0 0
2.40/2.44 c vbounds : 0.00 0 0
2.40/2.44 c undercover : 0.00 0 0
2.40/2.44 c subnlp : 0.00 0 0
2.40/2.44 c trysol : 0.00 0 0
2.40/2.44 c LP : Time Calls Iterations Iter/call Iter/sec
2.40/2.44 c primal LP : 0.00 0 0 0.00 -
2.40/2.44 c dual LP : 0.00 0 0 0.00 -
2.40/2.44 c lex dual LP : 0.00 0 0 0.00 -
2.40/2.44 c barrier LP : 0.00 0 0 0.00 -
2.40/2.44 c diving/probing LP: 0.00 0 0 0.00 -
2.40/2.44 c strong branching : 0.00 0 0 0.00 -
2.40/2.44 c (at root node) : - 0 0 0.00 -
2.40/2.44 c conflict analysis: 0.00 0 0 0.00 -
2.40/2.44 c B&B Tree :
2.40/2.44 c number of runs : 1
2.40/2.44 c nodes : 0
2.40/2.44 c nodes (total) : 0
2.40/2.44 c nodes left : 1
2.40/2.44 c max depth : -1
2.40/2.44 c max depth (total): -1
2.40/2.44 c backtracks : 0 (0.0%)
2.40/2.44 c delayed cutoffs : 0
2.40/2.44 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.40/2.44 c avg switch length: 0.00
2.40/2.44 c switching time : 0.00
2.40/2.44 c Solution :
2.40/2.44 c Solutions found : 0 (0 improvements)
2.40/2.44 c Primal Bound : infeasible
2.40/2.44 c Dual Bound : -
2.40/2.44 c Gap : infinite
2.40/2.44 c Root Dual Bound : -
2.40/2.44 c Root Iterations : 0
2.49/2.50 c Time complete: 2.49.