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