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