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