0.00/0.08 c SCIP version 1.1.0.7
0.00/0.08 c LP-Solver Clp 1.8.2
0.00/0.08 c user parameter file <scip.set> not found - using default parameters
0.00/0.08 c read problem <HOME/instance-1868571-1245128474.opb>
0.00/0.08 c original problem has 1804 variables (1804 bin, 0 int, 0 impl, 0 cont) and 4931 constraints
0.09/0.10 c No objective function, only one solution is needed.
0.09/0.10 c start presolving problem
0.09/0.10 c presolving:
0.19/0.20 c (round 1) 281 del vars, 294 del conss, 112 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99792 impls, 0 clqs
0.19/0.21 c (round 2) 290 del vars, 714 del conss, 121 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99812 impls, 0 clqs
0.19/0.22 c (round 3) 298 del vars, 727 del conss, 125 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99866 impls, 0 clqs
0.19/0.22 c (round 4) 300 del vars, 743 del conss, 125 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.19/0.23 c (round 5) 300 del vars, 747 del conss, 125 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.19/0.28 c (round 6) 300 del vars, 756 del conss, 125 chg bounds, 112 chg sides, 290 chg coeffs, 4175 upgd conss, 99930 impls, 0 clqs
0.29/0.30 c presolving (7 rounds):
0.29/0.30 c 300 deleted vars, 756 deleted constraints, 125 tightened bounds, 0 added holes, 112 changed sides, 290 changed coefficients
0.29/0.30 c 99930 implications, 0 cliques
0.29/0.30 c presolved problem has 1504 variables (1504 bin, 0 int, 0 impl, 0 cont) and 4175 constraints
0.29/0.30 c 224 constraints of type <knapsack>
0.29/0.30 c 3951 constraints of type <logicor>
0.29/0.30 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.18
0.29/0.31 c SATUNSAT-LIN
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = c -1
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = c -1
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/rens/nodesofs = c 2000
0.29/0.31 c # minimum percentage of integer variables that have to be fixable
0.29/0.31 c # [type: real, range: [0,1], default: 0.5]
0.29/0.31 c heuristics/rens/minfixingrate = c 0.3
0.29/0.31 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/rens/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/pscostdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/oneopt/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.31 c # [type: real, range: [0,1], default: 0.01]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/objpscostdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/linesearchdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/intshifting/freq = c -1
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/guideddiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/fracdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.31 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/feaspump/freq = c -1
0.29/0.31 c # minimum percentage of integer variables that have to be fixed
0.29/0.31 c # [type: real, range: [0,1], default: 0.666]
0.29/0.31 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.31 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.31 c # [type: real, range: [0,1], default: 0.1]
0.29/0.31 c heuristics/crossover/nodesquot = c 0.15
0.29/0.31 c # number of nodes without incumbent change that heuristic should wait
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.31 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/crossover/nodesofs = c 750
0.29/0.31 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.31 c heuristics/crossover/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/coefdiving/freq = c -1
0.29/0.31 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c presolving/probing/maxrounds = c 0
0.29/0.31 c # should presolving try to simplify knapsacks
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.31 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.31 c constraints/knapsack/disaggregation = c FALSE
0.29/0.31 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.31 c # should presolving try to simplify inequalities
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.31 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c separating/maxroundsroot = c 5
0.29/0.31 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.31 c separating/maxrounds = c 1
0.29/0.31 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c limits/solutions = c 1
0.29/0.31 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/memory = c 1620
0.29/0.31 c # maximal time in seconds to run
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/time = c 1791
0.29/0.31 c # frequency for displaying node information lines
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.31 c display/freq = c 10000
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c start solving problem
0.29/0.31 c
0.29/0.39 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.39 c 0.3s| 1 | 0 | 613 | 11M| 0 | 373 |1504 |4175 |4175 |1504 |4175 | 0 | 0 | 0 | 1.920478e+02 | -- | Inf
0.58/0.69 c 0.6s| 1 | 0 | 883 | 11M| 0 | 372 |1504 |4175 |4175 |1504 |4274 | 99 | 0 | 0 | 2.143594e+02 | -- | Inf
1.00/1.01 c 0.9s| 1 | 0 | 1329 | 11M| 0 | 477 |1504 |4175 |4175 |1504 |4342 | 167 | 0 | 0 | 2.247227e+02 | -- | Inf
1.39/1.44 c 1.3s| 1 | 0 | 1797 | 12M| 0 | 506 |1504 |4175 |4175 |1504 |4431 | 256 | 0 | 0 | 2.378987e+02 | -- | Inf
1.79/1.83 c 1.7s| 1 | 0 | 2122 | 12M| 0 | 505 |1504 |4175 |4175 |1504 |4482 | 307 | 0 | 0 | 2.408908e+02 | -- | Inf
2.19/2.29 c 2.1s| 1 | 0 | 2661 | 13M| 0 | 481 |1504 |4175 |4175 |1504 |4554 | 379 | 0 | 0 | 2.450239e+02 | -- | Inf
3.99/4.00 c 3.9s| 1 | 2 | 2661 | 13M| 0 | 481 |1504 |4175 |4175 |1504 |4554 | 379 | 0 | 17 | 2.450239e+02 | -- | Inf
51.46/51.59 c
51.46/51.59 c SCIP Status : problem is solved [infeasible]
51.46/51.59 c Solving Time (sec) : 51.08
51.46/51.59 c Solving Nodes : 358
51.46/51.59 c Primal Bound : +1.00000000000000e+20 (0 solutions)
51.46/51.59 c Dual Bound : +1.00000000000000e+20
51.46/51.59 c Gap : 0.00 %
51.46/51.59 c NODE 358
51.46/51.59 c DUAL BOUND 1e+20
51.46/51.59 c PRIMAL BOUND 1e+20
51.46/51.59 c GAP 0
51.46/51.59 s UNSATISFIABLE
51.46/51.59 c SCIP Status : problem is solved [infeasible]
51.46/51.59 c Solving Time : 51.08
51.46/51.59 c Original Problem :
51.46/51.59 c Problem name : HOME/instance-1868571-1245128474.opb
51.46/51.59 c Variables : 1804 (1804 binary, 0 integer, 0 implicit integer, 0 continuous)
51.46/51.59 c Constraints : 4931 initial, 4931 maximal
51.46/51.59 c Presolved Problem :
51.46/51.59 c Problem name : t_HOME/instance-1868571-1245128474.opb
51.46/51.59 c Variables : 1504 (1504 binary, 0 integer, 0 implicit integer, 0 continuous)
51.46/51.59 c Constraints : 4175 initial, 4226 maximal
51.46/51.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
51.46/51.59 c trivial : 0.00 0 0 0 0 0 0 0 0
51.46/51.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
51.46/51.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
51.46/51.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
51.46/51.59 c implics : 0.01 0 171 0 0 0 0 0 0
51.46/51.59 c probing : 0.00 0 0 0 0 0 0 0 0
51.46/51.59 c knapsack : 0.01 0 0 0 0 0 0 0 0
51.46/51.59 c linear : 0.11 125 4 0 125 0 756 112 290
51.46/51.59 c logicor : 0.02 0 0 0 0 0 0 0 0
51.46/51.59 c root node : - 124 - - 124 - - - -
51.46/51.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
51.46/51.59 c integral : 0 0 0 197 0 4 46 0 0 362
51.46/51.59 c knapsack : 224 5 4125 0 0 1 166 484 0 0
51.46/51.59 c logicor : 3951+ 5 3966 0 0 16 17777 0 0 0
51.46/51.59 c countsols : 0 0 0 0 0 0 0 0 0 0
51.46/51.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
51.46/51.59 c integral : 41.06 0.00 0.00 41.06 0.00
51.46/51.59 c knapsack : 0.02 0.00 0.02 0.00 0.00
51.46/51.59 c logicor : 0.10 0.00 0.10 0.00 0.00
51.46/51.59 c countsols : 0.00 0.00 0.00 0.00 0.00
51.46/51.59 c Propagators : Time Calls Cutoffs DomReds
51.46/51.59 c rootredcost : 0.00 0 0 0
51.46/51.59 c pseudoobj : 0.27 4151 1 0
51.46/51.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
51.46/51.59 c propagation : 0.00 17 17 83 16.2 1 4.0 -
51.46/51.59 c infeasible LP : 0.07 157 0 0 0.0 0 0.0 0
51.46/51.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
51.46/51.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
51.46/51.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
51.46/51.59 c applied globally : - - - 58 15.4 - - -
51.46/51.59 c applied locally : - - - 0 0.0 - - -
51.46/51.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
51.46/51.59 c cut pool : 0.00 4 - - 460 - (maximal pool size: 1784)
51.46/51.59 c redcost : 0.00 192 0 0 0 0
51.46/51.59 c impliedbounds : 0.02 5 0 0 0 0
51.46/51.59 c intobj : 0.00 0 0 0 0 0
51.46/51.59 c gomory : 0.55 5 0 0 2500 0
51.46/51.59 c strongcg : 0.36 5 0 0 2500 0
51.46/51.59 c cmir : 0.00 0 0 0 0 0
51.46/51.59 c flowcover : 0.00 0 0 0 0 0
51.46/51.59 c clique : 0.09 5 0 0 34 0
51.46/51.59 c zerohalf : 0.00 0 0 0 0 0
51.46/51.59 c mcf : 0.01 1 0 0 0 0
51.46/51.59 c Pricers : Time Calls Vars
51.46/51.59 c problem variables: 0.00 0 0
51.46/51.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
51.46/51.59 c relpscost : 41.06 197 4 46 0 0 362
51.46/51.59 c pscost : 0.00 0 0 0 0 0 0
51.46/51.59 c inference : 0.00 0 0 0 0 0 0
51.46/51.59 c mostinf : 0.00 0 0 0 0 0 0
51.46/51.59 c leastinf : 0.00 0 0 0 0 0 0
51.46/51.59 c fullstrong : 0.00 0 0 0 0 0 0
51.46/51.59 c allfullstrong : 0.00 0 0 0 0 0 0
51.46/51.59 c random : 0.00 0 0 0 0 0 0
51.46/51.59 c Primal Heuristics : Time Calls Found
51.46/51.59 c LP solutions : 0.00 - 0
51.46/51.59 c pseudo solutions : 0.00 - 0
51.46/51.59 c simplerounding : 0.00 0 0
51.46/51.59 c rounding : 0.00 0 0
51.46/51.59 c shifting : 0.00 0 0
51.46/51.59 c intshifting : 0.00 0 0
51.46/51.59 c oneopt : 0.00 0 0
51.46/51.59 c fixandinfer : 0.00 0 0
51.46/51.59 c feaspump : 0.00 0 0
51.46/51.59 c coefdiving : 0.00 0 0
51.46/51.59 c pscostdiving : 0.00 0 0
51.46/51.59 c fracdiving : 0.00 0 0
51.46/51.59 c veclendiving : 0.00 0 0
51.46/51.59 c intdiving : 0.00 0 0
51.46/51.59 c actconsdiving : 0.00 0 0
51.46/51.59 c objpscostdiving : 0.00 0 0
51.46/51.59 c rootsoldiving : 0.00 0 0
51.46/51.59 c linesearchdiving : 0.00 0 0
51.46/51.59 c guideddiving : 0.00 0 0
51.46/51.59 c octane : 0.00 0 0
51.46/51.59 c rens : 0.00 0 0
51.46/51.59 c rins : 0.00 0 0
51.46/51.59 c localbranching : 0.00 0 0
51.46/51.59 c mutation : 0.00 0 0
51.46/51.59 c crossover : 0.00 0 0
51.46/51.59 c dins : 0.00 0 0
51.46/51.59 c LP : Time Calls Iterations Iter/call Iter/sec
51.46/51.59 c primal LP : 0.05 0 0 0.00 0.00
51.46/51.59 c dual LP : 7.73 289 20782 71.91 2688.49
51.46/51.59 c barrier LP : 0.00 0 0 0.00 -
51.46/51.59 c diving/probing LP: 0.00 0 0 0.00 -
51.46/51.59 c strong branching : 40.96 626 113714 181.65 2776.22
51.46/51.59 c (at root node) : - 17 3197 188.06 -
51.46/51.59 c conflict analysis: 0.00 0 0 0.00 -
51.46/51.59 c B&B Tree :
51.46/51.59 c number of runs : 1
51.46/51.59 c nodes : 358
51.46/51.59 c nodes (total) : 358
51.46/51.59 c nodes left : 0
51.46/51.59 c max depth : 34
51.46/51.59 c max depth (total): 34
51.46/51.59 c backtracks : 122 (34.1%)
51.46/51.59 c delayed cutoffs : 5
51.46/51.59 c repropagations : 184 (1161 domain reductions, 2 cutoffs)
51.46/51.59 c avg switch length: 5.58
51.46/51.59 c switching time : 0.19
51.46/51.59 c Solution :
51.46/51.59 c Solutions found : 0 (0 improvements)
51.46/51.59 c Primal Bound : infeasible
51.46/51.59 c Dual Bound : -
51.46/51.59 c Gap : 0.00 %
51.46/51.59 c Root Dual Bound : +2.45023863051423e+02
51.56/51.63 c Time complete: 51.59.