Natural Language InputAll birds can fly. Penguins are birds...Neural Network (LLM)Formal Logic Translation∀x(Bird(x) → CanFly(x)), ∀x(Penguin(x) → Bird(x))...Symbolic Reasoning(Theorem Prover)ConclusionFalse: Contradiction found