Certification Problem

Input (TPDB TRS_Standard/SK90/2.20)

The rewrite relation of the following TRS is considered.

sum(0) 0 (1)
sum(s(x)) +(sqr(s(x)),sum(x)) (2)
sqr(x) *(x,x) (3)
sum(s(x)) +(*(s(x),s(x)),sum(x)) (4)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Rule Removal

Using the
prec(sum) = 5 stat(sum) = mul
prec(0) = 1 stat(0) = mul
prec(s) = 3 stat(s) = mul
prec(+) = 4 stat(+) = mul
prec(sqr) = 2 stat(sqr) = mul
prec(*) = 0 stat(*) = mul

π(sum) = [1]
π(0) = []
π(s) = [1]
π(+) = [1,2]
π(sqr) = [1]
π(*) = [1,2]

all of the following rules can be deleted.
sum(0) 0 (1)
sum(s(x)) +(sqr(s(x)),sum(x)) (2)
sqr(x) *(x,x) (3)
sum(s(x)) +(*(s(x),s(x)),sum(x)) (4)

1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.