/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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) -> plus(s(0()),x)
    6: plus2(x) -> plus(s(s(0())),x)
    7: plus(0(),y) -> y
    8: plus(s(x),y) -> plus(x,s(y))
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying plus
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) -> plus^1_s(0(),x)
6: plus2(x) -> plus^1_s(s(0()),x)
7: plus^1_0(y) -> y
8: plus^1_s(x,y) -> plus(x,s(y))
9: plus(0(),_1) ->= plus^1_0(_1)
10: plus(s(_1),_2) ->= plus^1_s(_1,_2)
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #plus2(x) -> #plus^1_s(s(0()),x)
   #2: #plus(0(),_1) ->? #plus^1_0(_1)
   #3: #plus(s(_1),_2) ->? #plus^1_s(_1,_2)
   #4: #plus1(x) -> #plus^1_s(0(),x)
   #5: #f(true(),x,y) -> #f(gt(x,y),plus2(x),plus1(y))
   #6: #f(true(),x,y) -> #gt(x,y)
   #7: #f(true(),x,y) -> #plus2(x)
   #8: #f(true(),x,y) -> #plus1(y)
   #9: #plus^1_s(x,y) -> #plus(x,s(y))
   #10: #gt(s(x),s(y)) -> #gt(x,y)
Number of SCCs: 3, DPs: 4
  SCC { #10 }
POLO(Sum)... succeeded.
      plus^1_s	w: 0
      plus^1_0	w: 0
      s 	w: x1 + 1
      #plus^1_0	w: 0
      gt	w: 0
      plus1	w: 0
      #plus	w: 0
      false	w: 0
      #plus2	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      #gt	w: x2
      #f 	w: 0
      plus	w: 0
      #plus1	w: 0
      #plus^1_s	w: 0
      plus2	w: 0
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 2, DPs: 3
  SCC { #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.