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

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

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)



↳ QTRS
  ↳ DependencyPairsProof

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

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)


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

F(f(f(a, x), y), z) → F(y, z)
F(f(f(a, x), y), z) → F(x, z)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)

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

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ ForwardInstantiation

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

F(f(f(a, x), y), z) → F(y, z)
F(f(f(a, x), y), z) → F(x, z)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)

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

F(f(f(a, f(f(a, y_0), y_1)), x1), x2) → F(f(f(a, y_0), y_1), x2)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ ForwardInstantiation
        ↳ QDP
          ↳ ForwardInstantiation

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

F(f(f(a, f(f(a, y_0), y_1)), x1), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x), y), z) → F(y, z)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)

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

F(f(f(a, x0), f(f(a, f(f(a, y_0), y_1)), y_2)), x2) → F(f(f(a, f(f(a, y_0), y_1)), y_2), x2)
F(f(f(a, x0), f(f(a, y_0), y_1)), x2) → F(f(f(a, y_0), y_1), x2)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ ForwardInstantiation
        ↳ QDP
          ↳ ForwardInstantiation
            ↳ QDP
              ↳ MNOCProof

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

F(f(f(a, f(f(a, y_0), y_1)), x1), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x0), f(f(a, f(f(a, y_0), y_1)), y_2)), x2) → F(f(f(a, f(f(a, y_0), y_1)), y_2), x2)
F(f(f(a, x0), f(f(a, y_0), y_1)), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

The set Q consists of the following terms:

f(c, x0)
f(f(f(a, x0), x1), x2)
f(f(b, x0), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ ForwardInstantiation
        ↳ QDP
          ↳ ForwardInstantiation
            ↳ QDP
              ↳ MNOCProof
                ↳ QDP
                  ↳ NonTerminationProof

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

F(f(f(a, f(f(a, y_0), y_1)), x1), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x0), f(f(a, f(f(a, y_0), y_1)), y_2)), x2) → F(f(f(a, f(f(a, y_0), y_1)), y_2), x2)
F(f(f(a, x0), f(f(a, y_0), y_1)), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

F(f(f(a, f(f(a, y_0), y_1)), x1), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x0), f(f(a, f(f(a, y_0), y_1)), y_2)), x2) → F(f(f(a, f(f(a, y_0), y_1)), y_2), x2)
F(f(f(a, x0), f(f(a, y_0), y_1)), x2) → F(f(f(a, y_0), y_1), x2)
F(f(f(a, x), y), z) → F(f(x, z), f(y, z))

The TRS R consists of the following rules:

f(f(f(a, x), y), z) → f(f(x, z), f(y, z))
f(f(b, x), y) → x
f(c, y) → y


s = F(f(f(a, f(a, x0)), y), f(c, f(f(a, y_0), y_1))) evaluates to t =F(f(f(a, y_0), y_1), f(y, f(f(a, y_0), y_1)))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:



Rewriting sequence

F(f(f(a, f(a, x0)), c), f(c, f(f(a, f(a, x0)), c))) → F(f(f(a, f(a, x0)), c), f(f(a, f(a, x0)), c))
with rule f(c, y') → y' at position [1] and matcher [y' / f(f(a, f(a, x0)), c)]

F(f(f(a, f(a, x0)), c), f(f(a, f(a, x0)), c)) → F(f(f(a, x0), f(f(a, f(a, x0)), c)), f(c, f(f(a, f(a, x0)), c)))
with rule F(f(f(a, x), y), z) → F(f(x, z), f(y, z)) at position [] and matcher [z / f(f(a, f(a, x0)), c), y / c, x / f(a, x0)]

F(f(f(a, x0), f(f(a, f(a, x0)), c)), f(c, f(f(a, f(a, x0)), c))) → F(f(f(a, f(a, x0)), c), f(c, f(f(a, f(a, x0)), c)))
with rule F(f(f(a, x0), f(f(a, y_0), y_1)), x2) → F(f(f(a, y_0), y_1), x2)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence


All these steps are and every following step will be a correct step w.r.t to Q.