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


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


MAYBE
Input TRS:
    1: g(tt(),x) -> g(h(f(x,x)),s(x))
    2: h(f(0(),y)) -> tt()
    3: f(s(x),y) -> f(x,s(y))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(s(x),y) -> #f(x,s(y))
   #2: #g(tt(),x) -> #g(h(f(x,x)),s(x))
   #3: #g(tt(),x) -> #h(f(x,x))
   #4: #g(tt(),x) -> #f(x,x)
Number of SCCs: 2, DPs: 2
  SCC { #1 }
POLO(Sum)... succeeded.
      h 	w: 0
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 0
      #h 	w: 0
      #f 	w: x1
      #g 	w: 0
      tt	w: 0
      g 	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.