a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
B(a(b(x1))) → A(x1)
A(a(x1)) → A(b(a(x1)))
B(a(b(x1))) → A(c(a(x1)))
A(a(x1)) → B(a(x1))
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
B(a(b(x1))) → A(x1)
A(a(x1)) → A(b(a(x1)))
B(a(b(x1))) → A(c(a(x1)))
A(a(x1)) → B(a(x1))
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
B(a(b(x1))) → A(x1)
A(a(x1)) → A(b(a(x1)))
A(a(x1)) → B(a(x1))
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
B(a(b(x1))) → A(x1)
A(a(x1)) → B(a(x1))
Used ordering: Polynomial interpretation [25,35]:
A(a(x1)) → A(b(a(x1)))
The value of delta used in the strict ordering is 1.
POL(c(x1)) = 0
POL(B(x1)) = 1 + (2)x_1
POL(a(x1)) = 2 + (4)x_1
POL(A(x1)) = 4 + (4)x_1
POL(b(x1)) = x_1
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(a(x1)) → A(b(a(x1)))
a(a(x1)) → a(b(a(x1)))
b(a(b(x1))) → a(c(a(x1)))