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