feat: improve case-split heuristic in `grind`

This PR improves the case-split heuristics in `grind`.
In this PR, we do not increment the number of case splits in the first
case. The idea is to leverage non-chronological backtracking: if the first case
is solved using a proof that doesn't depend on the case hypothesis, we backtrack and close
the original goal directly. In this scenario, the case-split was "free", it didn't contribute
to the proof. By not counting it, we allow deeper exploration when case-splits turn out to be
irrelevant.
The new heuristic addresses the second example in #11545
3 files changed