(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(h(x), y) → h(f(y, f(x, h(f(a, a)))))
Rewrite Strategy: FULL
(1) InfiniteLowerBoundProof (EQUIVALENT transformation)
The loop following loop proves infinite runtime complexity:
The rewrite sequence
f(h(h(x9_0)), h(h(x539_0))) →+ h(h(f(h(h(f(f(x9_0, h(f(a, a))), f(f(a, a), h(f(a, a)))))), h(h(f(f(x539_0, h(f(a, a))), f(f(a, a), h(f(a, a)))))))))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0].
The pumping substitution is [ ].
The result substitution is [x9_0 / f(f(x9_0, h(f(a, a))), f(f(a, a), h(f(a, a)))), x539_0 / f(f(x539_0, h(f(a, a))), f(f(a, a), h(f(a, a))))].
(2) BOUNDS(INF, INF)