Left Termination of the query pattern
kay4(g)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

kay4(I) :- ','(length(.(X1, .(X2, 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, .(X3, [])) :- ','(write('|'), ','(mwrite(' ', X), ','(write('X'), ','(mwrite(' ', X), ','(write('|'), nl))))).
mid(X, .(X4, .(X5, Y))) :- ','(write('|'), ','(mwrite(' ', X), ','(write('\\'), ','(mwrite(' ', Y), ','(write('/'), ','(mwrite(' ', X), ','(write('|'), ','(nl, ','(mid(.(X6, X), Y), ','(write('|'), ','(mwrite(' ', X), ','(write('/'), ','(mwrite(' ', Y), ','(write('\\'), ','(mwrite(' ', X), ','(write('|'), nl)))))))))))))))).
mwrite(Char, L) :- findall(X7, ','(member(X8, L), write(Char)), X9).
member(X, .(X, X10)).
member(X, .(X11, Xs)) :- member(X, Xs).

Query: kay4(g)

(1) PrologToTRSTransformerProof (SOUND transformation)

Transformed Prolog program to TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
2 [label="2: kay4(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: kay4(T1), SCOPE: 1, CLAUSE: 0\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ','(length(.(X18, .(X19, X20)), T4), ','(top(X20), ','(mid([], X20), bot(X20))))\n\nT4 is ground\nX18 is free\nX19 is free\nX20 is free", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 13 [arrowhead = none ];
13 -> 4;

14 [label="ONLY EVAL with clause\nkay4(X17) :- ','(length(.(X18, .(X19, X20)), X17), ','(top(X20), ','(mid([], X20), bot(X20)))).\nand substitutionT1 -> T4,\nX17 -> T4", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 14 [arrowhead = none ];
14 -> 9;

15 [label="UNDEFINED ERROR", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 15 [arrowhead = none ];
15 -> 12;

}

(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) YES