/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(X) -> u(h(X),h(X),X)
    2: u(d(),c(Y),X) -> k(Y)
    3: h(d()) -> c(a())
    4: h(d()) -> c(b())
    5: f(k(a()),k(b()),X) -> f(X,X,X)
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(k(a()),k(b()),X) -> #f(X,X,X)
   #2: #g(X) -> #u(h(X),h(X),X)
   #3: #g(X) -> #h(X)
   #4: #g(X) -> #h(X)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.