0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870632-1245214414.opb>
0.00/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.02/0.03 c No objective function, only one solution is needed.
0.02/0.03 c start presolving problem
0.02/0.03 c presolving:
0.08/0.17 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11828 impls, 100 clqs
0.19/0.29 c presolving (2 rounds):
0.19/0.29 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.29 c 11828 implications, 100 cliques
0.19/0.29 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.19/0.29 c 1 constraints of type <knapsack>
0.19/0.29 c 100 constraints of type <setppc>
0.19/0.29 c 1466 constraints of type <and>
0.19/0.29 c 1 constraints of type <linear>
0.19/0.29 c 50 constraints of type <logicor>
0.19/0.29 c transformed objective value is always integral (scale: 1)
0.19/0.29 c Presolving Time: 0.11
0.19/0.29 c SATUNSAT-NLC
0.19/0.29 c -----------------------------------------------------------------------------------------------
0.19/0.29 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/flowcover/freq = c -1
0.19/0.29 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/cmir/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/veclendiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/simplerounding/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/shifting/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/rounding/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/rootsoldiving/freq = c -1
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/rens/nodesofs = c 2000
0.19/0.29 c # minimum percentage of integer variables that have to be fixable
0.19/0.29 c # [type: real, range: [0,1], default: 0.5]
0.19/0.29 c heuristics/rens/minfixingrate = c 0.3
0.19/0.29 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c heuristics/rens/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/pscostdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/oneopt/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.29 c # [type: real, range: [0,1], default: 0.01]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/objpscostdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/linesearchdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/intshifting/freq = c -1
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/guideddiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/fracdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.29 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/feaspump/freq = c -1
0.19/0.29 c # minimum percentage of integer variables that have to be fixed
0.19/0.29 c # [type: real, range: [0,1], default: 0.666]
0.19/0.29 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.29 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.29 c # [type: real, range: [0,1], default: 0.1]
0.19/0.29 c heuristics/crossover/nodesquot = c 0.15
0.19/0.29 c # number of nodes without incumbent change that heuristic should wait
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.29 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/crossover/nodesofs = c 750
0.19/0.29 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.29 c heuristics/crossover/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/coefdiving/freq = c -1
0.19/0.29 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c presolving/probing/maxrounds = c 0
0.19/0.29 c # should presolving try to simplify knapsacks
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.29 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.29 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.29 c constraints/knapsack/disaggregation = c FALSE
0.19/0.29 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.29 c # should presolving try to simplify inequalities
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.29 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.29 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c separating/maxroundsroot = c 5
0.19/0.29 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.29 c separating/maxrounds = c 1
0.19/0.29 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c limits/solutions = c 1
0.19/0.29 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.29 c limits/memory = c 1620
0.19/0.29 c # maximal time in seconds to run
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.29 c limits/time = c 1791
0.19/0.29 c # frequency for displaying node information lines
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.29 c display/freq = c 10000
0.19/0.29 c -----------------------------------------------------------------------------------------------
0.19/0.30 c start solving problem
0.19/0.30 c
0.28/0.34 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.28/0.34 c 0.2s| 1 | 0 | 91 |7053k| 0 | 60 |1566 |1618 |1618 |1566 |3084 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.52 c 0.3s| 1 | 0 | 95 |7066k| 0 | 61 |1566 |1618 |1618 |1566 |3085 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.71 c 0.5s| 1 | 0 | 133 |7097k| 0 | 61 |1566 |1618 |1618 |1566 |3087 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.89 c 0.7s| 1 | 0 | 157 |7133k| 0 | 63 |1566 |1618 |1618 |1566 |3089 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.40 c 1.2s| 1 | 0 | 209 |7164k| 0 | 64 |1566 |1618 |1618 |1566 |3090 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
1.99/2.00 c 1.8s| 1 | 0 | 270 |7266k| 0 | 63 |1566 |1618 |1618 |1566 |3091 | 7 | 0 | 0 | 3.000000e+01 | -- | Inf
8.09/8.16 c 7.9s| 1 | 2 | 270 |7267k| 0 | 63 |1566 |1618 |1618 |1566 |3091 | 7 | 0 | 30 | 3.000000e+01 | -- | Inf
21.38/21.42 c
21.38/21.42 c SCIP Status : problem is solved [infeasible]
21.38/21.42 c Solving Time (sec) : 20.97
21.38/21.42 c Solving Nodes : 279
21.38/21.42 c Primal Bound : +1.00000000000000e+20 (0 solutions)
21.38/21.42 c Dual Bound : +1.00000000000000e+20
21.38/21.42 c Gap : 0.00 %
21.38/21.42 c NODE 279
21.38/21.42 c DUAL BOUND 1e+20
21.38/21.42 c PRIMAL BOUND 1e+20
21.38/21.42 c GAP 0
21.38/21.42 s UNSATISFIABLE
21.38/21.42 c SCIP Status : problem is solved [infeasible]
21.38/21.42 c Solving Time : 20.97
21.38/21.42 c Original Problem :
21.38/21.42 c Problem name : HOME/instance-1870632-1245214414.opb
21.38/21.42 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
21.38/21.42 c Constraints : 1618 initial, 1618 maximal
21.38/21.42 c Presolved Problem :
21.38/21.42 c Problem name : t_HOME/instance-1870632-1245214414.opb
21.38/21.42 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
21.38/21.42 c Constraints : 1618 initial, 1711 maximal
21.38/21.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
21.38/21.42 c trivial : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c implics : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c probing : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c knapsack : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c setppc : 0.01 0 0 0 0 0 0 0 0
21.38/21.42 c and : 0.09 0 0 0 0 0 0 0 0
21.38/21.42 c linear : 0.01 0 0 0 0 0 0 0 0
21.38/21.42 c logicor : 0.00 0 0 0 0 0 0 0 0
21.38/21.42 c root node : - 72 - - 72 - - - -
21.38/21.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
21.38/21.42 c integral : 0 0 0 184 0 8 37 0 0 296
21.38/21.42 c knapsack : 1 5 1276 13 0 3 14 0 0 0
21.38/21.42 c setppc : 100 5 1273 13 0 0 760 0 0 0
21.38/21.42 c and : 1466 264 1273 13 0 0 19705 27902 0 0
21.38/21.42 c linear : 1 5 1273 0 0 1 0 0 0 0
21.38/21.42 c logicor : 50+ 5 331 0 0 0 243 0 0 0
21.38/21.42 c countsols : 0 0 0 0 0 0 0 0 0 0
21.38/21.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
21.38/21.42 c integral : 13.91 0.00 0.00 13.91 0.00
21.38/21.42 c knapsack : 0.00 0.00 0.00 0.00 0.00
21.38/21.42 c setppc : 0.03 0.00 0.03 0.00 0.00
21.38/21.42 c and : 0.33 0.19 0.14 0.00 0.00
21.38/21.42 c linear : 0.00 0.00 0.00 0.00 0.00
21.38/21.42 c logicor : 0.00 0.00 0.00 0.00 0.00
21.38/21.42 c countsols : 0.00 0.00 0.00 0.00 0.00
21.38/21.42 c Propagators : Time Calls Cutoffs DomReds
21.38/21.42 c rootredcost : 0.00 0 0 0
21.38/21.42 c pseudoobj : 0.18 1280 0 0
21.38/21.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.38/21.42 c propagation : 0.00 4 4 16 17.9 0 0.0 -
21.38/21.42 c infeasible LP : 0.08 108 108 410 15.5 1 6.0 0
21.38/21.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.38/21.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.38/21.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.38/21.42 c applied globally : - - - 168 14.4 - - -
21.38/21.42 c applied locally : - - - 0 0.0 - - -
21.38/21.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
21.38/21.42 c cut pool : 0.00 4 - - 3 - (maximal pool size: 40)
21.38/21.42 c redcost : 0.05 264 0 0 0 0
21.38/21.42 c impliedbounds : 0.00 5 0 0 0 0
21.38/21.42 c intobj : 0.00 0 0 0 0 0
21.38/21.42 c gomory : 0.82 5 0 0 1500 0
21.38/21.42 c strongcg : 0.70 5 0 0 2396 0
21.38/21.42 c cmir : 0.00 0 0 0 0 0
21.38/21.42 c flowcover : 0.00 0 0 0 0 0
21.38/21.42 c clique : 0.00 5 0 0 0 0
21.38/21.42 c zerohalf : 0.00 0 0 0 0 0
21.38/21.42 c mcf : 0.01 2 0 0 0 0
21.38/21.42 c Pricers : Time Calls Vars
21.38/21.42 c problem variables: 0.00 0 0
21.38/21.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
21.38/21.42 c relpscost : 13.91 171 8 37 0 0 296
21.38/21.42 c pscost : 0.00 0 0 0 0 0 0
21.38/21.42 c inference : 0.00 0 0 0 0 0 0
21.38/21.42 c mostinf : 0.00 0 0 0 0 0 0
21.38/21.42 c leastinf : 0.00 0 0 0 0 0 0
21.38/21.42 c fullstrong : 0.00 0 0 0 0 0 0
21.38/21.42 c allfullstrong : 0.00 0 0 0 0 0 0
21.38/21.42 c random : 0.00 0 0 0 0 0 0
21.38/21.42 c Primal Heuristics : Time Calls Found
21.38/21.42 c LP solutions : 0.00 - 0
21.38/21.42 c pseudo solutions : 0.00 - 0
21.38/21.42 c simplerounding : 0.00 0 0
21.38/21.42 c rounding : 0.00 0 0
21.38/21.42 c shifting : 0.00 0 0
21.38/21.42 c intshifting : 0.00 0 0
21.38/21.42 c oneopt : 0.00 0 0
21.38/21.42 c fixandinfer : 0.00 0 0
21.38/21.42 c feaspump : 0.00 0 0
21.38/21.42 c coefdiving : 0.00 0 0
21.38/21.42 c pscostdiving : 0.00 0 0
21.38/21.42 c fracdiving : 0.00 0 0
21.38/21.42 c veclendiving : 0.00 0 0
21.38/21.42 c intdiving : 0.00 0 0
21.38/21.42 c actconsdiving : 0.00 0 0
21.38/21.42 c objpscostdiving : 0.00 0 0
21.38/21.42 c rootsoldiving : 0.00 0 0
21.38/21.42 c linesearchdiving : 0.00 0 0
21.38/21.42 c guideddiving : 0.00 0 0
21.38/21.42 c octane : 0.00 0 0
21.38/21.42 c rens : 0.00 0 0
21.38/21.42 c rins : 0.00 0 0
21.38/21.42 c localbranching : 0.00 0 0
21.38/21.42 c mutation : 0.00 0 0
21.38/21.42 c crossover : 0.00 0 0
21.38/21.42 c dins : 0.00 0 0
21.38/21.42 c LP : Time Calls Iterations Iter/call Iter/sec
21.38/21.42 c primal LP : 0.00 0 0 0.00 -
21.38/21.42 c dual LP : 4.13 544 25581 47.02 6193.95
21.38/21.42 c barrier LP : 0.00 0 0 0.00 -
21.38/21.42 c diving/probing LP: 0.00 0 0 0.00 -
21.38/21.42 c strong branching : 13.88 1241 54969 44.29 3960.30
21.38/21.42 c (at root node) : - 30 11400 380.00 -
21.38/21.42 c conflict analysis: 0.00 0 0 0.00 -
21.38/21.42 c B&B Tree :
21.38/21.42 c number of runs : 1
21.38/21.42 c nodes : 279
21.38/21.42 c nodes (total) : 279
21.38/21.42 c nodes left : 0
21.38/21.42 c max depth : 46
21.38/21.42 c max depth (total): 46
21.38/21.42 c backtracks : 59 (21.1%)
21.38/21.42 c delayed cutoffs : 18
21.38/21.42 c repropagations : 474 (3410 domain reductions, 0 cutoffs)
21.38/21.42 c avg switch length: 4.98
21.38/21.42 c switching time : 0.05
21.38/21.42 c Solution :
21.38/21.42 c Solutions found : 0 (0 improvements)
21.38/21.42 c Primal Bound : infeasible
21.38/21.42 c Dual Bound : -
21.38/21.42 c Gap : 0.00 %
21.38/21.42 c Root Dual Bound : +3.00000000000000e+01
21.38/21.45 c Time complete: 21.43.