(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g → h
c → d
h → g
Q is empty.
(1) AAECC Innermost (EQUIVALENT transformation)
We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none
The TRS R 2 is
g → h
c → d
h → g
The signature Sigma is {
c,
g,
d,
h}
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g → h
c → d
h → g
The set Q consists of the following terms:
g
c
h
(3) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
G → H
H → G
The TRS R consists of the following rules:
g → h
c → d
h → g
The set Q consists of the following terms:
g
c
h
We have to consider all minimal (P,Q,R)-chains.