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:

app2(app2(rec, h), app2(g, 0)) -> g
app2(app2(rec, h), app2(g, app2(s, x))) -> app2(app2(h, x), app2(app2(rec, h), app2(g, x)))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

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

app2(app2(rec, h), app2(g, 0)) -> g
app2(app2(rec, h), app2(g, app2(s, x))) -> app2(app2(h, x), app2(app2(rec, h), app2(g, x)))

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:

APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(app2(h, x), app2(app2(rec, h), app2(g, x)))
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(g, x)
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(h, x)
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(app2(rec, h), app2(g, x))

The TRS R consists of the following rules:

app2(app2(rec, h), app2(g, 0)) -> g
app2(app2(rec, h), app2(g, app2(s, x))) -> app2(app2(h, x), app2(app2(rec, h), app2(g, x)))

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

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP

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

APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(app2(h, x), app2(app2(rec, h), app2(g, x)))
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(g, x)
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(h, x)
APP2(app2(rec, h), app2(g, app2(s, x))) -> APP2(app2(rec, h), app2(g, x))

The TRS R consists of the following rules:

app2(app2(rec, h), app2(g, 0)) -> g
app2(app2(rec, h), app2(g, app2(s, x))) -> app2(app2(h, x), app2(app2(rec, h), app2(g, x)))

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