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


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


MAYBE
Input TRS:
    1: while(true(),s(s(s(i)))) -> while(gt(s(s(s(i))),s(0())),f(s(s(s(i)))))
    2: f(i) -> if(neq(i,s(s(0()))),i)
    3: gt(s(x),s(y)) -> gt(x,y)
    4: gt(s(x),0()) -> true()
    5: gt(0(),0()) -> false()
    6: gt(0(),s(y)) -> false()
    7: if(true(),i) -> plus(i,s(0()))
    8: if(false(),i) -> i
    9: neq(s(x),s(y)) -> neq(x,y)
    10: neq(0(),0()) -> false()
    11: neq(0(),s(y)) -> true()
    12: neq(s(x),0()) -> true()
    13: plus(s(x),y) -> plus(x,s(y))
    14: plus(0(),y) -> y
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying gt
1: while(true(),s(s(s(i)))) -> while(gt^1_s(s(s(i)),s(0())),f(s(s(s(i)))))
2: f(i) -> if(neq(i,s(s(0()))),i)
3: gt^1_s(x,s(y)) -> gt(x,y)
4: gt^1_s(x,0()) -> true()
5: gt^1_0(0()) -> false()
6: gt^1_0(s(y)) -> false()
7: if(true(),i) -> plus(i,s(0()))
8: if(false(),i) -> i
9: neq(s(x),s(y)) -> neq(x,y)
10: neq(0(),0()) -> false()
11: neq(0(),s(y)) -> true()
12: neq(s(x),0()) -> true()
13: plus(s(x),y) -> plus(x,s(y))
14: plus(0(),y) -> y
15: gt(0(),_1) ->= gt^1_0(_1)
16: gt(s(_1),_2) ->= gt^1_s(_1,_2)
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #f(i) -> #if(neq(i,s(s(0()))),i)
   #2: #f(i) -> #neq(i,s(s(0())))
   #3: #plus(s(x),y) -> #plus(x,s(y))
   #4: #neq(s(x),s(y)) -> #neq(x,y)
   #5: #if(true(),i) -> #plus(i,s(0()))
   #6: #gt(s(_1),_2) ->? #gt^1_s(_1,_2)
   #7: #gt^1_s(x,s(y)) -> #gt(x,y)
   #8: #while(true(),s(s(s(i)))) -> #while(gt^1_s(s(s(i)),s(0())),f(s(s(s(i)))))
   #9: #while(true(),s(s(s(i)))) -> #gt^1_s(s(s(i)),s(0()))
   #10: #while(true(),s(s(s(i)))) -> #f(s(s(s(i))))
   #11: #gt(0(),_1) ->? #gt^1_0(_1)
Number of SCCs: 4, DPs: 5
  SCC { #3 }
POLO(Sum)... succeeded.
      neq	w: 0
      s 	w: x1 + 1
      gt	w: 0
      #gt^1_0	w: 0
      #plus	w: x1
      false	w: 0
      #while	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      if	w: 0
      gt^1_0	w: 0
      while	w: 0
      #neq	w: 0
      #gt	w: 0
      #f 	w: 0
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      #gt^1_s	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 3, DPs: 4
  SCC { #4 }
POLO(Sum)... succeeded.
      neq	w: 0
      s 	w: x1 + 1
      gt	w: 0
      #gt^1_0	w: 0
      #plus	w: 0
      false	w: 0
      #while	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      if	w: 0
      gt^1_0	w: 0
      while	w: 0
      #neq	w: x2
      #gt	w: 0
      #f 	w: 0
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      #gt^1_s	w: 0
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 2, DPs: 3
  SCC { #6 #7 }
POLO(Sum)... succeeded.
      neq	w: 0
      s 	w: x1 + 2
      gt	w: 0
      #gt^1_0	w: 0
      #plus	w: 0
      false	w: 0
      #while	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      if	w: 0
      gt^1_0	w: 0
      while	w: 0
      #neq	w: 0
      #gt	w: x2 + 1
      #f 	w: 0
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      #gt^1_s	w: x2
    USABLE RULES: { }
    Removed DPs: #6 #7
Number of SCCs: 1, DPs: 1
  SCC { #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.