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


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


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