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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
    ↳5 QDP
        ↳6 QDPOrderProof (⇔)
        ↳7 QDP
        ↳8 QDPOrderProof (⇔)
        ↳9 QDP
        ↳10 QDPOrderProof (⇔)
        ↳11 QDP
        ↳12 QDPOrderProof (⇔)
        ↳13 QDP
        ↳14 PisEmptyProof (⇔)
        ↳15 TRUE
    ↳16 QDP
        ↳17 QDPOrderProof (⇔)
        ↳18 QDP
        ↳19 PisEmptyProof (⇔)
        ↳20 TRUE

(0) Obligation:

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

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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:

+1(x, s(y)) → +1(x, y)
+1(s(x), y) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
+1(x, +(y, z)) → +1(x, y)
F(g(f(x))) → F(h(s(0), x))
F(g(h(x, y))) → F(h(s(x), y))
F(h(x, h(y, z))) → F(h(+(x, y), z))
F(h(x, h(y, z))) → +1(x, y)

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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 2 SCCs with 3 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

+1(s(x), y) → +1(x, y)
+1(x, s(y)) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
+1(x, +(y, z)) → +1(x, y)

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

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

POL(+(x1, x2)) = x1 + x2   
POL(+1(x1, x2)) = 1   
POL(0) = 0   
POL(s(x1)) = 1 + x1   

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

+1(s(x), y) → +1(x, y)
+1(x, +(y, z)) → +1(+(x, y), z)
+1(x, +(y, z)) → +1(x, y)

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

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

POL(+(x1, x2)) = x1 + x2   
POL(+1(x1, x2)) = x1 + x2   
POL(0) = 0   
POL(s(x1)) = 1 + x1   

The following usable rules [FROCOS05] were oriented:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)

(9) Obligation:

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

+1(x, +(y, z)) → +1(+(x, y), z)
+1(x, +(y, z)) → +1(x, y)

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

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

POL(+(x1, x2)) = 1 + x1 + x2   
POL(+1(x1, x2)) = x1 + x2   
POL(0) = 0   
POL(s(x1)) = 0   

The following usable rules [FROCOS05] were oriented:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)

(11) Obligation:

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

+1(x, +(y, z)) → +1(+(x, y), z)

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(12) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Tags:
+1 has argument tags [1,3,1] and root tag 0

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

POL(+(x1, x2)) = 1 + x2   
POL(+1(x1, x2)) = 1   
POL(0) = 0   
POL(s(x1)) = 1   

The following usable rules [FROCOS05] were oriented: none

(13) Obligation:

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

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(14) PisEmptyProof (EQUIVALENT transformation)

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

(15) TRUE

(16) Obligation:

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

F(h(x, h(y, z))) → F(h(+(x, y), z))

The TRS R consists of the following rules:

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Tags:
F has argument tags [1,1] and root tag 0

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

POL(+(x1, x2)) = 0   
POL(0) = 0   
POL(F(x1)) = 1 + x1   
POL(h(x1, x2)) = 1 + x2   
POL(s(x1)) = 0   

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

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

(19) PisEmptyProof (EQUIVALENT transformation)

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

(20) TRUE