(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → 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:
F(g(x), a) → F(x, g(a))
F(g(x), g(y)) → H(g(y), x, g(y))
H(g(x), y, z) → F(y, h(x, y, z))
H(g(x), y, z) → H(x, y, z)
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → z
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
F(g(x), a) → F(x, g(a))
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,
x2) =
F(
x0,
x1)
H(
x0,
x1,
x2,
x3) =
H(
x0,
x2)
Tags:
F has argument tags [0,1,0] and root tag 1
H has argument tags [0,3,1,0] and root tag 1
Comparison: MIN
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
F(
x1,
x2) =
x2
g(
x1) =
g
a =
a
H(
x1,
x2,
x3) =
x3
h(
x1,
x2,
x3) =
x3
f(
x1,
x2) =
x2
Recursive path order with status [RPO].
Quasi-Precedence:
a > g
Status:
g: []
a: multiset
The following usable rules [FROCOS05] were oriented:
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
f(g(x), a) → f(x, g(a))
h(a, y, z) → z
f(a, g(y)) → g(g(y))
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(g(x), g(y)) → H(g(y), x, g(y))
H(g(x), y, z) → F(y, h(x, y, z))
H(g(x), y, z) → H(x, y, z)
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → z
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.
F(g(x), g(y)) → H(g(y), x, g(y))
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,
x2) =
F(
x1)
H(
x0,
x1,
x2,
x3) =
H(
x0,
x2)
Tags:
F has argument tags [1,6,0] and root tag 1
H has argument tags [0,4,6,7] and root tag 1
Comparison: MIN
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
F(
x1,
x2) =
F
g(
x1) =
g(
x1)
H(
x1,
x2,
x3) =
H(
x1,
x2,
x3)
h(
x1,
x2,
x3) =
h
f(
x1,
x2) =
f
a =
a
Recursive path order with status [RPO].
Quasi-Precedence:
h > [g1, f] > F > H3
h > [g1, f] > a
Status:
F: multiset
g1: multiset
H3: multiset
h: multiset
f: []
a: multiset
The following usable rules [FROCOS05] were oriented:
none
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
H(g(x), y, z) → F(y, h(x, y, z))
H(g(x), y, z) → H(x, y, z)
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → z
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 1 SCC with 1 less node.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
H(g(x), y, z) → H(x, y, z)
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → z
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(9) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
H(g(x), y, z) → 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:
H(
x0,
x1,
x2,
x3) =
H(
x1,
x2)
Tags:
H has argument tags [1,0,0,3] and root tag 0
Comparison: MS
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
H(
x1,
x2,
x3) =
H(
x2,
x3)
g(
x1) =
g(
x1)
Recursive path order with status [RPO].
Quasi-Precedence:
g1 > H2
Status:
H2: multiset
g1: multiset
The following usable rules [FROCOS05] were oriented:
none
(10) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(a, g(y)) → g(g(y))
f(g(x), a) → f(x, g(a))
f(g(x), g(y)) → h(g(y), x, g(y))
h(g(x), y, z) → f(y, h(x, y, z))
h(a, y, z) → z
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(11) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(12) TRUE