The rewrite relation of the following TRS is considered.
a__c | → | a__f(g(c)) | (1) |
a__f(g(X)) | → | g(X) | (2) |
mark(c) | → | a__c | (3) |
mark(f(X)) | → | a__f(X) | (4) |
mark(g(X)) | → | g(X) | (5) |
a__c | → | c | (6) |
a__f(X) | → | f(X) | (7) |
a__c# | → | a__f#(g(c)) | (8) |
mark#(f(X)) | → | a__f#(X) | (9) |
mark#(c) | → | a__c# | (10) |
The dependency pairs are split into 0 components.