Certification Problem

Input (TPDB TRS_Standard/SK90/4.17)

The rewrite relation of the following TRS is considered.

fac(s(x)) *(fac(p(s(x))),s(x)) (1)
p(s(0)) 0 (2)
p(s(s(x))) s(p(s(x))) (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Switch to Innermost Termination

The TRS is overlay and locally confluent:

10

Hence, it suffices to show innermost termination in the following.

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
fac#(s(x)) fac#(p(s(x))) (4)
fac#(s(x)) p#(s(x)) (5)
p#(s(s(x))) p#(s(x)) (6)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.