The TRS R consists of the following rules:

f(X) → f(c)

c → b

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

Runtime Complexity TRS:

The TRS R consists of the following rules:

f'(X) → f'(c')

c' → b'

Rewrite Strategy: INNERMOST

Infered types.

Rules:

f'(X) → f'(c')

c' → b'

Types:

f' :: b' → f'

c' :: b'

b' :: b'

_hole_f'1 :: f'

_hole_b'2 :: b'

Heuristically decided to analyse the following defined symbols:

f'

Rules:

f'(X) → f'(c')

c' → b'

Types:

f' :: b' → f'

c' :: b'

b' :: b'

_hole_f'1 :: f'

_hole_b'2 :: b'

Generator Equations:

The following defined symbols remain to be analysed:

f'

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

Rules:

f'(X) → f'(c')

c' → b'

Types:

f' :: b' → f'

c' :: b'

b' :: b'

_hole_f'1 :: f'

_hole_b'2 :: b'

Generator Equations:

No more defined symbols left to analyse.