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