0.00/0.54
0.00/0.54
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(s(X), Y) → h(s(f(h(Y), X)))
Rewrite Strategy: INNERMOST
0.00/0.54
0.00/0.54
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
0.00/0.54
0.00/0.54
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(s(z0), z1) → h(s(f(h(z1), z0)))
Tuples:
F(s(z0), z1) → c(F(h(z1), z0))
S tuples:
F(s(z0), z1) → c(F(h(z1), z0))
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
0.00/0.54
0.00/0.54
(3) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing tuple parts
0.00/0.54
0.00/0.54
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(s(z0), z1) → h(s(f(h(z1), z0)))
Tuples:
F(s(z0), z1) → c
S tuples:
F(s(z0), z1) → c
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:
F
Compound Symbols:
c
0.00/0.54
0.00/0.54
(5) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)
Removed 1 trailing nodes:
F(s(z0), z1) → c
0.00/0.54
0.00/0.54
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
f(s(z0), z1) → h(s(f(h(z1), z0)))
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f
Defined Pair Symbols:none
Compound Symbols:none
0.00/0.54
0.00/0.54
(7) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
0.00/0.54
0.00/0.54
(8) BOUNDS(O(1), O(1))
0.00/0.54