Provided a challenge as well as a set of premises, difficulty-solving cuts down to searching for the proof tree whose root node is labelled by a solution of the issue and whose leaf nodes are labelled by premises or axioms. In the case of Horn clauses, difficulty-solving search could be performed by reasoning forwards with the premises or backwards