R
↳Dependency Pair Analysis
A(a(x)) -> B(b(x))
A(a(x)) -> B(x)
B(b(a(x))) -> A(b(b(x)))
B(b(a(x))) -> B(b(x))
B(b(a(x))) -> B(x)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
B(b(a(x))) -> B(x)
B(b(a(x))) -> B(b(x))
A(a(x)) -> B(x)
B(b(a(x))) -> A(b(b(x)))
A(a(x)) -> B(b(x))
a(a(x)) -> b(b(x))
b(b(a(x))) -> a(b(b(x)))
B(b(a(x))) -> B(x)
B(b(a(x))) -> B(b(x))
A(a(x)) -> B(x)
b(b(a(x))) -> a(b(b(x)))
a(a(x)) -> b(b(x))
{A, B}
{a, b}
B(x1) -> B(x1)
A(x1) -> A(x1)
b(x1) -> b(x1)
a(x1) -> a(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Argument Filtering and Ordering
B(b(a(x))) -> A(b(b(x)))
A(a(x)) -> B(b(x))
a(a(x)) -> b(b(x))
b(b(a(x))) -> a(b(b(x)))
B(b(a(x))) -> A(b(b(x)))
A(a(x)) -> B(b(x))
b(b(a(x))) -> a(b(b(x)))
a(a(x)) -> b(b(x))
{A, B}
B(x1) -> B(x1)
A(x1) -> A(x1)
b(x1) -> x1
a(x1) -> a(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳AFS
...
→DP Problem 3
↳Dependency Graph
a(a(x)) -> b(b(x))
b(b(a(x))) -> a(b(b(x)))