(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(0, y) → 0
f(s(x), y) → f(f(x, y), y)
Rewrite Strategy: INNERMOST
(1) CpxTrsToCpxRelTrsProof (BOTH BOUNDS(ID, ID) transformation)
Transformed TRS to relative TRS where S is empty.
(2) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
f(0, y) → 0
f(s(x), y) → f(f(x, y), y)
S is empty.
Rewrite Strategy: INNERMOST
(3) SlicingProof (LOWER BOUND(ID) transformation)
Sliced the following arguments:
f/1
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
f(0) → 0
f(s(x)) → f(f(x))
S is empty.
Rewrite Strategy: INNERMOST
(5) DecreasingLoopProof (EQUIVALENT transformation)
The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
f(s(x)) →+ f(f(x))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [x / s(x)].
The result substitution is [ ].
(6) BOUNDS(n^1, INF)