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(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(x1)))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(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:

A(a(x1)) → B(c(x1))
C(b(x1)) → B(a(c(x1)))
C(b(x1)) → A(c(x1))
A(a(x1)) → C(x1)
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(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(x1)) → B(c(x1))
C(b(x1)) → B(a(c(x1)))
C(b(x1)) → A(c(x1))
A(a(x1)) → C(x1)
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(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:

C(b(x1)) → A(c(x1))
A(a(x1)) → C(x1)
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(x1)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(b(x1)) → A(c(x1)) at position [0] we obtained the following new rules:

C(b(x0)) → A(x0)
C(b(b(x0))) → A(b(a(c(x0))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(b(x0)) → A(x0)
C(b(b(x0))) → A(b(a(c(x0))))
A(a(x1)) → C(x1)
C(b(x1)) → C(x1)

The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(x1)))

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(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(x1)))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → c(b(x))
b(x) → x
c(x) → x
b(c(x)) → c(a(b(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(x) → x
a(a(x)) → c(b(x))
b(x) → x
c(x) → x
b(c(x)) → c(a(b(x)))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → x1
a(a(x1)) → b(c(x1))
b(x1) → x1
c(x1) → x1
c(b(x1)) → b(a(c(x1)))

The set Q is empty.
We have obtained the following QTRS:

a(x) → x
a(a(x)) → c(b(x))
b(x) → x
c(x) → x
b(c(x)) → c(a(b(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(x) → x
a(a(x)) → c(b(x))
b(x) → x
c(x) → x
b(c(x)) → c(a(b(x)))

Q is empty.