0.00/0.55
0.00/0.55
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a(b(x)) → a(c(b(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:
a(b(z0)) → a(c(b(z0)))
Tuples:
A(b(z0)) → c1(A(c(b(z0))))
S tuples:
A(b(z0)) → c1(A(c(b(z0))))
K tuples:none
Defined Rule Symbols:
a
Defined Pair Symbols:
A
Compound Symbols:
c1
0.00/0.55
0.00/0.55
(3) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing tuple parts
0.00/0.55
0.00/0.55
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(b(z0)) → a(c(b(z0)))
Tuples:
A(b(z0)) → c1
S tuples:
A(b(z0)) → c1
K tuples:none
Defined Rule Symbols:
a
Defined Pair Symbols:
A
Compound Symbols:
c1
0.00/0.55
0.00/0.55
(5) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing nodes:
A(b(z0)) → c1
0.00/0.55
0.00/0.55
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
a(b(z0)) → a(c(b(z0)))
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
a
Defined Pair Symbols:none
Compound Symbols:none
0.00/0.55
0.00/0.55
(7) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
0.00/0.55
0.00/0.55
(8) BOUNDS(O(1), O(1))
0.00/0.55