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


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


MAYBE
Input TRS:
    1: digits() -> d(0())
    2: d(x) -> if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x)
    3: if(true(),x) -> cons(x,d(s(x)))
    4: if(false(),x) -> nil()
    5: le(0(),y) -> true()
    6: le(s(x),0()) -> false()
    7: le(s(x),s(y)) -> le(x,y)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #d(x) -> #if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x)
   #2: #d(x) -> #le(x,s(s(s(s(s(s(s(s(s(0()))))))))))
   #3: #le(s(x),s(y)) -> #le(x,y)
   #4: #if(true(),x) -> #d(s(x))
   #5: #digits() -> #d(0())
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... succeeded.
      le	w: 0
      d 	w: 0
      s 	w: x1 + 1
      #le	w: x2
      false	w: 0
      #digits	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      nil	w: 0
      #d 	w: 0
      digits	w: 0
      cons	w: 0
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 2
  SCC { #1 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.