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


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


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