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


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


MAYBE
Input TRS:
    1: g(tt(),x,y) -> g(f(x,y),s(x),s(y))
    2: f(s(x),y) -> f(x,y)
    3: f(x,s(y)) -> f(x,y)
    4: f(0(),0()) -> tt()
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(s(x),y) -> #f(x,y)
   #2: #f(x,s(y)) -> #f(x,y)
   #3: #g(tt(),x,y) -> #g(f(x,y),s(x),s(y))
   #4: #g(tt(),x,y) -> #f(x,y)
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.