0.00/0.55
0.00/0.55
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(f(a)) → f(g(n__f(a)))
0.00/0.55
f(X) → n__f(X)
0.00/0.55
activate(n__f(X)) → f(X)
0.00/0.55
activate(X) → X
Rewrite Strategy: INNERMOST
0.00/0.55
0.00/0.55
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
0.00/0.55
0.00/0.55
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a)) → f(g(n__f(a)))
0.00/0.55
f(z0) → n__f(z0)
0.00/0.55
activate(n__f(z0)) → f(z0)
0.00/0.55
activate(z0) → z0
Tuples:
F(f(a)) → c(F(g(n__f(a))))
0.00/0.55
ACTIVATE(n__f(z0)) → c2(F(z0))
S tuples:
F(f(a)) → c(F(g(n__f(a))))
0.00/0.55
ACTIVATE(n__f(z0)) → c2(F(z0))
K tuples:none
Defined Rule Symbols:
f, activate
Defined Pair Symbols:
F, ACTIVATE
Compound Symbols:
c, c2
0.00/0.55
0.00/0.55
(3) CdtUnreachableProof (EQUIVALENT transformation)
The following tuples could be removed as they are not reachable from basic start terms:
F(f(a)) → c(F(g(n__f(a))))
0.00/0.55
0.00/0.55
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a)) → f(g(n__f(a)))
0.00/0.55
f(z0) → n__f(z0)
0.00/0.55
activate(n__f(z0)) → f(z0)
0.00/0.55
activate(z0) → z0
Tuples:
ACTIVATE(n__f(z0)) → c2(F(z0))
S tuples:
ACTIVATE(n__f(z0)) → c2(F(z0))
K tuples:none
Defined Rule Symbols:
f, activate
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c2
0.00/0.55
0.00/0.55
(5) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing tuple parts
0.00/0.55
0.00/0.55
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a)) → f(g(n__f(a)))
0.00/0.55
f(z0) → n__f(z0)
0.00/0.55
activate(n__f(z0)) → f(z0)
0.00/0.55
activate(z0) → z0
Tuples:
ACTIVATE(n__f(z0)) → c2
S tuples:
ACTIVATE(n__f(z0)) → c2
K tuples:none
Defined Rule Symbols:
f, activate
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c2
0.00/0.55
0.00/0.55
(7) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing nodes:
ACTIVATE(n__f(z0)) → c2
0.00/0.55
0.00/0.55
(8) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(f(a)) → f(g(n__f(a)))
0.00/0.55
f(z0) → n__f(z0)
0.00/0.55
activate(n__f(z0)) → f(z0)
0.00/0.55
activate(z0) → z0
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f, activate
Defined Pair Symbols:none
Compound Symbols:none
0.00/0.55
0.00/0.55
(9) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
0.00/0.55
0.00/0.55
(10) BOUNDS(O(1), O(1))
0.00/0.55