Certification Problem

Input (TPDB TRS_Standard/Secret_05_TRS/ttt2)

The rewrite relation of the following TRS is considered.

+(1,x) +(+(0,1),x) (1)
+(0,x) x (2)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t0 = +(1,x)
+(+(0,1),x)
+(1,x)
= t2
where t2 = t0σ and σ = {x/x}