Done

Hi, I'm glad to hear that you liked it.
I'm a bit short on time right now, but I will incorporate your suggestions on the weekend.
Have fun solving katas!

The sorting is useless. My other solution (with it removed) runs faster. Wish I could delete this one!

This one was a real blast, thank you. Now I can get on with my life :-)

I was getting correct answers but struggling with the 12 second timeout during the random tests, so I knew I was close... but my solution was messy.

A complete change in approach made the code much faster and much more readable... very satisfying when that happens. Bring on the 8x8!

Many thanks!

It's fixed now. I'm really sorry it took so long

(the translation editor didn't work and being reluctant to use the kata editor I kept delaying)

C-V, is this fixed?

@C-V: did you fix the C++ translation? (see issue above)

I had a really hard time understanding the rules, like several people in the comments, because you express the problem in terms of adding braces.

Could I suggest that you phrase the problem something like:
"Varying the order of evaluation, how many distinct expression trees evaluate to true?"

This is unambiguous and answers questions like:
"is t|t|t distinct from (t|t)|t and t|(t|t) ?"
(answer: no, it's either one or the other)

Even once you understand the problem, I think it's a little hard for 3 kyu. I really enjoyed it anyway, so thanks.