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


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


MAYBE
Input TRS:
    1: b(q(b(x1))) -> b(p(b(x1)))
    2: 0(p(0(x1))) ->= q(x1)
    3: 1(p(1(x1))) ->= q(x1)
    4: 0(q(0(x1))) ->= q(x1)
    5: 1(q(1(x1))) ->= q(x1)
    6: p(x1) ->= 1(p(1(0(1(x1)))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #b(q(b(x1))) -> #b(p(b(x1)))
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.