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-2665977-1276333149.opb>
0.29/0.30 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.29/0.30 c problem read
0.29/0.30 c No objective function, only one solution is needed.
0.29/0.30 c presolving settings loaded
0.29/0.40 c presolving:
0.69/0.71 c (round 1) 1234 del vars, 2261 del conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 298456 impls, 0 clqs
0.69/0.75 c (round 2) 1262 del vars, 3404 del conss, 795 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 298562 impls, 0 clqs
0.69/0.77 c (round 3) 1265 del vars, 3413 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298654 impls, 0 clqs
0.69/0.79 c (round 4) 1266 del vars, 3420 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.79/0.81 c (round 5) 1266 del vars, 3422 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.89/0.97 c (round 6) 1266 del vars, 3477 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13207 upgd conss, 298834 impls, 0 clqs
1.00/1.02 c presolving (7 rounds):
1.00/1.02 c 1266 deleted vars, 3477 deleted constraints, 796 tightened bounds, 0 added holes, 374 changed sides, 881 changed coefficients
1.00/1.02 c 298834 implications, 0 cliques
1.00/1.02 c presolved problem has 4793 variables (4793 bin, 0 int, 0 impl, 0 cont) and 13207 constraints
1.00/1.02 c 716 constraints of type <knapsack>
1.00/1.02 c 12491 constraints of type <logicor>
1.00/1.02 c transformed objective value is always integral (scale: 1)
1.00/1.02 c Presolving Time: 0.56
1.00/1.02 c - non default parameters ----------------------------------------------------------------------
1.00/1.02 c # SCIP version 1.2.1.2
1.00/1.02 c
1.00/1.02 c # frequency for displaying node information lines
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 100]
1.00/1.02 c display/freq = 10000
1.00/1.02 c
1.00/1.02 c # maximal time in seconds to run
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.02 c limits/time = 1799.71
1.00/1.02 c
1.00/1.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.02 c limits/memory = 1620
1.00/1.02 c
1.00/1.02 c # solving stops, if the given number of solutions were found (-1: no limit)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c limits/solutions = 1
1.00/1.02 c
1.00/1.02 c # maximal number of separation rounds per node (-1: unlimited)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 5]
1.00/1.02 c separating/maxrounds = 1
1.00/1.02 c
1.00/1.02 c # maximal number of separation rounds in the root node (-1: unlimited)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c separating/maxroundsroot = 5
1.00/1.02 c
1.00/1.02 c # should presolving try to simplify inequalities
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.02 c constraints/linear/simplifyinequalities = TRUE
1.00/1.02 c
1.00/1.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.00/1.02 c constraints/knapsack/disaggregation = FALSE
1.00/1.02 c
1.00/1.02 c # should presolving try to simplify knapsacks
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.02 c constraints/knapsack/simplifyinequalities = TRUE
1.00/1.02 c
1.00/1.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c presolving/probing/maxrounds = 0
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/coefdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/coefdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/coefdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 30]
1.00/1.02 c heuristics/crossover/freq = -1
1.00/1.02 c
1.00/1.02 c # number of nodes added to the contingent of the total nodes
1.00/1.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.02 c heuristics/crossover/nodesofs = 750
1.00/1.02 c
1.00/1.02 c # number of nodes without incumbent change that heuristic should wait
1.00/1.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.00/1.02 c heuristics/crossover/nwaitingnodes = 100
1.00/1.02 c
1.00/1.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.00/1.02 c # [type: real, range: [0,1], default: 0.1]
1.00/1.02 c heuristics/crossover/nodesquot = 0.15
1.00/1.02 c
1.00/1.02 c # minimum percentage of integer variables that have to be fixed
1.00/1.02 c # [type: real, range: [0,1], default: 0.666]
1.00/1.02 c heuristics/crossover/minfixingrate = 0.5
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.02 c heuristics/feaspump/freq = -1
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/feaspump/maxlpiterofs = 2000
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/fracdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/fracdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/fracdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/guideddiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/guideddiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/guideddiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/intdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/intshifting/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/linesearchdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/nlp/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.02 c heuristics/objpscostdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to total iteration number
1.00/1.02 c # [type: real, range: [0,1], default: 0.01]
1.00/1.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/oneopt/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/pscostdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/pscostdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.02 c heuristics/rens/freq = -1
1.00/1.02 c
1.00/1.02 c # minimum percentage of integer variables that have to be fixable
1.00/1.02 c # [type: real, range: [0,1], default: 0.5]
1.00/1.02 c heuristics/rens/minfixingrate = 0.3
1.00/1.02 c
1.00/1.02 c # number of nodes added to the contingent of the total nodes
1.00/1.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.02 c heuristics/rens/nodesofs = 2000
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.02 c heuristics/rootsoldiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.00/1.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/rounding/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/shifting/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/simplerounding/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.02 c heuristics/trivial/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/trysol/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/veclendiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/veclendiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/veclendiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c heuristics/zirounding/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.02 c separating/cmir/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.02 c separating/flowcover/freq = -1
1.00/1.02 c
1.00/1.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c separating/rapidlearning/freq = 0
1.00/1.02 c
1.00/1.02 c -----------------------------------------------------------------------------------------------
1.00/1.02 c start solving
1.00/1.02 c
1.19/1.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.21 c 0.8s| 1 | 0 | 1085 | - | 37M| 0 | 925 |4793 | 13k|4793 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.06 c 1.5s| 1 | 0 | 1675 | - | 37M| 0 |1077 |4793 | 13k|4793 | 13k| 83 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.90 c 2.4s| 1 | 0 | 2822 | - | 37M| 0 |1595 |4793 | 13k|4793 | 13k| 156 | 0 | 0 | 0.000000e+00 | -- | Inf
5.19/5.26 c 4.7s| 1 | 0 | 4801 | - | 38M| 0 |2184 |4793 | 13k|4793 | 13k| 296 | 0 | 0 | 0.000000e+00 | -- | Inf
14.59/14.60 c 14.0s| 1 | 0 | 7810 | - | 38M| 0 |2756 |4793 | 13k|4793 | 13k| 443 | 0 | 0 | 0.000000e+00 | -- | Inf
26.18/26.20 c 25.5s| 1 | 0 | 10074 | - | 39M| 0 |2870 |4793 | 13k|4793 | 13k| 571 | 0 | 0 | 0.000000e+00 | -- | Inf
81.46/81.50 c 80.3s| 1 | 2 | 10074 | - | 39M| 0 |2870 |4793 | 13k|4793 | 13k| 571 | 0 | 30 | 0.000000e+00 | -- | Inf
359.49/359.65 c
359.49/359.65 c SCIP Status : problem is solved [infeasible]
359.49/359.65 c Solving Time (sec) : 354.84
359.49/359.65 c Solving Nodes : 318
359.49/359.65 c Primal Bound : +1.00000000000000e+20 (0 solutions)
359.49/359.65 c Dual Bound : +1.00000000000000e+20
359.49/359.65 c Gap : 0.00 %
359.49/359.65 s UNSATISFIABLE
359.49/359.65 c SCIP Status : problem is solved [infeasible]
359.49/359.65 c Solving Time : 354.84
359.49/359.65 c Original Problem :
359.49/359.65 c Problem name : HOME/instance-2665977-1276333149.opb
359.49/359.65 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
359.49/359.65 c Constraints : 16684 initial, 16684 maximal
359.49/359.65 c Presolved Problem :
359.49/359.65 c Problem name : t_HOME/instance-2665977-1276333149.opb
359.49/359.65 c Variables : 4793 (4793 binary, 0 integer, 0 implicit integer, 0 continuous)
359.49/359.65 c Constraints : 13207 initial, 13358 maximal
359.49/359.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
359.49/359.65 c trivial : 0.02 3 0 0 0 0 0 0 0
359.49/359.65 c dualfix : 0.01 1 0 0 0 0 0 0 0
359.49/359.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
359.49/359.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
359.49/359.65 c implics : 0.05 0 456 0 0 0 0 0 0
359.49/359.65 c probing : 0.00 0 0 0 0 0 0 0 0
359.49/359.65 c knapsack : 0.01 0 0 0 0 0 0 0 0
359.49/359.65 c linear : 0.35 796 10 0 796 0 3477 374 881
359.49/359.65 c logicor : 0.07 0 0 0 0 0 0 0 0
359.49/359.65 c root node : - 236 - - 236 - - - -
359.49/359.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
359.49/359.65 c integral : 0 0 0 281 0 0 19 0 0 546
359.49/359.65 c knapsack : 716 5 3664 0 0 1 183 1003 0 0
359.49/359.65 c logicor : 12491+ 5 3441 0 0 85 62363 0 0 0
359.49/359.65 c countsols : 0 0 0 0 0 0 0 0 0 0
359.49/359.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
359.49/359.65 c integral : 250.00 0.00 0.00 250.00 0.00
359.49/359.65 c knapsack : 0.11 0.01 0.10 0.00 0.00
359.49/359.65 c logicor : 0.46 0.03 0.43 0.00 0.00
359.49/359.65 c countsols : 0.00 0.00 0.00 0.00 0.00
359.49/359.65 c Propagators : Time Calls Cutoffs DomReds
359.49/359.65 c vbounds : 0.00 1 0 0
359.49/359.65 c rootredcost : 0.00 0 0 0
359.49/359.65 c pseudoobj : 0.00 0 0 0
359.49/359.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
359.49/359.65 c propagation : 0.03 86 75 273 21.4 17 5.3 -
359.49/359.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
359.49/359.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
359.49/359.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
359.49/359.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
359.49/359.65 c applied globally : - - - 167 12.9 - - -
359.49/359.65 c applied locally : - - - 0 0.0 - - -
359.49/359.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
359.49/359.65 c cut pool : 0.00 4 - - 104 - (maximal pool size: 1634)
359.49/359.65 c redcost : 0.12 277 0 0 0 0
359.49/359.65 c impliedbounds : 0.02 5 0 0 0 0
359.49/359.65 c intobj : 0.00 0 0 0 0 0
359.49/359.65 c cgmip : 0.00 0 0 0 0 0
359.49/359.65 c gomory : 6.94 5 0 0 2500 0
359.49/359.65 c strongcg : 4.26 5 0 0 2500 0
359.49/359.65 c cmir : 0.00 0 0 0 0 0
359.49/359.65 c flowcover : 0.00 0 0 0 0 0
359.49/359.65 c clique : 0.51 5 0 0 38 0
359.49/359.65 c zerohalf : 0.00 0 0 0 0 0
359.49/359.65 c mcf : 0.07 1 0 0 0 0
359.49/359.65 c rapidlearning : 0.00 0 0 0 0 0
359.49/359.65 c Pricers : Time Calls Vars
359.49/359.65 c problem variables: 0.00 0 0
359.49/359.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
359.49/359.65 c relpscost : 250.00 281 0 19 0 0 546
359.49/359.65 c pscost : 0.00 0 0 0 0 0 0
359.49/359.65 c inference : 0.00 0 0 0 0 0 0
359.49/359.65 c mostinf : 0.00 0 0 0 0 0 0
359.49/359.65 c leastinf : 0.00 0 0 0 0 0 0
359.49/359.65 c fullstrong : 0.00 0 0 0 0 0 0
359.49/359.65 c allfullstrong : 0.00 0 0 0 0 0 0
359.49/359.65 c random : 0.00 0 0 0 0 0 0
359.49/359.65 c Primal Heuristics : Time Calls Found
359.49/359.65 c LP solutions : 0.00 - 0
359.49/359.65 c pseudo solutions : 0.00 - 0
359.49/359.65 c trivial : 0.01 1 0
359.49/359.65 c simplerounding : 0.00 0 0
359.49/359.65 c zirounding : 0.00 0 0
359.49/359.65 c rounding : 0.00 0 0
359.49/359.65 c shifting : 0.00 0 0
359.49/359.65 c intshifting : 0.00 0 0
359.49/359.65 c oneopt : 0.00 0 0
359.49/359.65 c twoopt : 0.00 0 0
359.49/359.65 c fixandinfer : 0.00 0 0
359.49/359.65 c feaspump : 0.00 0 0
359.49/359.65 c coefdiving : 0.00 0 0
359.49/359.65 c pscostdiving : 0.00 0 0
359.49/359.65 c fracdiving : 0.00 0 0
359.49/359.65 c veclendiving : 0.00 0 0
359.49/359.65 c intdiving : 0.00 0 0
359.49/359.65 c actconsdiving : 0.00 0 0
359.49/359.65 c objpscostdiving : 0.00 0 0
359.49/359.65 c rootsoldiving : 0.00 0 0
359.49/359.65 c linesearchdiving : 0.00 0 0
359.49/359.65 c guideddiving : 0.00 0 0
359.49/359.65 c octane : 0.00 0 0
359.49/359.65 c rens : 0.00 0 0
359.49/359.65 c rins : 0.00 0 0
359.49/359.65 c localbranching : 0.00 0 0
359.49/359.65 c mutation : 0.00 0 0
359.49/359.65 c crossover : 0.00 0 0
359.49/359.65 c dins : 0.00 0 0
359.49/359.65 c undercover : 0.00 0 0
359.49/359.65 c nlp : 0.00 0 0
359.49/359.65 c trysol : 0.00 0 0
359.49/359.65 c LP : Time Calls Iterations Iter/call Iter/sec
359.49/359.65 c primal LP : 0.02 0 0 0.00 0.00
359.49/359.65 c dual LP : 89.28 286 67415 235.72 755.10
359.49/359.65 c lex dual LP : 0.00 0 0 0.00 -
359.49/359.65 c barrier LP : 0.00 0 0 0.00 -
359.49/359.65 c diving/probing LP: 0.00 0 0 0.00 -
359.49/359.65 c strong branching : 249.84 285 161156 565.46 645.04
359.49/359.65 c (at root node) : - 30 21700 723.33 -
359.49/359.65 c conflict analysis: 0.00 0 0 0.00 -
359.49/359.65 c B&B Tree :
359.49/359.65 c number of runs : 1
359.49/359.65 c nodes : 318
359.49/359.65 c nodes (total) : 318
359.49/359.65 c nodes left : 0
359.49/359.65 c max depth : 144
359.49/359.65 c max depth (total): 144
359.49/359.65 c backtracks : 45 (14.2%)
359.49/359.65 c delayed cutoffs : 229
359.49/359.65 c repropagations : 149 (21509 domain reductions, 41 cutoffs)
359.49/359.65 c avg switch length: 2.84
359.49/359.65 c switching time : 0.39
359.49/359.65 c Solution :
359.49/359.65 c Solutions found : 0 (0 improvements)
359.49/359.65 c Primal Bound : infeasible
359.49/359.65 c Dual Bound : -
359.49/359.65 c Gap : 0.00 %
359.49/359.65 c Root Dual Bound : +0.00000000000000e+00
359.49/359.65 c Root Iterations : 10074
359.59/359.75 c Time complete: 359.64.