0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2665732-1276273448.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 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.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.02/0.04 c presolving (3 rounds):
0.02/0.04 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.04 c 8 implications, 68 cliques
0.02/0.04 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.04 c 1 constraints of type <knapsack>
0.02/0.04 c 68 constraints of type <setppc>
0.02/0.04 c 4 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 1)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.2
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1800
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c limits/solutions = 1
0.02/0.04 c
0.02/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.04 c separating/maxrounds = 1
0.02/0.04 c
0.02/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/maxroundsroot = 5
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.04 c constraints/knapsack/disaggregation = FALSE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c presolving/probing/maxrounds = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/coefdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.04 c heuristics/crossover/freq = -1
0.02/0.04 c
0.02/0.04 c # number of nodes added to the contingent of the total nodes
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04 c heuristics/crossover/nodesofs = 750
0.02/0.04 c
0.02/0.04 c # number of nodes without incumbent change that heuristic should wait
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.04 c heuristics/crossover/nwaitingnodes = 100
0.02/0.04 c
0.02/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.04 c # [type: real, range: [0,1], default: 0.1]
0.02/0.04 c heuristics/crossover/nodesquot = 0.15
0.02/0.04 c
0.02/0.04 c # minimum percentage of integer variables that have to be fixed
0.02/0.04 c # [type: real, range: [0,1], default: 0.666]
0.02/0.04 c heuristics/crossover/minfixingrate = 0.5
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/feaspump/freq = -1
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/fracdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/guideddiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/intshifting/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/linesearchdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/nlp/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/objpscostdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.04 c # [type: real, range: [0,1], default: 0.01]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/oneopt/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/pscostdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/rens/freq = -1
0.02/0.04 c
0.02/0.04 c # minimum percentage of integer variables that have to be fixable
0.02/0.04 c # [type: real, range: [0,1], default: 0.5]
0.02/0.04 c heuristics/rens/minfixingrate = 0.3
0.02/0.04 c
0.02/0.04 c # number of nodes added to the contingent of the total nodes
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04 c heuristics/rens/nodesofs = 2000
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/rootsoldiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/rounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/shifting/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/simplerounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/trivial/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/trysol/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/veclendiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/zirounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c separating/cmir/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c separating/flowcover/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/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.02/0.04 c 0.0s| 1 | 0 | 46 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 133 | - |1230k| 0 | 56 | 169 | 194 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 295 | - |1241k| 0 | 59 | 169 | 194 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 484 | - |1256k| 0 | 58 | 169 | 194 | 169 | 112 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 712 | - |1477k| 0 | 56 | 169 | 194 | 169 | 120 | 47 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 934 | - |1555k| 0 | 58 | 169 | 194 | 169 | 127 | 54 | 0 | 0 | 0.000000e+00 | -- | Inf
0.78/0.84 c 0.8s| 1 | 0 | 987 | - |1546k| 0 | 63 | 169 | 187 | 169 | 127 | 54 | 0 | 10 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 997 | - |1498k| 0 | 60 | 169 | 142 | 169 | 127 | 54 | 0 | 21 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.7s| 1 | 2 | 997 | - |1498k| 0 | 60 | 169 | 142 | 169 | 127 | 54 | 0 | 30 | 0.000000e+00 | -- | Inf
3.19/3.29 c
3.19/3.29 c SCIP Status : problem is solved [infeasible]
3.19/3.29 c Solving Time (sec) : 3.16
3.19/3.29 c Solving Nodes : 3
3.19/3.29 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.19/3.29 c Dual Bound : +1.00000000000000e+20
3.19/3.29 c Gap : 0.00 %
3.19/3.29 s UNSATISFIABLE
3.19/3.29 c SCIP Status : problem is solved [infeasible]
3.19/3.29 c Solving Time : 3.16
3.19/3.29 c Original Problem :
3.19/3.29 c Problem name : HOME/instance-2665732-1276273448.opb
3.19/3.29 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.19/3.29 c Constraints : 101 initial, 101 maximal
3.19/3.29 c Presolved Problem :
3.19/3.29 c Problem name : t_HOME/instance-2665732-1276273448.opb
3.19/3.29 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.19/3.29 c Constraints : 73 initial, 194 maximal
3.19/3.29 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.19/3.29 c trivial : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c implics : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c probing : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c setppc : 0.01 0 0 0 0 0 0 0 0
3.19/3.29 c linear : 0.01 0 0 0 0 0 28 0 0
3.19/3.29 c logicor : 0.00 0 0 0 0 0 0 0 0
3.19/3.29 c root node : - 74 - - 74 - - - -
3.19/3.29 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.19/3.29 c integral : 0 0 0 12 0 1 41 0 0 2
3.19/3.29 c knapsack : 1 5 15 0 0 0 0 0 0 0
3.19/3.29 c setppc : 68 5 15 0 0 0 66 0 0 0
3.19/3.29 c linear : 0+ 5 14 0 0 0 0 0 0 0
3.19/3.29 c logicor : 4 5 2 0 0 0 0 0 0 0
3.19/3.29 c countsols : 0 0 0 0 0 0 0 0 0 0
3.19/3.29 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.19/3.29 c integral : 2.75 0.00 0.00 2.75 0.00
3.19/3.29 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.19/3.29 c setppc : 0.00 0.00 0.00 0.00 0.00
3.19/3.29 c linear : 0.00 0.00 0.00 0.00 0.00
3.19/3.29 c logicor : 0.00 0.00 0.00 0.00 0.00
3.19/3.29 c countsols : 0.00 0.00 0.00 0.00 0.00
3.19/3.29 c Propagators : Time Calls Cutoffs DomReds
3.19/3.29 c vbounds : 0.00 1 0 0
3.19/3.29 c rootredcost : 0.00 0 0 0
3.19/3.29 c pseudoobj : 0.00 0 0 0
3.19/3.29 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.19/3.29 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.19/3.29 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
3.19/3.29 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.19/3.29 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.19/3.29 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.19/3.29 c applied globally : - - - 0 0.0 - - -
3.19/3.29 c applied locally : - - - 0 0.0 - - -
3.19/3.29 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.19/3.29 c cut pool : 0.00 4 - - 13 - (maximal pool size: 179)
3.19/3.29 c redcost : 0.00 7 0 0 0 0
3.19/3.29 c impliedbounds : 0.00 5 0 0 0 0
3.19/3.29 c intobj : 0.00 0 0 0 0 0
3.19/3.29 c cgmip : 0.00 0 0 0 0 0
3.19/3.29 c gomory : 0.05 5 0 0 33 0
3.19/3.29 c strongcg : 0.02 5 0 0 124 0
3.19/3.29 c cmir : 0.00 0 0 0 0 0
3.19/3.29 c flowcover : 0.00 0 0 0 0 0
3.19/3.29 c clique : 0.00 5 0 0 30 0
3.19/3.29 c zerohalf : 0.00 0 0 0 0 0
3.19/3.29 c mcf : 0.00 1 0 0 0 0
3.19/3.29 c rapidlearning : 0.18 1 0 0 0 121
3.19/3.29 c Pricers : Time Calls Vars
3.19/3.29 c problem variables: 0.00 0 0
3.19/3.29 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.19/3.29 c relpscost : 2.75 12 1 41 0 0 2
3.19/3.29 c pscost : 0.00 0 0 0 0 0 0
3.19/3.29 c inference : 0.00 0 0 0 0 0 0
3.19/3.29 c mostinf : 0.00 0 0 0 0 0 0
3.19/3.29 c leastinf : 0.00 0 0 0 0 0 0
3.19/3.29 c fullstrong : 0.00 0 0 0 0 0 0
3.19/3.29 c allfullstrong : 0.00 0 0 0 0 0 0
3.19/3.29 c random : 0.00 0 0 0 0 0 0
3.19/3.29 c Primal Heuristics : Time Calls Found
3.19/3.29 c LP solutions : 0.00 - 0
3.19/3.29 c pseudo solutions : 0.00 - 0
3.19/3.29 c trivial : 0.00 1 0
3.19/3.29 c simplerounding : 0.00 0 0
3.19/3.29 c zirounding : 0.00 0 0
3.19/3.29 c rounding : 0.00 0 0
3.19/3.29 c shifting : 0.00 0 0
3.19/3.29 c intshifting : 0.00 0 0
3.19/3.29 c oneopt : 0.00 0 0
3.19/3.29 c twoopt : 0.00 0 0
3.19/3.29 c fixandinfer : 0.00 0 0
3.19/3.29 c feaspump : 0.00 0 0
3.19/3.29 c coefdiving : 0.00 0 0
3.19/3.29 c pscostdiving : 0.00 0 0
3.19/3.29 c fracdiving : 0.00 0 0
3.19/3.29 c veclendiving : 0.00 0 0
3.19/3.29 c intdiving : 0.00 0 0
3.19/3.29 c actconsdiving : 0.00 0 0
3.19/3.29 c objpscostdiving : 0.00 0 0
3.19/3.29 c rootsoldiving : 0.00 0 0
3.19/3.29 c linesearchdiving : 0.00 0 0
3.19/3.29 c guideddiving : 0.00 0 0
3.19/3.29 c octane : 0.00 0 0
3.19/3.29 c rens : 0.00 0 0
3.19/3.29 c rins : 0.00 0 0
3.19/3.29 c localbranching : 0.00 0 0
3.19/3.29 c mutation : 0.00 0 0
3.19/3.29 c crossover : 0.00 0 0
3.19/3.29 c dins : 0.00 0 0
3.19/3.29 c undercover : 0.00 0 0
3.19/3.29 c nlp : 0.00 0 0
3.19/3.29 c trysol : 0.00 0 0
3.19/3.29 c LP : Time Calls Iterations Iter/call Iter/sec
3.19/3.29 c primal LP : 0.00 0 0 0.00 -
3.19/3.29 c dual LP : 0.13 18 1489 82.72 11453.85
3.19/3.29 c lex dual LP : 0.00 0 0 0.00 -
3.19/3.29 c barrier LP : 0.00 0 0 0.00 -
3.19/3.29 c diving/probing LP: 0.00 0 0 0.00 -
3.19/3.29 c strong branching : 2.74 96 44560 464.17 16262.77
3.19/3.29 c (at root node) : - 30 18244 608.13 -
3.19/3.29 c conflict analysis: 0.00 0 0 0.00 -
3.19/3.29 c B&B Tree :
3.19/3.29 c number of runs : 1
3.19/3.29 c nodes : 3
3.19/3.29 c nodes (total) : 3
3.19/3.29 c nodes left : 0
3.19/3.29 c max depth : 1
3.19/3.29 c max depth (total): 1
3.19/3.29 c backtracks : 0 (0.0%)
3.19/3.29 c delayed cutoffs : 0
3.19/3.29 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.19/3.29 c avg switch length: 2.00
3.19/3.29 c switching time : 0.00
3.19/3.29 c Solution :
3.19/3.29 c Solutions found : 0 (0 improvements)
3.19/3.29 c Primal Bound : infeasible
3.19/3.29 c Dual Bound : -
3.19/3.29 c Gap : 0.00 %
3.19/3.29 c Root Dual Bound : +0.00000000000000e+00
3.19/3.29 c Root Iterations : 997
3.19/3.30 c Time complete: 3.29.