WORST_CASE(?,O(n^1))
proof of input_FJqJsfy4Ju.trs
# AProVE Commit ID: aff8ecad908e01718a4c36e68d2e55d5e0f16e15 fuhs 20220216 unpublished


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

(0) CpxTRS
(1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(2) CpxTRS
(3) CpxTrsMatchBoundsProof [FINISHED, 0 ms]
(4) BOUNDS(1, n^1)


----------------------------------------

(0)
Obligation:
The Runtime Complexity (parallel-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)

S is empty.
Rewrite Strategy: PARALLEL_INNERMOST
----------------------------------------

(1) RelTrsToTrsProof (UPPER BOUND(ID))
transformed relative TRS to TRS
----------------------------------------

(2)
Obligation:
The Runtime Complexity (parallel-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)

S is empty.
Rewrite Strategy: PARALLEL_INNERMOST
----------------------------------------

(3) CpxTrsMatchBoundsProof (FINISHED)
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.

"[6, 7, 8, 9, 10, 11, 12, 13]
{(6,7,[a__f_1|0, mark_1|0, f_1|1, g_1|1]), (6,8,[g_1|1]), (6,10,[a__f_1|1, f_1|2]), (6,11,[h_1|1]), (6,12,[g_1|2]), (7,7,[g_1|0, h_1|0, f_1|0]), (8,9,[h_1|1]), (9,7,[f_1|1]), (10,7,[mark_1|1, g_1|1]), (10,10,[a__f_1|1, f_1|2]), (10,11,[h_1|1]), (10,12,[g_1|2]), (11,7,[mark_1|1, g_1|1]), (11,10,[a__f_1|1, f_1|2]), (11,11,[h_1|1]), (11,12,[g_1|2]), (12,13,[h_1|2]), (13,10,[f_1|2])}"
----------------------------------------

(4)
BOUNDS(1, n^1)