f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
↳ QTRS
↳ DependencyPairsProof
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
F(X, c(X)) → F(s(X), X)
F(s(X), X) → F(X, a(X))
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(X, c(X)) → F(s(X), X)
F(s(X), X) → F(X, a(X))
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
F(s(X), X) → F(X, a(X))
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(s(X), X) → F(X, a(X))
The value of delta used in the strict ordering is 13.
POL(a(x1)) = 3 + (2)x_1
POL(s(x1)) = 4 + (3)x_1
POL(F(x1, x2)) = (4)x_1 + x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(X, c(X)) → F(s(X), X)
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(X, c(X)) → F(s(X), X)
The value of delta used in the strict ordering is 13.
POL(c(x1)) = 4 + (3)x_1
POL(s(x1)) = 3 + (2)x_1
POL(F(x1, x2)) = x_1 + (4)x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)