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


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


MAYBE
Input TRS:
    1: div(x,y) -> div2(x,y,0())
    2: div2(x,y,i) -> if1(le(y,0()),le(y,x),x,y,plus(i,0()),inc(i))
    3: if1(true(),b,x,y,i,j) -> divZeroError()
    4: if1(false(),b,x,y,i,j) -> if2(b,x,y,i,j)
    5: if2(true(),x,y,i,j) -> div2(minus(x,y),y,j)
    6: if2(false(),x,y,i,j) -> i
    7: inc(0()) -> 0()
    8: inc(s(i)) -> s(inc(i))
    9: le(s(x),0()) -> false()
    10: le(0(),y) -> true()
    11: le(s(x),s(y)) -> le(x,y)
    12: minus(x,0()) -> x
    13: minus(0(),y) -> 0()
    14: minus(s(x),s(y)) -> minus(x,y)
    15: plus(x,y) -> plusIter(x,y,0())
    16: plusIter(x,y,z) -> ifPlus(le(x,z),x,y,z)
    17: ifPlus(true(),x,y,z) -> y
    18: ifPlus(false(),x,y,z) -> plusIter(x,s(y),s(z))
    19: a() -> c()
    20: a() -> d()
Number of strict rules: 20
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #div2(x,y,i) -> #if1(le(y,0()),le(y,x),x,y,plus(i,0()),inc(i))
   #2: #div2(x,y,i) -> #le(y,0())
   #3: #div2(x,y,i) -> #le(y,x)
   #4: #div2(x,y,i) -> #plus(i,0())
   #5: #div2(x,y,i) -> #inc(i)
   #6: #le(s(x),s(y)) -> #le(x,y)
   #7: #minus(s(x),s(y)) -> #minus(x,y)
   #8: #if2(true(),x,y,i,j) -> #div2(minus(x,y),y,j)
   #9: #if2(true(),x,y,i,j) -> #minus(x,y)
   #10: #plusIter(x,y,z) -> #ifPlus(le(x,z),x,y,z)
   #11: #plusIter(x,y,z) -> #le(x,z)
   #12: #div(x,y) -> #div2(x,y,0())
   #13: #inc(s(i)) -> #inc(i)
   #14: #plus(x,y) -> #plusIter(x,y,0())
   #15: #if1(false(),b,x,y,i,j) -> #if2(b,x,y,i,j)
   #16: #ifPlus(false(),x,y,z) -> #plusIter(x,s(y),s(z))
Number of SCCs: 5, DPs: 8
  SCC { #13 }
POLO(Sum)... succeeded.
      a 	w: 0
      le	w: 0
      plusIter	w: 0
      #div	w: 0
      d 	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      #plus	w: 0
      if1	w: 0
      false	w: 0
      div	w: 0
      #inc	w: x1
      c 	w: 0
      inc	w: 0
      true	w: 0
      #if1	w: 0
      if2	w: 0
      0 	w: 0
      div2	w: 0
      divZeroError	w: 0
      #div2	w: 0
      #minus	w: 0
      ifPlus	w: 0
      plus	w: 0
      #a 	w: 0
      #ifPlus	w: 0
      #if2	w: 0
      #plusIter	w: 0
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 4, DPs: 7
  SCC { #6 }
POLO(Sum)... succeeded.
      a 	w: 0
      le	w: 0
      plusIter	w: 0
      #div	w: 0
      d 	w: 0
      s 	w: x1 + 1
      #le	w: x2
      minus	w: 0
      #plus	w: 0
      if1	w: 0
      false	w: 0
      div	w: 0
      #inc	w: 0
      c 	w: 0
      inc	w: 0
      true	w: 0
      #if1	w: 0
      if2	w: 0
      0 	w: 0
      div2	w: 0
      divZeroError	w: 0
      #div2	w: 0
      #minus	w: 0
      ifPlus	w: 0
      plus	w: 0
      #a 	w: 0
      #ifPlus	w: 0
      #if2	w: 0
      #plusIter	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 3, DPs: 6
  SCC { #7 }
POLO(Sum)... succeeded.
      a 	w: 0
      le	w: 0
      plusIter	w: 0
      #div	w: 0
      d 	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      #plus	w: 0
      if1	w: 0
      false	w: 0
      div	w: 0
      #inc	w: 0
      c 	w: 0
      inc	w: 0
      true	w: 0
      #if1	w: 0
      if2	w: 0
      0 	w: 0
      div2	w: 0
      divZeroError	w: 0
      #div2	w: 0
      #minus	w: x2
      ifPlus	w: 0
      plus	w: 0
      #a 	w: 0
      #ifPlus	w: 0
      #if2	w: 0
      #plusIter	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 2, DPs: 5
  SCC { #10 #16 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.