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


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


MAYBE
Input TRS:
      1: b(b(a(x1))) -> c(c(b(x1)))
      2: b(a(b(x1))) ->= a(a(c(x1)))
      3: c(a(a(x1))) ->= a(a(a(x1)))
      4: c(a(a(x1))) ->= b(b(b(x1)))
      5: c(b(b(x1))) ->= b(b(c(x1)))
      6: a(b(b(x1))) ->= c(a(c(x1)))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(a(b(x1))) ->? #a(a(c(x1)))
     #2: #b(a(b(x1))) ->? #a(c(x1))
     #3: #b(a(b(x1))) ->? #c(x1)
     #4: #a(b(b(x1))) ->? #c(a(c(x1)))
     #5: #a(b(b(x1))) ->? #a(c(x1))
     #6: #a(b(b(x1))) ->? #c(x1)
     #7: #c(b(b(x1))) ->? #b(b(c(x1)))
     #8: #c(b(b(x1))) ->? #b(c(x1))
     #9: #c(b(b(x1))) ->? #c(x1)
     #10: #c(a(a(x1))) ->? #a(a(a(x1)))
     #11: #b(b(a(x1))) -> #c(c(b(x1)))
     #12: #b(b(a(x1))) -> #c(b(x1))
     #13: #b(b(a(x1))) -> #b(x1)
     #14: #c(a(a(x1))) ->? #b(b(b(x1)))
     #15: #c(a(a(x1))) ->? #b(b(x1))
     #16: #c(a(a(x1))) ->? #b(x1)
Number of SCCs: 1, DPs: 16
  SCC { #1..16 }
POLO(Sum)... succeeded.
      a 	w: x1 + 1
      b 	w: x1 + 1
      c 	w: x1 + 1
      #c 	w: x1
      #a 	w: x1
      #b 	w: x1
    USABLE RULES: { 1..6 }
    Removed DPs: #2 #3 #5 #6 #8 #9 #12 #13 #15 #16
Number of SCCs: 1, DPs: 6
  SCC { #1 #4 #7 #10 #11 #14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.