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