### (0) Obligation:

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

f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), s(y)) → f(x, s(c(s(y))))

Rewrite Strategy: FULL

### (1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
f(x, c(y)) →+ f(x, s(f(y, y)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [1,0].
The pumping substitution is [y / c(y)].
The result substitution is [x / y].

### (3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

### (4) Obligation:

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

f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), s(y)) → f(x, s(c(s(y))))

S is empty.
Rewrite Strategy: FULL

Infered types.

### (6) Obligation:

TRS:
Rules:
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), s(y)) → f(x, s(c(s(y))))

Types:
f :: c:s → c:s → c:s
c :: c:s → c:s
s :: c:s → c:s
hole_c:s1_0 :: c:s
gen_c:s2_0 :: Nat → c:s

### (7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
f

### (8) Obligation:

TRS:
Rules:
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), s(y)) → f(x, s(c(s(y))))

Types:
f :: c:s → c:s → c:s
c :: c:s → c:s
s :: c:s → c:s
hole_c:s1_0 :: c:s
gen_c:s2_0 :: Nat → c:s

Generator Equations:
gen_c:s2_0(0) ⇔ hole_c:s1_0
gen_c:s2_0(+(x, 1)) ⇔ c(gen_c:s2_0(x))

The following defined symbols remain to be analysed:
f

### (9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

### (10) Obligation:

TRS:
Rules:
f(x, c(y)) → f(x, s(f(y, y)))
f(s(x), s(y)) → f(x, s(c(s(y))))

Types:
f :: c:s → c:s → c:s
c :: c:s → c:s
s :: c:s → c:s
hole_c:s1_0 :: c:s
gen_c:s2_0 :: Nat → c:s

Generator Equations:
gen_c:s2_0(0) ⇔ hole_c:s1_0
gen_c:s2_0(+(x, 1)) ⇔ c(gen_c:s2_0(x))

No more defined symbols left to analyse.