R
↳Dependency Pair Analysis
MARK(f(X)) -> AF(mark(X))
MARK(f(X)) -> MARK(X)
MARK(h(X)) -> MARK(X)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
MARK(h(X)) -> MARK(X)
MARK(f(X)) -> MARK(X)
af(X) -> g(h(f(X)))
af(X) -> f(X)
mark(f(X)) -> af(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
MARK(f(X)) -> MARK(X)
af(X) -> g(h(f(X)))
af(X) -> f(X)
mark(f(X)) -> af(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
POL(MARK(x1)) = 1 + x1 POL(g(x1)) = x1 POL(h(x1)) = x1 POL(mark(x1)) = x1 POL(f(x1)) = 1 + x1 POL(a__f(x1)) = 1 + x1
MARK(x1) -> MARK(x1)
f(x1) -> f(x1)
h(x1) -> h(x1)
af(x1) -> af(x1)
g(x1) -> g(x1)
mark(x1) -> mark(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Argument Filtering and Ordering
MARK(h(X)) -> MARK(X)
af(X) -> g(h(f(X)))
af(X) -> f(X)
mark(f(X)) -> af(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
MARK(h(X)) -> MARK(X)
af(X) -> g(h(f(X)))
af(X) -> f(X)
mark(f(X)) -> af(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
POL(MARK(x1)) = x1 POL(g) = 0 POL(h(x1)) = 1 + x1 POL(mark(x1)) = x1 POL(f(x1)) = x1 POL(a__f(x1)) = x1
MARK(x1) -> MARK(x1)
h(x1) -> h(x1)
af(x1) -> af(x1)
g(x1) -> g
f(x1) -> f(x1)
mark(x1) -> mark(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳AFS
...
→DP Problem 3
↳Dependency Graph
af(X) -> g(h(f(X)))
af(X) -> f(X)
mark(f(X)) -> af(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))