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