0.19/0.26 c SCIP version 1.1.0.7
0.19/0.26 c LP-Solver Clp 1.8.2
0.19/0.26 c user parameter file <scip.set> not found - using default parameters
0.19/0.26 c read problem <HOME/instance-1868577-1245128576.opb>
0.19/0.26 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.29/0.35 c No objective function, only one solution is needed.
0.29/0.35 c start presolving problem
0.29/0.35 c presolving:
0.59/0.66 c (round 1) 1228 del vars, 2251 del conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 297846 impls, 0 clqs
0.69/0.70 c (round 2) 1256 del vars, 3394 del conss, 796 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 297952 impls, 0 clqs
0.69/0.71 c (round 3) 1259 del vars, 3403 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298044 impls, 0 clqs
0.69/0.73 c (round 4) 1260 del vars, 3410 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298224 impls, 0 clqs
0.69/0.74 c (round 5) 1260 del vars, 3412 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298224 impls, 0 clqs
0.79/0.89 c (round 6) 1260 del vars, 3467 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 13214 upgd conss, 298224 impls, 0 clqs
0.89/0.97 c (round 7) 1260 del vars, 3467 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 13217 upgd conss, 298224 impls, 0 clqs
0.99/1.00 c presolving (8 rounds):
0.99/1.00 c 1260 deleted vars, 3467 deleted constraints, 797 tightened bounds, 0 added holes, 374 changed sides, 881 changed coefficients
0.99/1.00 c 298224 implications, 0 cliques
0.99/1.00 c presolved problem has 4799 variables (4799 bin, 0 int, 0 impl, 0 cont) and 13217 constraints
0.99/1.00 c 716 constraints of type <knapsack>
0.99/1.00 c 12501 constraints of type <logicor>
0.99/1.00 c transformed objective value is always integral (scale: 1)
0.99/1.00 c Presolving Time: 0.58
0.99/1.00 c SATUNSAT-LIN
0.99/1.00 c -----------------------------------------------------------------------------------------------
0.99/1.00 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.00 c separating/flowcover/freq = c -1
0.99/1.00 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.00 c separating/cmir/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/veclendiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/veclendiving/freq = c -1
0.99/1.00 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.00 c heuristics/simplerounding/freq = c -1
0.99/1.00 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/shifting/freq = c -1
0.99/1.00 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.00 c heuristics/rounding/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.99/1.00 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.99/1.00 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.00 c heuristics/rootsoldiving/freq = c -1
0.99/1.00 c # number of nodes added to the contingent of the total nodes
0.99/1.00 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.00 c heuristics/rens/nodesofs = c 2000
0.99/1.00 c # minimum percentage of integer variables that have to be fixable
0.99/1.00 c # [type: real, range: [0,1], default: 0.5]
0.99/1.00 c heuristics/rens/minfixingrate = c 0.3
0.99/1.00 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.00 c heuristics/rens/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/pscostdiving/freq = c -1
0.99/1.00 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.00 c heuristics/oneopt/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to total iteration number
0.99/1.00 c # [type: real, range: [0,1], default: 0.01]
0.99/1.00 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.99/1.00 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.00 c heuristics/objpscostdiving/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/linesearchdiving/freq = c -1
0.99/1.00 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/intshifting/freq = c -1
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/intdiving/maxlpiterquot = c 0.075
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/guideddiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/guideddiving/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/fracdiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/fracdiving/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/feaspump/maxlpiterofs = c 2000
0.99/1.00 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.00 c heuristics/feaspump/freq = c -1
0.99/1.00 c # minimum percentage of integer variables that have to be fixed
0.99/1.00 c # [type: real, range: [0,1], default: 0.666]
0.99/1.00 c heuristics/crossover/minfixingrate = c 0.5
0.99/1.00 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.99/1.00 c # [type: real, range: [0,1], default: 0.1]
0.99/1.00 c heuristics/crossover/nodesquot = c 0.15
0.99/1.00 c # number of nodes without incumbent change that heuristic should wait
0.99/1.00 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.99/1.00 c heuristics/crossover/nwaitingnodes = c 100
0.99/1.00 c # number of nodes added to the contingent of the total nodes
0.99/1.00 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.00 c heuristics/crossover/nodesofs = c 750
0.99/1.00 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 30]
0.99/1.00 c heuristics/crossover/freq = c -1
0.99/1.00 c # additional number of allowed LP iterations
0.99/1.00 c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.00 c heuristics/coefdiving/maxlpiterofs = c 1500
0.99/1.00 c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.00 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.00 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.99/1.00 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.00 c heuristics/coefdiving/freq = c -1
0.99/1.00 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.00 c presolving/probing/maxrounds = c 0
0.99/1.00 c # should presolving try to simplify knapsacks
0.99/1.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.00 c constraints/knapsack/simplifyinequalities = c TRUE
0.99/1.00 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.99/1.00 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.99/1.00 c constraints/knapsack/disaggregation = c FALSE
0.99/1.00 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.99/1.00 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.00 c constraints/knapsack/maxnumcardlift = c 0
0.99/1.00 c # should presolving try to simplify inequalities
0.99/1.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.01 c constraints/linear/simplifyinequalities = c TRUE
0.99/1.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.99/1.01 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.01 c separating/maxroundsroot = c 5
0.99/1.01 c # maximal number of separation rounds per node (-1: unlimited)
0.99/1.01 c # [type: int, range: [-1,2147483647], default: 5]
0.99/1.01 c separating/maxrounds = c 1
0.99/1.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.99/1.01 c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.01 c limits/solutions = c 1
0.99/1.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.99/1.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.01 c limits/memory = c 1620
0.99/1.01 c # maximal time in seconds to run
0.99/1.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.01 c limits/time = c 1791
0.99/1.01 c # frequency for displaying node information lines
0.99/1.01 c # [type: int, range: [-1,2147483647], default: 100]
0.99/1.01 c display/freq = c 10000
0.99/1.01 c -----------------------------------------------------------------------------------------------
0.99/1.01 c start solving problem
0.99/1.01 c
1.29/1.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.36 c 1.0s| 1 | 0 | 1284 | 37M| 0 | 820 |4799 | 13k| 13k|4799 | 13k| 0 | 0 | 0 | 4.391653e+02 | -- | Inf
2.19/2.28 c 1.8s| 1 | 0 | 1558 | 37M| 0 | 807 |4799 | 13k| 13k|4799 | 13k| 82 | 0 | 0 | 5.021009e+02 | -- | Inf
2.78/2.86 c 2.4s| 1 | 0 | 1943 | 37M| 0 | 905 |4799 | 13k| 13k|4799 | 13k| 242 | 0 | 0 | 5.255211e+02 | -- | Inf
3.69/3.77 c 3.3s| 1 | 0 | 2624 | 38M| 0 |1043 |4799 | 13k| 13k|4799 | 13k| 367 | 0 | 0 | 5.421192e+02 | -- | Inf
5.11/5.39 c 4.7s| 1 | 0 | 3418 | 39M| 0 |1015 |4799 | 13k| 13k|4799 | 13k| 507 | 0 | 0 | 5.593853e+02 | -- | Inf
10.19/11.17 c 9.8s| 1 | 0 | 4658 | 39M| 0 |1018 |4799 | 13k| 13k|4799 | 13k| 695 | 0 | 0 | 6.251867e+02 | -- | Inf
21.38/22.38 c 20.9s| 1 | 2 | 4658 | 39M| 0 |1018 |4799 | 13k| 13k|4799 | 13k| 695 | 0 | 36 | 6.251867e+02 | -- | Inf
154.73/155.77 c
154.73/155.77 c SCIP Status : problem is solved [infeasible]
154.73/155.77 c Solving Time (sec) : 153.82
154.73/155.77 c Solving Nodes : 141
154.73/155.77 c Primal Bound : +1.00000000000000e+20 (0 solutions)
154.73/155.77 c Dual Bound : +1.00000000000000e+20
154.73/155.77 c Gap : 0.00 %
154.73/155.77 c NODE 141
154.73/155.77 c DUAL BOUND 1e+20
154.73/155.77 c PRIMAL BOUND 1e+20
154.73/155.77 c GAP 0
154.73/155.77 s UNSATISFIABLE
154.73/155.77 c SCIP Status : problem is solved [infeasible]
154.73/155.77 c Solving Time : 153.82
154.73/155.77 c Original Problem :
154.73/155.77 c Problem name : HOME/instance-1868577-1245128576.opb
154.73/155.77 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
154.73/155.77 c Constraints : 16684 initial, 16684 maximal
154.73/155.77 c Presolved Problem :
154.73/155.77 c Problem name : t_HOME/instance-1868577-1245128576.opb
154.73/155.77 c Variables : 4799 (4799 binary, 0 integer, 0 implicit integer, 0 continuous)
154.73/155.77 c Constraints : 13217 initial, 13353 maximal
154.73/155.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
154.73/155.77 c trivial : 0.00 3 0 0 0 0 0 0 0
154.73/155.77 c dualfix : 0.01 0 0 0 0 0 0 0 0
154.73/155.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
154.73/155.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
154.73/155.77 c implics : 0.06 0 456 0 0 0 0 0 0
154.73/155.77 c probing : 0.00 0 0 0 0 0 0 0 0
154.73/155.77 c knapsack : 0.04 0 0 0 0 0 0 0 0
154.73/155.77 c linear : 0.33 797 4 0 797 0 3467 374 881
154.73/155.77 c logicor : 0.09 0 0 0 0 0 0 0 0
154.73/155.77 c root node : - 7 - - 7 - - - -
154.73/155.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
154.73/155.77 c integral : 0 0 0 114 0 3 27 0 0 210
154.73/155.77 c knapsack : 716 5 3176 0 0 0 0 1000 0 0
154.73/155.77 c logicor : 12501+ 5 3138 0 0 59 46192 0 0 0
154.73/155.77 c countsols : 0 0 0 0 0 0 0 0 0 0
154.73/155.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
154.73/155.77 c integral : 115.92 0.00 0.00 115.92 0.00
154.73/155.77 c knapsack : 0.27 0.05 0.22 0.00 0.00
154.73/155.77 c logicor : 0.30 0.00 0.30 0.00 0.00
154.73/155.77 c countsols : 0.00 0.00 0.00 0.00 0.00
154.73/155.77 c Propagators : Time Calls Cutoffs DomReds
154.73/155.77 c rootredcost : 0.01 0 0 0
154.73/155.77 c pseudoobj : 1.60 3190 0 0
154.73/155.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
154.73/155.77 c propagation : 0.02 59 53 194 27.7 16 7.2 -
154.73/155.77 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
154.73/155.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
154.73/155.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
154.73/155.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
154.73/155.77 c applied globally : - - - 146 22.6 - - -
154.73/155.77 c applied locally : - - - 0 0.0 - - -
154.73/155.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
154.73/155.77 c cut pool : 0.00 4 - - 561 - (maximal pool size: 2589)
154.73/155.77 c redcost : 0.04 114 0 0 0 0
154.73/155.77 c impliedbounds : 0.32 5 0 0 0 0
154.73/155.77 c intobj : 0.00 0 0 0 0 0
154.73/155.77 c gomory : 3.07 5 0 0 2500 0
154.73/155.77 c strongcg : 2.28 5 0 0 2500 0
154.73/155.77 c cmir : 0.00 0 0 0 0 0
154.73/155.77 c flowcover : 0.00 0 0 0 0 0
154.73/155.77 c clique : 0.37 5 0 0 37 0
154.73/155.77 c zerohalf : 0.00 0 0 0 0 0
154.73/155.77 c mcf : 0.09 1 0 0 0 0
154.73/155.77 c Pricers : Time Calls Vars
154.73/155.77 c problem variables: 0.00 0 0
154.73/155.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
154.73/155.77 c relpscost : 115.92 114 3 27 0 0 210
154.73/155.77 c pscost : 0.00 0 0 0 0 0 0
154.73/155.77 c inference : 0.00 0 0 0 0 0 0
154.73/155.77 c mostinf : 0.00 0 0 0 0 0 0
154.73/155.77 c leastinf : 0.00 0 0 0 0 0 0
154.73/155.77 c fullstrong : 0.00 0 0 0 0 0 0
154.73/155.77 c allfullstrong : 0.00 0 0 0 0 0 0
154.73/155.77 c random : 0.00 0 0 0 0 0 0
154.73/155.77 c Primal Heuristics : Time Calls Found
154.73/155.77 c LP solutions : 0.00 - 0
154.73/155.77 c pseudo solutions : 0.00 - 0
154.73/155.77 c simplerounding : 0.00 0 0
154.73/155.77 c rounding : 0.00 0 0
154.73/155.77 c shifting : 0.00 0 0
154.73/155.77 c intshifting : 0.00 0 0
154.73/155.77 c oneopt : 0.00 0 0
154.73/155.77 c fixandinfer : 0.00 0 0
154.73/155.77 c feaspump : 0.00 0 0
154.73/155.77 c coefdiving : 0.00 0 0
154.73/155.77 c pscostdiving : 0.00 0 0
154.73/155.77 c fracdiving : 0.00 0 0
154.73/155.77 c veclendiving : 0.00 0 0
154.73/155.77 c intdiving : 0.00 0 0
154.73/155.77 c actconsdiving : 0.00 0 0
154.73/155.77 c objpscostdiving : 0.00 0 0
154.73/155.77 c rootsoldiving : 0.00 0 0
154.73/155.77 c linesearchdiving : 0.00 0 0
154.73/155.77 c guideddiving : 0.00 0 0
154.73/155.77 c octane : 0.00 0 0
154.73/155.77 c rens : 0.00 0 0
154.73/155.77 c rins : 0.00 0 0
154.73/155.77 c localbranching : 0.00 0 0
154.73/155.77 c mutation : 0.00 0 0
154.73/155.77 c crossover : 0.00 0 0
154.73/155.77 c dins : 0.00 0 0
154.73/155.77 c LP : Time Calls Iterations Iter/call Iter/sec
154.73/155.77 c primal LP : 0.10 0 0 0.00 0.00
154.73/155.77 c dual LP : 27.51 119 41378 347.71 1504.11
154.73/155.77 c barrier LP : 0.00 0 0 0.00 -
154.73/155.77 c diving/probing LP: 0.00 0 0 0.00 -
154.73/155.77 c strong branching : 115.86 407 135003 331.70 1165.23
154.73/155.77 c (at root node) : - 36 11246 312.39 -
154.73/155.77 c conflict analysis: 0.00 0 0 0.00 -
154.73/155.77 c B&B Tree :
154.73/155.77 c number of runs : 1
154.73/155.77 c nodes : 141
154.73/155.77 c nodes (total) : 141
154.73/155.77 c nodes left : 0
154.73/155.77 c max depth : 22
154.73/155.77 c max depth (total): 22
154.73/155.77 c backtracks : 39 (27.7%)
154.73/155.77 c delayed cutoffs : 70
154.73/155.77 c repropagations : 91 (12888 domain reductions, 26 cutoffs)
154.73/155.77 c avg switch length: 3.73
154.73/155.77 c switching time : 0.45
154.73/155.77 c Solution :
154.73/155.77 c Solutions found : 0 (0 improvements)
154.73/155.77 c Primal Bound : infeasible
154.73/155.77 c Dual Bound : -
154.73/155.77 c Gap : 0.00 %
154.73/155.77 c Root Dual Bound : +6.25186675913574e+02
154.83/155.87 c Time complete: 154.9.