(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a__f(f(a)) → c(f(g(f(a))))
mark(f(X)) → a__f(mark(X))
mark(a) → a
mark(c(X)) → c(X)
mark(g(X)) → g(mark(X))
a__f(X) → f(X)
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:
a__f(f(a)) → c(f(g(f(a))))
mark(f(X)) → a__f(mark(X))
mark(a) → a
mark(c(X)) → c(X)
mark(g(X)) → g(mark(X))
a__f(X) → f(X)
S is empty.
Rewrite Strategy: INNERMOST
(3) SlicingProof (LOWER BOUND(ID) transformation)
Sliced the following arguments:
c/0
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
a__f(f(a)) → c
mark(f(X)) → a__f(mark(X))
mark(a) → a
mark(c) → c
mark(g(X)) → g(mark(X))
a__f(X) → 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
mark(f(X)) →+ a__f(mark(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / f(X)].
The result substitution is [ ].
(6) BOUNDS(n^1, INF)