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


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


MAYBE
Input TRS:
    1: a__h(X) -> a__g(mark(X),X)
    2: a__g(a(),X) -> a__f(b(),X)
    3: a__f(X,X) -> a__h(a__a())
    4: a__a() -> b()
    5: mark(h(X)) -> a__h(mark(X))
    6: mark(g(X1,X2)) -> a__g(mark(X1),X2)
    7: mark(a()) -> a__a()
    8: mark(f(X1,X2)) -> a__f(mark(X1),X2)
    9: mark(b()) -> b()
    10: a__h(X) -> h(X)
    11: a__g(X1,X2) -> g(X1,X2)
    12: a__a() -> a()
    13: a__f(X1,X2) -> f(X1,X2)
Number of strict rules: 13
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__g(a(),X) -> #a__f(b(),X)
   #2: #mark(g(X1,X2)) -> #a__g(mark(X1),X2)
   #3: #mark(g(X1,X2)) -> #mark(X1)
   #4: #mark(a()) -> #a__a()
   #5: #mark(h(X)) -> #a__h(mark(X))
   #6: #mark(h(X)) -> #mark(X)
   #7: #a__f(X,X) -> #a__h(a__a())
   #8: #a__f(X,X) -> #a__a()
   #9: #a__h(X) -> #a__g(mark(X),X)
   #10: #a__h(X) -> #mark(X)
   #11: #mark(f(X1,X2)) -> #a__f(mark(X1),X2)
   #12: #mark(f(X1,X2)) -> #mark(X1)
Number of SCCs: 1, DPs: 10
  SCC { #1..3 #5..7 #9..12 }
POLO(Sum)... succeeded.
      a 	w: 0
      h 	w: x1 + 3
      a__g	w: x1 + 3
      a__h	w: x1 + 3
      b 	w: 0
      #a__g	w: 4
      a__a	w: 0
      a__f	w: x1 + 3
      #a__h	w: x1 + 4
      f 	w: x1 + 3
      #mark	w: x1 + 2
      #a__a	w: 0
      mark	w: x1
      #a__f	w: 4
      g 	w: x1 + 3
    USABLE RULES: { 1..13 }
    Removed DPs: #2 #3 #5 #6 #10..12
Number of SCCs: 1, DPs: 3
  SCC { #1 #7 #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.