p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
↳ QTRS
↳ DependencyPairsProof
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(a(x0), p(a(a(a(x1))), x2)) → P(a(a(b(x0))), x2)
Used ordering: Polynomial interpretation [25,35]:
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
The value of delta used in the strict ordering is 8.
POL(P(x1, x2)) = (3)x_1 + (4)x_2
POL(a(x1)) = 3
POL(p(x1, x2)) = 2 + (2)x_2
POL(b(x1)) = 3 + (3)x_1
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
P(a(x0), p(a(a(a(x1))), x2)) → P(a(x2), p(a(a(b(x0))), x2))
p(a(x0), p(a(a(a(x1))), x2)) → p(a(x2), p(a(a(b(x0))), x2))