Termination w.r.t. Q proof of /tmp/tmpJVm4tO/toyama.trs

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:

f(0, 1, X) → f(X, X, X)
g(X, Y) → X
g(X, Y) → Y

The set Q consists of the following terms:

g(x0, x1)
f(0, 1, x0)

↳ QTRS

  ↳ DependencyPairsProof

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

f(0, 1, X) → f(X, X, X)
g(X, Y) → X
g(X, Y) → Y

The set Q consists of the following terms:

g(x0, x1)
f(0, 1, x0)

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(0, 1, X) → F(X, X, X)

The TRS R consists of the following rules:

f(0, 1, X) → f(X, X, X)
g(X, Y) → X
g(X, Y) → Y

The set Q consists of the following terms:

g(x0, x1)
f(0, 1, x0)

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:

F(0, 1, X) → F(X, X, X)

The TRS R consists of the following rules:

f(0, 1, X) → f(X, X, X)
g(X, Y) → X
g(X, Y) → Y

The set Q consists of the following terms:

g(x0, x1)
f(0, 1, x0)

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