0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870729-1245217448.opb>
0.00/0.02 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.00/0.04 c No objective function, only one solution is needed.
0.00/0.04 c start presolving problem
0.00/0.04 c presolving:
0.09/0.17 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11908 impls, 100 clqs
0.20/0.30 c presolving (2 rounds):
0.20/0.30 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.20/0.30 c 11908 implications, 100 cliques
0.20/0.30 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.20/0.30 c 1 constraints of type <knapsack>
0.20/0.30 c 100 constraints of type <setppc>
0.20/0.30 c 1476 constraints of type <and>
0.20/0.30 c 1 constraints of type <linear>
0.20/0.30 c 50 constraints of type <logicor>
0.20/0.30 c transformed objective value is always integral (scale: 1)
0.20/0.30 c Presolving Time: 0.12
0.20/0.30 c SATUNSAT-NLC
0.20/0.30 c -----------------------------------------------------------------------------------------------
0.20/0.30 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c separating/flowcover/freq = c -1
0.20/0.30 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c separating/cmir/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/veclendiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/veclendiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/simplerounding/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/shifting/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/rounding/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.20/0.30 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.20/0.30 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/rootsoldiving/freq = c -1
0.20/0.30 c # number of nodes added to the contingent of the total nodes
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.30 c heuristics/rens/nodesofs = c 2000
0.20/0.30 c # minimum percentage of integer variables that have to be fixable
0.20/0.30 c # [type: real, range: [0,1], default: 0.5]
0.20/0.30 c heuristics/rens/minfixingrate = c 0.3
0.20/0.30 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c heuristics/rens/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/pscostdiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/oneopt/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to total iteration number
0.20/0.30 c # [type: real, range: [0,1], default: 0.01]
0.20/0.30 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.20/0.30 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/objpscostdiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/linesearchdiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/intshifting/freq = c -1
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/intdiving/maxlpiterquot = c 0.075
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/guideddiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/guideddiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/fracdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/fracdiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/feaspump/maxlpiterofs = c 2000
0.20/0.30 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/feaspump/freq = c -1
0.20/0.30 c # minimum percentage of integer variables that have to be fixed
0.20/0.30 c # [type: real, range: [0,1], default: 0.666]
0.20/0.30 c heuristics/crossover/minfixingrate = c 0.5
0.20/0.30 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.20/0.30 c # [type: real, range: [0,1], default: 0.1]
0.20/0.30 c heuristics/crossover/nodesquot = c 0.15
0.20/0.30 c # number of nodes without incumbent change that heuristic should wait
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.20/0.30 c heuristics/crossover/nwaitingnodes = c 100
0.20/0.30 c # number of nodes added to the contingent of the total nodes
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.30 c heuristics/crossover/nodesofs = c 750
0.20/0.30 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 30]
0.20/0.30 c heuristics/crossover/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/coefdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/coefdiving/freq = c -1
0.20/0.30 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c presolving/probing/maxrounds = c 0
0.20/0.30 c # should presolving try to simplify knapsacks
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.30 c constraints/knapsack/simplifyinequalities = c TRUE
0.20/0.30 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.20/0.30 c constraints/knapsack/disaggregation = c FALSE
0.20/0.30 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c constraints/knapsack/maxnumcardlift = c 0
0.20/0.30 c # should presolving try to simplify inequalities
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.20/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c separating/maxroundsroot = c 5
0.20/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.20/0.30 c separating/maxrounds = c 1
0.20/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c limits/solutions = c 1
0.20/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/memory = c 1620
0.20/0.30 c # maximal time in seconds to run
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/time = c 1791
0.20/0.30 c # frequency for displaying node information lines
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.20/0.30 c display/freq = c 10000
0.20/0.30 c -----------------------------------------------------------------------------------------------
0.20/0.30 c start solving problem
0.20/0.30 c
0.30/0.34 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.30/0.34 c 0.2s| 1 | 0 | 67 |7097k| 0 | 60 |1576 |1628 |1628 |1576 |3104 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.54 c 0.4s| 1 | 0 | 112 |7117k| 0 | 62 |1576 |1628 |1628 |1576 |3105 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.89/0.92 c 0.7s| 1 | 0 | 137 |7147k| 0 | 62 |1576 |1628 |1628 |1576 |3106 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.10/1.17 c 1.0s| 1 | 0 | 194 |7212k| 0 | 63 |1576 |1628 |1628 |1576 |3107 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.69/1.76 c 1.6s| 1 | 0 | 233 |7274k| 0 | 63 |1576 |1628 |1628 |1576 |3108 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.38/2.43 c 2.2s| 1 | 0 | 338 |7337k| 0 | 65 |1576 |1628 |1628 |1576 |3109 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
5.18/5.29 c 5.1s| 1 | 2 | 338 |7338k| 0 | 65 |1576 |1628 |1628 |1576 |3109 | 5 | 0 | 33 | 3.000000e+01 | -- | Inf
21.78/21.82 c
21.78/21.82 c SCIP Status : problem is solved [infeasible]
21.78/21.82 c Solving Time (sec) : 21.50
21.78/21.82 c Solving Nodes : 349
21.78/21.82 c Primal Bound : +1.00000000000000e+20 (0 solutions)
21.78/21.82 c Dual Bound : +1.00000000000000e+20
21.78/21.82 c Gap : 0.00 %
21.78/21.82 c NODE 349
21.78/21.82 c DUAL BOUND 1e+20
21.78/21.82 c PRIMAL BOUND 1e+20
21.78/21.82 c GAP 0
21.78/21.82 s UNSATISFIABLE
21.78/21.82 c SCIP Status : problem is solved [infeasible]
21.78/21.82 c Solving Time : 21.50
21.78/21.82 c Original Problem :
21.78/21.82 c Problem name : HOME/instance-1870729-1245217448.opb
21.78/21.82 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
21.78/21.82 c Constraints : 1628 initial, 1628 maximal
21.78/21.82 c Presolved Problem :
21.78/21.82 c Problem name : t_HOME/instance-1870729-1245217448.opb
21.78/21.82 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
21.78/21.82 c Constraints : 1628 initial, 1628 maximal
21.78/21.82 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
21.78/21.82 c trivial : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c dualfix : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c boundshift : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c inttobinary : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c implics : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c probing : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c knapsack : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c setppc : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c and : 0.11 0 0 0 0 0 0 0 0
21.78/21.82 c linear : 0.01 0 0 0 0 0 0 0 0
21.78/21.82 c logicor : 0.00 0 0 0 0 0 0 0 0
21.78/21.82 c root node : - 132 - - 132 - - - -
21.78/21.82 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
21.78/21.82 c integral : 0 0 0 232 0 3 85 0 0 348
21.78/21.82 c knapsack : 1 5 964 19 0 3 84 0 0 0
21.78/21.82 c setppc : 100 5 969 19 0 3 2361 0 0 0
21.78/21.82 c and : 1476 307 966 19 0 5 45792 38001 0 0
21.78/21.82 c linear : 1 5 960 0 0 2 14 0 0 0
21.78/21.82 c logicor : 50+ 5 311 0 0 0 205 0 0 0
21.78/21.82 c countsols : 0 0 0 0 0 0 0 0 0 0
21.78/21.82 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
21.78/21.82 c integral : 11.42 0.00 0.00 11.42 0.00
21.78/21.82 c knapsack : 0.00 0.00 0.00 0.00 0.00
21.78/21.82 c setppc : 0.02 0.00 0.02 0.00 0.00
21.78/21.82 c and : 0.63 0.43 0.19 0.01 0.00
21.78/21.82 c linear : 0.03 0.00 0.03 0.00 0.00
21.78/21.82 c logicor : 0.00 0.00 0.00 0.00 0.00
21.78/21.82 c countsols : 0.00 0.00 0.00 0.00 0.00
21.78/21.82 c Propagators : Time Calls Cutoffs DomReds
21.78/21.82 c rootredcost : 0.00 0 0 0
21.78/21.82 c pseudoobj : 0.12 978 1 0
21.78/21.82 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.78/21.82 c propagation : 0.00 13 13 16 7.8 1 6.0 -
21.78/21.82 c infeasible LP : 0.01 158 0 0 0.0 0 0.0 0
21.78/21.82 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.78/21.82 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.78/21.82 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.78/21.82 c applied globally : - - - 14 6.9 - - -
21.78/21.82 c applied locally : - - - 0 0.0 - - -
21.78/21.82 c Separators : Time Calls Cutoffs DomReds Cuts Conss
21.78/21.82 c cut pool : 0.00 4 - - 4 - (maximal pool size: 40)
21.78/21.82 c redcost : 0.02 307 0 0 0 0
21.78/21.82 c impliedbounds : 0.00 5 0 0 0 0
21.78/21.82 c intobj : 0.00 0 0 0 0 0
21.78/21.82 c gomory : 1.10 5 0 0 1000 0
21.78/21.82 c strongcg : 0.80 5 0 0 1967 0
21.78/21.82 c cmir : 0.00 0 0 0 0 0
21.78/21.82 c flowcover : 0.00 0 0 0 0 0
21.78/21.82 c clique : 0.00 5 0 0 0 0
21.78/21.82 c zerohalf : 0.00 0 0 0 0 0
21.78/21.82 c mcf : 0.02 2 0 0 0 0
21.78/21.82 c Pricers : Time Calls Vars
21.78/21.82 c problem variables: 0.00 0 0
21.78/21.82 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
21.78/21.82 c relpscost : 11.42 213 3 85 0 0 348
21.78/21.82 c pscost : 0.00 0 0 0 0 0 0
21.78/21.82 c inference : 0.00 0 0 0 0 0 0
21.78/21.82 c mostinf : 0.00 0 0 0 0 0 0
21.78/21.82 c leastinf : 0.00 0 0 0 0 0 0
21.78/21.82 c fullstrong : 0.00 0 0 0 0 0 0
21.78/21.82 c allfullstrong : 0.00 0 0 0 0 0 0
21.78/21.82 c random : 0.00 0 0 0 0 0 0
21.78/21.82 c Primal Heuristics : Time Calls Found
21.78/21.82 c LP solutions : 0.00 - 0
21.78/21.83 c pseudo solutions : 0.00 - 0
21.78/21.83 c simplerounding : 0.00 0 0
21.78/21.83 c rounding : 0.00 0 0
21.78/21.83 c shifting : 0.00 0 0
21.78/21.83 c intshifting : 0.00 0 0
21.78/21.83 c oneopt : 0.00 0 0
21.78/21.83 c fixandinfer : 0.00 0 0
21.78/21.83 c feaspump : 0.00 0 0
21.78/21.83 c coefdiving : 0.00 0 0
21.78/21.83 c pscostdiving : 0.00 0 0
21.78/21.83 c fracdiving : 0.00 0 0
21.78/21.83 c veclendiving : 0.00 0 0
21.78/21.83 c intdiving : 0.00 0 0
21.78/21.83 c actconsdiving : 0.00 0 0
21.78/21.83 c objpscostdiving : 0.00 0 0
21.78/21.83 c rootsoldiving : 0.00 0 0
21.78/21.83 c linesearchdiving : 0.00 0 0
21.78/21.83 c guideddiving : 0.00 0 0
21.78/21.83 c octane : 0.00 0 0
21.78/21.83 c rens : 0.00 0 0
21.78/21.83 c rins : 0.00 0 0
21.78/21.83 c localbranching : 0.00 0 0
21.78/21.83 c mutation : 0.00 0 0
21.78/21.83 c crossover : 0.00 0 0
21.78/21.83 c dins : 0.00 0 0
21.78/21.83 c LP : Time Calls Iterations Iter/call Iter/sec
21.78/21.83 c primal LP : 0.80 0 0 0.00 0.00
21.78/21.83 c dual LP : 5.68 688 40445 58.79 7120.60
21.78/21.83 c barrier LP : 0.00 0 0 0.00 -
21.78/21.83 c diving/probing LP: 0.00 0 0 0.00 -
21.78/21.83 c strong branching : 11.39 1640 78285 47.73 6873.13
21.78/21.83 c (at root node) : - 33 5821 176.39 -
21.78/21.83 c conflict analysis: 0.00 0 0 0.00 -
21.78/21.83 c B&B Tree :
21.78/21.83 c number of runs : 1
21.78/21.83 c nodes : 349
21.78/21.83 c nodes (total) : 349
21.78/21.83 c nodes left : 0
21.78/21.83 c max depth : 46
21.78/21.83 c max depth (total): 46
21.78/21.83 c backtracks : 68 (19.5%)
21.78/21.83 c delayed cutoffs : 0
21.78/21.83 c repropagations : 24 (236 domain reductions, 0 cutoffs)
21.78/21.83 c avg switch length: 3.15
21.78/21.83 c switching time : 0.88
21.78/21.83 c Solution :
21.78/21.83 c Solutions found : 0 (0 improvements)
21.78/21.83 c Primal Bound : infeasible
21.78/21.83 c Dual Bound : -
21.78/21.83 c Gap : 0.00 %
21.78/21.83 c Root Dual Bound : +3.00000000000000e+01
21.78/21.86 c Time complete: 21.83.