Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/PALINDROME_nokinds-noand_L)

The rewrite relation of the following TRS is considered.

__(__(X,Y),Z) __(X,__(Y,Z)) (1)
__(X,nil) X (2)
__(nil,X) X (3)
U11(tt) tt (4)
U21(tt) U22(isList) (5)
U22(tt) tt (6)
U31(tt) tt (7)
U41(tt) U42(isNeList) (8)
U42(tt) tt (9)
U51(tt) U52(isList) (10)
U52(tt) tt (11)
U61(tt) tt (12)
U71(tt) U72(isPal) (13)
U72(tt) tt (14)
U81(tt) tt (15)
isList U11(isNeList) (16)
isList tt (17)
isList U21(isList) (18)
isNeList U31(isQid) (19)
isNeList U41(isList) (20)
isNeList U51(isNeList) (21)
isNePal U61(isQid) (22)
isNePal U71(isQid) (23)
isPal U81(isNePal) (24)
isPal tt (25)
isQid tt (26)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t0 = isList
U21(isList)
= t1
where t1 = C[t0] and C = U21()