0.00/0.79
0.00/0.79
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(x) → f(a)
Rewrite Strategy: INNERMOST
0.00/0.79
0.00/0.79
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
0.00/0.79
0.00/0.79
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(z0) → f(a)
Tuples:
F(z0) → c(F(a))
S tuples:
F(z0) → c(F(a))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
0.00/0.79
0.00/0.79
(3) CdtInstantiationProof (BOTH BOUNDS(ID, ID) transformation)
Use instantiation to replace
F(
z0) →
c(
F(
a)) by
F(a) → c(F(a))
0.00/0.79
0.00/0.79
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(z0) → f(a)
Tuples:
F(a) → c(F(a))
S tuples:
F(a) → c(F(a))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
0.00/0.79