a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))
B(a(b(x1))) → A(x1)
A(b(a(x1))) → B(b(x1))
B(a(b(x1))) → A(b(a(x1)))
B(a(b(x1))) → B(a(x1))
A(b(a(x1))) → B(b(b(x1)))
A(b(a(x1))) → B(x1)
a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
B(a(b(x1))) → A(x1)
A(b(a(x1))) → B(b(x1))
B(a(b(x1))) → A(b(a(x1)))
B(a(b(x1))) → B(a(x1))
A(b(a(x1))) → B(b(b(x1)))
A(b(a(x1))) → B(x1)
a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(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(b(a(x1))) → B(b(x1))
B(a(b(x1))) → B(a(x1))
A(b(a(x1))) → B(x1)
Used ordering: Polynomial interpretation [25,35]:
B(a(b(x1))) → A(b(a(x1)))
A(b(a(x1))) → B(b(b(x1)))
The value of delta used in the strict ordering is 2.
POL(B(x1)) = x_1
POL(a(x1)) = 2 + x_1
POL(A(x1)) = x_1
POL(b(x1)) = 2 + x_1
a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
B(a(b(x1))) → A(b(a(x1)))
A(b(a(x1))) → B(b(b(x1)))
a(b(a(x1))) → b(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))