MAYBE
Left Termination proof of ../tpdb/LP/lpexamples/kay4.pl
Left Termination of the query pattern
kay4_in_1(g)
w.r.t. the given Prolog program could not be shown:
↳ Prolog
↳ UndefinedPredicateHandlerProof
Clauses:
kay4(I) :- ','(length(.(_, .(_, L)), I), ','(top(L), ','(mid([], L), bot(L)))).
top(L) :- ','(write(a), ','(mwrite('-', L), ','(write(b), nl))).
bot(L) :- ','(write(c), ','(mwrite('-', L), ','(write(d), nl))).
mid(X, []).
mid(X, .(_, [])) :- ','(write('|'), ','(mwrite(' ', X), ','(write('X'), ','(mwrite(' ', X), ','(write('|'), nl))))).
mid(X, .(_, .(_, Y))) :- ','(write('|'), ','(mwrite(' ', X), ','(write('\\'), ','(mwrite(' ', Y), ','(write('/'), ','(mwrite(' ', X), ','(write('|'), ','(nl, ','(mid(.(_, X), Y), ','(write('|'), ','(mwrite(' ', X), ','(write('/'), ','(mwrite(' ', Y), ','(write('\\'), ','(mwrite(' ', X), ','(write('|'), nl)))))))))))))))).
mwrite(Char, L) :- findall(_, ','(member(_, L), write(Char)), _).
member(X, .(X, _)).
member(X, .(_, Xs)) :- member(X, Xs).
Queries:
kay4(g).
Added facts for all undefined predicates.
↳ Prolog
↳ UndefinedPredicateHandlerProof
↳ Prolog
Clauses:
kay4(I) :- ','(length(.(_, .(_, L)), I), ','(top(L), ','(mid([], L), bot(L)))).
top(L) :- ','(write(a), ','(mwrite('-', L), ','(write(b), nl))).
bot(L) :- ','(write(c), ','(mwrite('-', L), ','(write(d), nl))).
mid(X, []).
mid(X, .(_, [])) :- ','(write('|'), ','(mwrite(' ', X), ','(write('X'), ','(mwrite(' ', X), ','(write('|'), nl))))).
mid(X, .(_, .(_, Y))) :- ','(write('|'), ','(mwrite(' ', X), ','(write('\\'), ','(mwrite(' ', Y), ','(write('/'), ','(mwrite(' ', X), ','(write('|'), ','(nl, ','(mid(.(_, X), Y), ','(write('|'), ','(mwrite(' ', X), ','(write('/'), ','(mwrite(' ', Y), ','(write('\\'), ','(mwrite(' ', X), ','(write('|'), nl)))))))))))))))).
mwrite(Char, L) :- findall(_, ','(member(_, L), write(Char)), _).
member(X, .(X, _)).
member(X, .(_, Xs)) :- member(X, Xs).
length(X0, X1).
write(X0).
nl.
findall(X0, X1, X2).
Queries:
kay4(g).