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


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


MAYBE
Input TRS:
    1: p(0(),y) -> y
    2: p(s(x),y) -> s(p(x,y))
    3: p(x,y) ->= s(p(x,y))
Number of strict rules: 2
Direct POLO(bPol) ... removes: 1
      s 	w: x1
      p 	w: x1 + 2 * x2 + 1
      0 	w: 1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #p(s(x),y) -> #p(x,y)
   #2: #p(x,y) ->? #p(x,y)
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #p 	w: x1
      p 	w: 0
      0 	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.