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


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


MAYBE
Input TRS:
    1: cond1(true(),x,y) -> cond2(gr(x,0()),x,y)
    2: cond2(true(),x,y) -> cond1(gr(add(x,y),0()),p(x),y)
    3: cond2(false(),x,y) -> cond3(gr(y,0()),x,y)
    4: cond3(true(),x,y) -> cond1(gr(add(x,y),0()),x,p(y))
    5: cond3(false(),x,y) -> cond1(gr(add(x,y),0()),x,y)
    6: gr(0(),x) -> false()
    7: gr(s(x),0()) -> true()
    8: gr(s(x),s(y)) -> gr(x,y)
    9: add(0(),x) -> x
    10: add(s(x),y) -> s(add(x,y))
    11: p(0()) -> 0()
    12: p(s(x)) -> x
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #cond2(true(),x,y) -> #cond1(gr(add(x,y),0()),p(x),y)
   #2: #cond2(true(),x,y) -> #gr(add(x,y),0())
   #3: #cond2(true(),x,y) -> #add(x,y)
   #4: #cond2(true(),x,y) -> #p(x)
   #5: #add(s(x),y) -> #add(x,y)
   #6: #cond3(false(),x,y) -> #cond1(gr(add(x,y),0()),x,y)
   #7: #cond3(false(),x,y) -> #gr(add(x,y),0())
   #8: #cond3(false(),x,y) -> #add(x,y)
   #9: #cond2(false(),x,y) -> #cond3(gr(y,0()),x,y)
   #10: #cond2(false(),x,y) -> #gr(y,0())
   #11: #cond1(true(),x,y) -> #cond2(gr(x,0()),x,y)
   #12: #cond1(true(),x,y) -> #gr(x,0())
   #13: #gr(s(x),s(y)) -> #gr(x,y)
   #14: #cond3(true(),x,y) -> #cond1(gr(add(x,y),0()),x,p(y))
   #15: #cond3(true(),x,y) -> #gr(add(x,y),0())
   #16: #cond3(true(),x,y) -> #add(x,y)
   #17: #cond3(true(),x,y) -> #p(y)
Number of SCCs: 3, DPs: 7
  SCC { #5 }
POLO(Sum)... succeeded.
      cond2	w: 0
      #cond3	w: 0
      s 	w: x1 + 1
      #cond1	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      cond1	w: 0
      p 	w: 0
      0 	w: 0
      #gr	w: 0
      cond3	w: 0
      #add	w: x1
      add	w: 0
      #cond2	w: 0
      gr	w: 0
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 2, DPs: 6
  SCC { #13 }
POLO(Sum)... succeeded.
      cond2	w: 0
      #cond3	w: 0
      s 	w: x1 + 1
      #cond1	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      cond1	w: 0
      p 	w: 0
      0 	w: 0
      #gr	w: x2
      cond3	w: 0
      #add	w: 0
      add	w: 0
      #cond2	w: 0
      gr	w: 0
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 1, DPs: 5
  SCC { #1 #6 #9 #11 #14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      cond2	w: max(x3 - 1, 0)
      #cond3	w: max(x2, 0)
      s 	w: max(x1 + 3, 0)
      #cond1	w: max(x2, 0)
      false	w: 0
      #p 	w: 0
      true	w: 2
      cond1	w: max(x2 - 1, 0)
      p 	w: max(x1 - 1, 0)
      0 	w: 0
      #gr	w: 0
      cond3	w: max(x2 - 1, 0)
      #add	w: 0
      add	w: max(x1 - 1, x2 - 1, 0)
      #cond2	w: max(x1 - 1, x2, 0)
      gr	w: max(x1 - 1, 0)
    USABLE RULES: { 6 7 11 12 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 4
  SCC { #6 #9 #11 #14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      cond2	w: max(x3 - 1, 0)
      #cond3	w: max(x1 - 1, x3 - 2, 0)
      s 	w: max(x1 + 4, 0)
      #cond1	w: max(x3 - 2, 0)
      false	w: 0
      #p 	w: 0
      true	w: 2
      cond1	w: max(x2 - 1, 0)
      p 	w: max(x1 - 1, 0)
      0 	w: 0
      #gr	w: 0
      cond3	w: max(x2 - 1, 0)
      #add	w: 0
      add	w: max(x1 + 1, 0)
      #cond2	w: max(x3 - 2, 0)
      gr	w: max(x1 - 2, 0)
    USABLE RULES: { 6 7 11 12 }
    Removed DPs: #14
Number of SCCs: 1, DPs: 3
  SCC { #6 #9 #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.