/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 poly ... failed.
Freezing ... 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 }
Sum... succeeded.
  lowers(x1,x2)		w: (0)
  greaters(x1,x2)		w: (0)
  <=(x1,x2)		w: (0)
  ++(x1,x2)		w: (0)
  qsort(x1)		w: (0)
  #qsort(x1)		w: (0)
  if(x1,x2,x3)		w: (0)
  #lowers(x1,x2)		w: (0)
  nil()		w: (0)
  #greaters(x1,x2)		w: (x2)
  .(x1,x2)		w: (1 + x2)
    USABLE RULES: { }
    Removed DPs: #5 #6
Number of SCCs: 1, DPs: 2
	SCC { #7 #8 }
Sum... succeeded.
  lowers(x1,x2)		w: (0)
  greaters(x1,x2)		w: (0)
  <=(x1,x2)		w: (0)
  ++(x1,x2)		w: (0)
  qsort(x1)		w: (0)
  #qsort(x1)		w: (0)
  if(x1,x2,x3)		w: (0)
  #lowers(x1,x2)		w: (x2)
  nil()		w: (0)
  #greaters(x1,x2)		w: (0)
  .(x1,x2)		w: (1 + x2)
    USABLE RULES: { }
    Removed DPs: #7 #8
Number of SCCs: 0, DPs: 0