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