/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES
Input TRS:
    1: qsort(nil()) -> nil()
    2: qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
    3: lowers(x,nil()) -> nil()
    4: lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
    5: greaters(x,nil()) -> nil()
    6: greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #qsort(.(x,y)) -> #qsort(lowers(x,y))
   #2: #qsort(.(x,y)) -> #lowers(x,y)
   #3: #qsort(.(x,y)) -> #qsort(greaters(x,y))
   #4: #qsort(.(x,y)) -> #greaters(x,y)
   #5: #greaters(x,.(y,z)) -> #greaters(x,z)
   #6: #greaters(x,.(y,z)) -> #greaters(x,z)
   #7: #lowers(x,.(y,z)) -> #lowers(x,z)
   #8: #lowers(x,.(y,z)) -> #lowers(x,z)
Number of SCCs: 2, DPs: 4
  SCC { #5 #6 }
POLO(Sum)... succeeded.
      lowers	w: 0
      greaters	w: 0
      <=	w: 0
      ++	w: 0
      qsort	w: 0
      #qsort	w: 0
      if	w: 0
      #lowers	w: 0
      nil	w: 0
      #greaters	w: x2
      . 	w: x2 + 1
    USABLE RULES: { }
    Removed DPs: #5 #6
Number of SCCs: 1, DPs: 2
  SCC { #7 #8 }
POLO(Sum)... succeeded.
      lowers	w: 0
      greaters	w: 0
      <=	w: 0
      ++	w: 0
      qsort	w: 0
      #qsort	w: 0
      if	w: 0
      #lowers	w: x2
      nil	w: 0
      #greaters	w: 0
      . 	w: x2 + 1
    USABLE RULES: { }
    Removed DPs: #7 #8
Number of SCCs: 0, DPs: 0