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


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


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