Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 QDP
↳5 QDPOrderProof (⇔)
↳6 QDP
↳7 PisEmptyProof (⇔)
↳8 TRUE

(0) Obligation:

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

app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

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

APP(app(F, app(app(F, f), x)), x) → APP(app(F, app(G, app(app(F, f), x))), app(f, x))
APP(app(F, app(app(F, f), x)), x) → APP(F, app(G, app(app(F, f), x)))
APP(app(F, app(app(F, f), x)), x) → APP(G, app(app(F, f), x))
APP(app(F, app(app(F, f), x)), x) → APP(f, x)

The TRS R consists of the following rules:

app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))

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

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.

(4) Obligation:

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

APP(app(F, app(app(F, f), x)), x) → APP(f, x)

The TRS R consists of the following rules:

app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(F, app(app(F, f), x)), x) → APP(f, x)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x0, x1, x2)  =  APP(x1)

Tags:
APP has argument tags [3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(APP(x1, x2)) = 0   
POL(F) = 1   
POL(app(x1, x2)) = 1 + x1 + x2   

The following usable rules [FROCOS05] were oriented: none

(6) Obligation:

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

app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))

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

(7) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(8) TRUE