Runtime Complexity TRS:
The TRS R consists of the following rules:

f(g(x), y, y) → g(f(x, x, y))

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

Runtime Complexity TRS:
The TRS R consists of the following rules:

f'(g'(x), y, y) → g'(f'(x, x, y))

Rewrite Strategy: INNERMOST

Infered types.

Rules:
f'(g'(x), y, y) → g'(f'(x, x, y))

Types:
f' :: g' → g' → g' → g'
g' :: g' → g'
_hole_g'1 :: g'
_gen_g'2 :: Nat → g'

Heuristically decided to analyse the following defined symbols:
f'

Rules:
f'(g'(x), y, y) → g'(f'(x, x, y))

Types:
f' :: g' → g' → g' → g'
g' :: g' → g'
_hole_g'1 :: g'
_gen_g'2 :: Nat → g'

Generator Equations:
_gen_g'2(0) ⇔ _hole_g'1
_gen_g'2(+(x, 1)) ⇔ g'(_gen_g'2(x))

The following defined symbols remain to be analysed:
f'

Could not prove a rewrite lemma for the defined symbol f'.

Rules:
f'(g'(x), y, y) → g'(f'(x, x, y))

Types:
f' :: g' → g' → g' → g'
g' :: g' → g'
_hole_g'1 :: g'
_gen_g'2 :: Nat → g'

Generator Equations:
_gen_g'2(0) ⇔ _hole_g'1
_gen_g'2(+(x, 1)) ⇔ g'(_gen_g'2(x))

No more defined symbols left to analyse.