/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(0(),x) -> x
    2: plus(s(x),y) -> s(plus(x,y))
    3: times(0(),y) -> 0()
    4: times(s(x),y) -> plus(y,times(x,y))
    5: p(s(x)) -> x
    6: p(0()) -> 0()
    7: minus(x,0()) -> x
    8: minus(0(),x) -> 0()
    9: minus(x,s(y)) -> p(minus(x,y))
    10: isZero(0()) -> true()
    11: isZero(s(x)) -> false()
    12: facIter(x,y) -> if(isZero(x),minus(x,s(0())),y,times(y,x))
    13: if(true(),x,y,z) -> y
    14: if(false(),x,y,z) -> facIter(x,z)
    15: factorial(x) -> facIter(x,s(0()))
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #plus(s(x),y) -> #plus(x,y)
   #2: #minus(x,s(y)) -> #p(minus(x,y))
   #3: #minus(x,s(y)) -> #minus(x,y)
   #4: #facIter(x,y) -> #if(isZero(x),minus(x,s(0())),y,times(y,x))
   #5: #facIter(x,y) -> #isZero(x)
   #6: #facIter(x,y) -> #minus(x,s(0()))
   #7: #facIter(x,y) -> #times(y,x)
   #8: #if(false(),x,y,z) -> #facIter(x,z)
   #9: #factorial(x) -> #facIter(x,s(0()))
   #10: #times(s(x),y) -> #plus(y,times(x,y))
   #11: #times(s(x),y) -> #times(x,y)
Number of SCCs: 4, DPs: 5
  SCC { #3 }
POLO(Sum)... succeeded.
      facIter	w: 0
      s 	w: x1 + 1
      #isZero	w: 0
      minus	w: 0
      #plus	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      p 	w: 0
      #times	w: 0
      0 	w: 0
      if	w: 0
      times	w: 0
      #minus	w: x2
      plus	w: 0
      #if	w: 0
      factorial	w: 0
      isZero	w: 0
      #factorial	w: 0
      #facIter	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 3, DPs: 4
  SCC { #11 }
POLO(Sum)... succeeded.
      facIter	w: 0
      s 	w: x1 + 1
      #isZero	w: 0
      minus	w: 0
      #plus	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      p 	w: 0
      #times	w: x1
      0 	w: 0
      if	w: 0
      times	w: 0
      #minus	w: 0
      plus	w: 0
      #if	w: 0
      factorial	w: 0
      isZero	w: 0
      #factorial	w: 0
      #facIter	w: 0
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 2, DPs: 3
  SCC { #1 }
POLO(Sum)... succeeded.
      facIter	w: 0
      s 	w: x1 + 1
      #isZero	w: 0
      minus	w: 0
      #plus	w: x1
      false	w: 0
      #p 	w: 0
      true	w: 0
      p 	w: 0
      #times	w: 0
      0 	w: 0
      if	w: 0
      times	w: 0
      #minus	w: 0
      plus	w: 0
      #if	w: 0
      factorial	w: 0
      isZero	w: 0
      #factorial	w: 0
      #facIter	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2
  SCC { #4 #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.