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


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


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