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

Q is empty.


↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
  ↳ QTRS Reverse

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

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

Q is empty.

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

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

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
    ↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse

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

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

The TRS R consists of the following rules:

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

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

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

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

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

The TRS R consists of the following rules:

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

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

A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))



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

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

B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → B(b(a(x1)))
A(a(b(b(x1)))) → B(a(x1))
B(a(x1)) → A(a(a(x1)))
A(a(b(b(x1)))) → A(x1)
B(a(x1)) → A(a(a(a(x1))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))

The TRS R consists of the following rules:

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

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

A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))



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

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

B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
B(a(x1)) → A(a(a(x1)))
A(a(b(b(x1)))) → B(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → A(x1)
B(a(x1)) → A(a(a(a(x1))))
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))

The TRS R consists of the following rules:

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

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

B(a(a(b(b(x0))))) → A(a(a(b(b(b(a(x0)))))))
B(a(b(b(x0)))) → A(a(b(b(b(a(x0))))))



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

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

B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → B(a(x1))
B(a(x1)) → A(a(a(x1)))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
A(a(b(b(x1)))) → A(x1)
B(a(b(b(x0)))) → A(a(b(b(b(a(x0))))))
B(a(a(b(b(x0))))) → A(a(a(b(b(b(a(x0)))))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))

The TRS R consists of the following rules:

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

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

B(a(b(b(x0)))) → A(b(b(b(a(x0)))))
B(a(a(b(b(x0))))) → A(a(b(b(b(a(x0))))))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
  ↳ QTRS Reverse

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

B(a(b(b(x0)))) → A(b(b(b(a(x0)))))
B(a(a(b(b(x0))))) → A(a(b(b(b(a(x0))))))
B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
A(a(b(b(x1)))) → B(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))
B(a(a(b(b(x0))))) → A(a(a(b(b(b(a(x0)))))))
B(a(b(b(x0)))) → A(a(b(b(b(a(x0))))))

The TRS R consists of the following rules:

a(a(b(b(x1)))) → b(b(b(a(x1))))
b(a(x1)) → a(a(a(a(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
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
  ↳ QTRS Reverse

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

a(a(b(b(x1)))) → b(b(b(a(x1))))
b(a(x1)) → a(a(a(a(x1))))
B(a(b(b(x0)))) → A(b(b(b(a(x0)))))
B(a(a(b(b(x0))))) → A(a(b(b(b(a(x0))))))
B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
A(a(b(b(x1)))) → B(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))
B(a(a(b(b(x0))))) → A(a(a(b(b(b(a(x0)))))))
B(a(b(b(x0)))) → A(a(b(b(b(a(x0))))))

Q is empty.

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

a(a(b(b(x1)))) → b(b(b(a(x1))))
b(a(x1)) → a(a(a(a(x1))))
B(a(b(b(x0)))) → A(b(b(b(a(x0)))))
B(a(a(b(b(x0))))) → A(a(b(b(b(a(x0))))))
B(a(x1)) → A(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(a(x0))))))
A(a(b(b(x1)))) → B(a(x1))
A(a(b(b(a(b(b(x0))))))) → B(b(b(b(b(b(a(x0)))))))
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x0)))) → B(a(a(a(a(x0)))))
A(a(b(b(x0)))) → B(b(a(a(a(a(x0))))))
B(a(a(b(b(x0))))) → A(a(a(b(b(b(a(x0)))))))
B(a(b(b(x0)))) → A(a(b(b(b(a(x0))))))

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
  ↳ QTRS Reverse

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

Q is empty.

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

a(a(b(b(x)))) → b(b(b(a(x))))
b(a(x)) → a(a(a(a(x))))
B(a(b(b(x)))) → A(b(b(b(a(x)))))
B(a(a(b(b(x))))) → A(a(b(b(b(a(x))))))
B(a(x)) → A(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(a(x))))))
A(a(b(b(x)))) → B(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(b(a(x)))))))
A(a(b(b(x)))) → A(x)
A(a(b(b(x)))) → B(a(a(a(a(x)))))
A(a(b(b(x)))) → B(b(a(a(a(a(x))))))
B(a(a(b(b(x))))) → A(a(a(b(b(b(a(x)))))))
B(a(b(b(x)))) → A(a(b(b(b(a(x))))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
  ↳ QTRS Reverse

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

a(a(b(b(x)))) → b(b(b(a(x))))
b(a(x)) → a(a(a(a(x))))
B(a(b(b(x)))) → A(b(b(b(a(x)))))
B(a(a(b(b(x))))) → A(a(b(b(b(a(x))))))
B(a(x)) → A(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(a(x))))))
A(a(b(b(x)))) → B(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(b(a(x)))))))
A(a(b(b(x)))) → A(x)
A(a(b(b(x)))) → B(a(a(a(a(x)))))
A(a(b(b(x)))) → B(b(a(a(a(a(x))))))
B(a(a(b(b(x))))) → A(a(a(b(b(b(a(x)))))))
B(a(b(b(x)))) → A(a(b(b(b(a(x))))))

Q is empty.

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

a(a(b(b(x)))) → b(b(b(a(x))))
b(a(x)) → a(a(a(a(x))))
B(a(b(b(x)))) → A(b(b(b(a(x)))))
B(a(a(b(b(x))))) → A(a(b(b(b(a(x))))))
B(a(x)) → A(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(a(x))))))
A(a(b(b(x)))) → B(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(b(a(x)))))))
A(a(b(b(x)))) → A(x)
A(a(b(b(x)))) → B(a(a(a(a(x)))))
A(a(b(b(x)))) → B(b(a(a(a(a(x))))))
B(a(a(b(b(x))))) → A(a(a(b(b(b(a(x)))))))
B(a(b(b(x)))) → A(a(b(b(b(a(x))))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                                ↳ QTRS
                              ↳ DependencyPairsProof
  ↳ QTRS Reverse

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

a(a(b(b(x)))) → b(b(b(a(x))))
b(a(x)) → a(a(a(a(x))))
B(a(b(b(x)))) → A(b(b(b(a(x)))))
B(a(a(b(b(x))))) → A(a(b(b(b(a(x))))))
B(a(x)) → A(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(a(x))))))
A(a(b(b(x)))) → B(a(x))
A(a(b(b(a(b(b(x))))))) → B(b(b(b(b(b(a(x)))))))
A(a(b(b(x)))) → A(x)
A(a(b(b(x)))) → B(a(a(a(a(x)))))
A(a(b(b(x)))) → B(b(a(a(a(a(x))))))
B(a(a(b(b(x))))) → A(a(a(b(b(b(a(x)))))))
B(a(b(b(x)))) → A(a(b(b(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:

B1(b(a(B(x)))) → B1(b(a(A(x))))
B1(b(a(a(B(x))))) → B1(a(A(x)))
B1(b(a(B(x)))) → A1(b(b(b(A(x)))))
B1(b(a(a(B(x))))) → A1(a(A(x)))
B1(b(a(a(B(x))))) → B1(a(a(A(x))))
B1(b(a(a(B(x))))) → A1(b(b(b(a(a(A(x)))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(b(b(a(A(x))))))) → A1(b(b(b(b(B(x))))))
B1(b(a(B(x)))) → A1(b(b(b(a(A(x))))))
B1(b(a(a(B(x))))) → B1(b(b(a(A(x)))))
A1(b(x)) → A1(x)
A1(b(x)) → A1(a(x))
B1(b(a(A(x)))) → A1(a(a(a(B(x)))))
B1(b(a(B(x)))) → B1(b(b(A(x))))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(B(x))))
B1(b(a(A(x)))) → A1(a(a(a(b(B(x))))))
B1(b(a(A(x)))) → A1(a(b(B(x))))
B1(b(a(A(x)))) → A1(a(a(B(x))))
B1(b(a(a(x)))) → A1(b(b(b(x))))
B1(b(a(a(B(x))))) → B1(b(b(a(a(A(x))))))
B1(b(a(a(x)))) → B1(b(x))
B1(b(a(B(x)))) → A1(A(x))
B1(b(a(a(B(x))))) → A1(A(x))
B1(b(a(a(B(x))))) → B1(b(a(A(x))))
A1(b(x)) → A1(a(a(a(x))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(A(x)))) → A1(a(B(x)))
B1(b(a(b(b(a(A(x))))))) → B1(B(x))
B1(b(a(A(x)))) → A1(B(x))
B1(b(a(a(B(x))))) → A1(b(b(b(a(A(x))))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(x)))) → B1(x)
B1(b(a(A(x)))) → A1(a(a(b(B(x)))))
A1(B(x)) → A1(A(x))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(b(B(x)))))
B1(b(a(b(b(a(A(x))))))) → B1(b(B(x)))
B1(b(a(A(x)))) → B1(B(x))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(b(b(B(x))))))
B1(b(a(b(b(a(A(x))))))) → A1(b(b(b(b(b(B(x)))))))
B1(b(a(B(x)))) → B1(A(x))
A1(b(x)) → A1(a(a(x)))
B1(b(a(A(x)))) → A1(b(B(x)))
B1(b(a(B(x)))) → B1(a(A(x)))
B1(b(a(B(x)))) → B1(b(A(x)))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

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

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

B1(b(a(B(x)))) → B1(b(a(A(x))))
B1(b(a(a(B(x))))) → B1(a(A(x)))
B1(b(a(B(x)))) → A1(b(b(b(A(x)))))
B1(b(a(a(B(x))))) → A1(a(A(x)))
B1(b(a(a(B(x))))) → B1(a(a(A(x))))
B1(b(a(a(B(x))))) → A1(b(b(b(a(a(A(x)))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(b(b(a(A(x))))))) → A1(b(b(b(b(B(x))))))
B1(b(a(B(x)))) → A1(b(b(b(a(A(x))))))
B1(b(a(a(B(x))))) → B1(b(b(a(A(x)))))
A1(b(x)) → A1(x)
A1(b(x)) → A1(a(x))
B1(b(a(A(x)))) → A1(a(a(a(B(x)))))
B1(b(a(B(x)))) → B1(b(b(A(x))))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(B(x))))
B1(b(a(A(x)))) → A1(a(a(a(b(B(x))))))
B1(b(a(A(x)))) → A1(a(b(B(x))))
B1(b(a(A(x)))) → A1(a(a(B(x))))
B1(b(a(a(x)))) → A1(b(b(b(x))))
B1(b(a(a(B(x))))) → B1(b(b(a(a(A(x))))))
B1(b(a(a(x)))) → B1(b(x))
B1(b(a(B(x)))) → A1(A(x))
B1(b(a(a(B(x))))) → A1(A(x))
B1(b(a(a(B(x))))) → B1(b(a(A(x))))
A1(b(x)) → A1(a(a(a(x))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(A(x)))) → A1(a(B(x)))
B1(b(a(b(b(a(A(x))))))) → B1(B(x))
B1(b(a(A(x)))) → A1(B(x))
B1(b(a(a(B(x))))) → A1(b(b(b(a(A(x))))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(x)))) → B1(x)
B1(b(a(A(x)))) → A1(a(a(b(B(x)))))
A1(B(x)) → A1(A(x))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(b(B(x)))))
B1(b(a(b(b(a(A(x))))))) → B1(b(B(x)))
B1(b(a(A(x)))) → B1(B(x))
B1(b(a(b(b(a(A(x))))))) → B1(b(b(b(b(B(x))))))
B1(b(a(b(b(a(A(x))))))) → A1(b(b(b(b(b(B(x)))))))
B1(b(a(B(x)))) → B1(A(x))
A1(b(x)) → A1(a(a(x)))
B1(b(a(A(x)))) → A1(b(B(x)))
B1(b(a(B(x)))) → B1(a(A(x)))
B1(b(a(B(x)))) → B1(b(A(x)))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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 2 SCCs with 36 less nodes.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                        ↳ UsableRulesProof
                                        ↳ UsableRulesProof
                                      ↳ QDP
  ↳ QTRS Reverse

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

A1(b(x)) → A1(x)

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                        ↳ UsableRulesProof
                                          ↳ QDP
                                            ↳ UsableRulesReductionPairsProof
                                        ↳ UsableRulesProof
                                      ↳ QDP
  ↳ QTRS Reverse

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

A1(b(x)) → A1(x)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

A1(b(x)) → A1(x)
No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [25]:

POL(A1(x1)) = 2·x1   
POL(b(x1)) = 2·x1   



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                        ↳ UsableRulesProof
                                          ↳ QDP
                                            ↳ UsableRulesReductionPairsProof
                                              ↳ QDP
                                                ↳ PisEmptyProof
                                        ↳ UsableRulesProof
                                      ↳ QDP
  ↳ QTRS Reverse

Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                        ↳ UsableRulesProof
                                        ↳ UsableRulesProof
                                          ↳ QDP
                                      ↳ QDP
  ↳ QTRS Reverse

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

A1(b(x)) → A1(x)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(B(x))))) → B1(b(b(a(a(A(x))))))
B1(b(a(a(B(x))))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

B1(b(a(a(B(x0))))) → B1(a(a(a(a(B(x0))))))
B1(b(a(a(B(x0))))) → B1(a(a(a(a(b(B(x0)))))))
B1(b(a(a(B(x0))))) → B1(A(x0))
B1(b(a(a(B(x0))))) → B1(a(B(x0)))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x0))))) → B1(a(a(a(a(B(x0))))))
B1(b(a(a(B(x0))))) → B1(a(a(a(a(b(B(x0)))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(B(x0))))) → B1(A(x0))
B1(b(a(a(B(x))))) → B1(b(b(a(a(A(x))))))
B1(b(a(a(B(x0))))) → B1(a(B(x0)))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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 4 less nodes.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(B(x))))) → B1(b(b(a(a(A(x))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

B1(b(a(a(B(y0))))) → B1(a(b(b(b(A(y0))))))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(B(y0))))) → B1(a(b(b(b(A(y0))))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(B(x)))) → B1(b(b(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

B1(b(a(B(x0)))) → B1(A(x0))
B1(b(a(B(x0)))) → B1(a(a(a(a(B(x0))))))
B1(b(a(B(x0)))) → B1(a(B(x0)))
B1(b(a(B(x0)))) → B1(a(a(a(a(b(B(x0)))))))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(B(x0)))) → B1(A(x0))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(B(x0)))) → B1(a(a(a(a(B(x0))))))
B1(b(a(B(x0)))) → B1(a(B(x0)))
B1(b(a(B(x0)))) → B1(a(a(a(a(b(B(x0)))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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 4 less nodes.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(x)))) → B1(b(b(x)))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

B1(b(a(a(a(B(x0)))))) → B1(a(b(b(b(a(A(x0)))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(a(b(b(a(A(x0))))))))) → B1(a(b(b(b(b(B(x0)))))))
B1(b(a(a(a(A(x0)))))) → B1(A(x0))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(a(B(x0)))))) → B1(a(b(b(b(A(x0))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(a(A(x0)))))) → B1(a(a(a(a(B(x0))))))
B1(b(a(a(a(a(B(x0))))))) → B1(a(b(b(b(a(a(A(x0))))))))
B1(b(a(a(a(A(x0)))))) → B1(a(B(x0)))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(B(x0))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(A(x0)))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(a(b(b(a(A(x0))))))))) → B1(a(b(b(b(b(b(B(x0))))))))
B1(b(a(a(a(a(x0)))))) → B1(a(b(b(b(x0)))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(a(A(x0)))))) → B1(a(a(a(a(b(B(x0)))))))
B1(b(a(a(a(a(B(x0))))))) → B1(a(b(b(b(a(A(x0)))))))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
  ↳ QTRS Reverse

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

B1(b(a(a(a(B(x0)))))) → B1(a(b(b(b(a(A(x0)))))))
B1(b(a(a(a(A(x0)))))) → B1(A(x0))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(a(A(x0)))))) → B1(a(a(a(a(B(x0))))))
B1(b(a(a(a(a(x0)))))) → B1(a(b(b(b(x0)))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(a(A(x0)))))) → B1(a(a(a(a(b(B(x0)))))))
B1(b(a(a(a(a(B(x0))))))) → B1(a(b(b(b(a(A(x0)))))))
B1(b(a(a(x)))) → B1(b(x))
B1(b(a(a(a(b(b(a(A(x0))))))))) → B1(a(b(b(b(b(B(x0)))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(a(B(x0)))))) → B1(a(b(b(b(A(x0))))))
B1(b(a(a(x)))) → B1(x)
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(a(a(B(x0))))))) → B1(a(b(b(b(a(a(A(x0))))))))
B1(b(a(a(a(A(x0)))))) → B1(a(B(x0)))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(B(x0))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(A(x0)))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(a(b(b(a(A(x0))))))))) → B1(a(b(b(b(b(b(B(x0))))))))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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 12 less nodes.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
  ↳ QTRS Reverse

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

B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(x)))) → B1(x)
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(B(x0))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

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

B1(b(a(a(b(a(A(x0))))))) → B1(b(a(A(x0))))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
  ↳ QTRS Reverse

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

B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(A(x0))))
B1(b(a(a(x)))) → B1(x)
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(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
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
  ↳ QTRS Reverse

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

B1(b(a(a(x)))) → B1(x)
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule B1(b(a(a(x)))) → B1(x) we obtained the following new rules:

B1(b(a(a(b(y_2))))) → B1(b(y_2))



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(b(y_2))))) → B1(b(y_2))
B1(b(a(a(B(x))))) → B1(b(a(a(A(x)))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(B(x0)))))))
B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))
b(b(a(B(x)))) → a(b(b(b(A(x)))))
b(b(a(a(B(x))))) → a(b(b(b(a(A(x))))))
a(B(x)) → a(A(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(B(x))))))
b(b(a(A(x)))) → a(B(x))
b(b(a(b(b(a(A(x))))))) → a(b(b(b(b(b(B(x)))))))
b(b(a(A(x)))) → A(x)
b(b(a(A(x)))) → a(a(a(a(B(x)))))
b(b(a(A(x)))) → a(a(a(a(b(B(x))))))
b(b(a(a(B(x))))) → a(b(b(b(a(a(A(x)))))))
b(b(a(B(x)))) → a(b(b(b(a(A(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We found the following quasi-model for the rules of the TRS R. Interpretation over the domain with elements from 0 to 1.B: 0
a: x0
A: 0
B1: 0
b: 1
By semantic labelling [33] we obtain the following labelled TRS:Q DP problem:
The TRS P consists of the following rules:

B1.1(b.0(a.0(a.0(x)))) → B1.0(b.0(x))
B1.1(b.1(a.1(a.1(b.0(y_2))))) → B1.1(b.0(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.0(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.0(a.0(a.0(a.0(a.0(B.0(x0)))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.1(b.1(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(x)))) → B1.1(b.1(x))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.0(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.0(b.0(a.0(a.0(a.0(a.0(B.1(x0)))))))
B1.1(b.0(a.0(a.0(x)))) → B1.1(b.0(x))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.0(b.1(y_2))
B1.1(b.0(a.0(a.0(B.1(x))))) → B1.1(b.0(a.0(a.0(A.1(x)))))
B1.1(b.1(a.1(a.1(b.0(y_2))))) → B1.0(b.0(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.0(b.0(a.0(a.0(a.0(a.0(B.0(x0)))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(x)))) → B1.0(b.1(x))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.0(b.0(a.0(a.0(A.0(x)))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.1(b.0(a.0(a.0(A.0(x)))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.0(a.0(a.0(a.0(a.0(B.1(x0)))))))
B1.1(b.0(a.0(a.0(B.1(x))))) → B1.0(b.0(a.0(a.0(A.1(x)))))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
b.1(b.1(a.1(a.1(x)))) → a.1(b.1(b.1(b.1(x))))
b.1(x0) → b.0(x0)
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(A.1(x)))))
a.1(b.0(x)) → a.0(a.0(a.0(a.0(x))))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(A.0(x)))))
a.0(B.0(x)) → a.0(A.0(x))
a.1(x0) → a.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.0(B.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.1(a.1(a.1(a.1(b.0(B.1(x))))))
b.1(b.0(a.0(A.1(x)))) → A.1(x)
B.1(x0) → B.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.0(x)))))))
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))
b.1(b.0(a.0(a.0(x)))) → a.1(b.1(b.1(b.0(x))))
b.1(b.0(a.0(A.1(x)))) → a.0(a.0(a.0(a.0(B.1(x)))))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.0(B.1(x))
a.0(B.1(x)) → a.0(A.1(x))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.0(x)))) → a.0(a.0(a.0(a.0(B.0(x)))))
b.1(b.0(a.0(A.0(x)))) → A.0(x)
b.1(b.0(a.0(A.0(x)))) → a.1(a.1(a.1(a.1(b.0(B.0(x))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.1(x)))))))
a.1(b.1(x)) → a.1(a.1(a.1(a.1(x))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.0(B.1(x))))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.1(x)))))))
b.1(b.0(a.0(A.0(x)))) → a.0(B.0(x))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.0(x)))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1.1(b.0(a.0(a.0(x)))) → B1.0(b.0(x))
B1.1(b.1(a.1(a.1(b.0(y_2))))) → B1.1(b.0(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.0(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.0(a.0(a.0(a.0(a.0(B.0(x0)))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.1(b.1(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(x)))) → B1.1(b.1(x))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.0(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.0(b.0(a.0(a.0(a.0(a.0(B.1(x0)))))))
B1.1(b.0(a.0(a.0(x)))) → B1.1(b.0(x))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.0(b.1(y_2))
B1.1(b.0(a.0(a.0(B.1(x))))) → B1.1(b.0(a.0(a.0(A.1(x)))))
B1.1(b.1(a.1(a.1(b.0(y_2))))) → B1.0(b.0(y_2))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.0(b.0(a.0(a.0(a.0(a.0(B.0(x0)))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.0(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(x)))) → B1.0(b.1(x))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.0(b.0(a.0(a.0(A.0(x)))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.1(b.0(a.0(a.0(A.0(x)))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.0(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.0(a.0(a.0(a.0(a.0(B.1(x0)))))))
B1.1(b.0(a.0(a.0(B.1(x))))) → B1.0(b.0(a.0(a.0(A.1(x)))))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
b.1(b.1(a.1(a.1(x)))) → a.1(b.1(b.1(b.1(x))))
b.1(x0) → b.0(x0)
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(A.1(x)))))
a.1(b.0(x)) → a.0(a.0(a.0(a.0(x))))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(A.0(x)))))
a.0(B.0(x)) → a.0(A.0(x))
a.1(x0) → a.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.0(B.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.1(a.1(a.1(a.1(b.0(B.1(x))))))
b.1(b.0(a.0(A.1(x)))) → A.1(x)
B.1(x0) → B.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.0(x)))))))
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))
b.1(b.0(a.0(a.0(x)))) → a.1(b.1(b.1(b.0(x))))
b.1(b.0(a.0(A.1(x)))) → a.0(a.0(a.0(a.0(B.1(x)))))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.0(B.1(x))
a.0(B.1(x)) → a.0(A.1(x))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.0(x)))) → a.0(a.0(a.0(a.0(B.0(x)))))
b.1(b.0(a.0(A.0(x)))) → A.0(x)
b.1(b.0(a.0(A.0(x)))) → a.1(a.1(a.1(a.1(b.0(B.0(x))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.1(x)))))))
a.1(b.1(x)) → a.1(a.1(a.1(a.1(x))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.0(B.1(x))))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.1(x)))))))
b.1(b.0(a.0(A.0(x)))) → a.0(B.0(x))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.0(x)))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 27 less nodes.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                          ↳ AND
                                                                                            ↳ QDP
                                                                                              ↳ UsableRulesReductionPairsProof
                                                                                            ↳ QDP
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1.1(b.0(a.0(a.0(B.1(x))))) → B1.1(b.0(a.0(a.0(A.1(x)))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.1(b.0(a.0(a.0(A.0(x)))))
B1.1(b.0(a.0(a.0(x)))) → B1.1(b.0(x))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
b.1(b.1(a.1(a.1(x)))) → a.1(b.1(b.1(b.1(x))))
b.1(x0) → b.0(x0)
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(A.1(x)))))
a.1(b.0(x)) → a.0(a.0(a.0(a.0(x))))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(A.0(x)))))
a.0(B.0(x)) → a.0(A.0(x))
a.1(x0) → a.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.0(B.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.1(a.1(a.1(a.1(b.0(B.1(x))))))
b.1(b.0(a.0(A.1(x)))) → A.1(x)
B.1(x0) → B.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.0(x)))))))
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))
b.1(b.0(a.0(a.0(x)))) → a.1(b.1(b.1(b.0(x))))
b.1(b.0(a.0(A.1(x)))) → a.0(a.0(a.0(a.0(B.1(x)))))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.0(B.1(x))
a.0(B.1(x)) → a.0(A.1(x))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.0(x)))) → a.0(a.0(a.0(a.0(B.0(x)))))
b.1(b.0(a.0(A.0(x)))) → A.0(x)
b.1(b.0(a.0(A.0(x)))) → a.1(a.1(a.1(a.1(b.0(B.0(x))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.1(x)))))))
a.1(b.1(x)) → a.1(a.1(a.1(a.1(x))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.0(B.1(x))))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.1(x)))))))
b.1(b.0(a.0(A.0(x)))) → a.0(B.0(x))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.0(x)))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

B1.1(b.0(a.0(a.0(B.1(x))))) → B1.1(b.0(a.0(a.0(A.1(x)))))
B1.1(b.0(a.0(a.0(B.0(x))))) → B1.1(b.0(a.0(a.0(A.0(x)))))
The following rules are removed from R:

a.0(B.0(x)) → a.0(A.0(x))
a.0(B.1(x)) → a.0(A.1(x))
Used ordering: POLO with Polynomial interpretation [25]:

POL(A.0(x1)) = x1   
POL(A.1(x1)) = x1   
POL(B.0(x1)) = 1 + x1   
POL(B.1(x1)) = 1 + x1   
POL(B1.1(x1)) = x1   
POL(a.0(x1)) = x1   
POL(b.0(x1)) = x1   



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                          ↳ AND
                                                                                            ↳ QDP
                                                                                              ↳ UsableRulesReductionPairsProof
                                                                                                ↳ QDP
                                                                                                  ↳ UsableRulesReductionPairsProof
                                                                                            ↳ QDP
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1.1(b.0(a.0(a.0(x)))) → B1.1(b.0(x))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

B1.1(b.0(a.0(a.0(x)))) → B1.1(b.0(x))
No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [25]:

POL(B1.1(x1)) = x1   
POL(a.0(x1)) = x1   
POL(b.0(x1)) = x1   



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                          ↳ AND
                                                                                            ↳ QDP
                                                                                              ↳ UsableRulesReductionPairsProof
                                                                                                ↳ QDP
                                                                                                  ↳ UsableRulesReductionPairsProof
                                                                                                    ↳ QDP
                                                                                                      ↳ PisEmptyProof
                                                                                            ↳ QDP
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                          ↳ AND
                                                                                            ↳ QDP
                                                                                            ↳ QDP
                                                                                              ↳ RuleRemovalProof
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.1(b.1(y_2))
B1.1(b.1(a.1(a.1(x)))) → B1.1(b.1(x))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
b.1(b.1(a.1(a.1(x)))) → a.1(b.1(b.1(b.1(x))))
b.1(x0) → b.0(x0)
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(A.1(x)))))
a.1(b.0(x)) → a.0(a.0(a.0(a.0(x))))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(A.0(x)))))
a.0(B.0(x)) → a.0(A.0(x))
a.1(x0) → a.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.0(B.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.1(a.1(a.1(a.1(b.0(B.1(x))))))
b.1(b.0(a.0(A.1(x)))) → A.1(x)
B.1(x0) → B.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.0(x)))))))
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))
b.1(b.0(a.0(a.0(x)))) → a.1(b.1(b.1(b.0(x))))
b.1(b.0(a.0(A.1(x)))) → a.0(a.0(a.0(a.0(B.1(x)))))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.0(B.1(x))
a.0(B.1(x)) → a.0(A.1(x))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.0(x)))) → a.0(a.0(a.0(a.0(B.0(x)))))
b.1(b.0(a.0(A.0(x)))) → A.0(x)
b.1(b.0(a.0(A.0(x)))) → a.1(a.1(a.1(a.1(b.0(B.0(x))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.1(x)))))))
a.1(b.1(x)) → a.1(a.1(a.1(a.1(x))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.0(B.1(x))))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.1(x)))))))
b.1(b.0(a.0(A.0(x)))) → a.0(B.0(x))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.0(x)))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented rules of the TRS R:

A.1(x0) → A.0(x0)
B.1(x0) → B.0(x0)

Used ordering: POLO with Polynomial interpretation [25]:

POL(A.0(x1)) = x1   
POL(A.1(x1)) = 1 + x1   
POL(B.0(x1)) = x1   
POL(B.1(x1)) = 1 + x1   
POL(B1.1(x1)) = x1   
POL(a.0(x1)) = x1   
POL(a.1(x1)) = x1   
POL(b.0(x1)) = x1   
POL(b.1(x1)) = x1   



↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                      ↳ QDP
                                                                                        ↳ DependencyGraphProof
                                                                                          ↳ AND
                                                                                            ↳ QDP
                                                                                            ↳ QDP
                                                                                              ↳ RuleRemovalProof
                                                                                                ↳ QDP
                                                                                    ↳ SemLabProof2
  ↳ QTRS Reverse

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

B1.1(b.1(a.1(a.1(b.0(a.0(a.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(x0))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.1(b.0(B.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.1(y_2))))) → B1.1(b.1(y_2))
B1.1(b.1(a.1(a.1(x)))) → B1.1(b.1(x))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.1(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.0(x0))))))))
B1.1(b.1(a.1(a.1(b.1(a.1(a.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(x0))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.0(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.0(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.1(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.1(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(A.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.1(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.1(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(A.0(x0))))))) → B1.1(b.1(a.1(a.1(a.1(a.1(b.0(B.0(x0))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(a.0(B.0(x0)))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(a.0(a.0(A.0(x0)))))))))
B1.1(b.1(a.1(a.1(b.0(a.0(B.1(x0))))))) → B1.1(b.1(a.1(b.1(b.1(b.0(A.1(x0)))))))
B1.1(b.1(a.1(a.1(b.1(a.1(b.1(b.0(a.0(A.0(x0)))))))))) → B1.1(b.1(a.1(b.1(b.1(b.1(b.0(B.0(x0))))))))

The TRS R consists of the following rules:

b.1(b.1(a.1(a.1(x)))) → a.1(b.1(b.1(b.1(x))))
b.1(x0) → b.0(x0)
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(A.1(x)))))
a.1(b.0(x)) → a.0(a.0(a.0(a.0(x))))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(A.0(x)))))
a.0(B.0(x)) → a.0(A.0(x))
a.1(x0) → a.0(x0)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.0(B.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.1(a.1(a.1(a.1(b.0(B.1(x))))))
b.1(b.0(a.0(A.1(x)))) → A.1(x)
b.1(b.1(a.1(b.1(b.0(a.0(A.0(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.0(x)))))))
b.1(b.0(a.0(B.1(x)))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))
b.1(b.0(a.0(a.0(x)))) → a.1(b.1(b.1(b.0(x))))
b.1(b.0(a.0(A.1(x)))) → a.0(a.0(a.0(a.0(B.1(x)))))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.1(x)))) → a.0(B.1(x))
a.0(B.1(x)) → a.0(A.1(x))
b.1(b.0(a.0(B.0(x)))) → a.1(b.1(b.1(b.0(a.0(A.0(x))))))
b.1(b.0(a.0(A.0(x)))) → a.0(a.0(a.0(a.0(B.0(x)))))
b.1(b.0(a.0(A.0(x)))) → A.0(x)
b.1(b.0(a.0(A.0(x)))) → a.1(a.1(a.1(a.1(b.0(B.0(x))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.1(x)))))))
a.1(b.1(x)) → a.1(a.1(a.1(a.1(x))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.0(B.1(x))))))
b.1(b.1(a.1(b.1(b.0(a.0(A.1(x))))))) → a.1(b.1(b.1(b.1(b.1(b.0(B.1(x)))))))
b.1(b.0(a.0(A.0(x)))) → a.0(B.0(x))
b.1(b.0(a.0(a.0(B.0(x))))) → a.1(b.1(b.1(b.0(a.0(a.0(A.0(x)))))))
b.1(b.0(a.0(a.0(B.1(x))))) → a.1(b.1(b.1(b.0(a.0(A.1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
As can be seen after transforming the QDP problem by semantic labelling [33] and then some rule deleting processors, only certain labelled rules and pairs can be used. Hence, we only have to consider all unlabelled pairs and rules (without the decreasing rules for quasi-models).

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ Narrowing
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ AND
                                      ↳ QDP
                                      ↳ QDP
                                        ↳ Narrowing
                                          ↳ QDP
                                            ↳ DependencyGraphProof
                                              ↳ QDP
                                                ↳ Narrowing
                                                  ↳ QDP
                                                    ↳ DependencyGraphProof
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
                                                              ↳ QDP
                                                                ↳ Narrowing
                                                                  ↳ QDP
                                                                    ↳ DependencyGraphProof
                                                                      ↳ QDP
                                                                        ↳ Narrowing
                                                                          ↳ QDP
                                                                            ↳ DependencyGraphProof
                                                                              ↳ QDP
                                                                                ↳ ForwardInstantiation
                                                                                  ↳ QDP
                                                                                    ↳ SemLabProof
                                                                                    ↳ SemLabProof2
                                                                                      ↳ QDP
  ↳ QTRS Reverse

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

B1(b(a(a(b(a(A(x0))))))) → B1(b(a(a(a(a(b(B(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(a(A(x0)))))))))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(b(B(x0)))))))))
B1(b(a(a(b(y_2))))) → B1(b(y_2))
B1(b(a(a(b(a(b(b(a(A(x0)))))))))) → B1(b(a(b(b(b(b(B(x0))))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(A(x0)))))))
B1(b(a(a(b(a(B(x0))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(B(x0)))))))) → B1(b(a(b(b(b(a(A(x0))))))))
B1(b(a(a(b(a(a(x0))))))) → B1(b(a(b(b(b(x0))))))
B1(b(a(a(x)))) → B1(b(x))

The TRS R consists of the following rules:

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

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
    ↳ QTRS

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

b(b(a(a(x)))) → a(b(b(b(x))))
a(b(x)) → a(a(a(a(x))))

Q is empty.