Termination w.r.t. Q proof of /tmp/tmp9KZj9N/torpa3.srs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

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

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

Q is empty.

↳ QTRS

  ↳ QTRS Reverse

  ↳ QTRS Reverse

  ↳ DependencyPairsProof

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

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

Q is empty.

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

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

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

b(b(x)) → d(c(x))
c(c(x)) → d(d(d(x)))
c(x) → g(x)
d(d(x)) → f(c(x))
d(d(d(x))) → c(g(x))
f(x) → g(a(x))
g(x) → b(a(d(x)))
g(g(x)) → c(b(x))

The set Q is empty.

↳ QTRS

  ↳ QTRS Reverse

    ↳ QTRS

  ↳ QTRS Reverse

  ↳ DependencyPairsProof

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

b(b(x)) → d(c(x))
c(c(x)) → d(d(d(x)))
c(x) → g(x)
d(d(x)) → f(c(x))
d(d(d(x))) → c(g(x))
f(x) → g(a(x))
g(x) → b(a(d(x)))
g(g(x)) → c(b(x))

Q is empty.

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

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

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

b(b(x)) → d(c(x))
c(c(x)) → d(d(d(x)))
c(x) → g(x)
d(d(x)) → f(c(x))
d(d(d(x))) → c(g(x))
f(x) → g(a(x))
g(x) → b(a(d(x)))
g(g(x)) → c(b(x))

The set Q is empty.

↳ QTRS

  ↳ QTRS Reverse

  ↳ QTRS Reverse

    ↳ QTRS

  ↳ DependencyPairsProof

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

b(b(x)) → d(c(x))
c(c(x)) → d(d(d(x)))
c(x) → g(x)
d(d(x)) → f(c(x))
d(d(d(x))) → c(g(x))
f(x) → g(a(x))
g(x) → b(a(d(x)))
g(g(x)) → c(b(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:

C(c(x1)) → D(d(d(x1)))
G(x1) → B(x1)
G(x1) → D(a(b(x1)))
G(g(x1)) → B(c(x1))
C(c(x1)) → D(x1)
G(g(x1)) → C(x1)
B(b(x1)) → C(d(x1))
C(c(x1)) → D(d(x1))
F(x1) → G(x1)
B(b(x1)) → D(x1)
C(x1) → G(x1)
D(d(x1)) → C(f(x1))
D(d(d(x1))) → G(c(x1))
D(d(x1)) → F(x1)
D(d(d(x1))) → C(x1)

The TRS R consists of the following rules:

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

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

↳ QTRS

  ↳ QTRS Reverse

  ↳ QTRS Reverse

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

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

C(c(x1)) → D(d(d(x1)))
G(x1) → B(x1)
G(x1) → D(a(b(x1)))
G(g(x1)) → B(c(x1))
C(c(x1)) → D(x1)
G(g(x1)) → C(x1)
B(b(x1)) → C(d(x1))
C(c(x1)) → D(d(x1))
F(x1) → G(x1)
B(b(x1)) → D(x1)
C(x1) → G(x1)
D(d(x1)) → C(f(x1))
D(d(d(x1))) → G(c(x1))
D(d(x1)) → F(x1)
D(d(d(x1))) → C(x1)

The TRS R consists of the following rules:

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

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

↳ QTRS

  ↳ QTRS Reverse

  ↳ QTRS Reverse

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

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

C(c(x1)) → D(d(d(x1)))
G(x1) → B(x1)
G(g(x1)) → B(c(x1))
C(c(x1)) → D(x1)
G(g(x1)) → C(x1)
B(b(x1)) → C(d(x1))
C(c(x1)) → D(d(x1))
F(x1) → G(x1)
B(b(x1)) → D(x1)
D(d(x1)) → C(f(x1))
D(d(d(x1))) → G(c(x1))
C(x1) → G(x1)
D(d(x1)) → F(x1)
D(d(d(x1))) → C(x1)

The TRS R consists of the following rules:

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

C(c(x1)) → D(d(d(x1)))
C(c(x1)) → D(x1)
G(g(x1)) → C(x1)
C(c(x1)) → D(d(x1))
B(b(x1)) → D(x1)
D(d(x1)) → C(f(x1))
D(d(d(x1))) → G(c(x1))
C(x1) → G(x1)
D(d(x1)) → F(x1)
D(d(d(x1))) → C(x1)

The remaining pairs can at least be oriented weakly.

G(x1) → B(x1)
G(g(x1)) → B(c(x1))
B(b(x1)) → C(d(x1))
F(x1) → G(x1)

Used ordering: Polynomial interpretation [25,35]:

POL(C(x₁)) = 3 + (2)x_1
POL(c(x₁)) = 3 + x_1
POL(f(x₁)) = x_1
POL(D(x₁)) = (2)x_1
POL(B(x₁)) = 1 + (2)x_1
POL(g(x₁)) = 3 + x_1
POL(a(x₁)) = 0
POL(G(x₁)) = 1 + (2)x_1
POL(d(x₁)) = 2 + x_1
POL(b(x₁)) = 3 + x_1
POL(F(x₁)) = 1 + (2)x_1

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

b(b(x1)) → c(d(x1))
d(d(d(x1))) → g(c(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
g(g(x1)) → b(c(x1))
d(d(x1)) → c(f(x1))
g(x1) → d(a(b(x1)))
f(x1) → a(g(x1))

↳ QTRS

  ↳ QTRS Reverse

  ↳ QTRS Reverse

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

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

F(x1) → G(x1)
G(x1) → B(x1)
G(g(x1)) → B(c(x1))
B(b(x1)) → C(d(x1))

The TRS R consists of the following rules:

b(b(x1)) → c(d(x1))
c(c(x1)) → d(d(d(x1)))
c(x1) → g(x1)
d(d(x1)) → c(f(x1))
d(d(d(x1))) → g(c(x1))
f(x1) → a(g(x1))
g(x1) → d(a(b(x1)))
g(g(x1)) → b(c(x1))

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