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


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


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