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