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


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


MAYBE
Input TRS:
    1: a__f(X,X) -> a__f(a(),b())
    2: a__b() -> a()
    3: mark(f(X1,X2)) -> a__f(mark(X1),X2)
    4: mark(b()) -> a__b()
    5: mark(a()) -> a()
    6: a__f(X1,X2) -> f(X1,X2)
    7: a__b() -> b()
Number of strict rules: 7
Direct POLO(bPol) ... removes: 4 5 7 2
      a 	w: 0
      b 	w: 0
      a__b	w: 1
      a__f	w: x1 + x2 + 2
      f 	w: x1 + x2 + 2
      mark	w: x1 + 2
Number of strict rules: 3
Direct POLO(bPol) ... removes: 3 6
      a 	w: 0
      b 	w: 0
      a__b	w: 1
      a__f	w: x1 + x2 + 3
      f 	w: x1 + x2 + 2
      mark	w: 2 * x1 + 1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__f(X,X) -> #a__f(a(),b())
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.