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


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


MAYBE
Input TRS:
    1: f(X,n__g(X),Y) -> f(activate(Y),activate(Y),activate(Y))
    2: g(b()) -> c()
    3: b() -> c()
    4: g(X) -> n__g(X)
    5: activate(n__g(X)) -> g(activate(X))
    6: activate(X) -> X
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #activate(n__g(X)) -> #g(activate(X))
   #2: #activate(n__g(X)) -> #activate(X)
   #3: #f(X,n__g(X),Y) -> #f(activate(Y),activate(Y),activate(Y))
   #4: #f(X,n__g(X),Y) -> #activate(Y)
   #5: #f(X,n__g(X),Y) -> #activate(Y)
   #6: #f(X,n__g(X),Y) -> #activate(Y)
Number of SCCs: 2, DPs: 2
  SCC { #2 }
POLO(Sum)... succeeded.
      b 	w: 0
      activate	w: 0
      #activate	w: x1
      c 	w: 0
      f 	w: 0
      #f 	w: 0
      #g 	w: 0
      n__g	w: x1 + 1
      g 	w: 0
      #b 	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.