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-3690364-1338016940.opb>
0.00/0.00 c original problem has 1860 variables (1860 bin, 0 int, 0 impl, 0 cont) and 122 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 0 impls, 60 clqs
0.00/0.02 c (round 2) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 122 upgd conss, 0 impls, 60 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 60 cliques
0.00/0.02 c presolved problem has 1860 variables (1860 bin, 0 int, 0 impl, 0 cont) and 122 constraints
0.00/0.02 c 60 constraints of type <setppc>
0.00/0.02 c 62 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = 5
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = FALSE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = -1
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = 750
0.00/0.02 c
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = 100
0.00/0.02 c
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = 0.15
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = 0.5
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = -1
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = -1
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = 0.3
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/subnlp/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/trivial/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/trysol/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c propagating/probing/maxprerounds = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/indoneopt/freq = -1
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 768 | - |4300k| 0 | - |1860 | 122 |1860 | 122 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.00/0.04 c 0.0s| 1 | 0 | 768 | - |4300k| 0 | - |1860 | 122 |1860 | 122 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.00/0.04 c
0.00/0.04 c SCIP Status : problem is solved [infeasible]
0.00/0.04 c Solving Time (sec) : 0.04
0.00/0.04 c Solving Nodes : 1
0.00/0.04 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.00/0.04 c Dual Bound : +1.00000000000000e+20
0.00/0.04 c Gap : 0.00 %
0.00/0.04 s UNSATISFIABLE
0.00/0.04 c SCIP Status : problem is solved [infeasible]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.01 (included in solving)
0.00/0.04 c reading : 0.00 (included in solving)
0.00/0.04 c copying : 0.00 (0 times copied the problem)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3690364-1338016940.opb
0.00/0.04 c Variables : 1860 (1860 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 122 initial, 122 maximal
0.00/0.04 c Objective sense : minimize
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3690364-1338016940.opb
0.00/0.04 c Variables : 1860 (1860 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 122 initial, 122 maximal
0.00/0.04 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c linear : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c root node : - - 0 - - 0 - - - - -
0.00/0.04 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c setppc : 60 60 0 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c logicor : 62 62 0 1 0 0 0 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c pseudoobj : 0 0 0 0
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c redcost : 0 0 0 0
0.00/0.04 c probing : 0 0 0 0
0.00/0.04 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.04 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.04 c problem variables: 0.00 - 0 0
0.00/0.04 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.04 c LP solutions : 0.00 - - 0
0.00/0.04 c pseudo solutions : 0.00 - - 0
0.00/0.04 c smallcard : 0.00 0.00 0 0
0.00/0.04 c trivial : 0.00 0.00 1 0
0.00/0.04 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.04 c simplerounding : 0.00 0.00 0 0
0.00/0.04 c zirounding : 0.00 0.00 0 0
0.00/0.04 c rounding : 0.00 0.00 0 0
0.00/0.04 c shifting : 0.00 0.00 0 0
0.00/0.04 c intshifting : 0.00 0.00 0 0
0.00/0.04 c oneopt : 0.00 0.00 0 0
0.00/0.04 c twoopt : 0.00 0.00 0 0
0.00/0.04 c indtwoopt : 0.00 0.00 0 0
0.00/0.04 c indoneopt : 0.00 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0.00 0 0
0.00/0.04 c feaspump : 0.00 0.00 0 0
0.00/0.04 c clique : 0.00 0.00 0 0
0.00/0.04 c indrounding : 0.00 0.00 0 0
0.00/0.04 c indcoefdiving : 0.00 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0.00 0 0
0.00/0.04 c nlpdiving : 0.00 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0.00 0 0
0.00/0.04 c intdiving : 0.00 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0.00 0 0
0.00/0.04 c octane : 0.00 0.00 0 0
0.00/0.04 c rens : 0.00 0.00 0 0
0.00/0.04 c rins : 0.00 0.00 0 0
0.00/0.04 c localbranching : 0.00 0.00 0 0
0.00/0.04 c mutation : 0.00 0.00 0 0
0.00/0.04 c crossover : 0.00 0.00 0 0
0.00/0.04 c dins : 0.00 0.00 0 0
0.00/0.04 c vbounds : 0.00 0.00 0 0
0.00/0.04 c undercover : 0.00 0.00 0 0
0.00/0.04 c subnlp : 0.00 0.00 0 0
0.00/0.04 c trysol : 0.00 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.04 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c dual LP : 0.02 1 768 768.00 43953.53 0.00 0
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 1
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 0 (0 improvements)
0.00/0.04 c Primal Bound : infeasible
0.00/0.04 c Dual Bound : -
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : -
0.00/0.04 c Root Iterations : 768
0.00/0.05 c Time complete: 0.05.