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


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


MAYBE
Input TRS:
    1: plus(x,y) -> plusIter(x,y,0())
    2: plusIter(x,y,z) -> ifPlus(le(x,z),x,y,z)
    3: ifPlus(true(),x,y,z) -> y
    4: ifPlus(false(),x,y,z) -> plusIter(x,s(y),s(z))
    5: le(s(x),0()) -> false()
    6: le(0(),y) -> true()
    7: le(s(x),s(y)) -> le(x,y)
    8: sum(xs) -> sumIter(xs,0())
    9: sumIter(xs,x) -> ifSum(isempty(xs),xs,x,plus(x,head(xs)))
    10: ifSum(true(),xs,x,y) -> x
    11: ifSum(false(),xs,x,y) -> sumIter(tail(xs),y)
    12: isempty(nil()) -> true()
    13: isempty(cons(x,xs)) -> false()
    14: head(nil()) -> error()
    15: head(cons(x,xs)) -> x
    16: tail(nil()) -> nil()
    17: tail(cons(x,xs)) -> xs
    18: a() -> b()
    19: a() -> c()
Number of strict rules: 19
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #plusIter(x,y,z) -> #ifPlus(le(x,z),x,y,z)
   #2: #plusIter(x,y,z) -> #le(x,z)
   #3: #sumIter(xs,x) -> #ifSum(isempty(xs),xs,x,plus(x,head(xs)))
   #4: #sumIter(xs,x) -> #isempty(xs)
   #5: #sumIter(xs,x) -> #plus(x,head(xs))
   #6: #sumIter(xs,x) -> #head(xs)
   #7: #ifSum(false(),xs,x,y) -> #sumIter(tail(xs),y)
   #8: #ifSum(false(),xs,x,y) -> #tail(xs)
   #9: #le(s(x),s(y)) -> #le(x,y)
   #10: #plus(x,y) -> #plusIter(x,y,0())
   #11: #sum(xs) -> #sumIter(xs,0())
   #12: #ifPlus(false(),x,y,z) -> #plusIter(x,s(y),s(z))
Number of SCCs: 3, DPs: 5
  SCC { #9 }
POLO(Sum)... succeeded.
      a 	w: 0
      isempty	w: 0
      le	w: 0
      plusIter	w: 0
      #ifSum	w: 0
      s 	w: x1 + 1
      #le	w: x1 + x2
      b 	w: 0
      ifSum	w: 0
      #plus	w: 0
      #isempty	w: 0
      false	w: 0
      sumIter	w: 0
      #head	w: 0
      c 	w: 0
      true	w: 0
      sum	w: 0
      tail	w: 0
      error	w: 0
      0 	w: 0
      nil	w: 0
      #tail	w: 0
      #sumIter	w: 0
      ifPlus	w: 0
      plus	w: 0
      head	w: 0
      cons	w: 0
      #a 	w: 0
      #ifPlus	w: 0
      #sum	w: 0
      #plusIter	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 2, DPs: 4
  SCC { #3 #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: 0
      isempty	w: max(x1 + 5, 0)
      le	w: 0
      plusIter	w: max(x1 - 2, x2, x3 + 2, 0)
      #ifSum	w: max(x1, x2 + 5, x3 - 2, x4 + 1, 0)
      s 	w: max(x1 - 1, 0)
      #le	w: 0
      b 	w: 0
      ifSum	w: max(x3 - 1, 0)
      #plus	w: 0
      #isempty	w: 0
      false	w: 6
      sumIter	w: 0
      #head	w: 0
      c 	w: 0
      true	w: 1
      sum	w: max(x1 - 1, 0)
      tail	w: max(x1 - 8, 0)
      error	w: 0
      0 	w: 2
      nil	w: 0
      #tail	w: 0
      #sumIter	w: max(x1 + 5, x2 - 1, 0)
      ifPlus	w: max(x2 - 2, x3, x4 + 2, 0)
      plus	w: max(x1 - 2, x2 + 4, 0)
      head	w: max(x1 - 7, 0)
      cons	w: max(x1 + x2 + 8, 0)
      #a 	w: 0
      #ifPlus	w: 0
      #sum	w: 0
      #plusIter	w: 0
    USABLE RULES: { 1..4 12..17 }
    Removed DPs: #7
Number of SCCs: 1, DPs: 2
  SCC { #1 #12 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.