/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(p(b(x1))) -> b(q(b(x1)))
    2: 1(p(0(1(0(x1))))) ->= p(x1)
    3: q(x1) ->= 0(q(0(x1)))
    4: q(x1) ->= 1(q(1(x1)))
    5: q(x1) ->= 0(p(0(x1)))
    6: q(x1) ->= 1(p(1(x1)))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying 1
1: b(p(b(x1))) -> b(q(b(x1)))
2: 1^1_p(0(1^1_0(x1))) ->= p(x1)
3: q(x1) ->= 0(q(0(x1)))
4: q(x1) ->= 1(q(1(x1)))
5: q(x1) ->= 0(p(0(x1)))
6: q(x1) ->= 1^1_p(1(x1))
7: 1(p(_1)) ->= 1^1_p(_1)
8: 1(0(_1)) ->= 1^1_0(_1)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #b(p(b(x1))) -> #b(q(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.