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


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


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