:- true pred bst_member(E,_A) : ( num(E), bin_tree(_A) ) => ( num(E), bin_tree(_A), depth(_A,_B) ) + cost(ub,steps,_B+3).