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


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


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