Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → B(a(a(x1)))
A(a(b(x1))) → B(a(b(a(a(x1)))))
A(a(b(x1))) → A(b(a(a(x1))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → B(a(a(x1)))
A(a(b(x1))) → B(a(b(a(a(x1)))))
A(a(b(x1))) → A(b(a(a(x1))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → A(b(a(a(x1))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(a(b(x1))) → A(b(a(a(x1)))) at position [0] we obtained the following new rules:
A(a(b(a(b(x0))))) → A(b(a(b(a(b(a(a(x0))))))))
A(a(b(a(x0)))) → A(b(a(x0)))
A(a(b(b(x0)))) → A(b(b(a(b(a(a(x0)))))))
A(a(b(x0))) → A(b(x0))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(a(b(x0))))) → A(b(a(b(a(b(a(a(x0))))))))
A(a(b(x0))) → A(b(x0))
A(a(b(b(x0)))) → A(b(b(a(b(a(a(x0)))))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(a(x0)))) → A(b(a(x0)))
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(a(b(x0))) → A(b(x0)) at position [0] we obtained the following new rules:
A(a(b(b(x0)))) → A(x0)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(a(b(x0))))) → A(b(a(b(a(b(a(a(x0))))))))
A(a(b(b(x0)))) → A(b(b(a(b(a(a(x0)))))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(x0)
A(a(b(a(x0)))) → A(b(a(x0)))
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
A(a(b(a(b(x0))))) → A(b(a(b(a(b(a(a(x0))))))))
A(a(b(b(x0)))) → A(b(b(a(b(a(a(x0)))))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(x0)
A(a(b(a(x0)))) → A(b(a(x0)))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
A(a(b(a(b(x0))))) → A(b(a(b(a(b(a(a(x0))))))))
A(a(b(b(x0)))) → A(b(b(a(b(a(a(x0)))))))
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(x0)
A(a(b(a(x0)))) → A(b(a(x0)))
The set Q is empty.
We have obtained the following QTRS:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
B(a(b(a(A(x))))) → A1(b(a(b(a(b(A(x)))))))
B(a(b(a(A(x))))) → B(A(x))
B(a(b(a(A(x))))) → A1(a(b(a(b(a(b(A(x))))))))
A1(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → A1(b(b(A(x))))
B(a(a(x))) → A1(b(a(b(x))))
B(b(a(A(x)))) → A1(b(a(b(b(A(x))))))
B(b(a(A(x)))) → A1(a(b(a(b(b(A(x)))))))
B(a(b(a(A(x))))) → A1(b(A(x)))
B(a(a(x))) → A1(a(b(a(b(x)))))
B(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → B(b(A(x)))
B(a(a(x))) → B(a(b(x)))
B(a(b(a(A(x))))) → A1(b(a(b(A(x)))))
A1(b(a(A(x)))) → A1(b(A(x)))
B(a(a(x))) → A1(b(x))
B(b(a(A(x)))) → B(a(b(b(A(x)))))
B(a(b(a(A(x))))) → B(a(b(a(b(A(x))))))
B(a(b(a(A(x))))) → B(a(b(A(x))))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(b(a(A(x))))) → A1(b(a(b(a(b(A(x)))))))
B(a(b(a(A(x))))) → B(A(x))
B(a(b(a(A(x))))) → A1(a(b(a(b(a(b(A(x))))))))
A1(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → A1(b(b(A(x))))
B(a(a(x))) → A1(b(a(b(x))))
B(b(a(A(x)))) → A1(b(a(b(b(A(x))))))
B(b(a(A(x)))) → A1(a(b(a(b(b(A(x)))))))
B(a(b(a(A(x))))) → A1(b(A(x)))
B(a(a(x))) → A1(a(b(a(b(x)))))
B(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → B(b(A(x)))
B(a(a(x))) → B(a(b(x)))
B(a(b(a(A(x))))) → A1(b(a(b(A(x)))))
A1(b(a(A(x)))) → A1(b(A(x)))
B(a(a(x))) → A1(b(x))
B(b(a(A(x)))) → B(a(b(b(A(x)))))
B(a(b(a(A(x))))) → B(a(b(a(b(A(x))))))
B(a(b(a(A(x))))) → B(a(b(A(x))))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 17 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x))) → B(a(b(x)))
B(b(a(A(x)))) → B(a(b(b(A(x)))))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(b(a(A(x)))) → B(a(b(b(A(x))))) at position [0] we obtained the following new rules:
B(b(a(A(y0)))) → B(a(A(y0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(b(a(A(y0)))) → B(a(A(y0)))
B(a(a(x))) → B(a(b(x)))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x))) → B(a(b(x)))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(a(x))) → B(a(b(x))) at position [0] we obtained the following new rules:
B(a(a(a(A(x0))))) → B(a(a(A(x0))))
B(a(a(b(a(A(x0)))))) → B(a(A(x0)))
B(a(a(a(A(x0))))) → B(a(b(A(x0))))
B(a(a(a(a(x0))))) → B(a(a(a(b(a(b(x0)))))))
B(a(a(b(x0)))) → B(a(x0))
B(a(a(b(a(A(x0)))))) → B(a(a(a(b(a(b(b(A(x0)))))))))
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(b(a(b(a(b(A(x0))))))))))
B(a(a(a(A(x0))))) → B(a(A(x0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(a(A(x0))))) → B(a(a(A(x0))))
B(a(a(b(a(A(x0)))))) → B(a(A(x0)))
B(a(a(b(x0)))) → B(a(x0))
B(a(a(a(a(x0))))) → B(a(a(a(b(a(b(x0)))))))
B(a(a(a(A(x0))))) → B(a(b(A(x0))))
B(a(a(b(a(A(x0)))))) → B(a(a(a(b(a(b(b(A(x0)))))))))
B(a(a(x))) → B(x)
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(b(a(b(a(b(A(x0))))))))))
B(a(a(a(A(x0))))) → B(a(A(x0)))
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(a(A(x0))))) → B(a(a(A(x0))))
B(a(a(b(x0)))) → B(a(x0))
B(a(a(a(a(x0))))) → B(a(a(a(b(a(b(x0)))))))
B(a(a(b(a(A(x0)))))) → B(a(a(a(b(a(b(b(A(x0)))))))))
B(a(a(x))) → B(x)
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(b(a(b(a(b(A(x0))))))))))
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
The set Q is empty.
We have obtained the following QTRS:
a(a(x)) → x
a(a(b(x))) → b(a(b(a(a(x)))))
b(b(x)) → x
A(a(b(a(b(x))))) → A(b(a(b(a(b(a(a(x))))))))
A(a(b(b(x)))) → A(b(b(a(b(a(a(x)))))))
A(a(b(x))) → A(x)
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(x)
A(a(b(a(x)))) → A(b(a(x)))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → x
a(a(b(x))) → b(a(b(a(a(x)))))
b(b(x)) → x
A(a(b(a(b(x))))) → A(b(a(b(a(b(a(a(x))))))))
A(a(b(b(x)))) → A(b(b(a(b(a(a(x)))))))
A(a(b(x))) → A(x)
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(x)
A(a(b(a(x)))) → A(b(a(x)))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
b(a(b(a(A(x))))) → a(a(b(a(b(a(b(A(x))))))))
b(b(a(A(x)))) → a(a(b(a(b(b(A(x)))))))
b(a(A(x))) → A(x)
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → A(x)
a(b(a(A(x)))) → a(b(A(x)))
The set Q is empty.
We have obtained the following QTRS:
a(a(x)) → x
a(a(b(x))) → b(a(b(a(a(x)))))
b(b(x)) → x
A(a(b(a(b(x))))) → A(b(a(b(a(b(a(a(x))))))))
A(a(b(b(x)))) → A(b(b(a(b(a(a(x)))))))
A(a(b(x))) → A(x)
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(x)
A(a(b(a(x)))) → A(b(a(x)))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → x
a(a(b(x))) → b(a(b(a(a(x)))))
b(b(x)) → x
A(a(b(a(b(x))))) → A(b(a(b(a(b(a(a(x))))))))
A(a(b(b(x)))) → A(b(b(a(b(a(a(x)))))))
A(a(b(x))) → A(x)
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(x)
A(a(b(a(x)))) → A(b(a(x)))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
The set Q is empty.
We have obtained the following QTRS:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(x1)) → x1
a(a(b(x1))) → b(a(b(a(a(x1)))))
b(b(x1)) → x1
The set Q is empty.
We have obtained the following QTRS:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → x
b(a(a(x))) → a(a(b(a(b(x)))))
b(b(x)) → x
Q is empty.