Assume theoretically that P equals NP. Write a detailed explanation of how this resolution would fundamentally alter the landscape of computer science, cryptography, and mathematics. Specifically, discuss the impact on public-key encryption systems like RSA, the efficiency of solving optimization problems such as the Traveling Salesman, and the potential for automated mathematical theorem proving. Conversely, analyze the philosophical implications of efficient verification being equivalent to efficient discovery in the context of human creativity.