YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(x0) x0
a(a(x0)) a(b(a(c(a(x0)))))
c(b(x0)) a(c(x0))

Proof

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(a(x0)) c#(a(x0))
a#(a(x0)) a#(c(a(x0)))
a#(a(x0)) a#(b(a(c(a(x0)))))
c#(b(x0)) c#(x0)
c#(b(x0)) a#(c(x0))

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.