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