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


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


MAYBE
Input TRS:
    1: o(l(x1)) -> r(x1)
    2: n(l(o(x1))) -> r(o(x1))
    3: L(l(o(x1))) -> L(r(o(x1)))
    4: r(o(x1)) -> l(x1)
    5: o(r(n(x1))) -> o(l(x1))
    6: o(r(R(x1))) -> o(l(R(x1)))
    7: L(x1) ->= L(n(x1))
    8: R(x1) ->= n(R(x1))
Number of strict rules: 6
Direct POLO(bPol) ... removes: 4 1
      n 	w: x1
      r 	w: x1 + 1
      l 	w: x1 + 1
      o 	w: x1 + 1
      R 	w: x1 + 1
      L 	w: 2 * x1
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #o(r(R(x1))) -> #o(l(R(x1)))
   #2: #L(x1) ->? #L(n(x1))
   #3: #L(x1) ->? #n(x1)
   #4: #o(r(n(x1))) -> #o(l(x1))
   #5: #L(l(o(x1))) -> #L(r(o(x1)))
   #6: #R(x1) ->? #n(R(x1))
   #7: #R(x1) ->? #R(x1)
Number of SCCs: 2, DPs: 2
  SCC { #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.