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-3730613-1338689995.opb>
0.29/0.34 c original problem has 19944 variables (19944 bin, 0 int, 0 impl, 0 cont) and 50842 constraints
0.29/0.34 c problem read
0.29/0.34 c No objective function, only one solution is needed.
0.29/0.34 c presolving settings loaded
0.38/0.46 c presolving:
0.79/0.82 c (round 1) 297 del vars, 1 del conss, 0 add conss, 1 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
0.79/0.84 c (round 2) 299 del vars, 596 del conss, 0 add conss, 3 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
0.79/0.85 c (round 3) 303 del vars, 604 del conss, 0 add conss, 7 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
0.79/0.86 c presolving (4 rounds):
0.79/0.86 c 422 deleted vars, 841 deleted constraints, 0 added constraints, 126 tightened bounds, 0 added holes, 3472 changed sides, 6944 changed coefficients
0.79/0.86 c 863698 implications, 0 cliques
0.79/0.86 c presolving detected infeasibility
0.79/0.86 c Presolving Time: 0.43
0.79/0.86 c - non default parameters ----------------------------------------------------------------------
0.79/0.86 c # SCIP version 2.0.1.5
0.79/0.86 c
0.79/0.86 c # frequency for displaying node information lines
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 100]
0.79/0.86 c display/freq = 10000
0.79/0.86 c
0.79/0.86 c # maximal time in seconds to run
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.86 c limits/time = 1797
0.79/0.86 c
0.79/0.86 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.86 c limits/memory = 13950
0.79/0.86 c
0.79/0.86 c # solving stops, if the given number of solutions were found (-1: no limit)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c limits/solutions = 1
0.79/0.86 c
0.79/0.86 c # maximal number of separation rounds per node (-1: unlimited)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 5]
0.79/0.86 c separating/maxrounds = 1
0.79/0.86 c
0.79/0.86 c # maximal number of separation rounds in the root node (-1: unlimited)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c separating/maxroundsroot = 5
0.79/0.86 c
0.79/0.86 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.79/0.86 c # [type: int, range: [1,2], default: 1]
0.79/0.86 c timing/clocktype = 2
0.79/0.86 c
0.79/0.86 c # belongs reading time to solving time?
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.86 c timing/reading = TRUE
0.79/0.86 c
0.79/0.86 c # should presolving try to simplify inequalities
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.86 c constraints/linear/simplifyinequalities = TRUE
0.79/0.86 c
0.79/0.86 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.86 c constraints/indicator/addCouplingCons = TRUE
0.79/0.86 c
0.79/0.86 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.79/0.86 c constraints/knapsack/disaggregation = FALSE
0.79/0.86 c
0.79/0.86 c # should presolving try to simplify knapsacks
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.86 c constraints/knapsack/simplifyinequalities = TRUE
0.79/0.86 c
0.79/0.86 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c presolving/probing/maxrounds = 0
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/coefdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/coefdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/coefdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 30]
0.79/0.86 c heuristics/crossover/freq = -1
0.79/0.86 c
0.79/0.86 c # number of nodes added to the contingent of the total nodes
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.86 c heuristics/crossover/nodesofs = 750
0.79/0.86 c
0.79/0.86 c # number of nodes without incumbent change that heuristic should wait
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.79/0.86 c heuristics/crossover/nwaitingnodes = 100
0.79/0.86 c
0.79/0.86 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.79/0.86 c # [type: real, range: [0,1], default: 0.1]
0.79/0.86 c heuristics/crossover/nodesquot = 0.15
0.79/0.86 c
0.79/0.86 c # minimum percentage of integer variables that have to be fixed
0.79/0.86 c # [type: real, range: [0,1], default: 0.666]
0.79/0.86 c heuristics/crossover/minfixingrate = 0.5
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/feaspump/freq = -1
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/feaspump/maxlpiterofs = 2000
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/fracdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/fracdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/fracdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/guideddiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/guideddiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/guideddiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/intdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/intshifting/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/linesearchdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/objpscostdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to total iteration number
0.79/0.86 c # [type: real, range: [0,1], default: 0.01]
0.79/0.86 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/oneopt/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/pscostdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/pscostdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/rens/freq = -1
0.79/0.86 c
0.79/0.86 c # minimum percentage of integer variables that have to be fixable
0.79/0.86 c # [type: real, range: [0,1], default: 0.5]
0.79/0.86 c heuristics/rens/minfixingrate = 0.3
0.79/0.86 c
0.79/0.86 c # number of nodes added to the contingent of the total nodes
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.86 c heuristics/rens/nodesofs = 2000
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/rootsoldiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.79/0.86 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/rounding/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/shiftandpropagate/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/shifting/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/simplerounding/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/subnlp/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/trivial/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/trysol/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/undercover/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/veclendiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/veclendiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/veclendiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/zirounding/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c separating/cmir/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c separating/flowcover/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c separating/rapidlearning/freq = 0
0.79/0.86 c
0.79/0.86 c -----------------------------------------------------------------------------------------------
0.79/0.86 c start solving
0.79/0.86 c
0.79/0.86 c SCIP Status : problem is solved [infeasible]
0.79/0.86 c Solving Time (sec) : 0.86
0.79/0.86 c Solving Nodes : 0
0.79/0.86 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.79/0.86 c Dual Bound : -1.00000000000000e+20
0.79/0.86 c Gap : infinite
0.79/0.86 s UNSATISFIABLE
0.79/0.86 c SCIP Status : problem is solved [infeasible]
0.79/0.86 c Total Time : 0.86
0.79/0.86 c solving : 0.86
0.79/0.86 c presolving : 0.43 (included in solving)
0.79/0.86 c reading : 0.34 (included in solving)
0.79/0.86 c Original Problem :
0.79/0.86 c Problem name : HOME/instance-3730613-1338689995.opb
0.79/0.86 c Variables : 19944 (19944 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.86 c Constraints : 50842 initial, 50842 maximal
0.79/0.86 c Presolved Problem :
0.79/0.86 c Problem name : t_HOME/instance-3730613-1338689995.opb
0.79/0.86 c Variables : 19522 (19522 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.86 c Constraints : 50001 initial, 50001 maximal
0.79/0.86 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.79/0.86 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c implics : 0.03 0 296 0 0 0 0 0 0 0
0.79/0.86 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.86 c linear : 0.36 126 0 0 126 0 841 0 3472 6944
0.79/0.86 c root node : - 0 - - 0 - - - - -
0.79/0.86 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.79/0.86 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
0.79/0.86 c linear : 50001 0 0 0 0 0 0 0 0 0 0 0
0.79/0.86 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.79/0.86 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.79/0.86 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.86 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.86 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.86 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.79/0.86 c pseudoobj : 0 0 0 0
0.79/0.86 c rootredcost : 0 0 0 0
0.79/0.86 c vbounds : 0 0 0 0
0.79/0.86 c Propagator Timings : TotalTime Propagate Resprop
0.79/0.86 c pseudoobj : 0.00 0.00 0.00
0.79/0.86 c rootredcost : 0.00 0.00 0.00
0.79/0.86 c vbounds : 0.00 0.00 0.00
0.79/0.86 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.86 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.86 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.86 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.86 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.86 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.86 c applied globally : - - - 0 0.0 - - -
0.79/0.86 c applied locally : - - - 0 0.0 - - -
0.79/0.86 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.86 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.86 c redcost : 0.00 0 0 0 0 0
0.79/0.86 c impliedbounds : 0.00 0 0 0 0 0
0.79/0.86 c intobj : 0.00 0 0 0 0 0
0.79/0.86 c gomory : 0.00 0 0 0 0 0
0.79/0.86 c cgmip : 0.00 0 0 0 0 0
0.79/0.86 c closecuts : 0.00 0 0 0 0 0
0.79/0.86 c strongcg : 0.00 0 0 0 0 0
0.79/0.86 c cmir : 0.00 0 0 0 0 0
0.79/0.86 c flowcover : 0.00 0 0 0 0 0
0.79/0.86 c clique : 0.00 0 0 0 0 0
0.79/0.86 c zerohalf : 0.00 0 0 0 0 0
0.79/0.86 c mcf : 0.00 0 0 0 0 0
0.79/0.86 c oddcycle : 0.00 0 0 0 0 0
0.79/0.86 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.86 c Pricers : Time Calls Vars
0.79/0.86 c problem variables: 0.00 0 0
0.79/0.86 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.86 c pscost : 0.00 0 0 0 0 0 0
0.79/0.86 c inference : 0.00 0 0 0 0 0 0
0.79/0.86 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.86 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.86 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.86 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.86 c random : 0.00 0 0 0 0 0 0
0.79/0.86 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.86 c Primal Heuristics : Time Calls Found
0.79/0.86 c LP solutions : 0.00 - 0
0.79/0.86 c pseudo solutions : 0.00 - 0
0.79/0.86 c trivial : 0.01 1 0
0.79/0.86 c shiftandpropagate: 0.00 0 0
0.79/0.86 c simplerounding : 0.00 0 0
0.79/0.86 c zirounding : 0.00 0 0
0.79/0.86 c rounding : 0.00 0 0
0.79/0.86 c shifting : 0.00 0 0
0.79/0.86 c intshifting : 0.00 0 0
0.79/0.86 c oneopt : 0.00 0 0
0.79/0.86 c twoopt : 0.00 0 0
0.79/0.86 c fixandinfer : 0.00 0 0
0.79/0.86 c feaspump : 0.00 0 0
0.79/0.86 c clique : 0.00 0 0
0.79/0.86 c coefdiving : 0.00 0 0
0.79/0.86 c pscostdiving : 0.00 0 0
0.79/0.86 c fracdiving : 0.00 0 0
0.79/0.86 c veclendiving : 0.00 0 0
0.79/0.86 c intdiving : 0.00 0 0
0.79/0.86 c actconsdiving : 0.00 0 0
0.79/0.86 c objpscostdiving : 0.00 0 0
0.79/0.86 c rootsoldiving : 0.00 0 0
0.79/0.86 c linesearchdiving : 0.00 0 0
0.79/0.86 c guideddiving : 0.00 0 0
0.79/0.86 c octane : 0.00 0 0
0.79/0.86 c rens : 0.00 0 0
0.79/0.86 c rins : 0.00 0 0
0.79/0.86 c localbranching : 0.00 0 0
0.79/0.86 c mutation : 0.00 0 0
0.79/0.86 c crossover : 0.00 0 0
0.79/0.86 c dins : 0.00 0 0
0.79/0.86 c vbounds : 0.00 0 0
0.79/0.86 c undercover : 0.00 0 0
0.79/0.86 c subnlp : 0.00 0 0
0.79/0.86 c trysol : 0.00 0 0
0.79/0.86 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.86 c primal LP : 0.00 0 0 0.00 -
0.79/0.86 c dual LP : 0.00 0 0 0.00 -
0.79/0.86 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.86 c barrier LP : 0.00 0 0 0.00 -
0.79/0.86 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.86 c strong branching : 0.00 0 0 0.00 -
0.79/0.86 c (at root node) : - 0 0 0.00 -
0.79/0.86 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.86 c B&B Tree :
0.79/0.86 c number of runs : 1
0.79/0.86 c nodes : 0
0.79/0.86 c nodes (total) : 0
0.79/0.86 c nodes left : 1
0.79/0.86 c max depth : -1
0.79/0.86 c max depth (total): -1
0.79/0.86 c backtracks : 0 (0.0%)
0.79/0.86 c delayed cutoffs : 0
0.79/0.86 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.86 c avg switch length: 0.00
0.79/0.86 c switching time : 0.00
0.79/0.86 c Solution :
0.79/0.86 c Solutions found : 0 (0 improvements)
0.79/0.86 c Primal Bound : infeasible
0.79/0.86 c Dual Bound : -
0.79/0.86 c Gap : infinite
0.79/0.86 c Root Dual Bound : -
0.79/0.86 c Root Iterations : 0
0.89/0.96 c Time complete: 0.96.