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

(0) Obligation:

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

g(s(x)) → f(x)
f(0) → s(0)
f(s(x)) → s(s(g(x)))
g(0) → 0

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

g(s(z0)) → f(z0)
g(0) → 0
f(0) → s(0)
f(s(z0)) → s(s(g(z0)))

Tuples:

G(s(z0)) → c(F(z0))
G(0) → c1
F(0) → c2
F(s(z0)) → c3(G(z0))

S tuples:

G(s(z0)) → c(F(z0))
G(0) → c1
F(0) → c2
F(s(z0)) → c3(G(z0))

K tuples:none
Defined Rule Symbols:

g, f

Defined Pair Symbols:

G, F

Compound Symbols:

c, c1, c2, c3

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

Removed 2 trailing nodes:

G(0) → c1
F(0) → c2

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

g(s(z0)) → f(z0)
g(0) → 0
f(0) → s(0)
f(s(z0)) → s(s(g(z0)))

Tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

S tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

K tuples:none
Defined Rule Symbols:

g, f

Defined Pair Symbols:

G, F

Compound Symbols:

c, c3

(5) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

g(s(z0)) → f(z0)
g(0) → 0
f(0) → s(0)
f(s(z0)) → s(s(g(z0)))

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

S tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:

G, F

Compound Symbols:

c, c3

(7) CdtRuleRemovalProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

We considered the (Usable) Rules:none
And the Tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(F(x₁)) = [4] + [4]x₁   
POL(G(x₁)) = [2] + [4]x₁   
POL(c(x₁)) = x₁   
POL(c3(x₁)) = x₁   
POL(s(x₁)) = [5] + x₁   

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

S tuples:none
K tuples:

G(s(z0)) → c(F(z0))
F(s(z0)) → c3(G(z0))

Defined Rule Symbols:none

Defined Pair Symbols:

G, F

Compound Symbols:

c, c3

(9) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(10) BOUNDS(O(1), O(1))