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