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


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


MAYBE
Input TRS:
    1: Mr(R(x1)) -> Ml(cr(R(x1)))
    2: L(Ml(x1)) -> L(Mr(cr(x1)))
    3: Mr(o(x1)) -> Ml(cr(x1))
    4: Mr(n(x1)) -> Ml(cr(x1))
    5: o(Ml(x1)) -> Mr(cr(x1))
    6: n(Ml(x1)) -> Mr(cr(x1))
    7: Mr(o(x1)) ->= Mr(x1)
    8: Mr(n(x1)) ->= Mr(x1)
    9: o(Ml(x1)) ->= Ml(x1)
    10: n(Ml(x1)) ->= Ml(x1)
    11: Ml(cr(x1)) ->= cl(Ml(x1))
    12: Mr(cr(x1)) ->= cl(Mr(x1))
    13: L(x1) ->= L(n(x1))
    14: R(x1) ->= n(R(x1))
    15: cr(n(x1)) ->= n(cr(x1))
    16: cr(o(x1)) ->= o(cr(x1))
    17: cr(o(x1)) ->= o(x1)
    18: n(cl(x1)) ->= cl(n(x1))
    19: o(cl(x1)) ->= cl(o(x1))
    20: o(cl(x1)) ->= o(x1)
Number of strict rules: 6
Direct POLO(bPol) ... removes: 3 5 7 9
      n 	w: x1
      Ml	w: x1 + 1
      o 	w: 2 * x1 + 1
      Mr	w: x1 + 1
      R 	w: x1 + 1
      L 	w: x1
      cr	w: x1
      cl	w: x1
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #L(Ml(x1)) -> #L(Mr(cr(x1)))
   #2: #L(Ml(x1)) -> #Mr(cr(x1))
   #3: #L(Ml(x1)) -> #cr(x1)
   #4: #n(Ml(x1)) -> #Mr(cr(x1))
   #5: #n(Ml(x1)) -> #cr(x1)
   #6: #L(x1) ->? #L(n(x1))
   #7: #L(x1) ->? #n(x1)
   #8: #Mr(cr(x1)) ->? #Mr(x1)
   #9: #R(x1) ->? #n(R(x1))
   #10: #R(x1) ->? #R(x1)
   #11: #cr(o(x1)) ->? #cr(x1)
   #12: #Mr(R(x1)) -> #cr(R(x1))
   #13: #Mr(n(x1)) ->? #Mr(x1)
   #14: #cr(n(x1)) ->? #n(cr(x1))
   #15: #cr(n(x1)) ->? #cr(x1)
   #16: #Mr(n(x1)) -> #cr(x1)
   #17: #n(cl(x1)) ->? #n(x1)
Number of SCCs: 3, DPs: 13
  SCC { #10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.