/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 poly ... failed.
Freezing ... 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 }
Sum... succeeded.
  s(x1)		w: (0)
  #nthtail(x1,x2)		w: (0)
  nthtail(x1,x2)		w: (0)
  false()		w: (0)
  #ge(x1,x2)		w: (0)
  true()		w: (0)
  tail(x1)		w: (0)
  #cond(x1,x2,x3)		w: (0)
  0()		w: (0)
  ge(x1,x2)		w: (0)
  nil()		w: (0)
  #tail(x1)		w: (0)
  cons(x1,x2)		w: (1 + x2)
  length(x1)		w: (0)
  #length(x1)		w: (x1)
  cond(x1,x2,x3)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 3
	SCC { #2 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  #nthtail(x1,x2)		w: (0)
  nthtail(x1,x2)		w: (0)
  false()		w: (0)
  #ge(x1,x2)		w: (x2)
  true()		w: (0)
  tail(x1)		w: (0)
  #cond(x1,x2,x3)		w: (0)
  0()		w: (0)
  ge(x1,x2)		w: (0)
  nil()		w: (0)
  #tail(x1)		w: (0)
  cons(x1,x2)		w: (1)
  length(x1)		w: (0)
  #length(x1)		w: (0)
  cond(x1,x2,x3)		w: (0)
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
	SCC { #4 #5 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.