(0) Obligation:

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

active(f(X, X)) → mark(f(a, b))
active(b) → mark(a)
mark(f(X1, X2)) → active(f(mark(X1), X2))
mark(a) → active(a)
mark(b) → active(b)
f(mark(X1), X2) → f(X1, X2)
f(X1, mark(X2)) → f(X1, X2)
f(active(X1), X2) → f(X1, X2)
f(X1, active(X2)) → f(X1, X2)

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

active(f(z0, z0)) → mark(f(a, b))
active(b) → mark(a)
mark(f(z0, z1)) → active(f(mark(z0), z1))
mark(a) → active(a)
mark(b) → active(b)
f(mark(z0), z1) → f(z0, z1)
f(z0, mark(z1)) → f(z0, z1)
f(active(z0), z1) → f(z0, z1)
f(z0, active(z1)) → f(z0, z1)
Tuples:

ACTIVE(f(z0, z0)) → c(MARK(f(a, b)), F(a, b))
ACTIVE(b) → c1(MARK(a))
MARK(f(z0, z1)) → c2(ACTIVE(f(mark(z0), z1)), F(mark(z0), z1), MARK(z0))
MARK(a) → c3(ACTIVE(a))
MARK(b) → c4(ACTIVE(b))
F(mark(z0), z1) → c5(F(z0, z1))
F(z0, mark(z1)) → c6(F(z0, z1))
F(active(z0), z1) → c7(F(z0, z1))
F(z0, active(z1)) → c8(F(z0, z1))
S tuples:

ACTIVE(f(z0, z0)) → c(MARK(f(a, b)), F(a, b))
ACTIVE(b) → c1(MARK(a))
MARK(f(z0, z1)) → c2(ACTIVE(f(mark(z0), z1)), F(mark(z0), z1), MARK(z0))
MARK(a) → c3(ACTIVE(a))
MARK(b) → c4(ACTIVE(b))
F(mark(z0), z1) → c5(F(z0, z1))
F(z0, mark(z1)) → c6(F(z0, z1))
F(active(z0), z1) → c7(F(z0, z1))
F(z0, active(z1)) → c8(F(z0, z1))
K tuples:none
Defined Rule Symbols:

active, mark, f

Defined Pair Symbols:

ACTIVE, MARK, F

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

ACTIVE(f(z0, z0)) → c(MARK(f(a, b)), F(a, b))
MARK(f(z0, z1)) → c2(ACTIVE(f(mark(z0), z1)), F(mark(z0), z1), MARK(z0))
F(mark(z0), z1) → c5(F(z0, z1))
F(z0, mark(z1)) → c6(F(z0, z1))
F(active(z0), z1) → c7(F(z0, z1))
F(z0, active(z1)) → c8(F(z0, z1))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

active(f(z0, z0)) → mark(f(a, b))
active(b) → mark(a)
mark(f(z0, z1)) → active(f(mark(z0), z1))
mark(a) → active(a)
mark(b) → active(b)
f(mark(z0), z1) → f(z0, z1)
f(z0, mark(z1)) → f(z0, z1)
f(active(z0), z1) → f(z0, z1)
f(z0, active(z1)) → f(z0, z1)
Tuples:

ACTIVE(b) → c1(MARK(a))
MARK(a) → c3(ACTIVE(a))
MARK(b) → c4(ACTIVE(b))
S tuples:

ACTIVE(b) → c1(MARK(a))
MARK(a) → c3(ACTIVE(a))
MARK(b) → c4(ACTIVE(b))
K tuples:none
Defined Rule Symbols:

active, mark, f

Defined Pair Symbols:

ACTIVE, MARK

Compound Symbols:

c1, c3, c4

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

Removed 3 trailing nodes:

MARK(a) → c3(ACTIVE(a))
ACTIVE(b) → c1(MARK(a))
MARK(b) → c4(ACTIVE(b))

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

active(f(z0, z0)) → mark(f(a, b))
active(b) → mark(a)
mark(f(z0, z1)) → active(f(mark(z0), z1))
mark(a) → active(a)
mark(b) → active(b)
f(mark(z0), z1) → f(z0, z1)
f(z0, mark(z1)) → f(z0, z1)
f(active(z0), z1) → f(z0, z1)
f(z0, active(z1)) → f(z0, z1)
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

active, mark, f

Defined Pair Symbols:none

Compound Symbols:none

(7) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(8) BOUNDS(O(1), O(1))