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