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: 947bdb7-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-3691668-1338028819.opb>
0.01/0.02 c original problem has 2355 variables (2355 bin, 0 int, 0 impl, 0 cont) and 6744 constraints
0.01/0.02 c problem read in 0.02
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/0.04 c presolving:
0.01/0.09 c (round 1) 283 del vars, 316 del conss, 0 add conss, 137 chg bounds, 88 chg sides, 260 chg coeffs, 0 upgd conss, 142381 impls, 0 clqs
0.09/0.10 c (round 2) 319 del vars, 771 del conss, 0 add conss, 176 chg bounds, 88 chg sides, 260 chg coeffs, 0 upgd conss, 142542 impls, 0 clqs
0.09/0.10 c (round 3) 367 del vars, 927 del conss, 0 add conss, 228 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 142861 impls, 0 clqs
0.09/0.10 c (round 4) 398 del vars, 1031 del conss, 0 add conss, 252 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 142883 impls, 0 clqs
0.09/0.11 c (round 5) 401 del vars, 1037 del conss, 0 add conss, 255 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 142948 impls, 0 clqs
0.09/0.11 c (round 6) 405 del vars, 1046 del conss, 0 add conss, 258 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 143070 impls, 0 clqs
0.09/0.11 c (round 7) 414 del vars, 1062 del conss, 0 add conss, 265 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 143518 impls, 0 clqs
0.09/0.12 c (round 8) 770 del vars, 1979 del conss, 0 add conss, 557 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 149368 impls, 0 clqs
0.09/0.13 c (round 9) 924 del vars, 2431 del conss, 0 add conss, 649 chg bounds, 88 chg sides, 262 chg coeffs, 0 upgd conss, 152542 impls, 0 clqs
0.09/0.14 c (round 10) 1267 del vars, 3294 del conss, 0 add conss, 824 chg bounds, 91 chg sides, 265 chg coeffs, 0 upgd conss, 159897 impls, 0 clqs
0.09/0.15 c presolving (11 rounds):
0.09/0.15 c 1275 deleted vars, 3446 deleted constraints, 0 added constraints, 829 tightened bounds, 0 added holes, 91 changed sides, 266 changed coefficients
0.09/0.15 c 160448 implications, 0 cliques
0.09/0.15 c presolving detected infeasibility
0.09/0.15 c Presolving Time: 0.11
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 2.1.1.4
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1797
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 13950
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.15 c # [type: int, range: [1,2], default: 1]
0.09/0.15 c timing/clocktype = 2
0.09/0.15 c
0.09/0.15 c # belongs reading time to solving time?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c timing/reading = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/shiftandpropagate/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/subnlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/undercover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c propagating/probing/maxprerounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/indoneopt/freq = -1
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 s UNSATISFIABLE
0.09/0.15 c SCIP Status : problem is solved [infeasible]
0.09/0.15 c Total Time : 0.15
0.09/0.15 c solving : 0.15
0.09/0.15 c presolving : 0.11 (included in solving)
0.09/0.15 c reading : 0.02 (included in solving)
0.09/0.15 c copying : 0.00 (0 times copied the problem)
0.09/0.15 c Original Problem :
0.09/0.15 c Problem name : HOME/instance-3691668-1338028819.opb
0.09/0.15 c Variables : 2355 (2355 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15 c Constraints : 6744 initial, 6744 maximal
0.09/0.15 c Objective sense : minimize
0.09/0.15 c Presolved Problem :
0.09/0.15 c Problem name : t_HOME/instance-3691668-1338028819.opb
0.09/0.15 c Variables : 1080 (1080 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15 c Constraints : 3298 initial, 3298 maximal
0.09/0.15 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.15 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c trivial : 0.00 0.00 23 0 0 0 0 0 0 0 0
0.09/0.15 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c implics : 0.02 0.00 0 437 0 0 0 0 0 0 0
0.09/0.15 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.09/0.15 c linear : 0.09 0.00 807 8 0 829 0 3446 0 91 266
0.09/0.15 c root node : - - 0 - - 0 - - - - -
0.09/0.15 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.09/0.15 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.09/0.15 c linear : 3298 3298 0 0 0 0 0 0 0 0 0 0 0
0.09/0.15 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.09/0.15 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.09/0.15 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.09/0.15 c pseudoobj : 0 0 0 0
0.09/0.15 c redcost : 0 0 0 0
0.09/0.15 c rootredcost : 0 0 0 0
0.09/0.15 c vbounds : 0 0 0 0
0.09/0.15 c probing : 0 0 0 0
0.09/0.15 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.09/0.15 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c redcost : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c probing : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.15 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.15 c applied globally : - - - 0 0.0 - - -
0.09/0.15 c applied locally : - - - 0 0.0 - - -
0.09/0.15 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.09/0.15 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.15 c clique : 0.00 0.00 0 0 0 0 0
0.09/0.15 c closecuts : 0.00 0.00 0 0 0 0 0
0.09/0.15 c cgmip : 0.00 0.00 0 0 0 0 0
0.09/0.15 c cmir : 0.00 0.00 0 0 0 0 0
0.09/0.15 c flowcover : 0.00 0.00 0 0 0 0 0
0.09/0.15 c gomory : 0.00 0.00 0 0 0 0 0
0.09/0.15 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.09/0.15 c intobj : 0.00 0.00 0 0 0 0 0
0.09/0.15 c mcf : 0.00 0.00 0 0 0 0 0
0.09/0.15 c oddcycle : 0.00 0.00 0 0 0 0 0
0.09/0.15 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.09/0.15 c strongcg : 0.00 0.00 0 0 0 0 0
0.09/0.15 c zerohalf : 0.00 0.00 0 0 0 0 0
0.09/0.15 c Pricers : ExecTime SetupTime Calls Vars
0.09/0.15 c problem variables: 0.00 - 0 0
0.09/0.15 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.09/0.15 c pscost : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c inference : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c random : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.09/0.15 c Primal Heuristics : ExecTime SetupTime Calls Found
0.09/0.15 c LP solutions : 0.00 - - 0
0.09/0.15 c pseudo solutions : 0.00 - - 0
0.09/0.15 c smallcard : 0.00 0.00 0 0
0.09/0.15 c trivial : 0.00 0.00 1 0
0.09/0.15 c shiftandpropagate: 0.00 0.00 0 0
0.09/0.15 c simplerounding : 0.00 0.00 0 0
0.09/0.15 c zirounding : 0.00 0.00 0 0
0.09/0.15 c rounding : 0.00 0.00 0 0
0.09/0.15 c shifting : 0.00 0.00 0 0
0.09/0.15 c intshifting : 0.00 0.00 0 0
0.09/0.15 c oneopt : 0.00 0.00 0 0
0.09/0.15 c twoopt : 0.00 0.00 0 0
0.09/0.15 c indtwoopt : 0.00 0.00 0 0
0.09/0.15 c indoneopt : 0.00 0.00 0 0
0.09/0.15 c fixandinfer : 0.00 0.00 0 0
0.09/0.15 c feaspump : 0.00 0.00 0 0
0.09/0.15 c clique : 0.00 0.00 0 0
0.09/0.15 c indrounding : 0.00 0.00 0 0
0.09/0.15 c indcoefdiving : 0.00 0.00 0 0
0.09/0.15 c coefdiving : 0.00 0.00 0 0
0.09/0.15 c pscostdiving : 0.00 0.00 0 0
0.09/0.15 c nlpdiving : 0.00 0.00 0 0
0.09/0.15 c fracdiving : 0.00 0.00 0 0
0.09/0.15 c veclendiving : 0.00 0.00 0 0
0.09/0.15 c intdiving : 0.00 0.00 0 0
0.09/0.15 c actconsdiving : 0.00 0.00 0 0
0.09/0.15 c objpscostdiving : 0.00 0.00 0 0
0.09/0.15 c rootsoldiving : 0.00 0.00 0 0
0.09/0.15 c linesearchdiving : 0.00 0.00 0 0
0.09/0.15 c guideddiving : 0.00 0.00 0 0
0.09/0.15 c octane : 0.00 0.00 0 0
0.09/0.15 c rens : 0.00 0.00 0 0
0.09/0.15 c rins : 0.00 0.00 0 0
0.09/0.15 c localbranching : 0.00 0.00 0 0
0.09/0.15 c mutation : 0.00 0.00 0 0
0.09/0.15 c crossover : 0.00 0.00 0 0
0.09/0.15 c dins : 0.00 0.00 0 0
0.09/0.15 c vbounds : 0.00 0.00 0 0
0.09/0.15 c undercover : 0.00 0.00 0 0
0.09/0.15 c subnlp : 0.00 0.00 0 0
0.09/0.15 c trysol : 0.00 0.00 0 0
0.09/0.15 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.09/0.15 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.09/0.15 c dual LP : 0.00 0 0 0.00 - 0.00 0
0.09/0.15 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.15 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.09/0.15 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.15 c strong branching : 0.00 0 0 0.00 -
0.09/0.15 c (at root node) : - 0 0 0.00 -
0.09/0.15 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.15 c B&B Tree :
0.09/0.15 c number of runs : 1
0.09/0.15 c nodes : 0
0.09/0.15 c nodes (total) : 0
0.09/0.15 c nodes left : 1
0.09/0.15 c max depth : -1
0.09/0.15 c max depth (total): -1
0.09/0.15 c backtracks : 0 (0.0%)
0.09/0.15 c delayed cutoffs : 0
0.09/0.15 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.15 c avg switch length: 0.00
0.09/0.15 c switching time : 0.00
0.09/0.15 c Solution :
0.09/0.15 c Solutions found : 0 (0 improvements)
0.09/0.15 c Primal Bound : infeasible
0.09/0.15 c Dual Bound : -
0.09/0.15 c Gap : infinite
0.09/0.15 c Root Dual Bound : -
0.09/0.15 c Root Iterations : 0
0.09/0.16 c Time complete: 0.16.