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


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


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