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


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


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