MAYBE

Problem:
 app(nil(),xs) -> nil()
 app(cons(x,xs),ys) -> cons(x,app(xs,ys))
 rev(nil()) -> nil()
 rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))

Proof:
 DP Processor:
  DPs:
   app#(cons(x,xs),ys) -> app#(xs,ys)
   rev#(cons(x,xs)) -> rev#(cons(x,nil()))
  TRS:
   app(nil(),xs) -> nil()
   app(cons(x,xs),ys) -> cons(x,app(xs,ys))
   rev(nil()) -> nil()
   rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))
  TDG Processor:
   DPs:
    app#(cons(x,xs),ys) -> app#(xs,ys)
    rev#(cons(x,xs)) -> rev#(cons(x,nil()))
   TRS:
    app(nil(),xs) -> nil()
    app(cons(x,xs),ys) -> cons(x,app(xs,ys))
    rev(nil()) -> nil()
    rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))
   graph:
    rev#(cons(x,xs)) -> rev#(cons(x,nil())) ->
    rev#(cons(x,xs)) -> rev#(cons(x,nil()))
    app#(cons(x,xs),ys) -> app#(xs,ys) -> app#(cons(x,xs),ys) -> app#(xs,ys)
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 2/4
    DPs:
     app#(cons(x,xs),ys) -> app#(xs,ys)
    TRS:
     app(nil(),xs) -> nil()
     app(cons(x,xs),ys) -> cons(x,app(xs,ys))
     rev(nil()) -> nil()
     rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))
    Subterm Criterion Processor:
     simple projection:
      pi(app#) = 0
     problem:
      DPs:
       
      TRS:
       app(nil(),xs) -> nil()
       app(cons(x,xs),ys) -> cons(x,app(xs,ys))
       rev(nil()) -> nil()
       rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))
     Qed
    
    DPs:
     rev#(cons(x,xs)) -> rev#(cons(x,nil()))
    TRS:
     app(nil(),xs) -> nil()
     app(cons(x,xs),ys) -> cons(x,app(xs,ys))
     rev(nil()) -> nil()
     rev(cons(x,xs)) -> append(xs,rev(cons(x,nil())))
    Open