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