(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(f(a, x), a) → f(f(x, f(a, f(a, a))), a)
Rewrite Strategy: INNERMOST
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a, z0), a) → f(f(z0, f(a, f(a, a))), a)
Tuples:
F(f(a, z0), a) → c(F(f(z0, f(a, f(a, a))), a), F(z0, f(a, f(a, a))), F(a, f(a, a)), F(a, a))
S tuples:
F(f(a, z0), a) → c(F(f(z0, f(a, f(a, a))), a), F(z0, f(a, f(a, a))), F(a, f(a, a)), F(a, a))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
(3) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)
Use narrowing to replace
F(
f(
a,
z0),
a) →
c(
F(
f(
z0,
f(
a,
f(
a,
a))),
a),
F(
z0,
f(
a,
f(
a,
a))),
F(
a,
f(
a,
a)),
F(
a,
a)) by
F(f(a, x0), a) → c(F(f(x0, f(a, f(a, a))), a))
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a, z0), a) → f(f(z0, f(a, f(a, a))), a)
Tuples:
F(f(a, x0), a) → c(F(f(x0, f(a, f(a, a))), a))
S tuples:
F(f(a, x0), a) → c(F(f(x0, f(a, f(a, a))), a))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
(5) CdtInstantiationProof (BOTH BOUNDS(ID, ID) transformation)
Use instantiation to replace
F(
f(
a,
x0),
a) →
c(
F(
f(
x0,
f(
a,
f(
a,
a))),
a)) by
F(f(a, f(a, f(a, a))), a) → c(F(f(f(a, f(a, a)), f(a, f(a, a))), a))
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a, z0), a) → f(f(z0, f(a, f(a, a))), a)
Tuples:
F(f(a, f(a, f(a, a))), a) → c(F(f(f(a, f(a, a)), f(a, f(a, a))), a))
S tuples:
F(f(a, f(a, f(a, a))), a) → c(F(f(f(a, f(a, a)), f(a, f(a, a))), a))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
(7) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing nodes:
F(f(a, f(a, f(a, a))), a) → c(F(f(f(a, f(a, a)), f(a, f(a, a))), a))
(8) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a, z0), a) → f(f(z0, f(a, f(a, a))), a)
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:none
Compound Symbols:none
(9) SIsEmptyProof (EQUIVALENT transformation)
The set S is empty
(10) BOUNDS(O(1), O(1))