(0) Obligation:

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

f(f(a, f(a, a)), x) → f(x, f(f(a, a), a))

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:

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

The TRS R consists of the following rules:

f(f(a, f(a, a)), x) → f(x, f(f(a, a), a))

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 1 less node.

(4) Obligation:

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

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

The TRS R consists of the following rules:

f(f(a, f(a, a)), x) → f(x, f(f(a, a), a))

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

(5) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
a  =  a
f(x1, x2)  =  f(x2)

From the DPs we obtained the following set of size-change graphs:

  • F(f(a, f(a, a)), x) → F(x, f(f(a, a), a)) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 2 >= 1, 1 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(6) TRUE