### Syntax for input formulas for, respectively, negation, conjunction, disjunction, conditional and absurdity constant: ~a , a & b, a V b (but not a v b), a > b (or a -> b) , F.

#### Note that if rule Bot_E (that is to say Falsity Elimination i.e. FE) is used in the proof of your formula, even only once, then your formula is provable in intuitionistic logic, but not in minimal logic.

Result of the proof search: