The Runtime Complexity (full) of the given
could be proven to be
1 InfiniteLowerBoundProof (⇔, 0 ms)
2 BOUNDS(INF, INF)
Runtime Complexity TRS:
The TRS R consists of the following rules:
Rewrite Strategy: FULL
(1) InfiniteLowerBoundProof (EQUIVALENT transformation)
The loop following loop proves infinite runtime complexity:
The rewrite sequence
gives rise to a decreasing loop by considering the right hand sides subterm at position .
The pumping substitution is [ ].
The result substitution is [ ].