Term Rewriting System R:
[x]
p(s(x)) -> x
fac(0) -> s(0)
fac(s(x)) -> times(s(x), fac(p(s(x))))
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
FAC(s(x)) -> FAC(p(s(x)))
FAC(s(x)) -> P(s(x))
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
FAC(s(x)) -> FAC(p(s(x)))
Rules:
p(s(x)) -> x
fac(0) -> s(0)
fac(s(x)) -> times(s(x), fac(p(s(x))))
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes