MAYBE

Problem:
 f(s(X),X) -> f(X,a(X))
 f(X,c(X)) -> f(s(X),X)
 f(X,X) -> c(X)

Proof:
 DP Processor:
  DPs:
   f#(s(X),X) -> f#(X,a(X))
   f#(X,c(X)) -> f#(s(X),X)
  TRS:
   f(s(X),X) -> f(X,a(X))
   f(X,c(X)) -> f(s(X),X)
   f(X,X) -> c(X)
  Usable Rule Processor:
   DPs:
    f#(s(X),X) -> f#(X,a(X))
    f#(X,c(X)) -> f#(s(X),X)
   TRS:
    
   Restore Modifier:
    DPs:
     f#(s(X),X) -> f#(X,a(X))
     f#(X,c(X)) -> f#(s(X),X)
    TRS:
     f(s(X),X) -> f(X,a(X))
     f(X,c(X)) -> f(s(X),X)
     f(X,X) -> c(X)
    SCC Processor:
     #sccs: 1
     #rules: 2
     #arcs: 4/4
     DPs:
      f#(s(X),X) -> f#(X,a(X))
      f#(X,c(X)) -> f#(s(X),X)
     TRS:
      f(s(X),X) -> f(X,a(X))
      f(X,c(X)) -> f(s(X),X)
      f(X,X) -> c(X)
     Open