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