Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z046)
The rewrite relation of the following TRS is considered.
|
c(a(a(b(a(x1))))) |
→ |
a(a(b(a(c(c(a(a(b(x1))))))))) |
(1) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Looping derivation
There is a looping derivation.
c a a b a a a →+ a a b a c a a b a a a b a c c a a b c c a a b
The derivation can be derived as follows.
-
c a a b a →+ a a b a c c a a b:
This is an original rule (OC1).
-
c a a b a a →+ a a b a c a a b a c c a a b:
The overlap closure is obtained from the following two overlap closures (OC2).
-
c a a b a →+ a a b a c c a a b
-
c a a b a →+ a a b a c c a a b
-
c a a b a a →+ a a b a a a b a c c a a b c c a a b:
The overlap closure is obtained from the following two overlap closures (OC3).
-
c a a b a a →+ a a b a c a a b a c c a a b
-
c a a b a →+ a a b a c c a a b
-
c a a b a a a →+ a a b a c a a b a a a b a c c a a b c c a a b:
The overlap closure is obtained from the following two overlap closures (OC2).
-
c a a b a →+ a a b a c c a a b
-
c a a b a a →+ a a b a a a b a c c a a b c c a a b