0.39/0.40 c SCIP version 1.1.0.7
0.39/0.40 c LP-Solver Clp 1.8.2
0.39/0.40 c user parameter file <scip.set> not found - using default parameters
0.39/0.40 c read problem <HOME/instance-1868559-1245127763.opb>
0.39/0.40 c original problem has 8937 variables (8937 bin, 0 int, 0 impl, 0 cont) and 26319 constraints
0.49/0.52 c No objective function, only one solution is needed.
0.49/0.52 c start presolving problem
0.49/0.52 c presolving:
1.09/1.11 c (round 1) 502 del vars, 529 del conss, 230 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 691346 impls, 0 clqs
1.09/1.19 c (round 2) 615 del vars, 1458 del conss, 317 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 692636 impls, 0 clqs
1.19/1.21 c (round 3) 622 del vars, 1569 del conss, 328 chg bounds, 136 chg sides, 420 chg coeffs, 0 upgd conss, 693203 impls, 0 clqs
1.19/1.24 c (round 4) 635 del vars, 1608 del conss, 333 chg bounds, 136 chg sides, 430 chg coeffs, 0 upgd conss, 693365 impls, 0 clqs
1.39/1.48 c (round 5) 635 del vars, 1617 del conss, 333 chg bounds, 136 chg sides, 430 chg coeffs, 24702 upgd conss, 693365 impls, 0 clqs
1.49/1.57 c presolving (6 rounds):
1.49/1.57 c 635 deleted vars, 1617 deleted constraints, 333 tightened bounds, 0 added holes, 136 changed sides, 430 changed coefficients
1.49/1.57 c 693365 implications, 0 cliques
1.49/1.57 c presolved problem has 8302 variables (8302 bin, 0 int, 0 impl, 0 cont) and 24702 constraints
1.49/1.57 c 272 constraints of type <knapsack>
1.49/1.57 c 24430 constraints of type <logicor>
1.49/1.57 c transformed objective value is always integral (scale: 1)
1.49/1.57 c Presolving Time: 0.94
1.49/1.57 c SATUNSAT-LIN
1.49/1.57 c -----------------------------------------------------------------------------------------------
1.49/1.57 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c separating/flowcover/freq = c -1
1.49/1.57 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c separating/cmir/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/veclendiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/veclendiving/freq = c -1
1.49/1.57 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/simplerounding/freq = c -1
1.49/1.57 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/shifting/freq = c -1
1.49/1.57 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/rounding/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.49/1.57 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.49/1.57 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/rootsoldiving/freq = c -1
1.49/1.57 c # number of nodes added to the contingent of the total nodes
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.57 c heuristics/rens/nodesofs = c 2000
1.49/1.57 c # minimum percentage of integer variables that have to be fixable
1.49/1.57 c # [type: real, range: [0,1], default: 0.5]
1.49/1.57 c heuristics/rens/minfixingrate = c 0.3
1.49/1.57 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c heuristics/rens/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/pscostdiving/freq = c -1
1.49/1.57 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/oneopt/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to total iteration number
1.49/1.57 c # [type: real, range: [0,1], default: 0.01]
1.49/1.57 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.49/1.57 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/objpscostdiving/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/linesearchdiving/freq = c -1
1.49/1.57 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/intshifting/freq = c -1
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/intdiving/maxlpiterquot = c 0.075
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/guideddiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/guideddiving/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/fracdiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/fracdiving/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/feaspump/maxlpiterofs = c 2000
1.49/1.57 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/feaspump/freq = c -1
1.49/1.57 c # minimum percentage of integer variables that have to be fixed
1.49/1.57 c # [type: real, range: [0,1], default: 0.666]
1.49/1.57 c heuristics/crossover/minfixingrate = c 0.5
1.49/1.57 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.49/1.57 c # [type: real, range: [0,1], default: 0.1]
1.49/1.57 c heuristics/crossover/nodesquot = c 0.15
1.49/1.57 c # number of nodes without incumbent change that heuristic should wait
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.49/1.57 c heuristics/crossover/nwaitingnodes = c 100
1.49/1.57 c # number of nodes added to the contingent of the total nodes
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.57 c heuristics/crossover/nodesofs = c 750
1.49/1.57 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 30]
1.49/1.57 c heuristics/crossover/freq = c -1
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/coefdiving/maxlpiterofs = c 1500
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.49/1.57 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/coefdiving/freq = c -1
1.49/1.57 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c presolving/probing/maxrounds = c 0
1.49/1.57 c # should presolving try to simplify knapsacks
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.57 c constraints/knapsack/simplifyinequalities = c TRUE
1.49/1.57 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.49/1.57 c constraints/knapsack/disaggregation = c FALSE
1.49/1.57 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c constraints/knapsack/maxnumcardlift = c 0
1.49/1.57 c # should presolving try to simplify inequalities
1.49/1.58 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.58 c constraints/linear/simplifyinequalities = c TRUE
1.49/1.58 c # maximal number of separation rounds in the root node (-1: unlimited)
1.49/1.58 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.58 c separating/maxroundsroot = c 5
1.49/1.58 c # maximal number of separation rounds per node (-1: unlimited)
1.49/1.58 c # [type: int, range: [-1,2147483647], default: 5]
1.49/1.58 c separating/maxrounds = c 1
1.49/1.58 c # solving stops, if the given number of solutions were found (-1: no limit)
1.49/1.58 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.58 c limits/solutions = c 1
1.49/1.58 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.49/1.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.58 c limits/memory = c 1620
1.49/1.58 c # maximal time in seconds to run
1.49/1.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.58 c limits/time = c 1791
1.49/1.58 c # frequency for displaying node information lines
1.49/1.58 c # [type: int, range: [-1,2147483647], default: 100]
1.49/1.58 c display/freq = c 10000
1.49/1.58 c -----------------------------------------------------------------------------------------------
1.49/1.58 c start solving problem
1.49/1.58 c
1.89/1.99 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.99 c 1.4s| 1 | 0 | 766 | 65M| 0 | 467 |8302 | 24k| 24k|8302 | 24k| 0 | 0 | 0 | 2.678649e+02 | -- | Inf
4.09/4.18 c 3.4s| 1 | 0 | 1131 | 66M| 0 | 483 |8302 | 24k| 24k|8302 | 24k| 73 | 0 | 0 | 2.870229e+02 | -- | Inf
5.29/5.35 c 4.6s| 1 | 0 | 1602 | 66M| 0 | 600 |8302 | 24k| 24k|8302 | 24k| 134 | 0 | 0 | 2.989109e+02 | -- | Inf
7.18/7.29 c 6.5s| 1 | 0 | 2220 | 67M| 0 | 639 |8302 | 24k| 24k|8302 | 24k| 177 | 0 | 0 | 3.055261e+02 | -- | Inf
9.89/9.96 c 9.2s| 1 | 0 | 2635 | 67M| 0 | 622 |8302 | 24k| 24k|8302 | 24k| 218 | 0 | 0 | 3.115388e+02 | -- | Inf
17.79/17.82 c 17.0s| 1 | 0 | 3242 | 67M| 0 | 639 |8302 | 24k| 24k|8302 | 24k| 272 | 0 | 0 | 3.179157e+02 | -- | Inf
40.26/40.30 c 39.4s| 1 | 2 | 3242 | 67M| 0 | 639 |8302 | 24k| 24k|8302 | 24k| 272 | 0 | 32 | 3.179157e+02 | -- | Inf
195.72/195.81 c
195.72/195.81 c SCIP Status : problem is solved [infeasible]
195.72/195.81 c Solving Time (sec) : 194.00
195.72/195.81 c Solving Nodes : 10
195.72/195.81 c Primal Bound : +1.00000000000000e+20 (0 solutions)
195.72/195.81 c Dual Bound : +1.00000000000000e+20
195.72/195.81 c Gap : 0.00 %
195.72/195.81 c NODE 10
195.72/195.81 c DUAL BOUND 1e+20
195.72/195.81 c PRIMAL BOUND 1e+20
195.72/195.81 c GAP 0
195.72/195.81 s UNSATISFIABLE
195.72/195.81 c SCIP Status : problem is solved [infeasible]
195.72/195.81 c Solving Time : 194.00
195.72/195.81 c Original Problem :
195.72/195.81 c Problem name : HOME/instance-1868559-1245127763.opb
195.72/195.81 c Variables : 8937 (8937 binary, 0 integer, 0 implicit integer, 0 continuous)
195.72/195.81 c Constraints : 26319 initial, 26319 maximal
195.72/195.81 c Presolved Problem :
195.72/195.81 c Problem name : t_HOME/instance-1868559-1245127763.opb
195.72/195.81 c Variables : 8302 (8302 binary, 0 integer, 0 implicit integer, 0 continuous)
195.72/195.81 c Constraints : 24702 initial, 24703 maximal
195.72/195.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
195.72/195.81 c trivial : 0.01 30 0 0 0 0 0 0 0
195.72/195.81 c dualfix : 0.01 0 0 0 0 0 0 0 0
195.72/195.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
195.72/195.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
195.72/195.81 c implics : 0.10 0 284 0 0 0 0 0 0
195.72/195.81 c probing : 0.00 0 0 0 0 0 0 0 0
195.72/195.81 c knapsack : 0.02 0 0 0 0 0 0 0 0
195.72/195.81 c linear : 0.65 321 0 0 333 0 1617 136 430
195.72/195.81 c logicor : 0.09 0 0 0 0 0 0 0 0
195.72/195.81 c root node : - 2519 - - 2519 - - - -
195.72/195.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
195.72/195.81 c integral : 0 0 0 9 0 1 2 0 0 12
195.72/195.81 c knapsack : 272 5 414 0 0 0 0 478 0 0
195.72/195.81 c logicor : 24430+ 5 409 0 0 5 10235 0 0 0
195.72/195.81 c countsols : 0 0 0 0 0 0 0 0 0 0
195.72/195.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
195.72/195.81 c integral : 168.48 0.00 0.00 168.48 0.00
195.72/195.81 c knapsack : 0.05 0.01 0.04 0.00 0.00
195.72/195.81 c logicor : 0.39 0.00 0.39 0.00 0.00
195.72/195.81 c countsols : 0.00 0.00 0.00 0.00 0.00
195.72/195.81 c Propagators : Time Calls Cutoffs DomReds
195.72/195.81 c rootredcost : 0.00 0 0 0
195.72/195.81 c pseudoobj : 0.58 421 0 0
195.72/195.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
195.72/195.81 c propagation : 0.01 5 5 6 3.5 3 4.0 -
195.72/195.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
195.72/195.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
195.72/195.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
195.72/195.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
195.72/195.81 c applied globally : - - - 9 3.7 - - -
195.72/195.81 c applied locally : - - - 0 0.0 - - -
195.72/195.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
195.72/195.81 c cut pool : 0.00 4 - - 432 - (maximal pool size: 1277)
195.72/195.81 c redcost : 0.05 11 0 0 0 0
195.72/195.81 c impliedbounds : 0.03 5 0 0 0 0
195.72/195.81 c intobj : 0.00 0 0 0 0 0
195.72/195.81 c gomory : 5.73 5 0 0 2500 0
195.72/195.81 c strongcg : 4.50 5 0 0 2500 0
195.72/195.81 c cmir : 0.00 0 0 0 0 0
195.72/195.81 c flowcover : 0.00 0 0 0 0 0
195.72/195.81 c clique : 0.90 5 0 0 32 0
195.72/195.81 c zerohalf : 0.00 0 0 0 0 0
195.72/195.81 c mcf : 0.27 1 0 0 0 0
195.72/195.81 c Pricers : Time Calls Vars
195.72/195.81 c problem variables: 0.00 0 0
195.72/195.81 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
195.72/195.81 c relpscost : 168.48 9 1 2 0 0 12
195.72/195.81 c pscost : 0.00 0 0 0 0 0 0
195.72/195.81 c inference : 0.00 0 0 0 0 0 0
195.72/195.81 c mostinf : 0.00 0 0 0 0 0 0
195.72/195.81 c leastinf : 0.00 0 0 0 0 0 0
195.72/195.81 c fullstrong : 0.00 0 0 0 0 0 0
195.72/195.81 c allfullstrong : 0.00 0 0 0 0 0 0
195.72/195.81 c random : 0.00 0 0 0 0 0 0
195.72/195.81 c Primal Heuristics : Time Calls Found
195.72/195.81 c LP solutions : 0.00 - 0
195.72/195.81 c pseudo solutions : 0.00 - 0
195.72/195.81 c simplerounding : 0.00 0 0
195.72/195.81 c rounding : 0.00 0 0
195.72/195.81 c shifting : 0.00 0 0
195.72/195.81 c intshifting : 0.00 0 0
195.72/195.81 c oneopt : 0.00 0 0
195.72/195.81 c fixandinfer : 0.00 0 0
195.72/195.81 c feaspump : 0.00 0 0
195.72/195.81 c coefdiving : 0.00 0 0
195.72/195.81 c pscostdiving : 0.00 0 0
195.72/195.81 c fracdiving : 0.00 0 0
195.72/195.81 c veclendiving : 0.00 0 0
195.72/195.81 c intdiving : 0.00 0 0
195.72/195.81 c actconsdiving : 0.00 0 0
195.72/195.81 c objpscostdiving : 0.00 0 0
195.72/195.81 c rootsoldiving : 0.00 0 0
195.72/195.81 c linesearchdiving : 0.00 0 0
195.72/195.81 c guideddiving : 0.00 0 0
195.72/195.81 c octane : 0.00 0 0
195.72/195.81 c rens : 0.00 0 0
195.72/195.81 c rins : 0.00 0 0
195.72/195.81 c localbranching : 0.00 0 0
195.72/195.81 c mutation : 0.00 0 0
195.72/195.81 c crossover : 0.00 0 0
195.72/195.81 c dins : 0.00 0 0
195.72/195.81 c LP : Time Calls Iterations Iter/call Iter/sec
195.72/195.81 c primal LP : 0.31 0 0 0.00 0.00
195.72/195.81 c dual LP : 11.41 14 8141 581.50 713.50
195.72/195.81 c barrier LP : 0.00 0 0 0.00 -
195.72/195.81 c diving/probing LP: 0.00 0 0 0.00 -
195.72/195.81 c strong branching : 168.48 271 113504 418.83 673.69
195.72/195.81 c (at root node) : - 32 11719 366.22 -
195.72/195.81 c conflict analysis: 0.00 0 0 0.00 -
195.72/195.81 c B&B Tree :
195.72/195.81 c number of runs : 1
195.72/195.81 c nodes : 10
195.72/195.81 c nodes (total) : 10
195.72/195.81 c nodes left : 0
195.72/195.81 c max depth : 6
195.72/195.81 c max depth (total): 6
195.72/195.81 c backtracks : 3 (30.0%)
195.72/195.81 c delayed cutoffs : 3
195.72/195.81 c repropagations : 11 (3406 domain reductions, 2 cutoffs)
195.72/195.81 c avg switch length: 3.60
195.72/195.81 c switching time : 0.37
195.72/195.81 c Solution :
195.72/195.81 c Solutions found : 0 (0 improvements)
195.72/195.81 c Primal Bound : infeasible
195.72/195.81 c Dual Bound : -
195.72/195.81 c Gap : 0.00 %
195.72/195.81 c Root Dual Bound : +3.17915716840818e+02
195.82/195.97 c Time complete: 195.89.