/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 qsort(nil()) -> nil()
 qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
 lowers(x,nil()) -> nil()
 lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
 greaters(x,nil()) -> nil()
 greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

Proof:
 DP Processor:
  DPs:
   qsort#(.(x,y)) -> greaters#(x,y)
   qsort#(.(x,y)) -> qsort#(greaters(x,y))
   qsort#(.(x,y)) -> lowers#(x,y)
   qsort#(.(x,y)) -> qsort#(lowers(x,y))
   lowers#(x,.(y,z)) -> lowers#(x,z)
   greaters#(x,.(y,z)) -> greaters#(x,z)
  TRS:
   qsort(nil()) -> nil()
   qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
   lowers(x,nil()) -> nil()
   lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
   greaters(x,nil()) -> nil()
   greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
  TDG Processor:
   DPs:
    qsort#(.(x,y)) -> greaters#(x,y)
    qsort#(.(x,y)) -> qsort#(greaters(x,y))
    qsort#(.(x,y)) -> lowers#(x,y)
    qsort#(.(x,y)) -> qsort#(lowers(x,y))
    lowers#(x,.(y,z)) -> lowers#(x,z)
    greaters#(x,.(y,z)) -> greaters#(x,z)
   TRS:
    qsort(nil()) -> nil()
    qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
    lowers(x,nil()) -> nil()
    lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
    greaters(x,nil()) -> nil()
    greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
   graph:
    lowers#(x,.(y,z)) -> lowers#(x,z) ->
    lowers#(x,.(y,z)) -> lowers#(x,z)
    greaters#(x,.(y,z)) -> greaters#(x,z) ->
    greaters#(x,.(y,z)) -> greaters#(x,z)
    qsort#(.(x,y)) -> lowers#(x,y) ->
    lowers#(x,.(y,z)) -> lowers#(x,z)
    qsort#(.(x,y)) -> greaters#(x,y) ->
    greaters#(x,.(y,z)) -> greaters#(x,z)
    qsort#(.(x,y)) -> qsort#(greaters(x,y)) ->
    qsort#(.(x,y)) -> qsort#(lowers(x,y))
    qsort#(.(x,y)) -> qsort#(greaters(x,y)) ->
    qsort#(.(x,y)) -> lowers#(x,y)
    qsort#(.(x,y)) -> qsort#(greaters(x,y)) ->
    qsort#(.(x,y)) -> qsort#(greaters(x,y))
    qsort#(.(x,y)) -> qsort#(greaters(x,y)) ->
    qsort#(.(x,y)) -> greaters#(x,y)
    qsort#(.(x,y)) -> qsort#(lowers(x,y)) ->
    qsort#(.(x,y)) -> qsort#(lowers(x,y))
    qsort#(.(x,y)) -> qsort#(lowers(x,y)) ->
    qsort#(.(x,y)) -> lowers#(x,y)
    qsort#(.(x,y)) -> qsort#(lowers(x,y)) ->
    qsort#(.(x,y)) -> qsort#(greaters(x,y))
    qsort#(.(x,y)) -> qsort#(lowers(x,y)) -> qsort#(.(x,y)) -> greaters#(x,y)
   SCC Processor:
    #sccs: 3
    #rules: 4
    #arcs: 12/36
    DPs:
     qsort#(.(x,y)) -> qsort#(greaters(x,y))
     qsort#(.(x,y)) -> qsort#(lowers(x,y))
    TRS:
     qsort(nil()) -> nil()
     qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
     lowers(x,nil()) -> nil()
     lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
     greaters(x,nil()) -> nil()
     greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
    EDG Processor:
     DPs:
      qsort#(.(x,y)) -> qsort#(greaters(x,y))
      qsort#(.(x,y)) -> qsort#(lowers(x,y))
     TRS:
      qsort(nil()) -> nil()
      qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
      lowers(x,nil()) -> nil()
      lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
      greaters(x,nil()) -> nil()
      greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
     graph:
      
     SCC Processor:
      #sccs: 0
      #rules: 0
      #arcs: 0/4
      
    
    DPs:
     greaters#(x,.(y,z)) -> greaters#(x,z)
    TRS:
     qsort(nil()) -> nil()
     qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
     lowers(x,nil()) -> nil()
     lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
     greaters(x,nil()) -> nil()
     greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
    Subterm Criterion Processor:
     simple projection:
      pi(greaters#) = 1
     problem:
      DPs:
       
      TRS:
       qsort(nil()) -> nil()
       qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
       lowers(x,nil()) -> nil()
       lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
       greaters(x,nil()) -> nil()
       greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
     Qed
    
    DPs:
     lowers#(x,.(y,z)) -> lowers#(x,z)
    TRS:
     qsort(nil()) -> nil()
     qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
     lowers(x,nil()) -> nil()
     lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
     greaters(x,nil()) -> nil()
     greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
    Subterm Criterion Processor:
     simple projection:
      pi(lowers#) = 1
     problem:
      DPs:
       
      TRS:
       qsort(nil()) -> nil()
       qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
       lowers(x,nil()) -> nil()
       lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
       greaters(x,nil()) -> nil()
       greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
     Qed