/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) -> f(gt(x,y),plus2(x),plus1(y))
    2: gt(s(x),0()) -> true()
    3: gt(0(),y) -> false()
    4: gt(s(x),s(y)) -> gt(x,y)
    5: plus1(x) -> s(x)
    6: plus2(x) -> s(s(x))
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(true(),x,y) -> #f(gt(x,y),plus2(x),plus1(y))
   #2: #f(true(),x,y) -> #gt(x,y)
   #3: #f(true(),x,y) -> #plus2(x)
   #4: #f(true(),x,y) -> #plus1(y)
   #5: #gt(s(x),s(y)) -> #gt(x,y)
Number of SCCs: 2, DPs: 2
  SCC { #5 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gt	w: 0
      plus1	w: 0
      false	w: 0
      #plus2	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      #gt	w: x1 + x2
      #f 	w: 0
      #plus1	w: 0
      plus2	w: 0
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.