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-2665970-1276330081.opb>
0.39/0.46 c original problem has 8937 variables (8937 bin, 0 int, 0 impl, 0 cont) and 26319 constraints
0.39/0.46 c problem read
0.39/0.46 c No objective function, only one solution is needed.
0.39/0.46 c presolving settings loaded
0.59/0.60 c presolving:
1.09/1.19 c (round 1) 503 del vars, 530 del conss, 230 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 691346 impls, 0 clqs
1.20/1.27 c (round 2) 615 del vars, 1458 del conss, 316 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 692636 impls, 0 clqs
1.29/1.31 c (round 3) 622 del vars, 1569 del conss, 327 chg bounds, 136 chg sides, 420 chg coeffs, 0 upgd conss, 693203 impls, 0 clqs
1.29/1.34 c (round 4) 635 del vars, 1608 del conss, 332 chg bounds, 136 chg sides, 430 chg coeffs, 0 upgd conss, 693365 impls, 0 clqs
1.59/1.61 c (round 5) 635 del vars, 1617 del conss, 332 chg bounds, 136 chg sides, 430 chg coeffs, 24702 upgd conss, 693365 impls, 0 clqs
1.59/1.68 c presolving (6 rounds):
1.59/1.68 c 635 deleted vars, 1617 deleted constraints, 332 tightened bounds, 0 added holes, 136 changed sides, 430 changed coefficients
1.59/1.68 c 693365 implications, 0 cliques
1.59/1.68 c presolved problem has 8302 variables (8302 bin, 0 int, 0 impl, 0 cont) and 24702 constraints
1.59/1.68 c 272 constraints of type <knapsack>
1.59/1.68 c 24430 constraints of type <logicor>
1.59/1.68 c transformed objective value is always integral (scale: 1)
1.59/1.68 c Presolving Time: 1.00
1.59/1.68 c - non default parameters ----------------------------------------------------------------------
1.59/1.68 c # SCIP version 1.2.1.2
1.59/1.68 c
1.59/1.68 c # frequency for displaying node information lines
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 100]
1.59/1.68 c display/freq = 10000
1.59/1.68 c
1.59/1.68 c # maximal time in seconds to run
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.68 c limits/time = 1799.54
1.59/1.68 c
1.59/1.68 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.68 c limits/memory = 1620
1.59/1.68 c
1.59/1.68 c # solving stops, if the given number of solutions were found (-1: no limit)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.68 c limits/solutions = 1
1.59/1.68 c
1.59/1.68 c # maximal number of separation rounds per node (-1: unlimited)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 5]
1.59/1.68 c separating/maxrounds = 1
1.59/1.68 c
1.59/1.68 c # maximal number of separation rounds in the root node (-1: unlimited)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.68 c separating/maxroundsroot = 5
1.59/1.68 c
1.59/1.68 c # should presolving try to simplify inequalities
1.59/1.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.68 c constraints/linear/simplifyinequalities = TRUE
1.59/1.68 c
1.59/1.68 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.59/1.68 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.59/1.68 c constraints/knapsack/disaggregation = FALSE
1.59/1.68 c
1.59/1.68 c # should presolving try to simplify knapsacks
1.59/1.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.68 c constraints/knapsack/simplifyinequalities = TRUE
1.59/1.68 c
1.59/1.68 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.68 c presolving/probing/maxrounds = 0
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/coefdiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/coefdiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/coefdiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 30]
1.59/1.68 c heuristics/crossover/freq = -1
1.59/1.68 c
1.59/1.68 c # number of nodes added to the contingent of the total nodes
1.59/1.68 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.59/1.68 c heuristics/crossover/nodesofs = 750
1.59/1.68 c
1.59/1.68 c # number of nodes without incumbent change that heuristic should wait
1.59/1.68 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.59/1.68 c heuristics/crossover/nwaitingnodes = 100
1.59/1.68 c
1.59/1.68 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.59/1.68 c # [type: real, range: [0,1], default: 0.1]
1.59/1.68 c heuristics/crossover/nodesquot = 0.15
1.59/1.68 c
1.59/1.68 c # minimum percentage of integer variables that have to be fixed
1.59/1.68 c # [type: real, range: [0,1], default: 0.666]
1.59/1.68 c heuristics/crossover/minfixingrate = 0.5
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.68 c heuristics/feaspump/freq = -1
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/feaspump/maxlpiterofs = 2000
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/fracdiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/fracdiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/fracdiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/guideddiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/guideddiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/guideddiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/intdiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/intshifting/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/linesearchdiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/nlp/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.68 c heuristics/objpscostdiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to total iteration number
1.59/1.68 c # [type: real, range: [0,1], default: 0.01]
1.59/1.68 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/oneopt/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/pscostdiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/pscostdiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.68 c heuristics/rens/freq = -1
1.59/1.68 c
1.59/1.68 c # minimum percentage of integer variables that have to be fixable
1.59/1.68 c # [type: real, range: [0,1], default: 0.5]
1.59/1.68 c heuristics/rens/minfixingrate = 0.3
1.59/1.68 c
1.59/1.68 c # number of nodes added to the contingent of the total nodes
1.59/1.68 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.59/1.68 c heuristics/rens/nodesofs = 2000
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.68 c heuristics/rootsoldiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.59/1.68 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/rounding/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/shifting/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/simplerounding/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.68 c heuristics/trivial/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/trysol/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.68 c heuristics/veclendiving/freq = -1
1.59/1.68 c
1.59/1.68 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.68 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.68 c heuristics/veclendiving/maxlpiterquot = 0.075
1.59/1.68 c
1.59/1.68 c # additional number of allowed LP iterations
1.59/1.68 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.68 c heuristics/veclendiving/maxlpiterofs = 1500
1.59/1.68 c
1.59/1.68 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.68 c heuristics/zirounding/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.68 c separating/cmir/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.68 c separating/flowcover/freq = -1
1.59/1.68 c
1.59/1.68 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.59/1.68 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.68 c separating/rapidlearning/freq = 0
1.59/1.68 c
1.59/1.68 c -----------------------------------------------------------------------------------------------
1.59/1.68 c start solving
1.59/1.69 c
1.99/2.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.03 c 1.4s| 1 | 0 | 702 | - | 66M| 0 | 536 |8302 | 24k|8302 | 24k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.79/4.83 c 4.0s| 1 | 0 | 1475 | - | 67M| 0 | 992 |8302 | 24k|8302 | 24k| 79 | 0 | 0 | 0.000000e+00 | -- | Inf
13.48/13.55 c 12.6s| 1 | 0 | 3894 | - | 67M| 0 |1513 |8302 | 24k|8302 | 24k| 139 | 0 | 0 | 0.000000e+00 | -- | Inf
22.49/22.55 c 21.5s| 1 | 0 | 6762 | - | 67M| 0 |2309 |8302 | 24k|8302 | 24k| 214 | 0 | 0 | 0.000000e+00 | -- | Inf
37.78/37.82 c 36.7s| 1 | 0 | 10067 | - | 67M| 0 |2536 |8302 | 24k|8302 | 24k| 272 | 0 | 0 | 0.000000e+00 | -- | Inf
45.57/45.66 c 44.5s| 1 | 0 | 11806 | - | 68M| 0 |2807 |8302 | 24k|8302 | 25k| 309 | 0 | 0 | 0.000000e+00 | -- | Inf
163.54/163.61 c 162s| 1 | 2 | 11806 | - | 68M| 0 |2807 |8302 | 24k|8302 | 25k| 309 | 0 | 33 | 0.000000e+00 | -- | Inf
713.48/713.74 c
713.48/713.74 c SCIP Status : problem is solved [infeasible]
713.48/713.74 c Solving Time (sec) : 707.07
713.48/713.74 c Solving Nodes : 87
713.48/713.74 c Primal Bound : +1.00000000000000e+20 (0 solutions)
713.48/713.74 c Dual Bound : +1.00000000000000e+20
713.48/713.74 c Gap : 0.00 %
713.48/713.74 s UNSATISFIABLE
713.48/713.74 c SCIP Status : problem is solved [infeasible]
713.48/713.74 c Solving Time : 707.07
713.48/713.74 c Original Problem :
713.48/713.74 c Problem name : HOME/instance-2665970-1276330081.opb
713.48/713.74 c Variables : 8937 (8937 binary, 0 integer, 0 implicit integer, 0 continuous)
713.48/713.74 c Constraints : 26319 initial, 26319 maximal
713.48/713.74 c Presolved Problem :
713.48/713.74 c Problem name : t_HOME/instance-2665970-1276330081.opb
713.48/713.74 c Variables : 8302 (8302 binary, 0 integer, 0 implicit integer, 0 continuous)
713.48/713.74 c Constraints : 24702 initial, 24703 maximal
713.48/713.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
713.48/713.74 c trivial : 0.01 30 0 0 0 0 0 0 0
713.48/713.74 c dualfix : 0.00 0 0 0 0 0 0 0 0
713.48/713.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
713.48/713.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
713.48/713.74 c implics : 0.09 0 284 0 0 0 0 0 0
713.48/713.74 c probing : 0.00 0 0 0 0 0 0 0 0
713.48/713.74 c knapsack : 0.01 0 0 0 0 0 0 0 0
713.48/713.74 c linear : 0.70 320 1 0 332 0 1617 136 430
713.48/713.74 c logicor : 0.11 0 0 0 0 0 0 0 0
713.48/713.74 c root node : - 4668 - - 4668 - - - -
713.48/713.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
713.48/713.74 c integral : 0 0 0 71 0 0 2 0 0 140
713.48/713.74 c knapsack : 272 5 1346 0 0 0 38 728 0 0
713.48/713.74 c logicor : 24430+ 5 1216 0 0 23 41469 0 0 0
713.48/713.74 c countsols : 0 0 0 0 0 0 0 0 0 0
713.48/713.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
713.48/713.74 c integral : 565.00 0.00 0.00 565.00 0.00
713.48/713.74 c knapsack : 0.07 0.03 0.04 0.00 0.00
713.48/713.74 c logicor : 0.55 0.01 0.54 0.00 0.00
713.48/713.74 c countsols : 0.00 0.00 0.00 0.00 0.00
713.48/713.74 c Propagators : Time Calls Cutoffs DomReds
713.48/713.74 c vbounds : 0.00 1 0 0
713.48/713.74 c rootredcost : 0.00 0 0 0
713.48/713.74 c pseudoobj : 0.00 0 0 0
713.48/713.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
713.48/713.74 c propagation : 0.00 23 21 34 3.2 5 2.8 -
713.48/713.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
713.48/713.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
713.48/713.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
713.48/713.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
713.48/713.74 c applied globally : - - - 37 3.1 - - -
713.48/713.74 c applied locally : - - - 0 0.0 - - -
713.48/713.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
713.48/713.74 c cut pool : 0.00 4 - - 41 - (maximal pool size: 798)
713.48/713.74 c redcost : 0.07 74 0 0 0 0
713.48/713.74 c impliedbounds : 0.04 5 0 0 0 0
713.48/713.74 c intobj : 0.00 0 0 0 0 0
713.48/713.74 c cgmip : 0.00 0 0 0 0 0
713.48/713.74 c gomory : 9.54 5 0 0 2500 0
713.48/713.74 c strongcg : 6.43 5 0 0 2500 0
713.48/713.74 c cmir : 0.00 0 0 0 0 0
713.48/713.74 c flowcover : 0.00 0 0 0 0 0
713.48/713.74 c clique : 1.31 5 0 0 40 0
713.48/713.74 c zerohalf : 0.00 0 0 0 0 0
713.48/713.74 c mcf : 0.91 1 0 0 0 0
713.48/713.74 c rapidlearning : 0.00 0 0 0 0 0
713.48/713.74 c Pricers : Time Calls Vars
713.48/713.74 c problem variables: 0.00 0 0
713.48/713.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
713.48/713.74 c relpscost : 565.00 71 0 2 0 0 140
713.48/713.74 c pscost : 0.00 0 0 0 0 0 0
713.48/713.74 c inference : 0.00 0 0 0 0 0 0
713.48/713.74 c mostinf : 0.00 0 0 0 0 0 0
713.48/713.74 c leastinf : 0.00 0 0 0 0 0 0
713.48/713.74 c fullstrong : 0.00 0 0 0 0 0 0
713.48/713.74 c allfullstrong : 0.00 0 0 0 0 0 0
713.48/713.74 c random : 0.00 0 0 0 0 0 0
713.48/713.74 c Primal Heuristics : Time Calls Found
713.48/713.74 c LP solutions : 0.00 - 0
713.48/713.74 c pseudo solutions : 0.00 - 0
713.48/713.74 c trivial : 0.01 1 0
713.48/713.74 c simplerounding : 0.00 0 0
713.48/713.74 c zirounding : 0.00 0 0
713.48/713.74 c rounding : 0.00 0 0
713.48/713.74 c shifting : 0.00 0 0
713.48/713.74 c intshifting : 0.00 0 0
713.48/713.74 c oneopt : 0.00 0 0
713.48/713.74 c twoopt : 0.00 0 0
713.48/713.74 c fixandinfer : 0.00 0 0
713.48/713.74 c feaspump : 0.00 0 0
713.48/713.74 c coefdiving : 0.00 0 0
713.48/713.74 c pscostdiving : 0.00 0 0
713.48/713.74 c fracdiving : 0.00 0 0
713.48/713.74 c veclendiving : 0.00 0 0
713.48/713.74 c intdiving : 0.00 0 0
713.48/713.74 c actconsdiving : 0.00 0 0
713.48/713.74 c objpscostdiving : 0.00 0 0
713.48/713.74 c rootsoldiving : 0.00 0 0
713.48/713.74 c linesearchdiving : 0.00 0 0
713.48/713.74 c guideddiving : 0.00 0 0
713.48/713.74 c octane : 0.00 0 0
713.48/713.74 c rens : 0.00 0 0
713.48/713.74 c rins : 0.00 0 0
713.48/713.74 c localbranching : 0.00 0 0
713.48/713.74 c mutation : 0.00 0 0
713.48/713.74 c crossover : 0.00 0 0
713.48/713.74 c dins : 0.00 0 0
713.48/713.74 c undercover : 0.00 0 0
713.48/713.74 c nlp : 0.00 0 0
713.48/713.74 c trysol : 0.00 0 0
713.48/713.74 c LP : Time Calls Iterations Iter/call Iter/sec
713.48/713.74 c primal LP : 0.03 0 0 0.00 0.00
713.48/713.74 c dual LP : 120.77 76 45910 604.08 380.14
713.48/713.74 c lex dual LP : 0.00 0 0 0.00 -
713.48/713.74 c barrier LP : 0.00 0 0 0.00 -
713.48/713.74 c diving/probing LP: 0.00 0 0 0.00 -
713.48/713.74 c strong branching : 564.81 186 165137 887.83 292.38
713.48/713.74 c (at root node) : - 33 33000 1000.00 -
713.48/713.74 c conflict analysis: 0.00 0 0 0.00 -
713.48/713.74 c B&B Tree :
713.48/713.74 c number of runs : 1
713.48/713.74 c nodes : 87
713.48/713.74 c nodes (total) : 87
713.48/713.74 c nodes left : 0
713.48/713.74 c max depth : 38
713.48/713.74 c max depth (total): 38
713.48/713.74 c backtracks : 9 (10.3%)
713.48/713.74 c delayed cutoffs : 54
713.48/713.74 c repropagations : 123 (11917 domain reductions, 6 cutoffs)
713.48/713.74 c avg switch length: 4.51
713.48/713.74 c switching time : 0.24
713.48/713.74 c Solution :
713.48/713.74 c Solutions found : 0 (0 improvements)
713.48/713.74 c Primal Bound : infeasible
713.48/713.74 c Dual Bound : -
713.48/713.74 c Gap : 0.00 %
713.48/713.74 c Root Dual Bound : +0.00000000000000e+00
713.48/713.74 c Root Iterations : 11806
713.58/713.89 c Time complete: 713.66.