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-3690739-1338022349.opb>
0.00/0.00 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 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.09/0.15 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5028 impls, 100 clqs
0.09/0.16 c presolving (2 rounds):
0.09/0.16 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.16 c 5028 implications, 100 cliques
0.09/0.16 c presolved problem has 716 variables (716 bin, 0 int, 0 impl, 0 cont) and 768 constraints
0.09/0.16 c 1 constraints of type <knapsack>
0.09/0.16 c 150 constraints of type <setppc>
0.09/0.16 c 616 constraints of type <and>
0.09/0.16 c 1 constraints of type <linear>
0.09/0.16 c transformed objective value is always integral (scale: 1)
0.09/0.16 c Presolving Time: 0.15
0.09/0.16 c - non default parameters ----------------------------------------------------------------------
0.09/0.16 c # SCIP version 2.1.1.4
0.09/0.16 c
0.09/0.16 c # maximal time in seconds to run
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/time = 1797
0.09/0.16 c
0.09/0.16 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/memory = 13950
0.09/0.16 c
0.09/0.16 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c limits/solutions = 1
0.09/0.16 c
0.09/0.16 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.16 c separating/maxrounds = 1
0.09/0.16 c
0.09/0.16 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c separating/maxroundsroot = 5
0.09/0.16 c
0.09/0.16 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.16 c # [type: int, range: [1,2], default: 1]
0.09/0.16 c timing/clocktype = 2
0.09/0.16 c
0.09/0.16 c # belongs reading time to solving time?
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c timing/reading = TRUE
0.09/0.16 c
0.09/0.16 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.16 c constraints/knapsack/disaggregation = FALSE
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/coefdiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.16 c heuristics/crossover/freq = -1
0.09/0.16 c
0.09/0.16 c # number of nodes added to the contingent of the total nodes
0.09/0.16 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.16 c heuristics/crossover/nodesofs = 750
0.09/0.16 c
0.09/0.16 c # number of nodes without incumbent change that heuristic should wait
0.09/0.16 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.16 c heuristics/crossover/nwaitingnodes = 100
0.09/0.16 c
0.09/0.16 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.16 c # [type: real, range: [0,1], default: 0.1]
0.09/0.16 c heuristics/crossover/nodesquot = 0.15
0.09/0.16 c
0.09/0.16 c # minimum percentage of integer variables that have to be fixed
0.09/0.16 c # [type: real, range: [0,1], default: 0.666]
0.09/0.16 c heuristics/crossover/minfixingrate = 0.5
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.16 c heuristics/feaspump/freq = -1
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/fracdiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/guideddiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/intshifting/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/linesearchdiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.16 c heuristics/objpscostdiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.16 c # [type: real, range: [0,1], default: 0.01]
0.09/0.16 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/oneopt/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/pscostdiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c heuristics/rens/freq = -1
0.09/0.16 c
0.09/0.16 c # minimum percentage of integer variables that have to be fixable
0.09/0.16 c # [type: real, range: [0,1], default: 0.5]
0.09/0.16 c heuristics/rens/minfixingrate = 0.3
0.09/0.16 c
0.09/0.16 c # number of nodes added to the contingent of the total nodes
0.09/0.16 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.16 c heuristics/rens/nodesofs = 2000
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.16 c heuristics/rootsoldiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.16 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/rounding/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c heuristics/shiftandpropagate/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/shifting/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/simplerounding/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/subnlp/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c heuristics/trivial/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/trysol/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c heuristics/undercover/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.16 c heuristics/veclendiving/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.16 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.16 c
0.09/0.16 c # additional number of allowed LP iterations
0.09/0.16 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.16 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/zirounding/freq = -1
0.09/0.16 c
0.09/0.16 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c propagating/probing/maxprerounds = 0
0.09/0.16 c
0.09/0.16 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c separating/cmir/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.16 c separating/flowcover/freq = -1
0.09/0.16 c
0.09/0.16 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c separating/rapidlearning/freq = 0
0.09/0.16 c
0.09/0.16 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.16 c heuristics/indoneopt/freq = -1
0.09/0.16 c
0.09/0.16 c -----------------------------------------------------------------------------------------------
0.09/0.16 c start solving
0.09/0.16 c
0.09/0.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.16 c 0.2s| 1 | 0 | 30 | - |3205k| 0 | 13 | 716 | 768 | 716 |1384 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 39 | - |3323k| 0 | 21 | 716 | 801 | 716 |1389 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 40 | - |3392k| 0 | 0 | 716 | 801 | 716 |1392 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c * 0.3s| 1 | 0 | 40 | - |3396k| 0 | - | 716 | 801 | 716 |1392 | 8 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.29/0.35 c
0.29/0.35 c SCIP Status : problem is solved [optimal solution found]
0.29/0.35 c Solving Time (sec) : 0.35
0.29/0.35 c Solving Nodes : 1
0.29/0.35 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.29/0.35 c Dual Bound : +0.00000000000000e+00
0.29/0.35 c Gap : 0.00 %
0.29/0.35 s SATISFIABLE
0.29/0.35 v -x90 -x69 -x56 -x86 -x85 -x63 -x60 -x57 -x95 -x72 -x79 -x58 -x67 -x54 -x97 -x61 -x92 -x66 -x52 -x98 -x84 -x83 -x77 -x71 -x59 -x53
0.29/0.35 v -x81 -x68 -x74 -x55 -x88 -x94 -x100 -x80 -x51 -x87 -x82 -x75 -x73 -x64 -x93 -x96 -x78 x65 x99 x62 -x76 x89 -x70 x91 -x50 -x49
0.29/0.35 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
0.29/0.35 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 x8 -x7 x6 -x5 x4 x3 x2 -x1
0.29/0.35 c SCIP Status : problem is solved [optimal solution found]
0.29/0.35 c Total Time : 0.35
0.29/0.35 c solving : 0.35
0.29/0.35 c presolving : 0.15 (included in solving)
0.29/0.35 c reading : 0.00 (included in solving)
0.29/0.35 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.29/0.35 c Original Problem :
0.29/0.35 c Problem name : HOME/instance-3690739-1338022349.opb
0.29/0.35 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.35 c Constraints : 152 initial, 152 maximal
0.29/0.35 c Objective sense : minimize
0.29/0.35 c Presolved Problem :
0.29/0.35 c Problem name : t_HOME/instance-3690739-1338022349.opb
0.29/0.35 c Variables : 716 (716 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.35 c Constraints : 768 initial, 801 maximal
0.29/0.35 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.29/0.35 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c and : 0.14 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c linear : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.29/0.35 c root node : - - 0 - - 0 - - - - -
0.29/0.35 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.29/0.35 c integral : 0 0 0 0 1 0 3 0 0 0 0 0 0
0.29/0.35 c knapsack : 1 1 3 1 1 0 0 0 0 0 0 0 0
0.29/0.35 c setppc : 150 150 3 1 1 0 0 0 0 0 0 0 0
0.29/0.35 c and : 616 616 3 1 1 0 0 0 0 0 0 0 0
0.29/0.35 c linear : 1+ 34 4 1 1 0 0 0 0 0 0 0 0
0.29/0.35 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
0.29/0.35 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.29/0.35 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.29/0.35 c rootredcost : 0 0 0 0
0.29/0.35 c pseudoobj : 0 0 0 0
0.29/0.35 c vbounds : 0 0 0 0
0.29/0.35 c redcost : 3 0 0 0
0.29/0.35 c probing : 0 0 0 0
0.29/0.35 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.29/0.35 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c redcost : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c probing : 0.00 0.00 0.00 0.00 0.00
0.29/0.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.35 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.35 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.35 c applied globally : - - - 0 0.0 - - -
0.29/0.35 c applied locally : - - - 0 0.0 - - -
0.29/0.35 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.29/0.35 c cut pool : 0.00 2 - - 1 - (maximal pool size: 44)
0.29/0.35 c closecuts : 0.00 0.00 0 0 0 0 0
0.29/0.35 c impliedbounds : 0.00 0.00 2 0 0 0 0
0.29/0.35 c intobj : 0.00 0.00 0 0 0 0 0
0.29/0.35 c gomory : 0.01 0.00 2 0 0 100 0
0.29/0.35 c cgmip : 0.00 0.00 0 0 0 0 0
0.29/0.35 c strongcg : 0.03 0.00 2 0 0 600 0
0.29/0.35 c cmir : 0.00 0.00 0 0 0 0 0
0.29/0.35 c flowcover : 0.00 0.00 0 0 0 0 0
0.29/0.35 c clique : 0.00 0.00 2 0 0 4 0
0.29/0.35 c zerohalf : 0.00 0.00 0 0 0 0 0
0.29/0.35 c mcf : 0.00 0.00 1 0 0 0 0
0.29/0.35 c oddcycle : 0.00 0.00 0 0 0 0 0
0.29/0.35 c rapidlearning : 0.14 0.00 1 0 0 0 33
0.29/0.35 c Pricers : ExecTime SetupTime Calls Vars
0.29/0.35 c problem variables: 0.00 - 0 0
0.29/0.35 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.29/0.35 c pscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c inference : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c random : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.29/0.35 c Primal Heuristics : ExecTime SetupTime Calls Found
0.29/0.35 c LP solutions : 0.00 - - 1
0.29/0.35 c pseudo solutions : 0.00 - - 0
0.29/0.35 c smallcard : 0.00 0.00 0 0
0.29/0.35 c trivial : 0.00 0.00 1 0
0.29/0.35 c shiftandpropagate: 0.00 0.00 0 0
0.29/0.35 c simplerounding : 0.00 0.00 0 0
0.29/0.35 c zirounding : 0.00 0.00 0 0
0.29/0.35 c rounding : 0.00 0.00 0 0
0.29/0.35 c shifting : 0.00 0.00 0 0
0.29/0.35 c intshifting : 0.00 0.00 0 0
0.29/0.35 c oneopt : 0.00 0.00 0 0
0.29/0.35 c twoopt : 0.00 0.00 0 0
0.29/0.35 c indtwoopt : 0.00 0.00 0 0
0.29/0.35 c indoneopt : 0.00 0.00 0 0
0.29/0.35 c fixandinfer : 0.00 0.00 0 0
0.29/0.35 c feaspump : 0.00 0.00 0 0
0.29/0.35 c clique : 0.00 0.00 0 0
0.29/0.35 c indrounding : 0.00 0.00 0 0
0.29/0.35 c indcoefdiving : 0.00 0.00 0 0
0.29/0.35 c coefdiving : 0.00 0.00 0 0
0.29/0.35 c pscostdiving : 0.00 0.00 0 0
0.29/0.35 c nlpdiving : 0.00 0.00 0 0
0.29/0.35 c fracdiving : 0.00 0.00 0 0
0.29/0.35 c veclendiving : 0.00 0.00 0 0
0.29/0.35 c intdiving : 0.00 0.00 0 0
0.29/0.35 c actconsdiving : 0.00 0.00 0 0
0.29/0.35 c objpscostdiving : 0.00 0.00 0 0
0.29/0.35 c rootsoldiving : 0.00 0.00 0 0
0.29/0.35 c linesearchdiving : 0.00 0.00 0 0
0.29/0.35 c guideddiving : 0.00 0.00 0 0
0.29/0.35 c octane : 0.00 0.00 0 0
0.29/0.35 c rens : 0.00 0.00 0 0
0.29/0.35 c rins : 0.00 0.00 0 0
0.29/0.35 c localbranching : 0.00 0.00 0 0
0.29/0.35 c mutation : 0.00 0.00 0 0
0.29/0.35 c crossover : 0.00 0.00 0 0
0.29/0.35 c dins : 0.00 0.00 0 0
0.29/0.35 c vbounds : 0.00 0.00 0 0
0.29/0.35 c undercover : 0.00 0.00 0 0
0.29/0.35 c subnlp : 0.00 0.00 0 0
0.29/0.35 c trysol : 0.00 0.00 0 0
0.29/0.35 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.29/0.35 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.29/0.35 c dual LP : 0.00 3 40 13.33 - 0.00 0
0.29/0.35 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.35 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.29/0.35 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.35 c strong branching : 0.00 0 0 0.00 -
0.29/0.35 c (at root node) : - 0 0 0.00 -
0.29/0.35 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.35 c B&B Tree :
0.29/0.35 c number of runs : 1
0.29/0.35 c nodes : 1
0.29/0.35 c nodes (total) : 1
0.29/0.35 c nodes left : 0
0.29/0.35 c max depth : 0
0.29/0.35 c max depth (total): 0
0.29/0.35 c backtracks : 0 (0.0%)
0.29/0.35 c delayed cutoffs : 0
0.29/0.35 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.35 c avg switch length: 2.00
0.29/0.35 c switching time : 0.00
0.29/0.35 c Solution :
0.29/0.35 c Solutions found : 1 (1 improvements)
0.29/0.35 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.35 seconds, depth 0, found by <relaxation>)
0.29/0.35 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.35 seconds, depth 0, found by <relaxation>)
0.29/0.35 c Dual Bound : +0.00000000000000e+00
0.29/0.35 c Gap : 0.00 %
0.29/0.35 c Root Dual Bound : +0.00000000000000e+00
0.29/0.35 c Root Iterations : 40
0.29/0.35 c Time complete: 0.35.