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


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


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