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


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


MAYBE
Input TRS:
    1: inc(s(x)) -> s(inc(x))
    2: inc(0()) -> s(0())
    3: plus(x,y) -> ifPlus(eq(x,0()),minus(x,s(0())),x,inc(x))
    4: ifPlus(false(),x,y,z) -> plus(x,z)
    5: ifPlus(true(),x,y,z) -> y
    6: minus(s(x),s(y)) -> minus(x,y)
    7: minus(0(),x) -> 0()
    8: minus(x,0()) -> x
    9: minus(x,x) -> 0()
    10: eq(s(x),s(y)) -> eq(x,y)
    11: eq(0(),s(x)) -> false()
    12: eq(s(x),0()) -> false()
    13: eq(0(),0()) -> true()
    14: eq(x,x) -> true()
    15: times(x,y) -> timesIter(x,y,0())
    16: timesIter(x,y,z) -> ifTimes(eq(x,0()),minus(x,s(0())),y,z,plus(y,z))
    17: ifTimes(true(),x,y,z,u) -> z
    18: ifTimes(false(),x,y,z,u) -> timesIter(x,y,u)
    19: f() -> g()
    20: f() -> h()
Number of strict rules: 20
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #minus(s(x),s(y)) -> #minus(x,y)
   #2: #eq(s(x),s(y)) -> #eq(x,y)
   #3: #timesIter(x,y,z) -> #ifTimes(eq(x,0()),minus(x,s(0())),y,z,plus(y,z))
   #4: #timesIter(x,y,z) -> #eq(x,0())
   #5: #timesIter(x,y,z) -> #minus(x,s(0()))
   #6: #timesIter(x,y,z) -> #plus(y,z)
   #7: #plus(x,y) -> #ifPlus(eq(x,0()),minus(x,s(0())),x,inc(x))
   #8: #plus(x,y) -> #eq(x,0())
   #9: #plus(x,y) -> #minus(x,s(0()))
   #10: #plus(x,y) -> #inc(x)
   #11: #inc(s(x)) -> #inc(x)
   #12: #times(x,y) -> #timesIter(x,y,0())
   #13: #ifPlus(false(),x,y,z) -> #plus(x,z)
   #14: #ifTimes(false(),x,y,z,u) -> #timesIter(x,y,u)
Number of SCCs: 5, DPs: 7
  SCC { #11 }
POLO(Sum)... succeeded.
      h 	w: 0
      ifTimes	w: 0
      timesIter	w: 0
      s 	w: x1 + 1
      minus	w: 0
      #timesIter	w: 0
      #plus	w: 0
      eq	w: 0
      false	w: 0
      #inc	w: x1
      inc	w: 0
      true	w: 0
      f 	w: 0
      #eq	w: 0
      #times	w: 0
      0 	w: 0
      times	w: 0
      #f 	w: 0
      #minus	w: 0
      ifPlus	w: 0
      plus	w: 0
      #ifPlus	w: 0
      g 	w: 0
      #ifTimes	w: 0
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 4, DPs: 6
  SCC { #1 }
POLO(Sum)... succeeded.
      h 	w: 0
      ifTimes	w: 0
      timesIter	w: 0
      s 	w: x1 + 1
      minus	w: 0
      #timesIter	w: 0
      #plus	w: 0
      eq	w: 0
      false	w: 0
      #inc	w: 0
      inc	w: 0
      true	w: 0
      f 	w: 0
      #eq	w: 0
      #times	w: 0
      0 	w: 0
      times	w: 0
      #f 	w: 0
      #minus	w: x2
      ifPlus	w: 0
      plus	w: 0
      #ifPlus	w: 0
      g 	w: 0
      #ifTimes	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 3, DPs: 5
  SCC { #2 }
POLO(Sum)... succeeded.
      h 	w: 0
      ifTimes	w: 0
      timesIter	w: 0
      s 	w: x1 + 1
      minus	w: 0
      #timesIter	w: 0
      #plus	w: 0
      eq	w: 0
      false	w: 0
      #inc	w: 0
      inc	w: 0
      true	w: 0
      f 	w: 0
      #eq	w: x2
      #times	w: 0
      0 	w: 0
      times	w: 0
      #f 	w: 0
      #minus	w: 0
      ifPlus	w: 0
      plus	w: 0
      #ifPlus	w: 0
      g 	w: 0
      #ifTimes	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 4
  SCC { #7 #13 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.