Are lambda calculus and combinatory logic the same?
What distinguishes combinatory logic is that it is variable free.  This is sometimes useful in metamathematics and philosophical logic, where the status of variables is tricky.

It may also be useful in implementations, since managing variables can be a headache.  Cf., e.g., Hughes, 1982, Super-combinators: A new implementation method for applicative languages