User blog comment:Alemagno12/Rayo and FOST/@comment-27173506-20160331154639/@comment-80.98.179.160-20171224211446

Yes 42n+8 is the upper bound: We don't need parenthesizing all expressions with ¬, nor using parens for any and all existential quantifiers!! And with set limitations, we can get even less than 42n+8. And we DON'T require to parenthesize any and all expressions with AND.