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


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


MAYBE
Input TRS:
    1: table() -> gen(s(0()))
    2: gen(x) -> if1(le(x,10()),x)
    3: if1(false(),x) -> nil()
    4: if1(true(),x) -> if2(x,x)
    5: if2(x,y) -> if3(le(y,10()),x,y)
    6: if3(true(),x,y) -> cons(entry(x,y,times(x,y)),if2(x,s(y)))
    7: if3(false(),x,y) -> gen(s(x))
    8: le(0(),y) -> true()
    9: le(s(x),0()) -> false()
    10: le(s(x),s(y)) -> le(x,y)
    11: plus(0(),y) -> y
    12: plus(s(x),y) -> s(plus(x,y))
    13: times(0(),y) -> 0()
    14: times(s(x),y) -> plus(y,times(x,y))
    15: 10() -> s(s(s(s(s(s(s(s(s(s(0()))))))))))
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #gen(x) -> #if1(le(x,10()),x)
   #2: #gen(x) -> #le(x,10())
   #3: #gen(x) -> #10()
   #4: #if3(true(),x,y) -> #times(x,y)
   #5: #if3(true(),x,y) -> #if2(x,s(y))
   #6: #plus(s(x),y) -> #plus(x,y)
   #7: #times(s(x),y) -> #plus(y,times(x,y))
   #8: #times(s(x),y) -> #times(x,y)
   #9: #if3(false(),x,y) -> #gen(s(x))
   #10: #le(s(x),s(y)) -> #le(x,y)
   #11: #if2(x,y) -> #if3(le(y,10()),x,y)
   #12: #if2(x,y) -> #le(y,10())
   #13: #if2(x,y) -> #10()
   #14: #table() -> #gen(s(0()))
   #15: #if1(true(),x) -> #if2(x,x)
Number of SCCs: 4, DPs: 8
  SCC { #8 }
POLO(Sum)... succeeded.
      10	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #plus	w: 0
      if1	w: 0
      false	w: 0
      true	w: 0
      #if1	w: 0
      table	w: 0
      #table	w: 0
      if2	w: 0
      entry	w: 0
      #if3	w: 0
      #times	w: x1
      0 	w: 0
      times	w: 0
      #10	w: 0
      nil	w: 0
      #gen	w: 0
      gen	w: 0
      plus	w: 0
      if3	w: 0
      cons	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 3, DPs: 7
  SCC { #6 }
POLO(Sum)... succeeded.
      10	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #plus	w: x1
      if1	w: 0
      false	w: 0
      true	w: 0
      #if1	w: 0
      table	w: 0
      #table	w: 0
      if2	w: 0
      entry	w: 0
      #if3	w: 0
      #times	w: 0
      0 	w: 0
      times	w: 0
      #10	w: 0
      nil	w: 0
      #gen	w: 0
      gen	w: 0
      plus	w: 0
      if3	w: 0
      cons	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 6
  SCC { #10 }
POLO(Sum)... succeeded.
      10	w: 0
      le	w: 0
      s 	w: x1 + 1
      #le	w: x2
      #plus	w: 0
      if1	w: 0
      false	w: 0
      true	w: 0
      #if1	w: 0
      table	w: 0
      #table	w: 0
      if2	w: 0
      entry	w: 0
      #if3	w: 0
      #times	w: 0
      0 	w: 0
      times	w: 0
      #10	w: 0
      nil	w: 0
      #gen	w: 0
      gen	w: 0
      plus	w: 0
      if3	w: 0
      cons	w: 0
      #if2	w: 0
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 1, DPs: 5
  SCC { #1 #5 #9 #11 #15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.