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


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


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