(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(a(x1)) = x1
POL(c(x1)) = 1 + 2·x1
POL(f(x1, x2)) = 2 + 2·x1 + x2
POL(s(x1)) = x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(X, c(X)) → f(s(X), X)
f(X, X) → c(X)
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(s(X), X) → f(X, a(X))
Q is empty.
(3) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(a(x1)) = x1
POL(f(x1, x2)) = x1 + x2
POL(s(x1)) = 1 + x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(s(X), X) → f(X, a(X))
(4) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(5) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(6) TRUE
(7) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(8) TRUE