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