0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870643-1245214725.opb>
0.00/0.04 c original problem has 3262 variables (3262 bin, 0 int, 0 impl, 0 cont) and 3364 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, 24696 impls, 200 clqs
0.29/0.38 c presolving (2 rounds):
0.29/0.38 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.38 c 24696 implications, 200 cliques
0.29/0.38 c presolved problem has 3262 variables (3262 bin, 0 int, 0 impl, 0 cont) and 3364 constraints
0.29/0.38 c 1 constraints of type <knapsack>
0.29/0.38 c 200 constraints of type <setppc>
0.29/0.38 c 3062 constraints of type <and>
0.29/0.38 c 1 constraints of type <linear>
0.29/0.38 c 100 constraints of type <logicor>
0.29/0.38 c transformed objective value is always integral (scale: 1)
0.29/0.38 c Presolving Time: 0.15
0.29/0.38 c SATUNSAT-NLC
0.29/0.38 c -----------------------------------------------------------------------------------------------
0.29/0.38 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/flowcover/freq = c -1
0.29/0.38 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/cmir/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/veclendiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/simplerounding/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/shifting/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/rounding/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/rootsoldiving/freq = c -1
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/rens/nodesofs = c 2000
0.29/0.38 c # minimum percentage of integer variables that have to be fixable
0.29/0.38 c # [type: real, range: [0,1], default: 0.5]
0.29/0.38 c heuristics/rens/minfixingrate = c 0.3
0.29/0.38 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c heuristics/rens/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/pscostdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/oneopt/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.38 c # [type: real, range: [0,1], default: 0.01]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/objpscostdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/linesearchdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/intshifting/freq = c -1
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/guideddiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/fracdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.38 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/feaspump/freq = c -1
0.29/0.38 c # minimum percentage of integer variables that have to be fixed
0.29/0.38 c # [type: real, range: [0,1], default: 0.666]
0.29/0.38 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.38 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.38 c # [type: real, range: [0,1], default: 0.1]
0.29/0.38 c heuristics/crossover/nodesquot = c 0.15
0.29/0.38 c # number of nodes without incumbent change that heuristic should wait
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.38 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/crossover/nodesofs = c 750
0.29/0.38 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.38 c heuristics/crossover/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/coefdiving/freq = c -1
0.29/0.38 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c presolving/probing/maxrounds = c 0
0.29/0.38 c # should presolving try to simplify knapsacks
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.38 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.38 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.38 c constraints/knapsack/disaggregation = c FALSE
0.29/0.38 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.38 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.54 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.54 c 0.3s| 1 | 0 | 176 | 14M| 0 | 160 |3262 |3364 |3364 |3262 |6426 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.99/1.01 c 0.8s| 1 | 0 | 238 | 14M| 0 | 161 |3262 |3364 |3364 |3262 |6428 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
1.39/1.40 c 1.1s| 1 | 0 | 245 | 14M| 0 | 161 |3262 |3364 |3364 |3262 |6430 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
2.69/2.77 c 2.5s| 1 | 0 | 388 | 14M| 0 | 164 |3262 |3364 |3364 |3262 |6431 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
4.49/4.59 c 4.3s| 1 | 0 | 391 | 14M| 0 | 165 |3262 |3364 |3364 |3262 |6432 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
6.28/6.39 c 6.1s| 1 | 0 | 395 | 14M| 0 | 167 |3262 |3364 |3364 |3262 |6433 | 7 | 0 | 0 | 8.000000e+01 | -- | Inf
10.69/10.76 c 10.5s| 1 | 2 | 395 | 14M| 0 | 167 |3262 |3364 |3364 |3262 |6433 | 7 | 0 | 17 | 8.000000e+01 | -- | Inf
172.54/172.61 c
172.54/172.61 c SCIP Status : problem is solved [infeasible]
172.54/172.61 c Solving Time (sec) : 171.82
172.54/172.61 c Solving Nodes : 939
172.54/172.61 c Primal Bound : +1.00000000000000e+20 (0 solutions)
172.54/172.61 c Dual Bound : +1.00000000000000e+20
172.54/172.61 c Gap : 0.00 %
172.54/172.61 c NODE 939
172.54/172.61 c DUAL BOUND 1e+20
172.54/172.61 c PRIMAL BOUND 1e+20
172.54/172.61 c GAP 0
172.54/172.61 s UNSATISFIABLE
172.54/172.61 c SCIP Status : problem is solved [infeasible]
172.54/172.61 c Solving Time : 171.82
172.54/172.61 c Original Problem :
172.54/172.61 c Problem name : HOME/instance-1870643-1245214725.opb
172.54/172.61 c Variables : 3262 (3262 binary, 0 integer, 0 implicit integer, 0 continuous)
172.54/172.61 c Constraints : 3364 initial, 3364 maximal
172.54/172.61 c Presolved Problem :
172.54/172.61 c Problem name : t_HOME/instance-1870643-1245214725.opb
172.54/172.61 c Variables : 3262 (3262 binary, 0 integer, 0 implicit integer, 0 continuous)
172.54/172.61 c Constraints : 3364 initial, 3385 maximal
172.54/172.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
172.54/172.61 c trivial : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c implics : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c probing : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c knapsack : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c setppc : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c and : 0.11 0 0 0 0 0 0 0 0
172.54/172.61 c linear : 0.02 0 0 0 0 0 0 0 0
172.54/172.61 c logicor : 0.00 0 0 0 0 0 0 0 0
172.54/172.61 c root node : - 72 - - 72 - - - -
172.54/172.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
172.54/172.61 c integral : 0 0 0 491 0 6 42 0 0 938
172.54/172.61 c knapsack : 1 5 2384 3 0 1 0 0 0 0
172.54/172.61 c setppc : 200 5 2383 3 0 1 13847 0 0 0
172.54/172.61 c and : 3062 696 2382 3 0 20 323937 301860 0 0
172.54/172.61 c linear : 1 5 2362 0 0 0 0 0 0 0
172.54/172.61 c logicor : 100+ 5 769 0 0 0 633 0 0 0
172.54/172.61 c countsols : 0 0 0 0 0 0 0 0 0 0
172.54/172.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
172.54/172.61 c integral : 57.36 0.00 0.00 57.36 0.00
172.54/172.61 c knapsack : 0.01 0.00 0.01 0.00 0.00
172.54/172.61 c setppc : 0.10 0.00 0.10 0.00 0.00
172.54/172.61 c and : 3.88 2.26 1.61 0.01 0.00
172.54/172.61 c linear : 0.04 0.00 0.04 0.00 0.00
172.54/172.61 c logicor : 0.02 0.00 0.02 0.00 0.00
172.54/172.61 c countsols : 0.00 0.00 0.00 0.00 0.00
172.54/172.61 c Propagators : Time Calls Cutoffs DomReds
172.54/172.61 c rootredcost : 0.00 0 0 0
172.54/172.61 c pseudoobj : 1.05 2421 1 0
172.54/172.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
172.54/172.61 c propagation : 0.00 22 22 23 2.5 0 0.0 -
172.54/172.61 c infeasible LP : 0.40 441 0 0 0.0 0 0.0 0
172.54/172.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
172.54/172.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
172.54/172.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
172.54/172.61 c applied globally : - - - 22 2.3 - - -
172.54/172.61 c applied locally : - - - 0 0.0 - - -
172.54/172.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
172.54/172.61 c cut pool : 0.00 4 - - 2 - (maximal pool size: 31)
172.54/172.61 c redcost : 0.36 696 0 0 0 0
172.54/172.61 c impliedbounds : 0.01 5 0 0 0 0
172.54/172.61 c intobj : 0.00 0 0 0 0 0
172.54/172.61 c gomory : 3.10 5 0 0 1000 0
172.54/172.61 c strongcg : 2.29 5 0 0 2239 0
172.54/172.61 c cmir : 0.00 0 0 0 0 0
172.54/172.61 c flowcover : 0.00 0 0 0 0 0
172.54/172.61 c clique : 0.02 5 0 0 0 0
172.54/172.61 c zerohalf : 0.00 0 0 0 0 0
172.54/172.61 c mcf : 0.05 2 0 0 0 0
172.54/172.61 c Pricers : Time Calls Vars
172.54/172.61 c problem variables: 0.00 0 0
172.54/172.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
172.54/172.61 c relpscost : 57.36 488 6 42 0 0 938
172.54/172.61 c pscost : 0.00 0 0 0 0 0 0
172.54/172.61 c inference : 0.00 0 0 0 0 0 0
172.54/172.61 c mostinf : 0.00 0 0 0 0 0 0
172.54/172.61 c leastinf : 0.00 0 0 0 0 0 0
172.54/172.61 c fullstrong : 0.00 0 0 0 0 0 0
172.54/172.61 c allfullstrong : 0.00 0 0 0 0 0 0
172.54/172.61 c random : 0.00 0 0 0 0 0 0
172.54/172.61 c Primal Heuristics : Time Calls Found
172.54/172.61 c LP solutions : 0.00 - 0
172.54/172.61 c pseudo solutions : 0.00 - 0
172.54/172.61 c simplerounding : 0.00 0 0
172.54/172.61 c rounding : 0.00 0 0
172.54/172.61 c shifting : 0.00 0 0
172.54/172.61 c intshifting : 0.00 0 0
172.54/172.61 c oneopt : 0.00 0 0
172.54/172.61 c fixandinfer : 0.00 0 0
172.54/172.61 c feaspump : 0.00 0 0
172.54/172.61 c coefdiving : 0.00 0 0
172.54/172.61 c pscostdiving : 0.00 0 0
172.54/172.61 c fracdiving : 0.00 0 0
172.54/172.61 c veclendiving : 0.00 0 0
172.54/172.61 c intdiving : 0.00 0 0
172.54/172.61 c actconsdiving : 0.00 0 0
172.54/172.61 c objpscostdiving : 0.00 0 0
172.54/172.61 c rootsoldiving : 0.00 0 0
172.54/172.61 c linesearchdiving : 0.00 0 0
172.54/172.61 c guideddiving : 0.00 0 0
172.54/172.61 c octane : 0.00 0 0
172.54/172.61 c rens : 0.00 0 0
172.54/172.61 c rins : 0.00 0 0
172.54/172.61 c localbranching : 0.00 0 0
172.54/172.61 c mutation : 0.00 0 0
172.54/172.61 c crossover : 0.00 0 0
172.54/172.61 c dins : 0.00 0 0
172.54/172.61 c LP : Time Calls Iterations Iter/call Iter/sec
172.54/172.61 c primal LP : 11.91 0 0 0.00 0.00
172.54/172.61 c dual LP : 84.89 1617 274530 169.78 3233.95
172.54/172.61 c barrier LP : 0.00 0 0 0.00 -
172.54/172.61 c diving/probing LP: 0.00 0 0 0.00 -
172.54/172.61 c strong branching : 57.25 3514 236990 67.44 4139.56
172.54/172.61 c (at root node) : - 17 3523 207.24 -
172.54/172.61 c conflict analysis: 0.00 0 0 0.00 -
172.54/172.61 c B&B Tree :
172.54/172.61 c number of runs : 1
172.54/172.61 c nodes : 939
172.54/172.61 c nodes (total) : 939
172.54/172.61 c nodes left : 0
172.54/172.61 c max depth : 54
172.54/172.61 c max depth (total): 54
172.54/172.61 c backtracks : 207 (22.0%)
172.54/172.61 c delayed cutoffs : 0
172.54/172.61 c repropagations : 45 (50 domain reductions, 0 cutoffs)
172.54/172.61 c avg switch length: 3.99
172.54/172.61 c switching time : 12.76
172.54/172.61 c Solution :
172.54/172.61 c Solutions found : 0 (0 improvements)
172.54/172.61 c Primal Bound : infeasible
172.54/172.61 c Dual Bound : -
172.54/172.61 c Gap : 0.00 %
172.54/172.61 c Root Dual Bound : +8.00000000000002e+01
172.54/172.67 c Time complete: 172.6.