(0) Obligation:
Clauses:
even(0) :- !.
even(N) :- ','(p(N, P), odd(P)).
odd(s(0)) :- !.
odd(s(N)) :- even(P).
p(0, 0).
p(s(X), X).
Query: even(g)
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph DT10.
(2) Obligation:
Triples:
Clauses:
Afs:
(3) TPisEmptyProof (EQUIVALENT transformation)
There are no more dependency triples. Hence, the dependency triple problem trivially terminates.
(4) YES