Short answer: None.
The middle answer: it cannot be done, although you can write a program to verify the validity of this proof quite easily. In the case of propositional logic, the problem of automatically finding evidence is NP-complete (although it is solvable!), And in first-order logic there are true theorems for which the preventer never stops. (unsolvable) (through proof of incompleteness Gödel)
If you are interested in writing such a thing, you can strike her and possibly make her work in some small cases, but that is not possible at all.
, , . () () ! , . , , (c) , .