0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870744-1245217971.opb>
0.00/0.04 c original problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24792 impls, 200 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 24792 implications, 200 cliques
0.29/0.39 c presolved problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 200 constraints of type <setppc>
0.29/0.39 c 3074 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 100 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.15
0.29/0.39 c SATUNSAT-NLC
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = c -1
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = c -1
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = c 2000
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = c 0.3
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = c -1
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = c -1
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = c 0.15
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = c 750
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = c -1
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = c 0
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = c FALSE
0.29/0.39 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.49/0.57 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.57 c 0.3s| 1 | 0 | 322 | 14M| 0 | 160 |3274 |3376 |3376 |3274 |6450 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.99/1.03 c 0.8s| 1 | 0 | 360 | 14M| 0 | 161 |3274 |3376 |3376 |3274 |6451 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
2.19/2.23 c 2.0s| 1 | 0 | 481 | 14M| 0 | 162 |3274 |3376 |3376 |3274 |6452 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.59/2.68 c 2.4s| 1 | 0 | 587 | 14M| 0 | 163 |3274 |3376 |3376 |3274 |6454 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
4.59/4.60 c 4.3s| 1 | 0 | 702 | 14M| 0 | 163 |3274 |3376 |3376 |3274 |6455 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
6.89/6.92 c 6.6s| 1 | 0 | 815 | 14M| 0 | 163 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
20.99/21.03 c 20.7s| 1 | 2 | 815 | 14M| 0 | 163 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 19 | 8.000000e+01 | -- | Inf
178.25/178.35 c
178.25/178.35 c SCIP Status : problem is solved [infeasible]
178.25/178.35 c Solving Time (sec) : 176.90
178.25/178.35 c Solving Nodes : 731
178.25/178.35 c Primal Bound : +1.00000000000000e+20 (0 solutions)
178.25/178.35 c Dual Bound : +1.00000000000000e+20
178.25/178.35 c Gap : 0.00 %
178.25/178.35 c NODE 731
178.25/178.35 c DUAL BOUND 1e+20
178.25/178.35 c PRIMAL BOUND 1e+20
178.25/178.35 c GAP 0
178.25/178.35 s UNSATISFIABLE
178.25/178.35 c SCIP Status : problem is solved [infeasible]
178.25/178.35 c Solving Time : 176.90
178.25/178.35 c Original Problem :
178.25/178.35 c Problem name : HOME/instance-1870744-1245217971.opb
178.25/178.35 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
178.25/178.35 c Constraints : 3376 initial, 3376 maximal
178.25/178.35 c Presolved Problem :
178.25/178.35 c Problem name : t_HOME/instance-1870744-1245217971.opb
178.25/178.35 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
178.25/178.35 c Constraints : 3376 initial, 3548 maximal
178.25/178.35 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
178.25/178.35 c trivial : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c dualfix : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c boundshift : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c inttobinary : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c implics : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c probing : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c knapsack : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c setppc : 0.00 0 0 0 0 0 0 0 0
178.25/178.35 c and : 0.12 0 0 0 0 0 0 0 0
178.25/178.35 c linear : 0.02 0 0 0 0 0 0 0 0
178.25/178.35 c logicor : 0.01 0 0 0 0 0 0 0 0
178.25/178.35 c root node : - 185 - - 185 - - - -
178.25/178.35 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
178.25/178.35 c integral : 0 0 0 398 0 9 35 0 0 748
178.25/178.35 c knapsack : 1 5 2487 1 0 0 0 0 0 0
178.25/178.35 c setppc : 200 5 2487 1 0 1 7885 0 0 0
178.25/178.35 c and : 3074 592 2486 1 0 11 190764 224531 0 0
178.25/178.35 c linear : 1 5 2475 0 0 0 0 0 0 0
178.25/178.35 c logicor : 100+ 5 885 0 0 0 600 0 0 0
178.25/178.35 c countsols : 0 0 0 0 0 0 0 0 0 0
178.25/178.35 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
178.25/178.35 c integral : 81.91 0.00 0.00 81.91 0.00
178.25/178.35 c knapsack : 0.00 0.00 0.00 0.00 0.00
178.25/178.35 c setppc : 0.06 0.00 0.06 0.00 0.00
178.25/178.35 c and : 3.03 2.00 1.03 0.00 0.00
178.25/178.35 c linear : 0.14 0.00 0.14 0.00 0.00
178.25/178.35 c logicor : 0.03 0.00 0.03 0.00 0.00
178.25/178.35 c countsols : 0.00 0.00 0.00 0.00 0.00
178.25/178.35 c Propagators : Time Calls Cutoffs DomReds
178.25/178.35 c rootredcost : 0.00 0 0 0
178.25/178.35 c pseudoobj : 0.97 2509 1 0
178.25/178.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
178.25/178.35 c propagation : 0.00 12 12 12 2.1 0 0.0 -
178.25/178.35 c infeasible LP : 0.28 156 156 487 16.3 0 0.0 0
178.25/178.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
178.25/178.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
178.25/178.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
178.25/178.35 c applied globally : - - - 254 17.2 - - -
178.25/178.35 c applied locally : - - - 0 0.0 - - -
178.25/178.35 c Separators : Time Calls Cutoffs DomReds Cuts Conss
178.25/178.35 c cut pool : 0.00 4 - - 4 - (maximal pool size: 24)
178.25/178.35 c redcost : 0.18 592 0 0 0 0
178.25/178.35 c impliedbounds : 0.00 5 0 0 0 0
178.25/178.35 c intobj : 0.00 0 0 0 0 0
178.25/178.35 c gomory : 3.40 5 0 0 1058 0
178.25/178.35 c strongcg : 2.20 5 0 0 2122 0
178.25/178.35 c cmir : 0.00 0 0 0 0 0
178.25/178.35 c flowcover : 0.00 0 0 0 0 0
178.25/178.35 c clique : 0.01 5 0 0 0 0
178.25/178.35 c zerohalf : 0.00 0 0 0 0 0
178.25/178.35 c mcf : 0.05 2 0 0 0 0
178.25/178.35 c Pricers : Time Calls Vars
178.25/178.35 c problem variables: 0.00 0 0
178.25/178.35 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
178.25/178.35 c relpscost : 81.91 397 9 35 0 0 748
178.25/178.35 c pscost : 0.00 0 0 0 0 0 0
178.25/178.35 c inference : 0.00 0 0 0 0 0 0
178.25/178.35 c mostinf : 0.00 0 0 0 0 0 0
178.25/178.35 c leastinf : 0.00 0 0 0 0 0 0
178.25/178.35 c fullstrong : 0.00 0 0 0 0 0 0
178.25/178.35 c allfullstrong : 0.00 0 0 0 0 0 0
178.25/178.35 c random : 0.00 0 0 0 0 0 0
178.25/178.35 c Primal Heuristics : Time Calls Found
178.25/178.35 c LP solutions : 0.00 - 0
178.25/178.35 c pseudo solutions : 0.00 - 0
178.25/178.35 c simplerounding : 0.00 0 0
178.25/178.35 c rounding : 0.00 0 0
178.25/178.35 c shifting : 0.00 0 0
178.25/178.35 c intshifting : 0.00 0 0
178.25/178.35 c oneopt : 0.00 0 0
178.25/178.35 c fixandinfer : 0.00 0 0
178.25/178.35 c feaspump : 0.00 0 0
178.25/178.35 c coefdiving : 0.00 0 0
178.25/178.35 c pscostdiving : 0.00 0 0
178.25/178.35 c fracdiving : 0.00 0 0
178.25/178.35 c veclendiving : 0.00 0 0
178.25/178.35 c intdiving : 0.00 0 0
178.25/178.35 c actconsdiving : 0.00 0 0
178.25/178.35 c objpscostdiving : 0.00 0 0
178.25/178.35 c rootsoldiving : 0.00 0 0
178.25/178.35 c linesearchdiving : 0.00 0 0
178.25/178.35 c guideddiving : 0.00 0 0
178.25/178.35 c octane : 0.00 0 0
178.25/178.35 c rens : 0.00 0 0
178.25/178.35 c rins : 0.00 0 0
178.25/178.35 c localbranching : 0.00 0 0
178.25/178.35 c mutation : 0.00 0 0
178.25/178.35 c crossover : 0.00 0 0
178.25/178.35 c dins : 0.00 0 0
178.25/178.35 c LP : Time Calls Iterations Iter/call Iter/sec
178.25/178.35 c primal LP : 0.59 0 0 0.00 0.00
178.25/178.35 c dual LP : 78.97 1304 211842 162.46 2682.56
178.25/178.35 c barrier LP : 0.00 0 0 0.00 -
178.25/178.35 c diving/probing LP: 0.00 0 0 0.00 -
178.25/178.35 c strong branching : 81.78 3279 211804 64.59 2589.92
178.25/178.35 c (at root node) : - 19 11818 622.00 -
178.25/178.35 c conflict analysis: 0.00 0 0 0.00 -
178.25/178.35 c B&B Tree :
178.25/178.35 c number of runs : 1
178.25/178.35 c nodes : 731
178.25/178.35 c nodes (total) : 731
178.25/178.35 c nodes left : 0
178.25/178.35 c max depth : 51
178.25/178.35 c max depth (total): 51
178.25/178.35 c backtracks : 181 (24.8%)
178.25/178.35 c delayed cutoffs : 18
178.25/178.35 c repropagations : 571 (10357 domain reductions, 1 cutoffs)
178.25/178.35 c avg switch length: 5.32
178.25/178.35 c switching time : 1.29
178.25/178.35 c Solution :
178.25/178.35 c Solutions found : 0 (0 improvements)
178.25/178.35 c Primal Bound : infeasible
178.25/178.35 c Dual Bound : -
178.25/178.35 c Gap : 0.00 %
178.25/178.35 c Root Dual Bound : +8.00000000000002e+01
178.35/178.40 c Time complete: 178.36.