/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(a(),g(y),z) -> f(b(),g(y),g(y))
    2: f(b(),g(y),z) -> f(a(),y,z)
    3: a() -> b()
    4: f(x,y,z) ->= f(x,y,g(z))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(b(),g(y),z) -> #f(a(),y,z)
   #2: #f(b(),g(y),z) -> #a()
   #3: #f(a(),g(y),z) -> #f(b(),g(y),g(y))
   #4: #f(x,y,z) ->? #f(x,y,g(z))
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #4 }
POLO(Sum)... succeeded.
      a 	w: 2
      b 	w: 1
      f 	w: 0
      #f 	w: x1 + x2
      #a 	w: 0
      g 	w: x1 + 2
    USABLE RULES: { 3 }
    Removed DPs: #1 #3
Number of SCCs: 1, DPs: 1
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.