(0) Obligation:

Clauses:

goal(X) :- ','(s2l(X, Xs), conf(Xs)).
conf(X) :- ','(del2(X, Z), ','(del(U, Y, Z), conf(Y))).
del2(X, Y) :- ','(del(U, X, Z), del(V, Z, Y)).
del(X1, [], X2) :- ','(!, failure(a)).
del(H, X, T) :- ','(head(X, H), tail(X, T)).
del(X, Y, .(H, T2)) :- ','(head(Y, H), ','(tail(Y, T1), del(X, T1, T2))).
s2l(0, L) :- ','(!, eq(L, [])).
s2l(X, .(X3, Xs)) :- ','(p(X, P), s2l(P, Xs)).
head([], X4).
head(.(H, X5), H).
tail([], []).
tail(.(X6, Xs), Xs).
p(0, 0).
p(s(X), X).
failure(b).
eq(X, X).

Query: goal(g)

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

Transformed Prolog program to (Pi-)TRS.

(2) Obligation:

Pi-finite rewrite system:
R is empty.
Pi is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

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

(4) YES