0.09/0.16 c SCIP version 1.1.0.7
0.09/0.16 c LP-Solver SoPlex 1.4.1
0.09/0.16 c user parameter file <scip.set> not found - using default parameters
0.09/0.16 c read problem <HOME/instance-1868608-1245129130.opb>
0.09/0.16 c original problem has 3736 variables (3736 bin, 0 int, 0 impl, 0 cont) and 10457 constraints
0.19/0.22 c No objective function, only one solution is needed.
0.19/0.22 c start presolving problem
0.19/0.22 c presolving:
0.39/0.43 c (round 1) 473 del vars, 471 del conss, 175 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206361 impls, 0 clqs
0.39/0.45 c (round 2) 484 del vars, 1192 del conss, 186 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206395 impls, 0 clqs
0.39/0.46 c (round 3) 498 del vars, 1216 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206515 impls, 0 clqs
0.39/0.47 c (round 4) 499 del vars, 1238 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206585 impls, 0 clqs
0.39/0.48 c (round 5) 499 del vars, 1240 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206585 impls, 0 clqs
0.49/0.59 c (round 6) 499 del vars, 1251 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 9206 upgd conss, 206585 impls, 0 clqs
0.59/0.63 c presolving (7 rounds):
0.59/0.63 c 499 deleted vars, 1251 deleted constraints, 192 tightened bounds, 0 added holes, 184 changed sides, 460 changed coefficients
0.59/0.63 c 206585 implications, 0 cliques
0.59/0.63 c presolved problem has 3237 variables (3237 bin, 0 int, 0 impl, 0 cont) and 9206 constraints
0.59/0.63 c 368 constraints of type <knapsack>
0.59/0.63 c 8838 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.36
0.59/0.63 c SATUNSAT-LIN
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/flowcover/freq = c -1
0.59/0.63 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/cmir/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/veclendiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/veclendiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/simplerounding/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/shifting/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/rounding/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.59/0.63 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/rootsoldiving/freq = c -1
0.59/0.63 c # number of nodes added to the contingent of the total nodes
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.63 c heuristics/rens/nodesofs = c 2000
0.59/0.63 c # minimum percentage of integer variables that have to be fixable
0.59/0.63 c # [type: real, range: [0,1], default: 0.5]
0.59/0.63 c heuristics/rens/minfixingrate = c 0.3
0.59/0.63 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c heuristics/rens/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/pscostdiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/oneopt/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.63 c # [type: real, range: [0,1], default: 0.01]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.59/0.63 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/objpscostdiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/linesearchdiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/intshifting/freq = c -1
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/intdiving/maxlpiterquot = c 0.075
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/guideddiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/guideddiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/fracdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/fracdiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/feaspump/maxlpiterofs = c 2000
0.59/0.63 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/feaspump/freq = c -1
0.59/0.63 c # minimum percentage of integer variables that have to be fixed
0.59/0.63 c # [type: real, range: [0,1], default: 0.666]
0.59/0.63 c heuristics/crossover/minfixingrate = c 0.5
0.59/0.63 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.63 c # [type: real, range: [0,1], default: 0.1]
0.59/0.63 c heuristics/crossover/nodesquot = c 0.15
0.59/0.63 c # number of nodes without incumbent change that heuristic should wait
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.63 c heuristics/crossover/nwaitingnodes = c 100
0.59/0.63 c # number of nodes added to the contingent of the total nodes
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.63 c heuristics/crossover/nodesofs = c 750
0.59/0.63 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.63 c heuristics/crossover/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/coefdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/coefdiving/freq = c -1
0.59/0.63 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c presolving/probing/maxrounds = c 0
0.59/0.63 c # should presolving try to simplify knapsacks
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/knapsack/simplifyinequalities = c TRUE
0.59/0.63 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.63 c constraints/knapsack/disaggregation = c FALSE
0.59/0.63 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c constraints/knapsack/maxnumcardlift = c 0
0.59/0.63 c # should presolving try to simplify inequalities
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/linear/simplifyinequalities = c TRUE
0.59/0.63 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c separating/maxroundsroot = c 5
0.59/0.63 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.63 c separating/maxrounds = c 1
0.59/0.63 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c limits/solutions = c 1
0.59/0.63 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/memory = c 1620
0.59/0.63 c # maximal time in seconds to run
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/time = c 1791
0.59/0.63 c # frequency for displaying node information lines
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.63 c display/freq = c 10000
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c start solving problem
0.59/0.63 c
1.29/1.31 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.31 c 1.1s| 1 | 0 | 1319 | 24M| 0 | 603 |3237 |9206 |9206 |3237 |9206 | 0 | 0 | 0 | 3.287649e+02 | -- | Inf
2.19/2.23 c 1.9s| 1 | 0 | 1688 | 24M| 0 | 640 |3237 |9206 |9206 |3237 |9262 | 56 | 0 | 0 | 3.644151e+02 | -- | Inf
3.19/3.22 c 2.9s| 1 | 0 | 2117 | 24M| 0 | 628 |3237 |9206 |9206 |3237 |9373 | 167 | 0 | 0 | 3.893274e+02 | -- | Inf
4.49/4.58 c 4.2s| 1 | 0 | 2933 | 25M| 0 | 761 |3237 |9206 |9206 |3237 |9444 | 238 | 0 | 0 | 4.030481e+02 | -- | Inf
5.79/5.80 c 5.5s| 1 | 0 | 3514 | 26M| 0 | 714 |3237 |9206 |9206 |3237 |9524 | 318 | 0 | 0 | 4.086853e+02 | -- | Inf
8.59/8.66 c 8.3s| 1 | 0 | 4153 | 26M| 0 | 717 |3237 |9206 |9206 |3237 |9590 | 384 | 0 | 0 | 4.197149e+02 | -- | Inf
27.58/27.64 c 27.2s| 1 | 2 | 4153 | 26M| 0 | 717 |3237 |9206 |9206 |3237 |9590 | 384 | 0 | 21 | 4.197149e+02 | -- | Inf
227.80/227.97 c
227.80/227.97 c SCIP Status : problem is solved [infeasible]
227.80/227.97 c Solving Time (sec) : 226.77
227.80/227.97 c Solving Nodes : 637
227.80/227.97 c Primal Bound : +1.00000000000000e+20 (0 solutions)
227.80/227.97 c Dual Bound : +1.00000000000000e+20
227.80/227.97 c Gap : 0.00 %
227.80/227.97 c NODE 637
227.80/227.97 c DUAL BOUND 1e+20
227.80/227.97 c PRIMAL BOUND 1e+20
227.80/227.97 c GAP 0
227.80/227.97 s UNSATISFIABLE
227.80/227.97 c SCIP Status : problem is solved [infeasible]
227.80/227.97 c Solving Time : 226.77
227.80/227.97 c Original Problem :
227.80/227.97 c Problem name : HOME/instance-1868608-1245129130.opb
227.80/227.97 c Variables : 3736 (3736 binary, 0 integer, 0 implicit integer, 0 continuous)
227.80/227.97 c Constraints : 10457 initial, 10457 maximal
227.80/227.97 c Presolved Problem :
227.80/227.97 c Problem name : t_HOME/instance-1868608-1245129130.opb
227.80/227.97 c Variables : 3237 (3237 binary, 0 integer, 0 implicit integer, 0 continuous)
227.80/227.97 c Constraints : 9206 initial, 9763 maximal
227.80/227.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
227.80/227.97 c trivial : 0.01 0 0 0 0 0 0 0 0
227.80/227.97 c dualfix : 0.00 0 0 0 0 0 0 0 0
227.80/227.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
227.80/227.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
227.80/227.97 c implics : 0.05 0 304 0 0 0 0 0 0
227.80/227.97 c probing : 0.00 0 0 0 0 0 0 0 0
227.80/227.97 c knapsack : 0.02 0 0 0 0 0 0 0 0
227.80/227.97 c linear : 0.22 192 3 0 192 0 1251 184 460
227.80/227.97 c logicor : 0.04 0 0 0 0 0 0 0 0
227.80/227.97 c root node : - 480 - - 480 - - - -
227.80/227.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
227.80/227.97 c integral : 0 0 0 507 0 0 38 0 0 990
227.80/227.97 c knapsack : 368 5 9412 0 0 4 262 734 0 0
227.80/227.97 c logicor : 8838+ 5 9016 0 0 204 82406 0 0 0
227.80/227.97 c countsols : 0 0 0 0 0 0 0 0 0 0
227.80/227.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
227.80/227.97 c integral : 158.16 0.00 0.00 158.16 0.00
227.80/227.97 c knapsack : 0.13 0.03 0.10 0.00 0.00
227.80/227.97 c logicor : 0.71 0.00 0.71 0.00 0.00
227.80/227.97 c countsols : 0.00 0.00 0.00 0.00 0.00
227.80/227.97 c Propagators : Time Calls Cutoffs DomReds
227.80/227.97 c rootredcost : 0.00 0 0 0
227.80/227.97 c pseudoobj : 1.56 9435 0 0
227.80/227.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
227.80/227.97 c propagation : 0.13 208 173 1027 29.9 31 14.4 -
227.80/227.97 c infeasible LP : 0.06 25 25 108 16.2 5 16.8 0
227.80/227.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
227.80/227.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
227.80/227.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
227.80/227.97 c applied globally : - - - 598 20.1 - - -
227.80/227.97 c applied locally : - - - 0 0.0 - - -
227.80/227.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
227.80/227.97 c cut pool : 0.00 4 - - 421 - (maximal pool size: 1761)
227.80/227.97 c redcost : 0.10 500 0 0 0 0
227.80/227.97 c impliedbounds : 0.01 5 0 0 0 0
227.80/227.97 c intobj : 0.00 0 0 0 0 0
227.80/227.97 c gomory : 2.36 5 0 0 2417 0
227.80/227.97 c strongcg : 1.12 5 0 0 2500 0
227.80/227.97 c cmir : 0.00 0 0 0 0 0
227.80/227.97 c flowcover : 0.00 0 0 0 0 0
227.80/227.97 c clique : 0.23 5 0 0 35 0
227.80/227.97 c zerohalf : 0.00 0 0 0 0 0
227.80/227.97 c mcf : 0.03 1 0 0 0 0
227.80/227.97 c Pricers : Time Calls Vars
227.80/227.97 c problem variables: 0.00 0 0
227.80/227.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
227.80/227.97 c relpscost : 158.16 507 0 38 0 0 990
227.80/227.97 c pscost : 0.00 0 0 0 0 0 0
227.80/227.97 c inference : 0.00 0 0 0 0 0 0
227.80/227.97 c mostinf : 0.00 0 0 0 0 0 0
227.80/227.97 c leastinf : 0.00 0 0 0 0 0 0
227.80/227.97 c fullstrong : 0.00 0 0 0 0 0 0
227.80/227.97 c allfullstrong : 0.00 0 0 0 0 0 0
227.80/227.97 c random : 0.00 0 0 0 0 0 0
227.80/227.97 c Primal Heuristics : Time Calls Found
227.80/227.97 c LP solutions : 0.00 - 0
227.80/227.97 c pseudo solutions : 0.00 - 0
227.80/227.97 c simplerounding : 0.00 0 0
227.80/227.97 c rounding : 0.00 0 0
227.80/227.97 c shifting : 0.00 0 0
227.80/227.97 c intshifting : 0.00 0 0
227.80/227.97 c oneopt : 0.00 0 0
227.80/227.97 c fixandinfer : 0.00 0 0
227.80/227.97 c feaspump : 0.00 0 0
227.80/227.97 c coefdiving : 0.00 0 0
227.80/227.97 c pscostdiving : 0.00 0 0
227.80/227.97 c fracdiving : 0.00 0 0
227.80/227.97 c veclendiving : 0.00 0 0
227.80/227.97 c intdiving : 0.00 0 0
227.80/227.97 c actconsdiving : 0.00 0 0
227.80/227.97 c objpscostdiving : 0.00 0 0
227.80/227.97 c rootsoldiving : 0.00 0 0
227.80/227.97 c linesearchdiving : 0.00 0 0
227.80/227.97 c guideddiving : 0.00 0 0
227.80/227.97 c octane : 0.00 0 0
227.80/227.97 c rens : 0.00 0 0
227.80/227.97 c rins : 0.00 0 0
227.80/227.97 c localbranching : 0.00 0 0
227.80/227.97 c mutation : 0.00 0 0
227.80/227.97 c crossover : 0.00 0 0
227.80/227.97 c dins : 0.00 0 0
227.80/227.97 c LP : Time Calls Iterations Iter/call Iter/sec
227.80/227.97 c primal LP : 0.01 0 0 0.00 0.00
227.80/227.97 c dual LP : 58.29 535 54573 102.01 936.23
227.80/227.97 c barrier LP : 0.00 0 0 0.00 -
227.80/227.97 c diving/probing LP: 0.00 0 0 0.00 -
227.80/227.97 c strong branching : 158.00 311 143873 462.61 910.59
227.80/227.97 c (at root node) : - 21 14324 682.10 -
227.80/227.97 c conflict analysis: 0.00 0 0 0.00 -
227.80/227.97 c B&B Tree :
227.80/227.97 c number of runs : 1
227.80/227.97 c nodes : 637
227.80/227.97 c nodes (total) : 637
227.80/227.97 c nodes left : 0
227.80/227.97 c max depth : 52
227.80/227.97 c max depth (total): 52
227.80/227.97 c backtracks : 118 (18.5%)
227.80/227.97 c delayed cutoffs : 354
227.80/227.97 c repropagations : 447 (27284 domain reductions, 91 cutoffs)
227.80/227.97 c avg switch length: 3.38
227.80/227.97 c switching time : 0.66
227.80/227.97 c Solution :
227.80/227.97 c Solutions found : 0 (0 improvements)
227.80/227.97 c Primal Bound : infeasible
227.80/227.97 c Dual Bound : -
227.80/227.97 c Gap : 0.00 %
227.80/227.97 c Root Dual Bound : +4.19714893968292e+02
227.90/228.04 c Time complete: 227.96.