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

(0) Obligation:

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


The TRS R consists of the following rules:

a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)

Rewrite Strategy: FULL

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

Converted rc-obligation to irc-obligation.

As the TRS is a non-duplicating overlay system, we have rc = irc.

(2) Obligation:

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


The TRS R consists of the following rules:

a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)

Rewrite Strategy: INNERMOST

(3) CpxTrsMatchBoundsProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2.
The certificate found is represented by the following graph.

Start state: 3
Accept states: [4]
Transitions:
3→4[a__f_1|0, mark_1|0, f_1|1, g_1|1]
3→5[g_1|1]
3→7[a__f_1|1, f_1|2]
3→8[h_1|1]
3→9[g_1|2]
4→4[g_1|0, h_1|0, f_1|0]
5→6[h_1|1]
6→4[f_1|1]
7→4[mark_1|1, g_1|1]
7→7[a__f_1|1, f_1|2]
7→8[h_1|1]
7→9[g_1|2]
8→4[mark_1|1, g_1|1]
8→7[a__f_1|1, f_1|2]
8→8[h_1|1]
8→9[g_1|2]
9→10[h_1|2]
10→7[f_1|2]

(4) BOUNDS(1, n^1)