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