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-3690562-1338022693.opb>
0.00/0.08 c original problem has 9150 variables (9150 bin, 0 int, 0 impl, 0 cont) and 28514 constraints
0.00/0.08 c problem read in 0.08
0.00/0.08 c No objective function, only one solution is needed.
0.00/0.08 c presolving settings loaded
0.09/0.17 c presolving:
0.69/0.75 c (round 1) 2455 del vars, 6607 del conss, 0 add conss, 1633 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1477968 impls, 0 clqs
0.99/1.02 c (round 2) 5590 del vars, 17067 del conss, 0 add conss, 4541 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1496064 impls, 0 clqs
0.99/1.06 c (round 3) 6440 del vars, 21095 del conss, 0 add conss, 4965 chg bounds, 63 chg sides, 48 chg coeffs, 0 upgd conss, 1501160 impls, 0 clqs
0.99/1.08 c (round 4) 6897 del vars, 22441 del conss, 0 add conss, 5275 chg bounds, 115 chg sides, 86 chg coeffs, 0 upgd conss, 1506676 impls, 0 clqs
0.99/1.10 c (round 5) 7162 del vars, 23361 del conss, 0 add conss, 5424 chg bounds, 126 chg sides, 100 chg coeffs, 0 upgd conss, 1509805 impls, 0 clqs
1.09/1.11 c (round 6) 7285 del vars, 23772 del conss, 0 add conss, 5485 chg bounds, 129 chg sides, 105 chg coeffs, 0 upgd conss, 1512135 impls, 0 clqs
1.09/1.12 c (round 7) 7396 del vars, 24041 del conss, 0 add conss, 5563 chg bounds, 133 chg sides, 111 chg coeffs, 0 upgd conss, 1512975 impls, 0 clqs
1.09/1.13 c (round 8) 7545 del vars, 24359 del conss, 0 add conss, 5637 chg bounds, 145 chg sides, 121 chg coeffs, 0 upgd conss, 1515573 impls, 1 clqs
1.09/1.13 c presolving (9 rounds):
1.09/1.13 c 7600 deleted vars, 24576 deleted constraints, 0 added constraints, 5665 tightened bounds, 0 added holes, 153 changed sides, 129 changed coefficients
1.09/1.13 c 1516290 implications, 1 cliques
1.09/1.13 c presolving detected infeasibility
1.09/1.13 c Presolving Time: 1.02
1.09/1.13 c - non default parameters ----------------------------------------------------------------------
1.09/1.13 c # SCIP version 2.1.1.4
1.09/1.13 c
1.09/1.13 c # maximal time in seconds to run
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.09/1.13 c limits/time = 1797
1.09/1.13 c
1.09/1.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.09/1.13 c limits/memory = 13950
1.09/1.13 c
1.09/1.13 c # solving stops, if the given number of solutions were found (-1: no limit)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: -1]
1.09/1.13 c limits/solutions = 1
1.09/1.13 c
1.09/1.13 c # maximal number of separation rounds per node (-1: unlimited)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 5]
1.09/1.13 c separating/maxrounds = 1
1.09/1.13 c
1.09/1.13 c # maximal number of separation rounds in the root node (-1: unlimited)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: -1]
1.09/1.13 c separating/maxroundsroot = 5
1.09/1.13 c
1.09/1.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.09/1.13 c # [type: int, range: [1,2], default: 1]
1.09/1.13 c timing/clocktype = 2
1.09/1.13 c
1.09/1.13 c # belongs reading time to solving time?
1.09/1.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.09/1.13 c timing/reading = TRUE
1.09/1.13 c
1.09/1.13 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.09/1.13 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.09/1.13 c constraints/knapsack/disaggregation = FALSE
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/coefdiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/coefdiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/coefdiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 30]
1.09/1.13 c heuristics/crossover/freq = -1
1.09/1.13 c
1.09/1.13 c # number of nodes added to the contingent of the total nodes
1.09/1.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.09/1.13 c heuristics/crossover/nodesofs = 750
1.09/1.13 c
1.09/1.13 c # number of nodes without incumbent change that heuristic should wait
1.09/1.13 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.09/1.13 c heuristics/crossover/nwaitingnodes = 100
1.09/1.13 c
1.09/1.13 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.09/1.13 c # [type: real, range: [0,1], default: 0.1]
1.09/1.13 c heuristics/crossover/nodesquot = 0.15
1.09/1.13 c
1.09/1.13 c # minimum percentage of integer variables that have to be fixed
1.09/1.13 c # [type: real, range: [0,1], default: 0.666]
1.09/1.13 c heuristics/crossover/minfixingrate = 0.5
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 20]
1.09/1.13 c heuristics/feaspump/freq = -1
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/feaspump/maxlpiterofs = 2000
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/fracdiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/fracdiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/fracdiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/guideddiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/guideddiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/guideddiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/intdiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/intshifting/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/linesearchdiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 20]
1.09/1.13 c heuristics/objpscostdiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to total iteration number
1.09/1.13 c # [type: real, range: [0,1], default: 0.01]
1.09/1.13 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/oneopt/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/pscostdiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/pscostdiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c heuristics/rens/freq = -1
1.09/1.13 c
1.09/1.13 c # minimum percentage of integer variables that have to be fixable
1.09/1.13 c # [type: real, range: [0,1], default: 0.5]
1.09/1.13 c heuristics/rens/minfixingrate = 0.3
1.09/1.13 c
1.09/1.13 c # number of nodes added to the contingent of the total nodes
1.09/1.13 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.09/1.13 c heuristics/rens/nodesofs = 2000
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 20]
1.09/1.13 c heuristics/rootsoldiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.09/1.13 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/rounding/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c heuristics/shiftandpropagate/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/shifting/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/simplerounding/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/subnlp/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c heuristics/trivial/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/trysol/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c heuristics/undercover/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 10]
1.09/1.13 c heuristics/veclendiving/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal fraction of diving LP iterations compared to node LP iterations
1.09/1.13 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.09/1.13 c heuristics/veclendiving/maxlpiterquot = 0.075
1.09/1.13 c
1.09/1.13 c # additional number of allowed LP iterations
1.09/1.13 c # [type: int, range: [0,2147483647], default: 1000]
1.09/1.13 c heuristics/veclendiving/maxlpiterofs = 1500
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/zirounding/freq = -1
1.09/1.13 c
1.09/1.13 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: -1]
1.09/1.13 c propagating/probing/maxprerounds = 0
1.09/1.13 c
1.09/1.13 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c separating/cmir/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 0]
1.09/1.13 c separating/flowcover/freq = -1
1.09/1.13 c
1.09/1.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: -1]
1.09/1.13 c separating/rapidlearning/freq = 0
1.09/1.13 c
1.09/1.13 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
1.09/1.13 c # [type: int, range: [-1,2147483647], default: 1]
1.09/1.13 c heuristics/indoneopt/freq = -1
1.09/1.13 c
1.09/1.13 c -----------------------------------------------------------------------------------------------
1.09/1.13 c start solving
1.09/1.13 s UNSATISFIABLE
1.09/1.13 c SCIP Status : problem is solved [infeasible]
1.09/1.13 c Total Time : 1.13
1.09/1.13 c solving : 1.13
1.09/1.13 c presolving : 1.02 (included in solving)
1.09/1.13 c reading : 0.08 (included in solving)
1.09/1.13 c copying : 0.00 (0 times copied the problem)
1.09/1.13 c Original Problem :
1.09/1.13 c Problem name : HOME/instance-3690562-1338022693.opb
1.09/1.13 c Variables : 9150 (9150 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 28514 initial, 28514 maximal
1.09/1.13 c Objective sense : minimize
1.09/1.13 c Presolved Problem :
1.09/1.13 c Problem name : t_HOME/instance-3690562-1338022693.opb
1.09/1.13 c Variables : 1550 (1550 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.13 c Constraints : 3938 initial, 3938 maximal
1.09/1.13 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.09/1.13 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c trivial : 0.00 0.00 376 0 0 0 0 0 0 0 0
1.09/1.13 c dualfix : 0.01 0.00 59 0 0 0 0 0 0 0 0
1.09/1.13 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c implics : 0.01 0.00 0 92 0 0 0 0 0 0 0
1.09/1.13 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.09/1.13 c linear : 0.92 0.00 5291 1782 0 5665 0 24576 0 153 129
1.09/1.13 c root node : - - 0 - - 0 - - - - -
1.09/1.13 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.09/1.13 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.09/1.13 c linear : 3938 3938 0 0 0 0 0 0 0 0 0 0 0
1.09/1.13 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.09/1.13 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.09/1.13 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.09/1.13 c pseudoobj : 0 0 0 0
1.09/1.13 c redcost : 0 0 0 0
1.09/1.13 c rootredcost : 0 0 0 0
1.09/1.13 c vbounds : 0 0 0 0
1.09/1.13 c probing : 0 0 0 0
1.09/1.13 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.09/1.13 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c redcost : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c probing : 0.00 0.00 0.00 0.00 0.00
1.09/1.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.09/1.13 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.13 c applied globally : - - - 0 0.0 - - -
1.09/1.13 c applied locally : - - - 0 0.0 - - -
1.09/1.13 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.09/1.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.09/1.13 c clique : 0.00 0.00 0 0 0 0 0
1.09/1.13 c closecuts : 0.00 0.00 0 0 0 0 0
1.09/1.13 c cgmip : 0.00 0.00 0 0 0 0 0
1.09/1.13 c cmir : 0.00 0.00 0 0 0 0 0
1.09/1.13 c flowcover : 0.00 0.00 0 0 0 0 0
1.09/1.13 c gomory : 0.00 0.00 0 0 0 0 0
1.09/1.13 c impliedbounds : 0.00 0.00 0 0 0 0 0
1.09/1.13 c intobj : 0.00 0.00 0 0 0 0 0
1.09/1.13 c mcf : 0.00 0.00 0 0 0 0 0
1.09/1.13 c oddcycle : 0.00 0.00 0 0 0 0 0
1.09/1.13 c rapidlearning : 0.00 0.00 0 0 0 0 0
1.09/1.13 c strongcg : 0.00 0.00 0 0 0 0 0
1.09/1.13 c zerohalf : 0.00 0.00 0 0 0 0 0
1.09/1.13 c Pricers : ExecTime SetupTime Calls Vars
1.09/1.13 c problem variables: 0.00 - 0 0
1.09/1.13 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.09/1.13 c pscost : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c inference : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c random : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c relpscost : 0.00 0.00 0 0 0 0 0 0
1.09/1.13 c Primal Heuristics : ExecTime SetupTime Calls Found
1.09/1.13 c LP solutions : 0.00 - - 0
1.09/1.13 c pseudo solutions : 0.00 - - 0
1.09/1.13 c smallcard : 0.00 0.00 0 0
1.09/1.13 c trivial : 0.01 0.00 1 0
1.09/1.13 c shiftandpropagate: 0.00 0.00 0 0
1.09/1.13 c simplerounding : 0.00 0.00 0 0
1.09/1.13 c zirounding : 0.00 0.00 0 0
1.09/1.13 c rounding : 0.00 0.00 0 0
1.09/1.13 c shifting : 0.00 0.00 0 0
1.09/1.13 c intshifting : 0.00 0.00 0 0
1.09/1.13 c oneopt : 0.00 0.00 0 0
1.09/1.13 c twoopt : 0.00 0.00 0 0
1.09/1.13 c indtwoopt : 0.00 0.00 0 0
1.09/1.13 c indoneopt : 0.00 0.00 0 0
1.09/1.13 c fixandinfer : 0.00 0.00 0 0
1.09/1.13 c feaspump : 0.00 0.00 0 0
1.09/1.13 c clique : 0.00 0.00 0 0
1.09/1.13 c indrounding : 0.00 0.00 0 0
1.09/1.13 c indcoefdiving : 0.00 0.00 0 0
1.09/1.13 c coefdiving : 0.00 0.00 0 0
1.09/1.13 c pscostdiving : 0.00 0.00 0 0
1.09/1.13 c nlpdiving : 0.00 0.00 0 0
1.09/1.13 c fracdiving : 0.00 0.00 0 0
1.09/1.13 c veclendiving : 0.00 0.00 0 0
1.09/1.13 c intdiving : 0.00 0.00 0 0
1.09/1.13 c actconsdiving : 0.00 0.00 0 0
1.09/1.13 c objpscostdiving : 0.00 0.00 0 0
1.09/1.13 c rootsoldiving : 0.00 0.00 0 0
1.09/1.13 c linesearchdiving : 0.00 0.00 0 0
1.09/1.13 c guideddiving : 0.00 0.00 0 0
1.09/1.13 c octane : 0.00 0.00 0 0
1.09/1.13 c rens : 0.00 0.00 0 0
1.09/1.13 c rins : 0.00 0.00 0 0
1.09/1.13 c localbranching : 0.00 0.00 0 0
1.09/1.13 c mutation : 0.00 0.00 0 0
1.09/1.13 c crossover : 0.00 0.00 0 0
1.09/1.13 c dins : 0.00 0.00 0 0
1.09/1.13 c vbounds : 0.00 0.00 0 0
1.09/1.13 c undercover : 0.00 0.00 0 0
1.09/1.13 c subnlp : 0.00 0.00 0 0
1.09/1.13 c trysol : 0.00 0.00 0 0
1.09/1.13 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.09/1.13 c primal LP : 0.00 0 0 0.00 - 0.00 0
1.09/1.13 c dual LP : 0.00 0 0 0.00 - 0.00 0
1.09/1.13 c lex dual LP : 0.00 0 0 0.00 -
1.09/1.13 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.09/1.13 c diving/probing LP: 0.00 0 0 0.00 -
1.09/1.13 c strong branching : 0.00 0 0 0.00 -
1.09/1.13 c (at root node) : - 0 0 0.00 -
1.09/1.13 c conflict analysis: 0.00 0 0 0.00 -
1.09/1.13 c B&B Tree :
1.09/1.13 c number of runs : 1
1.09/1.13 c nodes : 0
1.09/1.13 c nodes (total) : 0
1.09/1.13 c nodes left : 1
1.09/1.13 c max depth : -1
1.09/1.13 c max depth (total): -1
1.09/1.13 c backtracks : 0 (0.0%)
1.09/1.13 c delayed cutoffs : 0
1.09/1.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.09/1.13 c avg switch length: 0.00
1.09/1.13 c switching time : 0.00
1.09/1.13 c Solution :
1.09/1.13 c Solutions found : 0 (0 improvements)
1.09/1.13 c Primal Bound : infeasible
1.09/1.13 c Dual Bound : -
1.09/1.13 c Gap : infinite
1.09/1.13 c Root Dual Bound : -
1.09/1.13 c Root Iterations : 0
1.09/1.17 c Time complete: 1.15.