MAYBE

Problem:
 f(0(),1(),X) -> f(X,X,X)
 g(X,Y) -> X
 g(X,Y) -> Y

Proof:
 DP Processor:
  DPs:
   f#(0(),1(),X) -> f#(X,X,X)
  TRS:
   f(0(),1(),X) -> f(X,X,X)
   g(X,Y) -> X
   g(X,Y) -> Y
  Usable Rule Processor:
   DPs:
    f#(0(),1(),X) -> f#(X,X,X)
   TRS:
    f6(x,y) -> x
    f6(x,y) -> y
   Restore Modifier:
    DPs:
     f#(0(),1(),X) -> f#(X,X,X)
    TRS:
     f(0(),1(),X) -> f(X,X,X)
     g(X,Y) -> X
     g(X,Y) -> Y
    SCC Processor:
     #sccs: 1
     #rules: 1
     #arcs: 1/1
     DPs:
      f#(0(),1(),X) -> f#(X,X,X)
     TRS:
      f(0(),1(),X) -> f(X,X,X)
      g(X,Y) -> X
      g(X,Y) -> Y
     Open