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


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


YES
Input TRS:
    1: t(o(x1)) -> m(a(x1))
    2: t(e(x1)) -> n(s(x1))
    3: a(l(x1)) -> a(t(x1))
    4: o(m(a(x1))) -> t(e(n(x1)))
    5: s(a(x1)) -> l(a(t(o(m(a(t(e(x1))))))))
    6: n(s(x1)) -> a(l(a(t(x1))))
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #t(e(x1)) -> #n(s(x1))
   #2: #t(e(x1)) -> #s(x1)
   #3: #n(s(x1)) -> #a(l(a(t(x1))))
   #4: #n(s(x1)) -> #a(t(x1))
   #5: #n(s(x1)) -> #t(x1)
   #6: #s(a(x1)) -> #a(t(o(m(a(t(e(x1)))))))
   #7: #s(a(x1)) -> #t(o(m(a(t(e(x1))))))
   #8: #s(a(x1)) -> #o(m(a(t(e(x1)))))
   #9: #s(a(x1)) -> #a(t(e(x1)))
   #10: #s(a(x1)) -> #t(e(x1))
   #11: #a(l(x1)) -> #a(t(x1))
   #12: #a(l(x1)) -> #t(x1)
   #13: #t(o(x1)) -> #a(x1)
   #14: #o(m(a(x1))) -> #t(e(n(x1)))
   #15: #o(m(a(x1))) -> #n(x1)
Number of SCCs: 1, DPs: 11
  SCC { #1..3 #5 #7 #8 #10 #12..15 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 + 11, 0)
      s 	w: max(x1 + 38, 0)
      n 	w: max(x1 - 27, 0)
      t 	w: max(x1 - 49, 0)
      l 	w: max(x1 - 49, 0)
      o 	w: max(x1 + 65, 0)
      #s 	w: max(x1 - 2, 0)
      #o 	w: max(x1 + 4, 0)
      e 	w: max(x1 + 60, 0)
      #a 	w: max(x1 + 1, 0)
      #t 	w: max(x1 - 57, 0)
      #n 	w: max(x1 - 36, 0)
      m 	w: max(x1 - 27, 0)
    USABLE RULES: { 1..6 }
    Removed DPs: #1..3 #5 #7 #8 #10 #12..15
Number of SCCs: 0, DPs: 0