/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(a(x0),p(b(a(x1)),x2)) -> p(x1,p(a(b(a(x1))),x2))
    2: a(b(a(x0))) -> b(a(b(x0)))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a(b(a(x0))) -> #a(b(x0))
   #2: #p(a(x0),p(b(a(x1)),x2)) -> #p(x1,p(a(b(a(x1))),x2))
   #3: #p(a(x0),p(b(a(x1)),x2)) -> #p(a(b(a(x1))),x2)
   #4: #p(a(x0),p(b(a(x1)),x2)) -> #a(b(a(x1)))
Number of SCCs: 2, DPs: 3
  SCC { #1 }
POLO(Sum)... succeeded.
      a 	w: x1 + 1
      b 	w: x1 + 1
      #p 	w: 0
      p 	w: 0
      #a 	w: x1
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2
  SCC { #2 #3 }
POLO(Sum)... succeeded.
      a 	w: 1
      b 	w: 2
      #p 	w: x2
      p 	w: x2 + 1
      #a 	w: 0
    USABLE RULES: { 1 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.