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


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


MAYBE
Input TRS:
    1: qsort(nil()) -> nil()
    2: qsort(cons(x,xs)) -> append(qsort(filterlow(x,cons(x,xs))),cons(x,qsort(filterhigh(x,cons(x,xs)))))
    3: filterlow(n,nil()) -> nil()
    4: filterlow(n,cons(x,xs)) -> if1(ge(n,x),n,x,xs)
    5: if1(true(),n,x,xs) -> filterlow(n,xs)
    6: if1(false(),n,x,xs) -> cons(x,filterlow(n,xs))
    7: filterhigh(n,nil()) -> nil()
    8: filterhigh(n,cons(x,xs)) -> if2(ge(x,n),n,x,xs)
    9: if2(true(),n,x,xs) -> filterhigh(n,xs)
    10: if2(false(),n,x,xs) -> cons(x,filterhigh(n,xs))
    11: ge(x,0()) -> true()
    12: ge(0(),s(x)) -> false()
    13: ge(s(x),s(y)) -> ge(x,y)
    14: append(nil(),ys()) -> ys()
    15: append(cons(x,xs),ys()) -> cons(x,append(xs,ys()))
Number of strict rules: 15
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #qsort(cons(x,xs)) -> #append(qsort(filterlow(x,cons(x,xs))),cons(x,qsort(filterhigh(x,cons(x,xs)))))
   #2: #qsort(cons(x,xs)) -> #qsort(filterlow(x,cons(x,xs)))
   #3: #qsort(cons(x,xs)) -> #filterlow(x,cons(x,xs))
   #4: #qsort(cons(x,xs)) -> #qsort(filterhigh(x,cons(x,xs)))
   #5: #qsort(cons(x,xs)) -> #filterhigh(x,cons(x,xs))
   #6: #if1(false(),n,x,xs) -> #filterlow(n,xs)
   #7: #ge(s(x),s(y)) -> #ge(x,y)
   #8: #if2(true(),n,x,xs) -> #filterhigh(n,xs)
   #9: #if2(false(),n,x,xs) -> #filterhigh(n,xs)
   #10: #if1(true(),n,x,xs) -> #filterlow(n,xs)
   #11: #filterhigh(n,cons(x,xs)) -> #if2(ge(x,n),n,x,xs)
   #12: #filterhigh(n,cons(x,xs)) -> #ge(x,n)
   #13: #append(cons(x,xs),ys()) -> #append(xs,ys())
   #14: #filterlow(n,cons(x,xs)) -> #if1(ge(n,x),n,x,xs)
   #15: #filterlow(n,cons(x,xs)) -> #ge(n,x)
Number of SCCs: 5, DPs: 10
	SCC { #13 }
Sum... succeeded.
  s(x1)		w: (0)
  #append(x1,x2)		w: (x2 + x1)
  if1(x1,x2,x3,x4)		w: (0)
  false()		w: (0)
  #ge(x1,x2)		w: (0)
  filterlow(x1,x2)		w: (0)
  qsort(x1)		w: (0)
  true()		w: (0)
  #if1(x1,x2,x3,x4)		w: (0)
  if2(x1,x2,x3,x4)		w: (0)
  #qsort(x1)		w: (0)
  append(x1,x2)		w: (0)
  0()		w: (0)
  ge(x1,x2)		w: (0)
  nil()		w: (0)
  #filterlow(x1,x2)		w: (0)
  cons(x1,x2)		w: (1 + x2)
  filterhigh(x1,x2)		w: (0)
  ys()		w: (1)
  #filterhigh(x1,x2)		w: (0)
  #if2(x1,x2,x3,x4)		w: (0)
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 4, DPs: 9
	SCC { #7 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  #append(x1,x2)		w: (0)
  if1(x1,x2,x3,x4)		w: (0)
  false()		w: (0)
  #ge(x1,x2)		w: (x2)
  filterlow(x1,x2)		w: (0)
  qsort(x1)		w: (0)
  true()		w: (0)
  #if1(x1,x2,x3,x4)		w: (0)
  if2(x1,x2,x3,x4)		w: (0)
  #qsort(x1)		w: (0)
  append(x1,x2)		w: (0)
  0()		w: (0)
  ge(x1,x2)		w: (0)
  nil()		w: (0)
  #filterlow(x1,x2)		w: (0)
  cons(x1,x2)		w: (1)
  filterhigh(x1,x2)		w: (0)
  ys()		w: (1)
  #filterhigh(x1,x2)		w: (0)
  #if2(x1,x2,x3,x4)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 3, DPs: 8
	SCC { #2 #4 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.