Is it OK, that the proof generation takes multiple minutes on recursive example?

[LogvinovLeon]

Aim

Just wanted to ask if it's a local problem or if it's to be expected.
Seems like such a small example proving that x !== y should not take multiple minutes as it renders it completely unusable for the users

Expected Behavior

.

Bug

.

To Reproduce

Environment

No response

Additional Context

No response

Would you like to submit a PR for this Issue?

No

Support Needs

No response