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:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

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

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G2(s1(x), s1(y)) -> G2(x, y)
F3(t, x, y) -> F3(g2(x, y), x, s1(y))
F3(t, x, y) -> G2(x, y)

The TRS R consists of the following rules:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

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

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

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

G2(s1(x), s1(y)) -> G2(x, y)
F3(t, x, y) -> F3(g2(x, y), x, s1(y))
F3(t, x, y) -> G2(x, y)

The TRS R consists of the following rules:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

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

G2(s1(x), s1(y)) -> G2(x, y)

The TRS R consists of the following rules:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

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


The following pairs can be oriented strictly and are deleted.


G2(s1(x), s1(y)) -> G2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(G2(x1, x2)) = x2   
POL(s1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

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
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP

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

F3(t, x, y) -> F3(g2(x, y), x, s1(y))

The TRS R consists of the following rules:

f3(t, x, y) -> f3(g2(x, y), x, s1(y))
g2(s1(x), 0) -> t
g2(s1(x), s1(y)) -> g2(x, y)

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