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-1870712-1245216608.opb>
0.00/0.04 c original problem has 3290 variables (3290 bin, 0 int, 0 impl, 0 cont) and 3392 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.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24920 impls, 200 clqs
0.29/0.36 c presolving (2 rounds):
0.29/0.36 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36 c 24920 implications, 200 cliques
0.29/0.36 c presolved problem has 3290 variables (3290 bin, 0 int, 0 impl, 0 cont) and 3392 constraints
0.29/0.36 c 1 constraints of type <knapsack>
0.29/0.36 c 200 constraints of type <setppc>
0.29/0.36 c 3090 constraints of type <and>
0.29/0.36 c 1 constraints of type <linear>
0.29/0.36 c 100 constraints of type <logicor>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.15
0.29/0.36 c SATUNSAT-NLC
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/flowcover/freq = c -1
0.29/0.36 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/cmir/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/veclendiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/simplerounding/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/shifting/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/rounding/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/rootsoldiving/freq = c -1
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/rens/nodesofs = c 2000
0.29/0.36 c # minimum percentage of integer variables that have to be fixable
0.29/0.36 c # [type: real, range: [0,1], default: 0.5]
0.29/0.36 c heuristics/rens/minfixingrate = c 0.3
0.29/0.36 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c heuristics/rens/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/pscostdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/oneopt/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.36 c # [type: real, range: [0,1], default: 0.01]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/objpscostdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/linesearchdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/intshifting/freq = c -1
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/guideddiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/fracdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.36 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/feaspump/freq = c -1
0.29/0.36 c # minimum percentage of integer variables that have to be fixed
0.29/0.36 c # [type: real, range: [0,1], default: 0.666]
0.29/0.36 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.36 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.36 c # [type: real, range: [0,1], default: 0.1]
0.29/0.36 c heuristics/crossover/nodesquot = c 0.15
0.29/0.36 c # number of nodes without incumbent change that heuristic should wait
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.36 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/crossover/nodesofs = c 750
0.29/0.36 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.36 c heuristics/crossover/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/coefdiving/freq = c -1
0.29/0.36 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c presolving/probing/maxrounds = c 0
0.29/0.36 c # should presolving try to simplify knapsacks
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.36 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.36 c constraints/knapsack/disaggregation = c FALSE
0.29/0.36 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.36 c # should presolving try to simplify inequalities
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.37 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c separating/maxroundsroot = c 5
0.29/0.37 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.37 c separating/maxrounds = c 1
0.29/0.37 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c limits/solutions = c 1
0.29/0.37 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/memory = c 1620
0.29/0.37 c # maximal time in seconds to run
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/time = c 1791
0.29/0.37 c # frequency for displaying node information lines
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.37 c display/freq = c 10000
0.29/0.37 c -----------------------------------------------------------------------------------------------
0.29/0.37 c start solving problem
0.29/0.37 c
0.49/0.55 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.55 c 0.3s| 1 | 0 | 351 | 14M| 0 | 160 |3290 |3392 |3392 |3290 |6482 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
1.00/1.01 c 0.8s| 1 | 0 | 406 | 14M| 0 | 161 |3290 |3392 |3392 |3290 |6483 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
2.39/2.41 c 2.2s| 1 | 0 | 542 | 14M| 0 | 162 |3290 |3392 |3392 |3290 |6484 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
3.68/3.75 c 3.5s| 1 | 0 | 658 | 14M| 0 | 161 |3290 |3392 |3392 |3290 |6485 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
5.69/5.77 c 5.5s| 1 | 0 | 781 | 15M| 0 | 162 |3290 |3392 |3392 |3290 |6486 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
6.39/6.49 c 6.2s| 1 | 0 | 914 | 15M| 0 | 162 |3290 |3392 |3392 |3290 |6488 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
18.89/18.93 c 18.6s| 1 | 2 | 914 | 15M| 0 | 162 |3290 |3392 |3392 |3290 |6488 | 6 | 0 | 17 | 8.000000e+01 | -- | Inf
240.42/240.51 c
240.42/240.51 c SCIP Status : problem is solved [infeasible]
240.42/240.51 c Solving Time (sec) : 238.77
240.42/240.51 c Solving Nodes : 1074
240.42/240.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
240.42/240.51 c Dual Bound : +1.00000000000000e+20
240.42/240.51 c Gap : 0.00 %
240.42/240.51 c NODE 1074
240.42/240.51 c DUAL BOUND 1e+20
240.42/240.51 c PRIMAL BOUND 1e+20
240.42/240.51 c GAP 0
240.42/240.51 s UNSATISFIABLE
240.42/240.51 c SCIP Status : problem is solved [infeasible]
240.42/240.51 c Solving Time : 238.77
240.42/240.51 c Original Problem :
240.42/240.51 c Problem name : HOME/instance-1870712-1245216608.opb
240.42/240.51 c Variables : 3290 (3290 binary, 0 integer, 0 implicit integer, 0 continuous)
240.42/240.51 c Constraints : 3392 initial, 3392 maximal
240.42/240.51 c Presolved Problem :
240.42/240.51 c Problem name : t_HOME/instance-1870712-1245216608.opb
240.42/240.51 c Variables : 3290 (3290 binary, 0 integer, 0 implicit integer, 0 continuous)
240.42/240.51 c Constraints : 3392 initial, 3684 maximal
240.42/240.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
240.42/240.51 c trivial : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c dualfix : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c implics : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c probing : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c knapsack : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c setppc : 0.01 0 0 0 0 0 0 0 0
240.42/240.51 c and : 0.10 0 0 0 0 0 0 0 0
240.42/240.51 c linear : 0.03 0 0 0 0 0 0 0 0
240.42/240.51 c logicor : 0.00 0 0 0 0 0 0 0 0
240.42/240.51 c root node : - 102 - - 102 - - - -
240.42/240.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
240.42/240.51 c integral : 0 0 0 574 0 5 57 0 0 1084
240.42/240.51 c knapsack : 1 5 3547 5 0 0 0 0 0 0
240.42/240.51 c setppc : 200 5 3547 5 0 0 17840 0 0 0
240.42/240.51 c and : 3090 753 3547 5 0 21 437427 273429 0 0
240.42/240.51 c linear : 1 5 3526 0 0 0 0 0 0 0
240.42/240.51 c logicor : 100+ 5 1304 0 0 0 939 0 0 0
240.42/240.51 c countsols : 0 0 0 0 0 0 0 0 0 0
240.42/240.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
240.42/240.51 c integral : 101.55 0.00 0.00 101.55 0.00
240.42/240.51 c knapsack : 0.01 0.00 0.01 0.00 0.00
240.42/240.51 c setppc : 0.06 0.00 0.05 0.01 0.00
240.42/240.51 c and : 4.19 2.29 1.88 0.02 0.00
240.42/240.51 c linear : 0.08 0.00 0.08 0.00 0.00
240.42/240.51 c logicor : 0.05 0.00 0.05 0.00 0.00
240.42/240.51 c countsols : 0.00 0.00 0.00 0.00 0.00
240.42/240.51 c Propagators : Time Calls Cutoffs DomReds
240.42/240.51 c rootredcost : 0.00 0 0 0
240.42/240.51 c pseudoobj : 1.51 3580 1 0
240.42/240.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
240.42/240.51 c propagation : 0.00 21 21 21 2.0 1 6.0 -
240.42/240.51 c infeasible LP : 0.33 177 176 606 18.2 0 0.0 0
240.42/240.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
240.42/240.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
240.42/240.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
240.42/240.51 c applied globally : - - - 339 21.8 - - -
240.42/240.51 c applied locally : - - - 0 0.0 - - -
240.42/240.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
240.42/240.51 c cut pool : 0.00 4 - - 9 - (maximal pool size: 32)
240.42/240.51 c redcost : 0.35 753 0 0 0 0
240.42/240.51 c impliedbounds : 0.00 5 0 0 0 0
240.42/240.51 c intobj : 0.00 0 0 0 0 0
240.42/240.51 c gomory : 3.20 5 0 0 1132 0
240.42/240.51 c strongcg : 1.93 5 0 0 2500 0
240.42/240.51 c cmir : 0.00 0 0 0 0 0
240.42/240.51 c flowcover : 0.00 0 0 0 0 0
240.42/240.51 c clique : 0.03 5 0 0 0 0
240.42/240.51 c zerohalf : 0.00 0 0 0 0 0
240.42/240.51 c mcf : 0.05 2 0 0 0 0
240.42/240.51 c Pricers : Time Calls Vars
240.42/240.51 c problem variables: 0.00 0 0
240.42/240.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
240.42/240.51 c relpscost : 101.54 569 5 57 0 0 1084
240.42/240.51 c pscost : 0.00 0 0 0 0 0 0
240.42/240.51 c inference : 0.00 0 0 0 0 0 0
240.42/240.51 c mostinf : 0.00 0 0 0 0 0 0
240.42/240.51 c leastinf : 0.00 0 0 0 0 0 0
240.42/240.51 c fullstrong : 0.00 0 0 0 0 0 0
240.42/240.51 c allfullstrong : 0.00 0 0 0 0 0 0
240.42/240.51 c random : 0.00 0 0 0 0 0 0
240.42/240.51 c Primal Heuristics : Time Calls Found
240.42/240.51 c LP solutions : 0.00 - 0
240.42/240.51 c pseudo solutions : 0.00 - 0
240.42/240.51 c simplerounding : 0.00 0 0
240.42/240.51 c rounding : 0.00 0 0
240.42/240.51 c shifting : 0.00 0 0
240.42/240.51 c intshifting : 0.00 0 0
240.42/240.51 c oneopt : 0.00 0 0
240.42/240.51 c fixandinfer : 0.00 0 0
240.42/240.51 c feaspump : 0.00 0 0
240.42/240.51 c coefdiving : 0.00 0 0
240.42/240.51 c pscostdiving : 0.00 0 0
240.42/240.51 c fracdiving : 0.00 0 0
240.42/240.51 c veclendiving : 0.00 0 0
240.42/240.51 c intdiving : 0.00 0 0
240.42/240.51 c actconsdiving : 0.00 0 0
240.42/240.51 c objpscostdiving : 0.00 0 0
240.42/240.51 c rootsoldiving : 0.00 0 0
240.42/240.51 c linesearchdiving : 0.00 0 0
240.42/240.51 c guideddiving : 0.00 0 0
240.42/240.51 c octane : 0.00 0 0
240.42/240.51 c rens : 0.00 0 0
240.42/240.51 c rins : 0.00 0 0
240.42/240.51 c localbranching : 0.00 0 0
240.42/240.51 c mutation : 0.00 0 0
240.42/240.51 c crossover : 0.00 0 0
240.42/240.51 c dins : 0.00 0 0
240.42/240.51 c LP : Time Calls Iterations Iter/call Iter/sec
240.42/240.51 c primal LP : 0.73 0 0 0.00 0.00
240.42/240.51 c dual LP : 117.38 1807 307087 169.94 2616.18
240.42/240.51 c barrier LP : 0.00 0 0 0.00 -
240.42/240.51 c diving/probing LP: 0.00 0 0 0.00 -
240.42/240.51 c strong branching : 101.42 3305 266097 80.51 2623.71
240.42/240.51 c (at root node) : - 17 10617 624.53 -
240.42/240.51 c conflict analysis: 0.00 0 0 0.00 -
240.42/240.51 c B&B Tree :
240.42/240.51 c number of runs : 1
240.42/240.51 c nodes : 1074
240.42/240.51 c nodes (total) : 1074
240.42/240.51 c nodes left : 0
240.42/240.51 c max depth : 51
240.42/240.51 c max depth (total): 51
240.42/240.51 c backtracks : 238 (22.2%)
240.42/240.51 c delayed cutoffs : 11
240.42/240.51 c repropagations : 741 (7681 domain reductions, 0 cutoffs)
240.42/240.51 c avg switch length: 5.16
240.42/240.51 c switching time : 2.08
240.42/240.51 c Solution :
240.42/240.51 c Solutions found : 0 (0 improvements)
240.42/240.51 c Primal Bound : infeasible
240.42/240.51 c Dual Bound : -
240.42/240.51 c Gap : 0.00 %
240.42/240.51 c Root Dual Bound : +8.00000000000000e+01
240.42/240.56 c Time complete: 240.49.