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