Hi Huang,
„From formulas“ means that either (a) parts of your initial lemma, (b) an auxiliary lemma, or (c) a restriction lead to the contradiction.
Let me give an example. Presume, you would like to prove secrecy but it is part of your threat model that you do not consider compromised public keys. Your lemma could look something like this:
lemma Secrecy:
„All m #x. Sent(m) @ #x ==> (not Ex #t. K(m) @ #t) | (Ex #x. PublicKeyReveal() @ #x)“
When you start proving this formula, it will be negated yielding:
Ex m #x. Sent(m) @ #x & (Ex #t. K(m) @ #t) & (All #x. PublicKeyReveal() @ #x ==> \bot)
Tamarin will next instantiate the Sent and K facts on the trace, leaving you with the formula (All #x. PublicKeyReveal() @ #x ==> \bot). Should it now happen that the fact PublicKeyReveal appears in your dependency graph, Tamarin will apply a constraint reduction rule that introduces the formula \bot into the constraint set, which is a direct contradiction. This contradiction is marked as „from formulas,“ because Tamarin applied formula reduction rules to derive it.
I hope this is clear!
Best,