Inductive proof schema for inductive datatypes

Implementation of a tainted algorithm to detect on which quantified to automatically performed proof by induction. The tainted algorithm must identified the parameters upon which well-founded recursion is established for each recursive function within the COI of a Lean formula to be translated.

---
**Transferred from:** input-output-hk/sc-fvt#236

The issue names no files, tests, or entry points. Start by locating the translation path for Lean formulas and its handling of recursive functions and their call-over-approximation (COI). Done means the implementation identifies the well-founded recursion parameters needed to select induction automatically.

Written by the indexing model from the issue text.