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


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


MAYBE
Input TRS:
    1: f(true(),x,y,z) -> f(gt(x,plus(y,z)),x,s(y),z)
    2: f(true(),x,y,z) -> f(gt(x,plus(y,z)),x,y,s(z))
    3: plus(n,0()) -> n
    4: plus(n,s(m)) -> s(plus(n,m))
    5: gt(0(),v) -> false()
    6: gt(s(u),0()) -> true()
    7: gt(s(u),s(v)) -> gt(u,v)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(true(),x,y,z) -> #f(gt(x,plus(y,z)),x,y,s(z))
   #2: #f(true(),x,y,z) -> #gt(x,plus(y,z))
   #3: #f(true(),x,y,z) -> #plus(y,z)
   #4: #gt(s(u),s(v)) -> #gt(u,v)
   #5: #f(true(),x,y,z) -> #f(gt(x,plus(y,z)),x,s(y),z)
   #6: #f(true(),x,y,z) -> #gt(x,plus(y,z))
   #7: #f(true(),x,y,z) -> #plus(y,z)
   #8: #plus(n,s(m)) -> #plus(n,m)
Number of SCCs: 3, DPs: 4
  SCC { #8 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gt	w: 0
      #plus	w: x2
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      #gt	w: 0
      #f 	w: 0
      plus	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 3
  SCC { #4 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gt	w: 0
      #plus	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      #gt	w: x1
      #f 	w: 0
      plus	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.