0.00/0.01 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3451989-1307113904.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5012 impls, 100 clqs
0.00/0.04 c presolving (2 rounds):
0.00/0.04 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.04 c 5012 implications, 100 cliques
0.00/0.04 c presolved problem has 714 variables (714 bin, 0 int, 0 impl, 0 cont) and 766 constraints
0.00/0.04 c 1 constraints of type <knapsack>
0.00/0.04 c 150 constraints of type <setppc>
0.00/0.04 c 614 constraints of type <and>
0.00/0.04 c 1 constraints of type <linear>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.4
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c limits/solutions = 1
0.00/0.04 c
0.00/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.04 c separating/maxrounds = 1
0.00/0.04 c
0.00/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/maxroundsroot = 5
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.04 c constraints/knapsack/disaggregation = FALSE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c presolving/probing/maxrounds = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/coefdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.04 c heuristics/crossover/freq = -1
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/crossover/nodesofs = 750
0.00/0.04 c
0.00/0.04 c # number of nodes without incumbent change that heuristic should wait
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.04 c heuristics/crossover/nwaitingnodes = 100
0.00/0.04 c
0.00/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.04 c # [type: real, range: [0,1], default: 0.1]
0.00/0.04 c heuristics/crossover/nodesquot = 0.15
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixed
0.00/0.04 c # [type: real, range: [0,1], default: 0.666]
0.00/0.04 c heuristics/crossover/minfixingrate = 0.5
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/feaspump/freq = -1
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/fracdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/guideddiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/intshifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/linesearchdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/objpscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04 c # [type: real, range: [0,1], default: 0.01]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/oneopt/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/pscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = -1
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/shiftandpropagate/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/subnlp/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/undercover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.03/0.04 c
0.03/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.03/0.04 c 0.0s| 1 | 0 | 37 | - |3082k| 0 | 31 | 714 | 766 | 714 |1380 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.13 c 0.1s| 1 | 0 | 81 | - |3173k| 0 | 37 | 714 | 779 | 714 |1384 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.18 c 0.2s| 1 | 0 | 145 | - |3227k| 0 | 37 | 714 | 779 | 714 |1390 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.25 c 0.2s| 1 | 0 | 256 | - |3317k| 0 | 34 | 714 | 779 | 714 |1395 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 327 | - |3446k| 0 | 44 | 714 | 779 | 714 |1401 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 352 | - |3625k| 0 | 53 | 714 | 779 | 714 |1415 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 2 | 352 | - |3626k| 0 | 53 | 714 | 779 | 714 |1415 | 35 | 0 | 9 | 0.000000e+00 | -- | Inf
0.89/0.97 c * 1.0s| 21 | 0 | 788 | 21.8 |3658k| 17 | - | 714 | 782 | 714 | 425 | 164 | 3 | 115 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.89/0.97 c
0.89/0.97 c SCIP Status : problem is solved [optimal solution found]
0.89/0.97 c Solving Time (sec) : 0.97
0.89/0.97 c Solving Nodes : 21
0.89/0.97 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.89/0.97 c Dual Bound : +0.00000000000000e+00
0.89/0.97 c Gap : 0.00 %
0.89/0.97 s SATISFIABLE
0.89/0.97 v -x85 -x63 -x78 -x89 -x97 -x60 -x87 -x72 -x56 x82 -x99 -x94 -x93 x91 -x61 -x57 -x81 -x71 -x83 -x73 -x98 -x90 -x74 -x70 -x66 x62
0.89/0.97 v -x80 -x69 -x68 -x100 -x92 -x53 -x54 -x65 -x55 -x51 -x96 -x67 -x59 -x58 x95 -x86 x79 x76 -x88 x64 x77 -x75 x84 -x52 -x50 -x49
0.89/0.97 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 x23
0.89/0.97 v -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2 -x1
0.89/0.97 c SCIP Status : problem is solved [optimal solution found]
0.89/0.97 c Total Time : 0.97
0.89/0.97 c solving : 0.97
0.89/0.97 c presolving : 0.03 (included in solving)
0.89/0.97 c reading : 0.00 (included in solving)
0.89/0.97 c Original Problem :
0.89/0.97 c Problem name : HOME/instance-3451989-1307113904.opb
0.89/0.97 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.97 c Constraints : 152 initial, 152 maximal
0.89/0.97 c Presolved Problem :
0.89/0.97 c Problem name : t_HOME/instance-3451989-1307113904.opb
0.89/0.97 c Variables : 714 (714 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.97 c Constraints : 766 initial, 782 maximal
0.89/0.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.89/0.97 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c and : 0.02 0 0 0 0 0 0 0 0 0
0.89/0.97 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.89/0.97 c root node : - 0 - - 0 - - - - -
0.89/0.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.89/0.97 c integral : 0 0 0 23 0 3 0 0 6 0 0 34
0.89/0.97 c knapsack : 1 5 56 0 0 0 0 0 0 0 0 0
0.89/0.97 c setppc : 150 5 68 1 0 0 29 2 77 0 0 0
0.89/0.97 c and : 614 24 66 1 0 0 32 0 623 145 0 0
0.89/0.97 c linear : 1+ 6 66 1 0 0 0 0 0 0 0 0
0.89/0.97 c logicor : 0+ 0 4 0 0 0 0 0 2 0 0 0
0.89/0.97 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
0.89/0.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.89/0.97 c integral : 0.51 0.00 0.00 0.51 0.00 0.00 0.00
0.89/0.97 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.89/0.97 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.89/0.97 c vbounds : 0 0 0 0
0.89/0.97 c rootredcost : 0 0 0 0
0.89/0.97 c pseudoobj : 0 0 0 0
0.89/0.97 c Propagator Timings : TotalTime Propagate Resprop
0.89/0.97 c vbounds : 0.00 0.00 0.00
0.89/0.97 c rootredcost : 0.00 0.00 0.00
0.89/0.97 c pseudoobj : 0.00 0.00 0.00
0.89/0.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.97 c propagation : 0.00 2 2 2 3.0 0 0.0 -
0.89/0.97 c infeasible LP : 0.00 1 1 1 42.0 0 0.0 0
0.89/0.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.97 c applied globally : - - - 3 16.0 - - -
0.89/0.97 c applied locally : - - - 0 0.0 - - -
0.89/0.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.97 c cut pool : 0.00 4 - - 41 - (maximal pool size: 149)
0.89/0.97 c redcost : 0.00 24 0 0 0 0
0.89/0.97 c impliedbounds : 0.00 5 0 0 17 0
0.89/0.97 c intobj : 0.00 0 0 0 0 0
0.89/0.97 c gomory : 0.16 5 0 0 456 0
0.89/0.97 c cgmip : 0.00 0 0 0 0 0
0.89/0.97 c closecuts : 0.00 0 0 0 0 0
0.89/0.97 c strongcg : 0.15 5 0 0 1522 0
0.89/0.97 c cmir : 0.00 0 0 0 0 0
0.89/0.97 c flowcover : 0.00 0 0 0 0 0
0.89/0.97 c clique : 0.00 5 0 0 14 0
0.89/0.97 c zerohalf : 0.00 0 0 0 0 0
0.89/0.97 c mcf : 0.00 1 0 0 0 0
0.89/0.97 c oddcycle : 0.00 0 0 0 0 0
0.89/0.97 c rapidlearning : 0.04 1 0 0 0 13
0.89/0.97 c Pricers : Time Calls Vars
0.89/0.97 c problem variables: 0.00 0 0
0.89/0.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.97 c relpscost : 0.51 19 0 6 0 0 28
0.89/0.97 c pscost : 0.00 0 0 0 0 0 0
0.89/0.97 c inference : 0.00 3 0 0 0 0 6
0.89/0.97 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.97 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.97 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.97 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.97 c random : 0.00 0 0 0 0 0 0
0.89/0.97 c Primal Heuristics : Time Calls Found
0.89/0.97 c LP solutions : 0.00 - 1
0.89/0.97 c pseudo solutions : 0.00 - 0
0.89/0.97 c trivial : 0.00 1 0
0.89/0.97 c shiftandpropagate: 0.00 0 0
0.89/0.97 c simplerounding : 0.00 0 0
0.89/0.97 c zirounding : 0.00 0 0
0.89/0.97 c rounding : 0.00 0 0
0.89/0.97 c shifting : 0.00 0 0
0.89/0.97 c intshifting : 0.00 0 0
0.89/0.97 c oneopt : 0.00 0 0
0.89/0.97 c twoopt : 0.00 0 0
0.89/0.97 c fixandinfer : 0.00 0 0
0.89/0.97 c feaspump : 0.00 0 0
0.89/0.97 c clique : 0.00 0 0
0.89/0.97 c coefdiving : 0.00 0 0
0.89/0.97 c pscostdiving : 0.00 0 0
0.89/0.97 c fracdiving : 0.00 0 0
0.89/0.97 c veclendiving : 0.00 0 0
0.89/0.97 c intdiving : 0.00 0 0
0.89/0.97 c actconsdiving : 0.00 0 0
0.89/0.97 c objpscostdiving : 0.00 0 0
0.89/0.97 c rootsoldiving : 0.00 0 0
0.89/0.97 c linesearchdiving : 0.00 0 0
0.89/0.97 c guideddiving : 0.00 0 0
0.89/0.97 c octane : 0.00 0 0
0.89/0.97 c rens : 0.00 0 0
0.89/0.97 c rins : 0.00 0 0
0.89/0.97 c localbranching : 0.00 0 0
0.89/0.97 c mutation : 0.00 0 0
0.89/0.97 c crossover : 0.00 0 0
0.89/0.97 c dins : 0.00 0 0
0.89/0.97 c vbounds : 0.00 0 0
0.89/0.97 c undercover : 0.00 0 0
0.89/0.97 c subnlp : 0.00 0 0
0.89/0.97 c trysol : 0.00 0 0
0.89/0.97 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.97 c primal LP : 0.00 0 0 0.00 -
0.89/0.97 c dual LP : 0.06 44 788 17.91 14236.68
0.89/0.97 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.97 c barrier LP : 0.00 0 0 0.00 -
0.89/0.97 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.97 c strong branching : 0.51 115 4877 42.41 9603.80
0.89/0.97 c (at root node) : - 9 3239 359.89 -
0.89/0.97 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.97 c B&B Tree :
0.89/0.97 c number of runs : 1
0.89/0.97 c nodes : 21
0.89/0.97 c nodes (total) : 21
0.89/0.97 c nodes left : 0
0.89/0.97 c max depth : 17
0.89/0.97 c max depth (total): 17
0.89/0.97 c backtracks : 0 (0.0%)
0.89/0.97 c delayed cutoffs : 0
0.89/0.97 c repropagations : 7 (10 domain reductions, 0 cutoffs)
0.89/0.97 c avg switch length: 2.48
0.89/0.97 c switching time : 0.00
0.89/0.97 c Solution :
0.89/0.97 c Solutions found : 1 (1 improvements)
0.89/0.97 c First Solution : +0.00000000000000e+00 (in run 1, after 21 nodes, 0.97 seconds, depth 17, found by <relaxation>)
0.89/0.97 c Primal Bound : +0.00000000000000e+00 (in run 1, after 21 nodes, 0.97 seconds, depth 17, found by <relaxation>)
0.89/0.97 c Dual Bound : +0.00000000000000e+00
0.89/0.97 c Gap : 0.00 %
0.89/0.97 c Root Dual Bound : +0.00000000000000e+00
0.89/0.97 c Root Iterations : 352
0.89/0.98 c Time complete: 0.97.