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


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


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