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


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


MAYBE
Input TRS:
    1: nthtail(n,l) -> cond(ge(n,length(l)),n,l)
    2: cond(true(),n,l) -> l
    3: cond(false(),n,l) -> tail(nthtail(s(n),l))
    4: tail(nil()) -> nil()
    5: tail(cons(x,l)) -> l
    6: length(nil()) -> 0()
    7: length(cons(x,l)) -> s(length(l))
    8: ge(u,0()) -> true()
    9: ge(0(),s(v)) -> false()
    10: ge(s(u),s(v)) -> ge(u,v)
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #length(cons(x,l)) -> #length(l)
   #2: #ge(s(u),s(v)) -> #ge(u,v)
   #3: #cond(false(),n,l) -> #tail(nthtail(s(n),l))
   #4: #cond(false(),n,l) -> #nthtail(s(n),l)
   #5: #nthtail(n,l) -> #cond(ge(n,length(l)),n,l)
   #6: #nthtail(n,l) -> #ge(n,length(l))
   #7: #nthtail(n,l) -> #length(l)
Number of SCCs: 3, DPs: 4
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: 0
      #nthtail	w: 0
      nthtail	w: 0
      false	w: 0
      #ge	w: 0
      true	w: 0
      tail	w: 0
      #cond	w: 0
      0 	w: 0
      ge	w: 0
      nil	w: 0
      #tail	w: 0
      cons	w: x2 + 1
      length	w: 0
      #length	w: x1
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 3
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #nthtail	w: 0
      nthtail	w: 0
      false	w: 0
      #ge	w: x1
      true	w: 0
      tail	w: 0
      #cond	w: 0
      0 	w: 0
      ge	w: 0
      nil	w: 0
      #tail	w: 0
      cons	w: 1
      length	w: 0
      #length	w: 0
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #4 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.