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


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


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