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


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


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