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