(0) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, 1).
The TRS R consists of the following rules:
f(f(x)) → f(c(f(x)))
f(f(x)) → f(d(f(x)))
g(c(x)) → x
g(d(x)) → x
g(c(0)) → g(d(1))
g(c(1)) → g(d(0))
Rewrite Strategy: INNERMOST
(1) DependencyGraphProof (BOTH BOUNDS(ID, ID) transformation)
The following rules are not reachable from basic terms in the dependency graph and can be removed:
f(f(x)) → f(c(f(x)))
f(f(x)) → f(d(f(x)))
(2) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, 1).
The TRS R consists of the following rules:
g(c(0)) → g(d(1))
g(d(x)) → x
g(c(x)) → x
g(c(1)) → g(d(0))
Rewrite Strategy: INNERMOST
(3) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted Cpx (relative) TRS to CDT
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
g(c(0)) → g(d(1))
g(d(z0)) → z0
g(c(z0)) → z0
g(c(1)) → g(d(0))
Tuples:
G(c(0)) → c1(G(d(1)))
G(d(z0)) → c2
G(c(z0)) → c3
G(c(1)) → c4(G(d(0)))
S tuples:
G(c(0)) → c1(G(d(1)))
G(d(z0)) → c2
G(c(z0)) → c3
G(c(1)) → c4(G(d(0)))
K tuples:none
Defined Rule Symbols:
g
Defined Pair Symbols:
G
Compound Symbols:
c1, c2, c3, c4
(5) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)
Removed 4 trailing nodes:
G(d(z0)) → c2
G(c(0)) → c1(G(d(1)))
G(c(1)) → c4(G(d(0)))
G(c(z0)) → c3
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
g(c(0)) → g(d(1))
g(d(z0)) → z0
g(c(z0)) → z0
g(c(1)) → g(d(0))
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
g
Defined Pair Symbols:none
Compound Symbols:none
(7) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
(8) BOUNDS(1, 1)