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(a(x1))) → b(c(x1))
c(b(x1)) → a(a(a(a(c(x1)))))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(a(x1))) → b(c(x1))
c(b(x1)) → a(a(a(a(c(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:
C(b(x1)) → A(c(x1))
C(b(x1)) → A(a(a(a(c(x1)))))
A(a(a(x1))) → C(x1)
C(b(x1)) → A(a(c(x1)))
C(b(x1)) → C(x1)
C(b(x1)) → A(a(a(c(x1))))
The TRS R consists of the following rules:
a(a(a(x1))) → b(c(x1))
c(b(x1)) → a(a(a(a(c(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
C(b(x1)) → A(c(x1))
C(b(x1)) → A(a(a(a(c(x1)))))
A(a(a(x1))) → C(x1)
C(b(x1)) → A(a(c(x1)))
C(b(x1)) → C(x1)
C(b(x1)) → A(a(a(c(x1))))
The TRS R consists of the following rules:
a(a(a(x1))) → b(c(x1))
c(b(x1)) → a(a(a(a(c(x1)))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.