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


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


MAYBE
Input TRS:
    1: i(x,x) -> i(a(),b())
    2: g(x,x) -> g(a(),b())
    3: h(s(f(x))) -> h(f(x))
    4: f(s(x)) -> s(s(f(h(s(x)))))
    5: f(g(s(x),y)) -> f(g(x,s(y)))
    6: h(g(x,s(y))) -> h(g(s(x),y))
    7: h(i(x,y)) -> i(i(c(),h(h(y))),x)
    8: g(a(),g(x,g(b(),g(a(),g(x,y))))) -> g(a(),g(a(),g(a(),g(x,g(b(),g(b(),y))))))
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #g(x,x) -> #g(a(),b())
   #2: #h(g(x,s(y))) -> #h(g(s(x),y))
   #3: #h(g(x,s(y))) -> #g(s(x),y)
   #4: #h(i(x,y)) -> #i(i(c(),h(h(y))),x)
   #5: #h(i(x,y)) -> #i(c(),h(h(y)))
   #6: #h(i(x,y)) -> #h(h(y))
   #7: #h(i(x,y)) -> #h(y)
   #8: #f(g(s(x),y)) -> #f(g(x,s(y)))
   #9: #f(g(s(x),y)) -> #g(x,s(y))
   #10: #h(s(f(x))) -> #h(f(x))
   #11: #i(x,x) -> #i(a(),b())
   #12: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(a(),g(a(),g(a(),g(x,g(b(),g(b(),y))))))
   #13: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(a(),g(a(),g(x,g(b(),g(b(),y)))))
   #14: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(a(),g(x,g(b(),g(b(),y))))
   #15: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(x,g(b(),g(b(),y)))
   #16: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(b(),g(b(),y))
   #17: #g(a(),g(x,g(b(),g(a(),g(x,y))))) -> #g(b(),y)
   #18: #f(s(x)) -> #f(h(s(x)))
   #19: #f(s(x)) -> #h(s(x))
Number of SCCs: 7, DPs: 11
  SCC { #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.