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


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


MAYBE
Input TRS:
    1: o(x) -> a(l(x))
    2: a(l(x)) -> l(a(a(x)))
    3: l(o(x)) -> o(l(x))
    4: a(x) -> x
    5: H(0(),x) -> o(x)
    6: a(H(H(0(),y),z)) -> c1(y,z)
    7: a(H(H(H(0(),x),y),z)) -> c2(x,y,z)
    8: c2(x,y,z) -> o(H(y,z))
    9: a(c1(x,y)) -> c1(x,H(x,y))
    10: a(c2(x,y,z)) -> c2(x,H(x,y),z)
    11: c1(y,z) -> o(z)
Number of strict rules: 11
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a(l(x)) -> #l(a(a(x)))
   #2: #a(l(x)) -> #a(a(x))
   #3: #a(l(x)) -> #a(x)
   #4: #a(H(H(0(),y),z)) -> #c1(y,z)
   #5: #a(c1(x,y)) -> #c1(x,H(x,y))
   #6: #a(c1(x,y)) -> #H(x,y)
   #7: #c1(y,z) -> #o(z)
   #8: #a(H(H(H(0(),x),y),z)) -> #c2(x,y,z)
   #9: #a(c2(x,y,z)) -> #c2(x,H(x,y),z)
   #10: #a(c2(x,y,z)) -> #H(x,y)
   #11: #H(0(),x) -> #o(x)
   #12: #l(o(x)) -> #o(l(x))
   #13: #l(o(x)) -> #l(x)
   #14: #o(x) -> #a(l(x))
   #15: #o(x) -> #l(x)
   #16: #c2(x,y,z) -> #o(H(y,z))
   #17: #c2(x,y,z) -> #H(y,z)
Number of SCCs: 1, DPs: 17
  SCC { #1..17 }
POLO(Sum)... POLO(max)... succeeded.
      a 	w: x1
      c1	w: max(x1 + 2, x2)
      l 	w: x1
      H 	w: max(x1 + 2, x2)
      o 	w: x1
      0 	w: 0
      c2	w: max(x1 + 4, x2 + 2, x3)
      #o 	w: x1 + 1
      #H 	w: max(x2 + 1)
      #l 	w: x1 + 1
      #a 	w: x1 + 1
      #c1	w: max(x1 + 2, x2 + 1)
      #c2	w: max(x1 + 5, x2 + 3, x3 + 1)
    USABLE RULES: { 1..11 }
    Removed DPs: #10
Number of SCCs: 1, DPs: 16
  SCC { #1..9 #11..17 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.