MAYBE

Problem:
 f(x,y) -> cond(lt(x,y),x,y)
 cond(tt(),x,y) -> f(s(x),s(y))
 lt(0(),y) -> tt()
 lt(s(x),s(y)) -> lt(x,y)

Proof:
 DP Processor:
  DPs:
   f#(x,y) -> lt#(x,y)
   f#(x,y) -> cond#(lt(x,y),x,y)
   cond#(tt(),x,y) -> f#(s(x),s(y))
   lt#(s(x),s(y)) -> lt#(x,y)
  TRS:
   f(x,y) -> cond(lt(x,y),x,y)
   cond(tt(),x,y) -> f(s(x),s(y))
   lt(0(),y) -> tt()
   lt(s(x),s(y)) -> lt(x,y)
  TDG Processor:
   DPs:
    f#(x,y) -> lt#(x,y)
    f#(x,y) -> cond#(lt(x,y),x,y)
    cond#(tt(),x,y) -> f#(s(x),s(y))
    lt#(s(x),s(y)) -> lt#(x,y)
   TRS:
    f(x,y) -> cond(lt(x,y),x,y)
    cond(tt(),x,y) -> f(s(x),s(y))
    lt(0(),y) -> tt()
    lt(s(x),s(y)) -> lt(x,y)
   graph:
    cond#(tt(),x,y) -> f#(s(x),s(y)) ->
    f#(x,y) -> cond#(lt(x,y),x,y)
    cond#(tt(),x,y) -> f#(s(x),s(y)) -> f#(x,y) -> lt#(x,y)
    lt#(s(x),s(y)) -> lt#(x,y) -> lt#(s(x),s(y)) -> lt#(x,y)
    f#(x,y) -> cond#(lt(x,y),x,y) -> cond#(tt(),x,y) -> f#(s(x),s(y))
    f#(x,y) -> lt#(x,y) -> lt#(s(x),s(y)) -> lt#(x,y)
   SCC Processor:
    #sccs: 2
    #rules: 3
    #arcs: 5/16
    DPs:
     cond#(tt(),x,y) -> f#(s(x),s(y))
     f#(x,y) -> cond#(lt(x,y),x,y)
    TRS:
     f(x,y) -> cond(lt(x,y),x,y)
     cond(tt(),x,y) -> f(s(x),s(y))
     lt(0(),y) -> tt()
     lt(s(x),s(y)) -> lt(x,y)
    Open
    
    DPs:
     lt#(s(x),s(y)) -> lt#(x,y)
    TRS:
     f(x,y) -> cond(lt(x,y),x,y)
     cond(tt(),x,y) -> f(s(x),s(y))
     lt(0(),y) -> tt()
     lt(s(x),s(y)) -> lt(x,y)
    Subterm Criterion Processor:
     simple projection:
      pi(lt#) = 1
     problem:
      DPs:
       
      TRS:
       f(x,y) -> cond(lt(x,y),x,y)
       cond(tt(),x,y) -> f(s(x),s(y))
       lt(0(),y) -> tt()
       lt(s(x),s(y)) -> lt(x,y)
     Qed