0.08/0.14 c SCIP version 1.1.0.7
0.08/0.14 c LP-Solver SoPlex 1.4.1
0.08/0.14 c user parameter file <scip.set> not found - using default parameters
0.08/0.14 c read problem <HOME/instance-1868626-1245130089.opb>
0.08/0.14 c original problem has 3249 variables (3249 bin, 0 int, 0 impl, 0 cont) and 8983 constraints
0.08/0.19 c No objective function, only one solution is needed.
0.08/0.19 c start presolving problem
0.08/0.19 c presolving:
0.29/0.34 c (round 1) 252 del vars, 138 del conss, 48 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.29/0.36 c (round 2) 253 del vars, 556 del conss, 49 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156722 impls, 0 clqs
0.29/0.37 c (round 3) 257 del vars, 564 del conss, 53 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156872 impls, 0 clqs
0.29/0.38 c (round 4) 259 del vars, 569 del conss, 56 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156911 impls, 0 clqs
0.29/0.39 c (round 5) 261 del vars, 576 del conss, 57 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 156986 impls, 0 clqs
0.29/0.39 c (round 6) 263 del vars, 581 del conss, 57 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.39/0.40 c (round 7) 263 del vars, 583 del conss, 57 chg bounds, 192 chg sides, 402 chg coeffs, 0 upgd conss, 157052 impls, 0 clqs
0.49/0.50 c (round 8) 263 del vars, 583 del conss, 57 chg bounds, 192 chg sides, 402 chg coeffs, 8400 upgd conss, 157052 impls, 0 clqs
0.49/0.54 c presolving (9 rounds):
0.49/0.54 c 263 deleted vars, 583 deleted constraints, 57 tightened bounds, 0 added holes, 192 changed sides, 402 changed coefficients
0.49/0.54 c 157052 implications, 0 cliques
0.49/0.54 c presolved problem has 2986 variables (2986 bin, 0 int, 0 impl, 0 cont) and 8400 constraints
0.49/0.54 c 384 constraints of type <knapsack>
0.49/0.54 c 8016 constraints of type <logicor>
0.49/0.54 c transformed objective value is always integral (scale: 1)
0.49/0.54 c Presolving Time: 0.31
0.49/0.54 c SATUNSAT-LIN
0.49/0.54 c -----------------------------------------------------------------------------------------------
0.49/0.54 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.54 c separating/flowcover/freq = c -1
0.49/0.54 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.54 c separating/cmir/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/veclendiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/veclendiving/freq = c -1
0.49/0.54 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.54 c heuristics/simplerounding/freq = c -1
0.49/0.54 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/shifting/freq = c -1
0.49/0.54 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.54 c heuristics/rounding/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.54 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.49/0.54 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.54 c heuristics/rootsoldiving/freq = c -1
0.49/0.54 c # number of nodes added to the contingent of the total nodes
0.49/0.54 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.54 c heuristics/rens/nodesofs = c 2000
0.49/0.54 c # minimum percentage of integer variables that have to be fixable
0.49/0.54 c # [type: real, range: [0,1], default: 0.5]
0.49/0.54 c heuristics/rens/minfixingrate = c 0.3
0.49/0.54 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.54 c heuristics/rens/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/pscostdiving/freq = c -1
0.49/0.54 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.54 c heuristics/oneopt/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.54 c # [type: real, range: [0,1], default: 0.01]
0.49/0.54 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.49/0.54 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.54 c heuristics/objpscostdiving/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/linesearchdiving/freq = c -1
0.49/0.54 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/intshifting/freq = c -1
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/intdiving/maxlpiterquot = c 0.075
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/guideddiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/guideddiving/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/fracdiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/fracdiving/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/feaspump/maxlpiterofs = c 2000
0.49/0.54 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.54 c heuristics/feaspump/freq = c -1
0.49/0.54 c # minimum percentage of integer variables that have to be fixed
0.49/0.54 c # [type: real, range: [0,1], default: 0.666]
0.49/0.54 c heuristics/crossover/minfixingrate = c 0.5
0.49/0.54 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.54 c # [type: real, range: [0,1], default: 0.1]
0.49/0.54 c heuristics/crossover/nodesquot = c 0.15
0.49/0.54 c # number of nodes without incumbent change that heuristic should wait
0.49/0.54 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.54 c heuristics/crossover/nwaitingnodes = c 100
0.49/0.54 c # number of nodes added to the contingent of the total nodes
0.49/0.54 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.54 c heuristics/crossover/nodesofs = c 750
0.49/0.54 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.54 c heuristics/crossover/freq = c -1
0.49/0.54 c # additional number of allowed LP iterations
0.49/0.54 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.54 c heuristics/coefdiving/maxlpiterofs = c 1500
0.49/0.54 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.54 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.49/0.54 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.54 c heuristics/coefdiving/freq = c -1
0.49/0.54 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.54 c presolving/probing/maxrounds = c 0
0.49/0.54 c # should presolving try to simplify knapsacks
0.49/0.54 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.54 c constraints/knapsack/simplifyinequalities = c TRUE
0.49/0.54 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.54 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.54 c constraints/knapsack/disaggregation = c FALSE
0.49/0.54 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.54 c constraints/knapsack/maxnumcardlift = c 0
0.49/0.54 c # should presolving try to simplify inequalities
0.49/0.54 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.54 c constraints/linear/simplifyinequalities = c TRUE
0.49/0.54 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.54 c separating/maxroundsroot = c 5
0.49/0.54 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.54 c separating/maxrounds = c 1
0.49/0.54 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.54 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.54 c limits/solutions = c 1
0.49/0.54 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.54 c limits/memory = c 1620
0.49/0.54 c # maximal time in seconds to run
0.49/0.54 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.54 c limits/time = c 1791
0.49/0.54 c # frequency for displaying node information lines
0.49/0.54 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.54 c display/freq = c 10000
0.49/0.54 c -----------------------------------------------------------------------------------------------
0.49/0.54 c start solving problem
0.49/0.54 c
0.99/1.01 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.01 c 0.8s| 1 | 0 | 1154 | 21M| 0 | 441 |2986 |8400 |8400 |2986 |8400 | 0 | 0 | 0 | 2.856183e+02 | -- | Inf
1.59/1.68 c 1.4s| 1 | 0 | 1439 | 21M| 0 | 420 |2986 |8400 |8400 |2986 |8470 | 70 | 0 | 0 | 3.232726e+02 | -- | Inf
2.29/2.37 c 2.1s| 1 | 0 | 1904 | 21M| 0 | 566 |2986 |8400 |8400 |2986 |8582 | 182 | 0 | 0 | 3.321859e+02 | -- | Inf
3.20/3.22 c 3.0s| 1 | 0 | 2424 | 22M| 0 | 612 |2986 |8400 |8400 |2986 |8638 | 238 | 0 | 0 | 3.449232e+02 | -- | Inf
4.89/4.92 c 4.7s| 1 | 0 | 3530 | 22M| 0 | 656 |2986 |8400 |8400 |2986 |8706 | 306 | 0 | 0 | 3.513246e+02 | -- | Inf
6.68/6.78 c 6.5s| 1 | 0 | 4412 | 23M| 0 | 650 |2986 |8400 |8400 |2986 |8761 | 361 | 0 | 0 | 3.600221e+02 | -- | Inf
35.88/35.90 c 35.5s| 1 | 2 | 4412 | 23M| 0 | 650 |2986 |8400 |8400 |2986 |8761 | 361 | 0 | 31 | 3.600221e+02 | -- | Inf
327.76/327.91 c
327.76/327.91 c SCIP Status : problem is solved [infeasible]
327.76/327.91 c Solving Time (sec) : 326.55
327.76/327.91 c Solving Nodes : 1988
327.76/327.91 c Primal Bound : +1.00000000000000e+20 (0 solutions)
327.76/327.91 c Dual Bound : +1.00000000000000e+20
327.76/327.91 c Gap : 0.00 %
327.76/327.91 c NODE 1988
327.76/327.91 c DUAL BOUND 1e+20
327.76/327.91 c PRIMAL BOUND 1e+20
327.76/327.91 c GAP 0
327.76/327.91 s UNSATISFIABLE
327.76/327.91 c SCIP Status : problem is solved [infeasible]
327.76/327.91 c Solving Time : 326.55
327.76/327.91 c Original Problem :
327.76/327.91 c Problem name : HOME/instance-1868626-1245130089.opb
327.76/327.91 c Variables : 3249 (3249 binary, 0 integer, 0 implicit integer, 0 continuous)
327.76/327.91 c Constraints : 8983 initial, 8983 maximal
327.76/327.91 c Presolved Problem :
327.76/327.91 c Problem name : t_HOME/instance-1868626-1245130089.opb
327.76/327.91 c Variables : 2986 (2986 binary, 0 integer, 0 implicit integer, 0 continuous)
327.76/327.91 c Constraints : 8400 initial, 9391 maximal
327.76/327.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
327.76/327.91 c trivial : 0.01 2 0 0 0 0 0 0 0
327.76/327.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
327.76/327.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
327.76/327.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
327.76/327.91 c implics : 0.02 0 203 0 0 0 0 0 0
327.76/327.91 c probing : 0.00 0 0 0 0 0 0 0 0
327.76/327.91 c knapsack : 0.02 0 0 0 0 0 0 0 0
327.76/327.91 c linear : 0.21 55 3 0 57 0 583 192 402
327.76/327.91 c logicor : 0.05 0 0 0 0 0 0 0 0
327.76/327.91 c root node : - 594 - - 594 - - - -
327.76/327.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
327.76/327.91 c integral : 0 0 0 1679 0 6 77 0 0 3294
327.76/327.91 c knapsack : 384 5 16891 0 0 99 3820 692 0 0
327.76/327.91 c logicor : 8016+ 5 15018 0 0 175 71703 0 0 0
327.76/327.91 c countsols : 0 0 0 0 0 0 0 0 0 0
327.76/327.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
327.76/327.91 c integral : 203.80 0.00 0.00 203.80 0.00
327.76/327.91 c knapsack : 0.30 0.02 0.28 0.00 0.00
327.76/327.91 c logicor : 0.66 0.00 0.66 0.00 0.00
327.76/327.91 c countsols : 0.00 0.00 0.00 0.00 0.00
327.76/327.91 c Propagators : Time Calls Cutoffs DomReds
327.76/327.91 c rootredcost : 0.02 0 0 0
327.76/327.91 c pseudoobj : 2.49 16916 0 0
327.76/327.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
327.76/327.91 c propagation : 0.06 274 256 1101 21.0 33 13.3 -
327.76/327.91 c infeasible LP : 0.31 142 142 555 20.3 14 12.6 0
327.76/327.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
327.76/327.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
327.76/327.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
327.76/327.91 c applied globally : - - - 1154 16.8 - - -
327.76/327.91 c applied locally : - - - 0 0.0 - - -
327.76/327.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
327.76/327.91 c cut pool : 0.00 4 - - 419 - (maximal pool size: 1623)
327.76/327.91 c redcost : 0.44 1657 0 0 0 0
327.76/327.91 c impliedbounds : 0.01 5 0 0 0 0
327.76/327.91 c intobj : 0.00 0 0 0 0 0
327.76/327.91 c gomory : 0.89 5 0 0 2500 0
327.76/327.91 c strongcg : 0.70 5 0 0 2500 0
327.76/327.91 c cmir : 0.00 0 0 0 0 0
327.76/327.91 c flowcover : 0.00 0 0 0 0 0
327.76/327.91 c clique : 0.20 5 0 0 33 0
327.76/327.91 c zerohalf : 0.00 0 0 0 0 0
327.76/327.91 c mcf : 0.03 1 0 0 0 0
327.76/327.91 c Pricers : Time Calls Vars
327.76/327.91 c problem variables: 0.00 0 0
327.76/327.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
327.76/327.91 c relpscost : 203.78 1679 6 77 0 0 3294
327.76/327.91 c pscost : 0.00 0 0 0 0 0 0
327.76/327.91 c inference : 0.00 0 0 0 0 0 0
327.76/327.91 c mostinf : 0.00 0 0 0 0 0 0
327.76/327.91 c leastinf : 0.00 0 0 0 0 0 0
327.76/327.91 c fullstrong : 0.00 0 0 0 0 0 0
327.76/327.91 c allfullstrong : 0.00 0 0 0 0 0 0
327.76/327.91 c random : 0.00 0 0 0 0 0 0
327.76/327.91 c Primal Heuristics : Time Calls Found
327.76/327.91 c LP solutions : 0.00 - 0
327.76/327.91 c pseudo solutions : 0.00 - 0
327.76/327.91 c simplerounding : 0.00 0 0
327.76/327.91 c rounding : 0.00 0 0
327.76/327.91 c shifting : 0.00 0 0
327.76/327.91 c intshifting : 0.00 0 0
327.76/327.91 c oneopt : 0.00 0 0
327.76/327.91 c fixandinfer : 0.00 0 0
327.76/327.91 c feaspump : 0.00 0 0
327.76/327.91 c coefdiving : 0.00 0 0
327.76/327.91 c pscostdiving : 0.00 0 0
327.76/327.91 c fracdiving : 0.00 0 0
327.76/327.91 c veclendiving : 0.00 0 0
327.76/327.91 c intdiving : 0.00 0 0
327.76/327.91 c actconsdiving : 0.00 0 0
327.76/327.91 c objpscostdiving : 0.00 0 0
327.76/327.91 c rootsoldiving : 0.00 0 0
327.76/327.91 c linesearchdiving : 0.00 0 0
327.76/327.91 c guideddiving : 0.00 0 0
327.76/327.91 c octane : 0.00 0 0
327.76/327.91 c rens : 0.00 0 0
327.76/327.91 c rins : 0.00 0 0
327.76/327.91 c localbranching : 0.00 0 0
327.76/327.91 c mutation : 0.00 0 0
327.76/327.91 c crossover : 0.00 0 0
327.76/327.91 c dins : 0.00 0 0
327.76/327.91 c LP : Time Calls Iterations Iter/call Iter/sec
327.76/327.91 c primal LP : 0.01 0 0 0.00 0.00
327.76/327.91 c dual LP : 107.23 1809 103267 57.09 963.04
327.76/327.91 c barrier LP : 0.00 0 0 0.00 -
327.76/327.91 c diving/probing LP: 0.00 0 0 0.00 -
327.76/327.91 c strong branching : 203.44 760 174503 229.61 857.76
327.76/327.91 c (at root node) : - 31 22280 718.71 -
327.76/327.91 c conflict analysis: 0.00 0 0 0.00 -
327.76/327.91 c B&B Tree :
327.76/327.91 c number of runs : 1
327.76/327.91 c nodes : 1988
327.76/327.91 c nodes (total) : 1988
327.76/327.91 c nodes left : 0
327.76/327.91 c max depth : 69
327.76/327.91 c max depth (total): 69
327.76/327.91 c backtracks : 180 (9.1%)
327.76/327.91 c delayed cutoffs : 1307
327.76/327.91 c repropagations : 2303 (15193 domain reductions, 81 cutoffs)
327.76/327.91 c avg switch length: 4.21
327.76/327.91 c switching time : 1.15
327.76/327.91 c Solution :
327.76/327.91 c Solutions found : 0 (0 improvements)
327.76/327.91 c Primal Bound : infeasible
327.76/327.91 c Dual Bound : -
327.76/327.91 c Gap : 0.00 %
327.76/327.91 c Root Dual Bound : +3.60022100559984e+02
327.76/327.97 c Time complete: 327.83.