Prolog can (sometimes) "reverse execute" a specification, not generalize from examples. It's like saying "a cat has a round face and pointy ears" versus "look at these cat pictures". (Versus "draw an oval and then draw two triangles at the top...")

But generalising from examples has been a research topic in the Prolog community since at least the early 80s. The field is called inductive logic programming (https://en.wikipedia.org/wiki/Inductive_logic_programming).

I wonder how far they went with prolog. I remember examples in books talking about solving a problem and outputing a plan. But it wasn't a program, not in the sense of nested/modular systems, more like a linear walk.

That said, webyrd has shown kanren embedded lambda calc (evalo relation) to find which program would be reduced to some value..

No, Prolog is nothing like that. Prolog is perhaps the sort of paradigm that could be used as one part of an implementation of something like that (as we see here with miniKanren), but Prolog itself isn't even close.