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:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), y))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

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

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), 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:

F2(x, f2(a, y)) -> F2(f2(a, x), h1(a))
F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
F2(x, f2(a, y)) -> F2(a, x)
F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))

The TRS R consists of the following rules:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), 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:

F2(x, f2(a, y)) -> F2(f2(a, x), h1(a))
F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
F2(x, f2(a, y)) -> F2(a, x)
F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))

The TRS R consists of the following rules:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), y))

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

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

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

F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
F2(x, f2(a, y)) -> F2(a, x)
F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))

The TRS R consists of the following rules:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), 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.


F2(x, f2(a, y)) -> F2(a, x)
The remaining pairs can at least be oriented weakly.

F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))
Used ordering: Polynomial interpretation [21]:

POL(F2(x1, x2)) = x1 + x2   
POL(a) = 0   
POL(f2(x1, x2)) = 1 + x2   
POL(h1(x1)) = 0   

The following usable rules [14] were oriented:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), y))



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

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

F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))

The TRS R consists of the following rules:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), 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.


F2(x, f2(a, y)) -> F2(f2(f2(a, x), h1(a)), y)
The remaining pairs can at least be oriented weakly.

F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))
Used ordering: Polynomial interpretation [21]:

POL(F2(x1, x2)) = x2   
POL(a) = 0   
POL(f2(x1, x2)) = 1 + x2   
POL(h1(x1)) = 0   

The following usable rules [14] were oriented:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), y))



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

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

F2(x, f2(a, y)) -> F2(a, f2(f2(f2(a, x), h1(a)), y))

The TRS R consists of the following rules:

f2(x, f2(a, y)) -> f2(a, f2(f2(f2(a, x), h1(a)), y))

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