The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

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

a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

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

a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Types:
a :: b → b
f :: b → b → b
b :: b → b
hole_b1_0 :: b
gen_b2_0 :: Nat → b

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
a, f

They will be analysed ascendingly in the following order:
a = f

(6) Obligation:

Innermost TRS:
Rules:
a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Types:
a :: b → b
f :: b → b → b
b :: b → b
hole_b1_0 :: b
gen_b2_0 :: Nat → b

Generator Equations:
gen_b2_0(0) ⇔ hole_b1_0
gen_b2_0(+(x, 1)) ⇔ b(gen_b2_0(x))

The following defined symbols remain to be analysed:
f, a

They will be analysed ascendingly in the following order:
a = f

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Induction Base:
f(gen_b2_0(+(1, 0)), gen_b2_0(+(1, 0)))

Induction Step:
f(gen_b2_0(+(1, +(n4_0, 1))), gen_b2_0(+(1, +(n4_0, 1)))) →_R^Ω(1)
b(f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0)))) →_IH
b(*3_0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Types:
a :: b → b
f :: b → b → b
b :: b → b
hole_b1_0 :: b
gen_b2_0 :: Nat → b

Lemmas:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_b2_0(0) ⇔ hole_b1_0
gen_b2_0(+(x, 1)) ⇔ b(gen_b2_0(x))

The following defined symbols remain to be analysed:
a

They will be analysed ascendingly in the following order:
a = f

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

(11) Obligation:

Innermost TRS:
Rules:
a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Types:
a :: b → b
f :: b → b → b
b :: b → b
hole_b1_0 :: b
gen_b2_0 :: Nat → b

Lemmas:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_b2_0(0) ⇔ hole_b1_0
gen_b2_0(+(x, 1)) ⇔ b(gen_b2_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
a(a(f(x, y))) → f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) → a(f(x, y))
f(b(x), b(y)) → b(f(x, y))

Types:
a :: b → b
f :: b → b → b
b :: b → b
hole_b1_0 :: b
gen_b2_0 :: Nat → b

Lemmas:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_b2_0(0) ⇔ hole_b1_0
gen_b2_0(+(x, 1)) ⇔ b(gen_b2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
f(gen_b2_0(+(1, n4_0)), gen_b2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

(16) BOUNDS(n^1, INF)