Termination w.r.t. Q proof of MNZ_10

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

0 QTRS

↳1 DependencyPairsProof (⇔, 0 ms)

↳2 QDP

↳3 DependencyGraphProof (⇔, 0 ms)

↳4 QDP

↳5 TransformationProof (⇔, 0 ms)

↳6 QDP

↳7 DependencyGraphProof (⇔, 0 ms)

↳8 AND

    ↳9 QDP

        ↳10 TransformationProof (⇔, 0 ms)

        ↳11 QDP

        ↳12 DependencyGraphProof (⇔, 0 ms)

        ↳13 QDP

        ↳14 TransformationProof (⇔, 0 ms)

        ↳15 QDP

        ↳16 DependencyGraphProof (⇔, 0 ms)

        ↳17 QDP

        ↳18 TransformationProof (⇔, 0 ms)

        ↳19 QDP

        ↳20 DependencyGraphProof (⇔, 0 ms)

        ↳21 QDP

        ↳22 TransformationProof (⇔, 0 ms)

        ↳23 QDP

        ↳24 DependencyGraphProof (⇔, 0 ms)

        ↳25 QDP

        ↳26 TransformationProof (⇔, 0 ms)

        ↳27 QDP

        ↳28 DependencyGraphProof (⇔, 0 ms)

        ↳29 QDP

        ↳30 TransformationProof (⇔, 4 ms)

        ↳31 QDP

        ↳32 DependencyGraphProof (⇔, 0 ms)

        ↳33 QDP

        ↳34 TransformationProof (⇔, 0 ms)

        ↳35 QDP

        ↳36 DependencyGraphProof (⇔, 0 ms)

        ↳37 QDP

        ↳38 TransformationProof (⇔, 0 ms)

        ↳39 QDP

        ↳40 DependencyGraphProof (⇔, 0 ms)

        ↳41 QDP

        ↳42 QDPOrderProof (⇔, 39 ms)

        ↳43 QDP

        ↳44 QDPOrderProof (⇔, 568 ms)

        ↳45 QDP

        ↳46 QDPOrderProof (⇔, 337 ms)

        ↳47 QDP

        ↳48 QDPOrderProof (⇔, 795 ms)

        ↳49 QDP

        ↳50 PisEmptyProof (⇔, 0 ms)

        ↳51 YES

    ↳52 QDP

        ↳53 QDPOrderProof (⇔, 48 ms)

        ↳54 QDP

        ↳55 DependencyGraphProof (⇔, 0 ms)

        ↳56 QDP

        ↳57 UsableRulesProof (⇔, 0 ms)

        ↳58 QDP

        ↳59 QDPSizeChangeProof (⇔, 0 ms)

        ↳60 YES

(0) Obligation:

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

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(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:

S(s(0)) → F(s(0))
G(x) → H(x, x)
S(x) → H(x, 0)
S(x) → H(0, x)
F(g(x)) → G(g(f(x)))
F(g(x)) → G(f(x))
F(g(x)) → F(x)
G(s(x)) → S(s(g(x)))
G(s(x)) → S(g(x))
G(s(x)) → G(x)
H(f(x), g(x)) → F(s(x))
H(f(x), g(x)) → S(x)
S(s(0)) → K(0)
S(s(s(0))) → K(s(0))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(s(s(0))))))
K(s(s(0))) → S(s(s(s(s(0)))))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
H(k(x), g(x)) → K(s(x))
H(k(x), g(x)) → S(x)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(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:

F(g(x)) → G(g(f(x)))
G(x) → H(x, x)
H(f(x), g(x)) → F(s(x))
F(g(x)) → G(f(x))
G(s(x)) → S(s(g(x)))
S(s(0)) → F(s(0))
F(g(x)) → F(x)
S(s(s(0))) → K(s(0))
K(s(s(0))) → S(s(s(s(s(s(0))))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(s(0)))))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
G(s(x)) → S(g(x))
G(s(x)) → G(x)
H(f(x), g(x)) → S(x)
H(k(x), g(x)) → K(s(x))
H(k(x), g(x)) → S(x)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(5) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule S(s(0)) → F(s(0)) at position [0] we obtained the following new rules [LPAR04]:

S(s(0)) → F(h(0, 0)) → S(s(0)) → F(h(0, 0))

(6) Obligation:

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

F(g(x)) → G(g(f(x)))
G(x) → H(x, x)
H(f(x), g(x)) → F(s(x))
F(g(x)) → G(f(x))
G(s(x)) → S(s(g(x)))
F(g(x)) → F(x)
S(s(s(0))) → K(s(0))
K(s(s(0))) → S(s(s(s(s(s(0))))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(s(0)))))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
G(s(x)) → S(g(x))
G(s(x)) → G(x)
H(f(x), g(x)) → S(x)
H(k(x), g(x)) → K(s(x))
H(k(x), g(x)) → S(x)
S(s(0)) → F(h(0, 0))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 6 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

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

K(s(s(0))) → S(s(s(s(s(s(0))))))
S(s(s(0))) → K(s(0))
K(s(s(0))) → S(s(s(s(s(0)))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(10) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule S(s(s(0))) → K(s(0)) at position [0] we obtained the following new rules [LPAR04]:

S(s(s(0))) → K(h(0, 0)) → S(s(s(0))) → K(h(0, 0))

(11) Obligation:

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

K(s(s(0))) → S(s(s(s(s(s(0))))))
K(s(s(0))) → S(s(s(s(s(0)))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
S(s(s(0))) → K(h(0, 0))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(12) DependencyGraphProof (EQUIVALENT transformation)

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

(13) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(s(s(0))))))
K(s(s(0))) → S(s(s(s(s(0)))))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(14) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(s(s(s(s(s(0)))))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(h(s(s(s(s(0)))), 0)) → K(s(s(0))) → S(h(s(s(s(s(0)))), 0))
K(s(s(0))) → S(h(0, s(s(s(s(0)))))) → K(s(s(0))) → S(h(0, s(s(s(s(0))))))
K(s(s(0))) → S(s(h(s(s(s(0))), 0))) → K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0)))))) → K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0)))) → K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0)))))) → K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0))))) → K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0)))))) → K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0))))) → K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0)))))) → K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0))))) → K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0)))))) → K(s(s(0))) → S(s(s(s(s(h(0, 0))))))

(15) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(s(0)))))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
K(s(s(0))) → S(h(s(s(s(s(0)))), 0))
K(s(s(0))) → S(h(0, s(s(s(s(0))))))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(16) DependencyGraphProof (EQUIVALENT transformation)

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

(17) Obligation:

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

K(s(s(0))) → S(s(s(s(s(0)))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(18) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(s(s(s(s(0))))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(h(s(s(s(0))), 0)) → K(s(s(0))) → S(h(s(s(s(0))), 0))
K(s(s(0))) → S(h(0, s(s(s(0))))) → K(s(s(0))) → S(h(0, s(s(s(0)))))
K(s(s(0))) → S(s(h(s(s(0)), 0))) → K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0))))) → K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0)))) → K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0))))) → K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0)))) → K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0))))) → K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0)))) → K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0))))) → K(s(s(0))) → S(s(s(s(h(0, 0)))))

(19) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(s(0))))
K(s(s(0))) → S(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(h(s(s(s(0))), 0))
K(s(s(0))) → S(h(0, s(s(s(0)))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(20) DependencyGraphProof (EQUIVALENT transformation)

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

(21) Obligation:

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

K(s(s(0))) → S(s(s(s(0))))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(22) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(s(s(s(0)))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(h(s(s(0)), 0)) → K(s(s(0))) → S(h(s(s(0)), 0))
K(s(s(0))) → S(h(0, s(s(0)))) → K(s(s(0))) → S(h(0, s(s(0))))
K(s(s(0))) → S(k(s(0))) → K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0)))) → K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0))) → K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0)))) → K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0))) → K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0)))) → K(s(s(0))) → S(s(s(h(0, 0))))

(23) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(h(s(s(0)), 0))
K(s(s(0))) → S(h(0, s(s(0))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(24) DependencyGraphProof (EQUIVALENT transformation)

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

(25) Obligation:

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

K(s(s(0))) → S(s(s(0)))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(26) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(s(s(0))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(f(s(0))) → K(s(s(0))) → S(f(s(0)))
K(s(s(0))) → S(h(s(0), 0)) → K(s(s(0))) → S(h(s(0), 0))
K(s(s(0))) → S(h(0, s(0))) → K(s(s(0))) → S(h(0, s(0)))
K(s(s(0))) → S(k(0)) → K(s(s(0))) → S(k(0))
K(s(s(0))) → S(s(h(0, 0))) → K(s(s(0))) → S(s(h(0, 0)))

(27) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(f(s(0)))
K(s(s(0))) → S(h(s(0), 0))
K(s(s(0))) → S(h(0, s(0)))
K(s(s(0))) → S(k(0))
K(s(s(0))) → S(s(h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(28) DependencyGraphProof (EQUIVALENT transformation)

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

(29) Obligation:

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

K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(f(s(0)))
K(s(s(0))) → S(k(0))
K(s(s(0))) → S(s(h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(30) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(f(s(0))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(f(h(0, 0))) → K(s(s(0))) → S(f(h(0, 0)))

(31) Obligation:

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

K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(k(0))
K(s(s(0))) → S(s(h(0, 0)))
K(s(s(0))) → S(f(h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(32) DependencyGraphProof (EQUIVALENT transformation)

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

(33) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(k(0))
K(s(s(0))) → S(s(h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(34) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(k(0)) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(0) → K(s(s(0))) → S(0)

(35) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(s(h(0, 0)))
K(s(s(0))) → S(0)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(36) DependencyGraphProof (EQUIVALENT transformation)

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

(37) Obligation:

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

K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(s(h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(38) TransformationProof (EQUIVALENT transformation)

By narrowing [LPAR04] the rule K(s(s(0))) → S(s(h(0, 0))) at position [0] we obtained the following new rules [LPAR04]:

K(s(s(0))) → S(h(h(0, 0), 0)) → K(s(s(0))) → S(h(h(0, 0), 0))
K(s(s(0))) → S(h(0, h(0, 0))) → K(s(s(0))) → S(h(0, h(0, 0)))

(39) Obligation:

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

K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))
K(s(s(0))) → S(h(h(0, 0), 0))
K(s(s(0))) → S(h(0, h(0, 0)))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(40) DependencyGraphProof (EQUIVALENT transformation)

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

(41) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(k(0)))
K(s(s(0))) → S(s(s(h(0, 0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(42) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

K(s(s(0))) → S(k(s(0)))
K(s(s(0))) → S(s(k(0)))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

POL(S(x₁)) = 1 +
[ 0, 1 ]

· x₁

POL(s(x₁)) =
/ 1 \

\ 1 /

+
/ 0 0 \

\ 1 0 /

· x₁

POL(0) =
/ 0 \

\ 0 /

POL(K(x₁)) = 1 +
[ 0, 1 ]

· x₁

POL(h(x₁, x₂)) =
/ 1 \

\ 1 /

+
/ 0 0 \

\ 1 0 /

· x₁ +
/ 0 0 \

\ 0 0 /

· x₂

POL(k(x₁)) =
/ 0 \

\ 0 /

+
/ 1 0 \

\ 0 1 /

· x₁

POL(f(x₁)) =
/ 1 \

\ 1 /

+
/ 0 0 \

\ 1 0 /

· x₁

POL(g(x₁)) =
/ 1 \

\ 1 /

+
/ 0 0 \

\ 1 0 /

· x₁

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(x) → h(x, x)
h(f(x), g(x)) → f(s(x))
h(k(x), g(x)) → k(s(x))
k(s(s(0))) → s(s(s(s(s(s(0))))))
s(s(0)) → f(s(0))
s(s(s(0))) → k(s(0))
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
g(s(x)) → s(s(g(x)))
s(s(0)) → k(0)
k(0) → 0
k(s(0)) → s(0)

(43) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(k(0))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(s(h(0, 0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(44) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

K(s(s(0))) → S(s(h(s(s(s(0))), 0)))
K(s(s(0))) → S(s(h(0, s(s(s(0))))))
K(s(s(0))) → S(s(s(h(s(s(0)), 0))))
K(s(s(0))) → S(s(s(h(0, s(s(0))))))
K(s(s(0))) → S(s(s(s(f(s(0))))))
K(s(s(0))) → S(s(s(s(h(s(0), 0)))))
K(s(s(0))) → S(s(s(s(h(0, s(0))))))
K(s(s(0))) → S(s(s(s(s(h(0, 0))))))
K(s(s(0))) → S(s(h(s(s(0)), 0)))
K(s(s(0))) → S(s(h(0, s(s(0)))))
K(s(s(0))) → S(s(s(f(s(0)))))
K(s(s(0))) → S(s(s(h(s(0), 0))))
K(s(s(0))) → S(s(s(h(0, s(0)))))
K(s(s(0))) → S(s(s(s(h(0, 0)))))
K(s(s(0))) → S(s(f(s(0))))
K(s(s(0))) → S(s(h(s(0), 0)))
K(s(s(0))) → S(s(h(0, s(0))))
K(s(s(0))) → S(s(s(h(0, 0))))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(S(x₁)) = -I +
[ 0A, -I, -I ]

· x₁

POL(s(x₁)) =
/ 0A \

| -I |

\ -I /

+
/ 0A -I 1A \

| 0A -I 1A |

\ -I -I -I /

· x₁

POL(0) =
/ 2A \

| -I |

\ -I /

POL(K(x₁)) = 1A +
[ 0A, -I, -I ]

· x₁

POL(h(x₁, x₂)) =
/ 0A \

| -I |

\ -I /

+
/ -I -I 0A \

| -I -I 0A |

\ -I -I -I /

· x₁ +
/ -I -I 0A \

| -I -I 0A |

\ -I -I -I /

· x₂

POL(k(x₁)) =
/ 2A \

| 2A |

\ -I /

+
/ -I -I 0A \

| -I -I -I |

\ -I -I -I /

· x₁

POL(f(x₁)) =
/ 0A \

| -I |

\ -I /

+
/ -I -I 2A \

| -I -I 3A |

\ -I -I 2A /

· x₁

POL(g(x₁)) =
/ 3A \

| 3A |

\ 2A /

+
/ 0A -I 0A \

| 1A -I 0A |

\ -I -I 0A /

· x₁

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(x) → h(x, x)
h(f(x), g(x)) → f(s(x))
h(k(x), g(x)) → k(s(x))
k(s(s(0))) → s(s(s(s(s(s(0))))))
s(s(0)) → f(s(0))
s(s(s(0))) → k(s(0))
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
g(s(x)) → s(s(g(x)))
s(s(0)) → k(0)
k(0) → 0
k(s(0)) → s(0)

(45) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(k(s(0))))
K(s(s(0))) → S(s(s(k(0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

K(s(s(0))) → S(s(k(s(0))))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(S(x₁)) = 3A +
[ 1A, -I, 0A ]

· x₁

POL(s(x₁)) =
/ 0A \

| -I |

\ 1A /

+
/ 0A 2A -I \

| -I -I 1A |

\ -I -I 0A /

· x₁

POL(0) =
/ 0A \

| -I |

\ -I /

POL(K(x₁)) = 1A +
[ 3A, 3A, -I ]

· x₁

POL(k(x₁)) =
/ 0A \

| -I |

\ 1A /

+
/ 0A 2A -I \

| -I 0A -I |

\ -I -I 0A /

· x₁

POL(h(x₁, x₂)) =
/ 0A \

| -I |

\ -I /

+
/ -I -I -I \

| -I -I 1A |

\ -I -I 0A /

· x₁ +
/ 0A -I -I \

| -I -I 1A |

\ -I -I -I /

· x₂

POL(f(x₁)) =
/ 0A \

| -I |

\ 0A /

+
/ 0A 2A -I \

| -I 0A 0A |

\ -I -I -I /

· x₁

POL(g(x₁)) =
/ 0A \

| 1A |

\ 0A /

+
/ 0A 2A 3A \

| -I -I 1A |

\ -I -I 0A /

· x₁

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(x) → h(x, x)
h(f(x), g(x)) → f(s(x))
h(k(x), g(x)) → k(s(x))
k(s(s(0))) → s(s(s(s(s(s(0))))))
s(s(0)) → f(s(0))
s(s(s(0))) → k(s(0))
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
g(s(x)) → s(s(g(x)))
s(s(0)) → k(0)
k(0) → 0
k(s(0)) → s(0)

(47) Obligation:

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

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(k(0))))

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

S(s(s(s(s(s(s(s(0)))))))) → K(s(s(0)))
K(s(s(0))) → S(s(s(k(s(0)))))
K(s(s(0))) → S(s(s(s(k(0)))))
K(s(s(0))) → S(s(s(k(0))))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

POL(S(x₁)) = 1 +
[ 0, 1 ]

· x₁

POL(s(x₁)) =
/ 0 \

\ 2 /

+
/ 0 1 \

\ 1 0 /

· x₁

POL(0) =
/ 0 \

\ 0 /

POL(K(x₁)) = 2 +
[ 0, 3 ]

· x₁

POL(k(x₁)) =
/ 2 \

\ 2 /

+
/ 2 0 \

\ 3 0 /

· x₁

POL(h(x₁, x₂)) =
/ 0 \

\ 0 /

+
/ 0 1 \

\ 1 0 /

· x₁ +
/ 0 1 \

\ 1 0 /

· x₂

POL(f(x₁)) =
/ 0 \

\ 0 /

+
/ 0 0 \

\ 0 0 /

· x₁

POL(g(x₁)) =
/ 0 \

\ 0 /

+
/ 3 3 \

\ 2 2 /

· x₁

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(x) → h(x, x)
h(f(x), g(x)) → f(s(x))
h(k(x), g(x)) → k(s(x))
k(s(s(0))) → s(s(s(s(s(s(0))))))
s(s(0)) → f(s(0))
s(s(s(0))) → k(s(0))
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
g(s(x)) → s(s(g(x)))
s(s(0)) → k(0)
k(0) → 0
k(s(0)) → s(0)

(49) Obligation:

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

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(50) PisEmptyProof (EQUIVALENT transformation)

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

(51) YES

(52) Obligation:

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

G(x) → H(x, x)
H(f(x), g(x)) → F(s(x))
F(g(x)) → G(g(f(x)))
G(s(x)) → G(x)
F(g(x)) → G(f(x))
F(g(x)) → F(x)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(53) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

F(g(x)) → G(g(f(x)))
F(g(x)) → G(f(x))
F(g(x)) → F(x)

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( F(x₁) ) = x₁

POL( G(x₁) ) = 0

POL( f(x₁) ) = 2x₁

POL( g(x₁) ) = x₁ + 2

POL( h(x₁, x₂) ) = 0

POL( s(x₁) ) = max{0, -2}

POL( k(x₁) ) = max{0, -2}

POL( 0 ) = 0

POL( H(x₁, x₂) ) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

f(g(x)) → g(g(f(x)))
g(x) → h(x, x)
h(f(x), g(x)) → f(s(x))
h(k(x), g(x)) → k(s(x))
k(s(s(0))) → s(s(s(s(s(s(0))))))
s(s(0)) → f(s(0))
s(s(s(0))) → k(s(0))
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
g(s(x)) → s(s(g(x)))
s(x) → h(x, 0)
s(x) → h(0, x)
s(s(0)) → k(0)
k(0) → 0
k(s(0)) → s(0)

(54) Obligation:

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

G(x) → H(x, x)
H(f(x), g(x)) → F(s(x))
G(s(x)) → G(x)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(55) DependencyGraphProof (EQUIVALENT transformation)

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

(56) Obligation:

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

G(s(x)) → G(x)

The TRS R consists of the following rules:

s(s(0)) → f(s(0))
g(x) → h(x, x)
s(x) → h(x, 0)
s(x) → h(0, x)
f(g(x)) → g(g(f(x)))
g(s(x)) → s(s(g(x)))
h(f(x), g(x)) → f(s(x))
s(s(0)) → k(0)
k(0) → 0
s(s(s(0))) → k(s(0))
k(s(0)) → s(0)
s(s(s(s(s(s(s(s(0)))))))) → k(s(s(0)))
k(s(s(0))) → s(s(s(s(s(s(0))))))
h(k(x), g(x)) → k(s(x))

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

(57) UsableRulesProof (EQUIVALENT transformation)

We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.

(58) Obligation:

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

G(s(x)) → G(x)

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

(59) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

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

G(s(x)) → G(x)
The graph contains the following edges 1 > 1

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) DependencyGraphProof (EQUIVALENT transformation)

(4) Obligation:

(5) TransformationProof (EQUIVALENT transformation)

(6) Obligation:

(7) DependencyGraphProof (EQUIVALENT transformation)

(8) Complex Obligation (AND)

(9) Obligation:

(10) TransformationProof (EQUIVALENT transformation)

(11) Obligation:

(12) DependencyGraphProof (EQUIVALENT transformation)

(13) Obligation:

(14) TransformationProof (EQUIVALENT transformation)

(15) Obligation:

(16) DependencyGraphProof (EQUIVALENT transformation)

(17) Obligation:

(18) TransformationProof (EQUIVALENT transformation)

(19) Obligation:

(20) DependencyGraphProof (EQUIVALENT transformation)

(21) Obligation:

(22) TransformationProof (EQUIVALENT transformation)

(23) Obligation:

(24) DependencyGraphProof (EQUIVALENT transformation)

(25) Obligation:

(26) TransformationProof (EQUIVALENT transformation)

(27) Obligation:

(28) DependencyGraphProof (EQUIVALENT transformation)

(29) Obligation:

(30) TransformationProof (EQUIVALENT transformation)

(31) Obligation:

(32) DependencyGraphProof (EQUIVALENT transformation)

(33) Obligation:

(34) TransformationProof (EQUIVALENT transformation)

(35) Obligation:

(36) DependencyGraphProof (EQUIVALENT transformation)

(37) Obligation:

(38) TransformationProof (EQUIVALENT transformation)

(39) Obligation:

(40) DependencyGraphProof (EQUIVALENT transformation)

(41) Obligation:

(42) QDPOrderProof (EQUIVALENT transformation)

(43) Obligation:

(44) QDPOrderProof (EQUIVALENT transformation)

(45) Obligation:

(46) QDPOrderProof (EQUIVALENT transformation)

(47) Obligation:

(48) QDPOrderProof (EQUIVALENT transformation)

(49) Obligation:

(50) PisEmptyProof (EQUIVALENT transformation)

(51) YES

(52) Obligation:

(53) QDPOrderProof (EQUIVALENT transformation)

(54) Obligation:

(55) DependencyGraphProof (EQUIVALENT transformation)

(56) Obligation:

(57) UsableRulesProof (EQUIVALENT transformation)

(58) Obligation:

(59) QDPSizeChangeProof (EQUIVALENT transformation)

(60) YES