The worst case complexity vanilla logic programming is exponential in the depth of the proof (Russell and Norvig, 2010a).
in our case, this is a particular problem because weak unification requires the prover to attempt unification between all entity and predicate symbols.