Certification Problem

Input (TPDB TRS_Standard/AG01/#3.16)

The rewrite relation of the following TRS is considered.

times(x,0) 0 (1)
times(x,s(y)) plus(times(x,y),x) (2)
plus(x,0) x (3)
plus(0,x) x (4)
plus(x,s(y)) s(plus(x,y)) (5)
plus(s(x),y) s(plus(x,y)) (6)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Rule Removal

Using the
prec(times) = 3 stat(times) = mul
prec(0) = 1 stat(0) = mul
prec(s) = 0 stat(s) = mul
prec(plus) = 2 stat(plus) = lex

π(times) = [1,2]
π(0) = []
π(s) = [1]
π(plus) = [1,2]

all of the following rules can be deleted.
times(x,0) 0 (1)
times(x,s(y)) plus(times(x,y),x) (2)
plus(x,0) x (3)
plus(0,x) x (4)
plus(x,s(y)) s(plus(x,y)) (5)
plus(s(x),y) s(plus(x,y)) (6)

1.1 R is empty

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