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-2665991-1276335579.opb>
0.09/0.19 c original problem has 3736 variables (3736 bin, 0 int, 0 impl, 0 cont) and 10457 constraints
0.09/0.19 c problem read
0.09/0.19 c No objective function, only one solution is needed.
0.09/0.19 c presolving settings loaded
0.19/0.25 c presolving:
0.39/0.46 c (round 1) 474 del vars, 472 del conss, 175 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206361 impls, 0 clqs
0.39/0.49 c (round 2) 484 del vars, 1192 del conss, 185 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206395 impls, 0 clqs
0.49/0.50 c (round 3) 498 del vars, 1216 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206515 impls, 0 clqs
0.49/0.51 c (round 4) 499 del vars, 1238 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.49/0.53 c (round 5) 499 del vars, 1240 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.59/0.64 c (round 6) 499 del vars, 1251 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 9206 upgd conss, 206589 impls, 0 clqs
0.59/0.68 c presolving (7 rounds):
0.59/0.68 c 499 deleted vars, 1251 deleted constraints, 191 tightened bounds, 0 added holes, 184 changed sides, 460 changed coefficients
0.59/0.68 c 206589 implications, 0 cliques
0.59/0.68 c presolved problem has 3237 variables (3237 bin, 0 int, 0 impl, 0 cont) and 9206 constraints
0.59/0.68 c 368 constraints of type <knapsack>
0.59/0.68 c 8838 constraints of type <logicor>
0.59/0.68 c transformed objective value is always integral (scale: 1)
0.59/0.68 c Presolving Time: 0.37
0.59/0.68 c - non default parameters ----------------------------------------------------------------------
0.59/0.68 c # SCIP version 1.2.1.2
0.59/0.68 c
0.59/0.68 c # frequency for displaying node information lines
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.68 c display/freq = 10000
0.59/0.68 c
0.59/0.68 c # maximal time in seconds to run
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.68 c limits/time = 1799.82
0.59/0.68 c
0.59/0.68 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.68 c limits/memory = 1620
0.59/0.68 c
0.59/0.68 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.68 c limits/solutions = 1
0.59/0.68 c
0.59/0.68 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.68 c separating/maxrounds = 1
0.59/0.68 c
0.59/0.68 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.68 c separating/maxroundsroot = 5
0.59/0.68 c
0.59/0.68 c # should presolving try to simplify inequalities
0.59/0.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.68 c constraints/linear/simplifyinequalities = TRUE
0.59/0.68 c
0.59/0.68 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.68 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.68 c constraints/knapsack/disaggregation = FALSE
0.59/0.68 c
0.59/0.68 c # should presolving try to simplify knapsacks
0.59/0.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.68 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.68 c
0.59/0.68 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.68 c presolving/probing/maxrounds = 0
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/coefdiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.68 c heuristics/crossover/freq = -1
0.59/0.68 c
0.59/0.68 c # number of nodes added to the contingent of the total nodes
0.59/0.68 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.68 c heuristics/crossover/nodesofs = 750
0.59/0.68 c
0.59/0.68 c # number of nodes without incumbent change that heuristic should wait
0.59/0.68 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.68 c heuristics/crossover/nwaitingnodes = 100
0.59/0.68 c
0.59/0.68 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.68 c # [type: real, range: [0,1], default: 0.1]
0.59/0.68 c heuristics/crossover/nodesquot = 0.15
0.59/0.68 c
0.59/0.68 c # minimum percentage of integer variables that have to be fixed
0.59/0.68 c # [type: real, range: [0,1], default: 0.666]
0.59/0.68 c heuristics/crossover/minfixingrate = 0.5
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.68 c heuristics/feaspump/freq = -1
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/fracdiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/fracdiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/fracdiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/guideddiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/guideddiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/guideddiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/intdiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/intshifting/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/linesearchdiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/nlp/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.68 c heuristics/objpscostdiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.68 c # [type: real, range: [0,1], default: 0.01]
0.59/0.68 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/oneopt/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/pscostdiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/pscostdiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.68 c heuristics/rens/freq = -1
0.59/0.68 c
0.59/0.68 c # minimum percentage of integer variables that have to be fixable
0.59/0.68 c # [type: real, range: [0,1], default: 0.5]
0.59/0.68 c heuristics/rens/minfixingrate = 0.3
0.59/0.68 c
0.59/0.68 c # number of nodes added to the contingent of the total nodes
0.59/0.68 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.68 c heuristics/rens/nodesofs = 2000
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.68 c heuristics/rootsoldiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.68 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/rounding/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/shifting/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/simplerounding/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.68 c heuristics/trivial/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/trysol/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.68 c heuristics/veclendiving/freq = -1
0.59/0.68 c
0.59/0.68 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.68 c heuristics/veclendiving/maxlpiterquot = 0.075
0.59/0.68 c
0.59/0.68 c # additional number of allowed LP iterations
0.59/0.68 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.68 c heuristics/veclendiving/maxlpiterofs = 1500
0.59/0.68 c
0.59/0.68 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.68 c heuristics/zirounding/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.68 c separating/cmir/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.68 c separating/flowcover/freq = -1
0.59/0.68 c
0.59/0.68 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.59/0.68 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.68 c separating/rapidlearning/freq = 0
0.59/0.68 c
0.59/0.68 c -----------------------------------------------------------------------------------------------
0.59/0.68 c start solving
0.59/0.68 c
0.79/0.84 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.84 c 0.6s| 1 | 0 | 946 | - | 24M| 0 | 763 |3237 |9206 |3237 |9206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.57 c 2.1s| 1 | 0 | 1916 | - | 24M| 0 |1191 |3237 |9457 |3237 |9247 | 49 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.64 c 4.2s| 1 | 0 | 3511 | - | 25M| 0 |1751 |3237 |9457 |3237 |9347 | 149 | 0 | 0 | 0.000000e+00 | -- | Inf
9.39/9.49 c 9.0s| 1 | 0 | 4803 | - | 25M| 0 |1657 |3237 |9457 |3237 |9418 | 220 | 0 | 0 | 0.000000e+00 | -- | Inf
14.39/14.40 c 13.9s| 1 | 0 | 6900 | - | 26M| 0 |1995 |3237 |9457 |3237 |9513 | 315 | 0 | 0 | 0.000000e+00 | -- | Inf
21.58/21.60 c 21.1s| 1 | 0 | 8421 | - | 26M| 0 |2129 |3237 |9457 |3237 |9596 | 398 | 0 | 0 | 0.000000e+00 | -- | Inf
32.78/32.83 c 32.3s| 1 | 2 | 8421 | - | 26M| 0 |2129 |3237 |9457 |3237 |9596 | 398 | 0 | 10 | 0.000000e+00 | -- | Inf
284.31/284.47 c
284.31/284.47 c SCIP Status : problem is solved [infeasible]
284.31/284.47 c Solving Time (sec) : 282.07
284.31/284.47 c Solving Nodes : 318
284.31/284.47 c Primal Bound : +1.00000000000000e+20 (0 solutions)
284.31/284.47 c Dual Bound : +1.00000000000000e+20
284.31/284.47 c Gap : 0.00 %
284.31/284.47 s UNSATISFIABLE
284.31/284.47 c SCIP Status : problem is solved [infeasible]
284.31/284.47 c Solving Time : 282.07
284.31/284.47 c Original Problem :
284.31/284.47 c Problem name : HOME/instance-2665991-1276335579.opb
284.31/284.47 c Variables : 3736 (3736 binary, 0 integer, 0 implicit integer, 0 continuous)
284.31/284.47 c Constraints : 10457 initial, 10457 maximal
284.31/284.47 c Presolved Problem :
284.31/284.47 c Problem name : t_HOME/instance-2665991-1276335579.opb
284.31/284.47 c Variables : 3237 (3237 binary, 0 integer, 0 implicit integer, 0 continuous)
284.31/284.47 c Constraints : 9206 initial, 9696 maximal
284.31/284.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
284.31/284.47 c trivial : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c implics : 0.04 0 304 0 0 0 0 0 0
284.31/284.47 c probing : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c knapsack : 0.00 0 0 0 0 0 0 0 0
284.31/284.47 c linear : 0.26 191 4 0 191 0 1251 184 460
284.31/284.47 c logicor : 0.04 0 0 0 0 0 0 0 0
284.31/284.47 c root node : - 459 - - 459 - - - -
284.31/284.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
284.31/284.47 c integral : 0 0 0 249 0 3 16 0 0 480
284.31/284.47 c knapsack : 368 6 5911 0 0 0 168 1201 0 0
284.31/284.47 c linear : 0+ 5 5910 0 0 5 325 37 0 0
284.31/284.47 c logicor : 8838+ 6 5721 0 0 134 69303 0 0 0
284.31/284.47 c countsols : 0 0 0 0 0 0 0 0 0 0
284.31/284.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
284.31/284.47 c integral : 187.72 0.00 0.00 187.72 0.00
284.31/284.47 c knapsack : 0.06 0.02 0.04 0.00 0.00
284.31/284.47 c linear : 0.12 0.00 0.12 0.00 0.00
284.31/284.47 c logicor : 0.50 0.00 0.50 0.00 0.00
284.31/284.47 c countsols : 0.00 0.00 0.00 0.00 0.00
284.31/284.47 c Propagators : Time Calls Cutoffs DomReds
284.31/284.47 c vbounds : 0.00 1 0 0
284.31/284.47 c rootredcost : 0.00 0 0 0
284.31/284.47 c pseudoobj : 0.01 0 0 0
284.31/284.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
284.31/284.47 c propagation : 0.03 139 136 542 19.7 25 9.2 -
284.31/284.47 c infeasible LP : 0.02 8 8 12 11.0 3 15.0 0
284.31/284.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
284.31/284.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
284.31/284.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
284.31/284.47 c applied globally : - - - 301 13.1 - - -
284.31/284.47 c applied locally : - - - 0 0.0 - - -
284.31/284.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
284.31/284.47 c cut pool : 0.00 4 - - 26 - (maximal pool size: 1038)
284.31/284.47 c redcost : 0.04 248 0 0 0 0
284.31/284.47 c impliedbounds : 0.04 5 0 0 0 0
284.31/284.47 c intobj : 0.00 0 0 0 0 0
284.31/284.47 c cgmip : 0.00 0 0 0 0 0
284.31/284.47 c gomory : 6.81 5 0 0 2353 0
284.31/284.47 c strongcg : 4.41 5 0 0 2446 0
284.31/284.47 c cmir : 0.00 0 0 0 0 0
284.31/284.47 c flowcover : 0.00 0 0 0 0 0
284.31/284.47 c clique : 0.37 5 0 0 40 0
284.31/284.47 c zerohalf : 0.00 0 0 0 0 0
284.31/284.47 c mcf : 0.04 1 0 0 0 0
284.31/284.47 c rapidlearning : 0.86 1 0 2 0 253
284.31/284.47 c Pricers : Time Calls Vars
284.31/284.47 c problem variables: 0.00 0 0
284.31/284.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
284.31/284.47 c relpscost : 187.72 249 3 16 0 0 480
284.31/284.47 c pscost : 0.00 0 0 0 0 0 0
284.31/284.47 c inference : 0.00 0 0 0 0 0 0
284.31/284.47 c mostinf : 0.00 0 0 0 0 0 0
284.31/284.47 c leastinf : 0.00 0 0 0 0 0 0
284.31/284.47 c fullstrong : 0.00 0 0 0 0 0 0
284.31/284.47 c allfullstrong : 0.00 0 0 0 0 0 0
284.31/284.47 c random : 0.00 0 0 0 0 0 0
284.31/284.48 c Primal Heuristics : Time Calls Found
284.31/284.48 c LP solutions : 0.00 - 0
284.31/284.48 c pseudo solutions : 0.00 - 0
284.31/284.48 c trivial : 0.00 1 0
284.31/284.48 c simplerounding : 0.00 0 0
284.31/284.48 c zirounding : 0.00 0 0
284.31/284.48 c rounding : 0.00 0 0
284.31/284.48 c shifting : 0.00 0 0
284.31/284.48 c intshifting : 0.00 0 0
284.31/284.48 c oneopt : 0.00 0 0
284.31/284.48 c twoopt : 0.00 0 0
284.31/284.48 c fixandinfer : 0.00 0 0
284.31/284.48 c feaspump : 0.00 0 0
284.31/284.48 c coefdiving : 0.00 0 0
284.31/284.48 c pscostdiving : 0.00 0 0
284.31/284.48 c fracdiving : 0.00 0 0
284.31/284.48 c veclendiving : 0.00 0 0
284.31/284.48 c intdiving : 0.00 0 0
284.31/284.48 c actconsdiving : 0.00 0 0
284.31/284.48 c objpscostdiving : 0.00 0 0
284.31/284.48 c rootsoldiving : 0.00 0 0
284.31/284.48 c linesearchdiving : 0.00 0 0
284.31/284.48 c guideddiving : 0.00 0 0
284.31/284.48 c octane : 0.00 0 0
284.31/284.48 c rens : 0.00 0 0
284.31/284.48 c rins : 0.00 0 0
284.31/284.48 c localbranching : 0.00 0 0
284.31/284.48 c mutation : 0.00 0 0
284.31/284.48 c crossover : 0.00 0 0
284.31/284.48 c dins : 0.00 0 0
284.31/284.48 c undercover : 0.00 0 0
284.31/284.48 c nlp : 0.00 0 0
284.31/284.48 c trysol : 0.00 0 0
284.31/284.48 c LP : Time Calls Iterations Iter/call Iter/sec
284.31/284.48 c primal LP : 0.02 0 0 0.00 0.00
284.31/284.48 c dual LP : 78.87 262 88182 336.57 1118.07
284.31/284.48 c lex dual LP : 0.00 0 0 0.00 -
284.31/284.48 c barrier LP : 0.00 0 0 0.00 -
284.31/284.48 c diving/probing LP: 0.00 0 0 0.00 -
284.31/284.48 c strong branching : 187.56 218 154404 708.28 823.22
284.31/284.48 c (at root node) : - 10 7677 767.70 -
284.31/284.48 c conflict analysis: 0.00 0 0 0.00 -
284.31/284.48 c B&B Tree :
284.31/284.48 c number of runs : 1
284.31/284.48 c nodes : 318
284.31/284.48 c nodes (total) : 318
284.31/284.48 c nodes left : 0
284.31/284.48 c max depth : 29
284.31/284.48 c max depth (total): 29
284.31/284.48 c backtracks : 81 (25.5%)
284.31/284.48 c delayed cutoffs : 163
284.31/284.48 c repropagations : 250 (26581 domain reductions, 72 cutoffs)
284.31/284.48 c avg switch length: 3.08
284.31/284.48 c switching time : 0.40
284.31/284.48 c Solution :
284.31/284.48 c Solutions found : 0 (0 improvements)
284.31/284.48 c Primal Bound : infeasible
284.31/284.48 c Dual Bound : -
284.31/284.48 c Gap : 0.00 %
284.31/284.48 c Root Dual Bound : +0.00000000000000e+00
284.31/284.48 c Root Iterations : 8421
284.40/284.54 c Time complete: 284.45.