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


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


MAYBE
Input TRS:
    1: cond1(true(),x,y) -> cond2(gr(x,y),x,y)
    2: cond2(true(),x,y) -> cond1(gr(x,0()),y,y)
    3: cond2(false(),x,y) -> cond1(gr(x,0()),p(x),y)
    4: gr(0(),x) -> false()
    5: gr(s(x),0()) -> true()
    6: gr(s(x),s(y)) -> gr(x,y)
    7: p(0()) -> 0()
    8: p(s(x)) -> x
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #cond2(true(),x,y) -> #cond1(gr(x,0()),y,y)
   #2: #cond2(true(),x,y) -> #gr(x,0())
   #3: #gr(s(x),s(y)) -> #gr(x,y)
   #4: #cond2(false(),x,y) -> #cond1(gr(x,0()),p(x),y)
   #5: #cond2(false(),x,y) -> #gr(x,0())
   #6: #cond2(false(),x,y) -> #p(x)
   #7: #cond1(true(),x,y) -> #cond2(gr(x,y),x,y)
   #8: #cond1(true(),x,y) -> #gr(x,y)
Number of SCCs: 2, DPs: 4
  SCC { #3 }
POLO(Sum)... succeeded.
      cond2	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: x1 + x2
      #cond2	w: 0
      gr	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 3
  SCC { #1 #4 #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.