MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(0(),1(),X) -> g#(X,X)
   f#(0(),1(),X) -> f#(g(X,X),X,X)
  TRS:
   f(0(),1(),X) -> f(g(X,X),X,X)
   g(X,Y) -> X
   g(X,Y) -> Y
  TDG Processor:
   DPs:
    f#(0(),1(),X) -> g#(X,X)
    f#(0(),1(),X) -> f#(g(X,X),X,X)
   TRS:
    f(0(),1(),X) -> f(g(X,X),X,X)
    g(X,Y) -> X
    g(X,Y) -> Y
   graph:
    f#(0(),1(),X) -> f#(g(X,X),X,X) ->
    f#(0(),1(),X) -> f#(g(X,X),X,X)
    f#(0(),1(),X) -> f#(g(X,X),X,X) -> f#(0(),1(),X) -> g#(X,X)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     f#(0(),1(),X) -> f#(g(X,X),X,X)
    TRS:
     f(0(),1(),X) -> f(g(X,X),X,X)
     g(X,Y) -> X
     g(X,Y) -> Y
    Open