MAYBE

Problem:
 merge(x,nil()) -> x
 merge(nil(),y) -> y
 merge(++(x,y),++(u(),v())) -> ++(x,merge(y,++(u(),v())))
 merge(++(x,y),++(u(),v())) -> ++(u(),merge(++(x,y),v()))

Proof:
 DP Processor:
  DPs:
   merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
   merge#(++(x,y),++(u(),v())) -> merge#(++(x,y),v())
  TRS:
   merge(x,nil()) -> x
   merge(nil(),y) -> y
   merge(++(x,y),++(u(),v())) -> ++(x,merge(y,++(u(),v())))
   merge(++(x,y),++(u(),v())) -> ++(u(),merge(++(x,y),v()))
  Usable Rule Processor:
   DPs:
    merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
    merge#(++(x,y),++(u(),v())) -> merge#(++(x,y),v())
   TRS:
    
   ADG Processor:
    DPs:
     merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
     merge#(++(x,y),++(u(),v())) -> merge#(++(x,y),v())
    TRS:
     
    graph:
     merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v())) ->
     merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
     merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v())) ->
     merge#(++(x,y),++(u(),v())) -> merge#(++(x,y),v())
    Restore Modifier:
     DPs:
      merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
      merge#(++(x,y),++(u(),v())) -> merge#(++(x,y),v())
     TRS:
      merge(x,nil()) -> x
      merge(nil(),y) -> y
      merge(++(x,y),++(u(),v())) -> ++(x,merge(y,++(u(),v())))
      merge(++(x,y),++(u(),v())) -> ++(u(),merge(++(x,y),v()))
     SCC Processor:
      #sccs: 1
      #rules: 1
      #arcs: 2/4
      DPs:
       merge#(++(x,y),++(u(),v())) -> merge#(y,++(u(),v()))
      TRS:
       merge(x,nil()) -> x
       merge(nil(),y) -> y
       merge(++(x,y),++(u(),v())) -> ++(x,merge(y,++(u(),v())))
       merge(++(x,y),++(u(),v())) -> ++(u(),merge(++(x,y),v()))
      Open