These results indicate that the majority of relations TEXTRUNNER extracted from text are APF, and so we can expect HOLMES's techniques will allow efficient inference over most relations.
it holds in our experience, and if necessary could be enforced by terminating the search for proof trees at a certain depth, e.g., log(m).